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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:13:37,478 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:13:37,479 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:13:37,490 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:13:37,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:13:37,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:13:37,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:13:37,494 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:13:37,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:13:37,496 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:13:37,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:13:37,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:13:37,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:13:37,499 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:13:37,499 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:13:37,501 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:13:37,503 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:13:37,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:13:37,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:13:37,507 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:13:37,508 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:13:37,509 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:13:37,509 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:13:37,510 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:13:37,511 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:13:37,512 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:13:37,512 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:13:37,513 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:13:37,513 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:13:37,513 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:13:37,514 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:13:37,514 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:13:37,528 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:13:37,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:13:37,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:13:37,530 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:13:37,530 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:13:37,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:13:37,530 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:13:37,531 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:13:37,531 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:13:37,531 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:13:37,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:13:37,531 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:13:37,532 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:13:37,532 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:13:37,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:13:37,532 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:13:37,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:13:37,533 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:13:37,533 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:13:37,533 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:13:37,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:13:37,533 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:13:37,533 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:13:37,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:13:37,574 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:13:37,577 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:13:37,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:13:37,578 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:13:37,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-02-02 10:13:37,677 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:13:37,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:13:37,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:13:37,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:13:37,684 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:13:37,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:13:37" (1/1) ... [2018-02-02 10:13:37,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e684a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:13:37, skipping insertion in model container [2018-02-02 10:13:37,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:13:37" (1/1) ... [2018-02-02 10:13:37,703 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:13:37,717 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:13:37,798 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:13:37,809 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:13:37,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:13:37 WrapperNode [2018-02-02 10:13:37,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:13:37,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:13:37,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:13:37,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:13:37,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:13:37" (1/1) ... [2018-02-02 10:13:37,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:13:37" (1/1) ... [2018-02-02 10:13:37,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:13:37" (1/1) ... [2018-02-02 10:13:37,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:13:37" (1/1) ... [2018-02-02 10:13:37,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:13:37" (1/1) ... [2018-02-02 10:13:37,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:13:37" (1/1) ... [2018-02-02 10:13:37,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:13:37" (1/1) ... [2018-02-02 10:13:37,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:13:37,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:13:37,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:13:37,840 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:13:37,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:13:37" (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-02-02 10:13:37,882 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:13:37,882 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:13:37,882 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 10:13:37,882 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:13:37,883 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:13:37,883 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:13:37,883 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:13:37,883 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:13:37,883 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:13:37,883 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 10:13:37,884 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:13:37,884 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:13:37,884 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:13:38,046 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:13:38,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:13:38 BoogieIcfgContainer [2018-02-02 10:13:38,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:13:38,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:13:38,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:13:38,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:13:38,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:13:37" (1/3) ... [2018-02-02 10:13:38,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab1db12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:13:38, skipping insertion in model container [2018-02-02 10:13:38,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:13:37" (2/3) ... [2018-02-02 10:13:38,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab1db12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:13:38, skipping insertion in model container [2018-02-02 10:13:38,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:13:38" (3/3) ... [2018-02-02 10:13:38,052 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-02-02 10:13:38,057 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:13:38,062 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-02 10:13:38,104 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:13:38,105 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:13:38,105 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:13:38,105 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:13:38,105 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:13:38,105 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:13:38,105 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:13:38,105 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:13:38,106 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:13:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 10:13:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 10:13:38,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:38,127 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:38,127 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-02 10:13:38,170 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:38,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:38,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-02-02 10:13:38,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:13:38,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:13:38,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,263 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-02-02 10:13:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:13:38,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:13:38,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:13:38,277 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 10:13:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:38,353 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-02 10:13:38,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:13:38,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 10:13:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:38,360 INFO L225 Difference]: With dead ends: 63 [2018-02-02 10:13:38,360 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 10:13:38,362 INFO L554 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-02-02 10:13:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 10:13:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-02 10:13:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:13:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-02 10:13:38,432 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-02 10:13:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:38,432 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-02 10:13:38,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:13:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-02 10:13:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:13:38,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:38,433 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:38,433 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:38,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-02 10:13:38,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:38,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:13:38,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:13:38,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,467 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= foo_~i~0 0)] [2018-02-02 10:13:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:13:38,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:13:38,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:13:38,469 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-02 10:13:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:38,495 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-02 10:13:38,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:13:38,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 10:13:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:38,497 INFO L225 Difference]: With dead ends: 60 [2018-02-02 10:13:38,497 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 10:13:38,497 INFO L554 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-02-02 10:13:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 10:13:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-02 10:13:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 10:13:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-02 10:13:38,501 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-02 10:13:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:38,501 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-02 10:13:38,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:13:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-02 10:13:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:13:38,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:38,502 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:38,502 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:38,502 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-02 10:13:38,503 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:38,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:13:38,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:13:38,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,596 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 282#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 283#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 284#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 31))] [2018-02-02 10:13:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:13:38,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:13:38,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:13:38,597 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-02 10:13:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:38,703 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-02 10:13:38,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:13:38,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-02 10:13:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:38,705 INFO L225 Difference]: With dead ends: 54 [2018-02-02 10:13:38,705 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 10:13:38,705 INFO L554 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-02-02 10:13:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 10:13:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-02 10:13:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 10:13:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-02 10:13:38,710 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-02 10:13:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:38,711 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-02 10:13:38,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:13:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-02 10:13:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:13:38,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:38,712 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:38,712 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:38,712 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-02 10:13:38,713 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:38,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:13:38,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:13:38,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,754 INFO L182 omatonBuilderFactory]: Interpolants [394#true, 395#false, 396#(= 1 (select |#valid| |main_~#mask~0.base|)), 397#(= 1 (select |#valid| |foo_#in~b.base|)), 398#(= 1 (select |#valid| foo_~b.base))] [2018-02-02 10:13:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:13:38,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:13:38,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:13:38,756 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-02 10:13:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:38,787 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-02 10:13:38,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:13:38,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:13:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:38,789 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:13:38,789 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:13:38,790 INFO L554 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-02-02 10:13:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:13:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 10:13:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:13:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 10:13:38,793 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-02 10:13:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:38,794 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 10:13:38,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:13:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 10:13:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:13:38,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:38,795 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:38,795 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-02 10:13:38,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:38,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:13:38,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:13:38,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,858 INFO L182 omatonBuilderFactory]: Interpolants [501#true, 502#false, 503#(= 0 main_~i~1), 504#(= 0 |foo_#in~size|), 505#(= foo_~size 0), 506#(and (= foo_~size 0) (<= 0 foo_~i~0)), 507#(and (= foo_~size 0) (<= 1 foo_~i~0))] [2018-02-02 10:13:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:38,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:13:38,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:13:38,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:13:38,859 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-02-02 10:13:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:38,960 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-02 10:13:38,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:13:38,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-02 10:13:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:38,962 INFO L225 Difference]: With dead ends: 72 [2018-02-02 10:13:38,962 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 10:13:38,962 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:13:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 10:13:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-02-02 10:13:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 10:13:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-02 10:13:38,967 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 22 [2018-02-02 10:13:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:38,967 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-02 10:13:38,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:13:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-02 10:13:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:13:38,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:38,968 INFO L351 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-02-02 10:13:38,968 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:38,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-02 10:13:38,969 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:38,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:39,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:13:39,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:13:39,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:39,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-02-02 10:13:39,011 INFO L182 omatonBuilderFactory]: Interpolants [647#true, 648#false, 649#(<= 0 main_~i~1), 650#(<= 1 main_~i~1), 651#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-02-02 10:13:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:39,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:13:39,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:13:39,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:13:39,012 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 5 states. [2018-02-02 10:13:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:39,041 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-02-02 10:13:39,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:13:39,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:13:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:39,043 INFO L225 Difference]: With dead ends: 72 [2018-02-02 10:13:39,043 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 10:13:39,043 INFO L554 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-02-02 10:13:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 10:13:39,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2018-02-02 10:13:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 10:13:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-02 10:13:39,048 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 23 [2018-02-02 10:13:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:39,048 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-02 10:13:39,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:13:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-02 10:13:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:13:39,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:39,049 INFO L351 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-02-02 10:13:39,049 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-02 10:13:39,050 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:39,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:39,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:39,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:13:39,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:39,131 INFO L182 omatonBuilderFactory]: Interpolants [784#true, 785#false, 786#(= main_~i~1 0), 787#(= foo_~i~0 0), 788#(= |foo_#res| 0), 789#(and (= |main_#t~ret3| 0) (= main_~i~1 0)), 790#(= (select main_~b~0 0) 0), 791#(= main_~i~1 (select main_~b~0 main_~i~1))] [2018-02-02 10:13:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:39,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:13:39,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:13:39,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:13:39,132 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 8 states. [2018-02-02 10:13:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:39,237 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-02-02 10:13:39,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:13:39,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-02 10:13:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:39,238 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:13:39,238 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:13:39,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:13:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:13:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2018-02-02 10:13:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 10:13:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-02 10:13:39,242 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 31 [2018-02-02 10:13:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:39,243 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-02 10:13:39,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:13:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-02 10:13:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:13:39,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:39,244 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:39,244 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:39,244 INFO L82 PathProgramCache]: Analyzing trace with hash -533212584, now seen corresponding path program 1 times [2018-02-02 10:13:39,245 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:39,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:13:39,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:13:39,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:13:39,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:39,325 INFO L182 omatonBuilderFactory]: Interpolants [961#true, 962#false, 963#(= 0 main_~i~1), 964#(and (= foo_~i~0 0) (or (= foo_~size 0) (= |foo_#in~size| foo_~size))), 965#(and (= foo_~i~0 0) (not (= |foo_#in~size| 0))), 966#(not (= |foo_#in~size| 0))] [2018-02-02 10:13:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:13:39,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:13:39,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:13:39,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:13:39,326 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-02-02 10:13:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:39,386 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-02-02 10:13:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:13:39,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 10:13:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:39,388 INFO L225 Difference]: With dead ends: 79 [2018-02-02 10:13:39,388 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:13:39,388 INFO L554 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-02-02 10:13:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:13:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2018-02-02 10:13:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 10:13:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-02 10:13:39,396 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 34 [2018-02-02 10:13:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:39,396 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-02 10:13:39,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:13:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-02 10:13:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:13:39,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:39,397 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:39,397 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-02-02 10:13:39,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:39,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:13:39,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:39,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:13:39,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:39,432 INFO L182 omatonBuilderFactory]: Interpolants [1108#true, 1109#false, 1110#(= main_~i~1 0), 1111#(<= main_~i~1 1)] [2018-02-02 10:13:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:13:39,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:13:39,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:13:39,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:13:39,433 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2018-02-02 10:13:39,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:39,468 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-02-02 10:13:39,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:13:39,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-02-02 10:13:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:39,469 INFO L225 Difference]: With dead ends: 86 [2018-02-02 10:13:39,469 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 10:13:39,469 INFO L554 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-02-02 10:13:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 10:13:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2018-02-02 10:13:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 10:13:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-02 10:13:39,474 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 37 [2018-02-02 10:13:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:39,474 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-02 10:13:39,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:13:39,475 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-02 10:13:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:13:39,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:39,475 INFO L351 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-02-02 10:13:39,476 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:39,476 INFO L82 PathProgramCache]: Analyzing trace with hash 465858064, now seen corresponding path program 2 times [2018-02-02 10:13:39,477 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:39,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:13:39,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:39,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:13:39,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:39,558 INFO L182 omatonBuilderFactory]: Interpolants [1267#true, 1268#false, 1269#(<= main_~i~1 31), 1270#(<= |foo_#in~size| 31), 1271#(<= foo_~size 31), 1272#(and (<= 0 foo_~i~0) (<= foo_~size 31)), 1273#(and (<= 1 foo_~i~0) (<= foo_~size 31)), 1274#(and (<= 1 foo_~i~0) (<= foo_~i~0 31))] [2018-02-02 10:13:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:13:39,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:13:39,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:13:39,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:13:39,559 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 8 states. [2018-02-02 10:13:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:39,641 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-02-02 10:13:39,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:13:39,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-02 10:13:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:39,643 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:13:39,643 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:13:39,643 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-02-02 10:13:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:13:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-02-02 10:13:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 10:13:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-02 10:13:39,648 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 40 [2018-02-02 10:13:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:39,648 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-02 10:13:39,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:13:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-02 10:13:39,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:13:39,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:39,649 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:39,650 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:39,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1898563809, now seen corresponding path program 2 times [2018-02-02 10:13:39,651 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:39,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:13:39,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:39,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:13:39,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:13:39,694 INFO L182 omatonBuilderFactory]: Interpolants [1424#(= main_~i~1 0), 1425#(<= main_~i~1 1), 1426#(<= main_~i~1 2), 1422#true, 1423#false] [2018-02-02 10:13:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:13:39,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:13:39,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:13:39,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:13:39,696 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2018-02-02 10:13:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:39,740 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-02-02 10:13:39,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:13:39,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-02-02 10:13:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:39,742 INFO L225 Difference]: With dead ends: 98 [2018-02-02 10:13:39,742 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 10:13:39,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-02 10:13:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 10:13:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2018-02-02 10:13:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:13:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-02 10:13:39,747 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 49 [2018-02-02 10:13:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:39,747 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-02 10:13:39,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:13:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-02 10:13:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:13:39,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:39,749 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:39,749 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1217895456, now seen corresponding path program 3 times [2018-02-02 10:13:39,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:39,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:13:39,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:39,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:13:39,817 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:13:39,818 INFO L182 omatonBuilderFactory]: Interpolants [1601#true, 1602#false, 1603#(= main_~i~1 0), 1604#(<= main_~i~1 1), 1605#(<= main_~i~1 2), 1606#(<= main_~i~1 3)] [2018-02-02 10:13:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:13:39,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:13:39,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:13:39,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:13:39,819 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2018-02-02 10:13:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:39,871 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-02-02 10:13:39,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:13:39,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-02 10:13:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:39,872 INFO L225 Difference]: With dead ends: 114 [2018-02-02 10:13:39,872 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:13:39,872 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:13:39,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:13:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2018-02-02 10:13:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:13:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-02-02 10:13:39,875 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 61 [2018-02-02 10:13:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:39,875 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-02-02 10:13:39,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:13:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-02-02 10:13:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:13:39,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:39,876 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:39,876 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash -354388191, now seen corresponding path program 4 times [2018-02-02 10:13:39,877 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:39,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-02-02 10:13:39,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:39,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:13:39,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:13:39,938 INFO L182 omatonBuilderFactory]: Interpolants [1808#true, 1809#false, 1810#(<= 0 main_~i~1), 1811#(<= 1 main_~i~1), 1812#(<= 2 main_~i~1), 1813#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 1814#(and (= foo_~i~0 0) (<= (+ |foo_#in~size| 1) foo_~i~0)), 1815#(<= (+ |foo_#in~size| 1) 0)] [2018-02-02 10:13:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-02-02 10:13:39,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:13:39,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:13:39,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:13:39,940 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 8 states. [2018-02-02 10:13:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:40,067 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2018-02-02 10:13:40,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:13:40,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-02-02 10:13:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:40,068 INFO L225 Difference]: With dead ends: 106 [2018-02-02 10:13:40,068 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 10:13:40,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:13:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 10:13:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2018-02-02 10:13:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:13:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-02 10:13:40,072 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 73 [2018-02-02 10:13:40,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:40,072 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-02 10:13:40,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:13:40,073 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-02 10:13:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 10:13:40,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:40,074 INFO L351 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:40,074 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash 459321465, now seen corresponding path program 5 times [2018-02-02 10:13:40,075 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:40,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-02-02 10:13:40,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:40,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:13:40,149 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:13:40,150 INFO L182 omatonBuilderFactory]: Interpolants [2016#(<= main_~i~1 1), 2017#(<= main_~i~1 2), 2018#(<= main_~i~1 3), 2019#(<= main_~i~1 4), 2013#true, 2014#false, 2015#(= main_~i~1 0)] [2018-02-02 10:13:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-02-02 10:13:40,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:13:40,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:13:40,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:13:40,151 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 7 states. [2018-02-02 10:13:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:40,217 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-02-02 10:13:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:13:40,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-02-02 10:13:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:40,219 INFO L225 Difference]: With dead ends: 132 [2018-02-02 10:13:40,223 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 10:13:40,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:13:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 10:13:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2018-02-02 10:13:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 10:13:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-02-02 10:13:40,227 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 91 [2018-02-02 10:13:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:40,228 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-02-02 10:13:40,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:13:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-02-02 10:13:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 10:13:40,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:40,229 INFO L351 BasicCegarLoop]: trace histogram [10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:40,229 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 109337218, now seen corresponding path program 6 times [2018-02-02 10:13:40,230 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:40,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 55 proven. 47 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-02 10:13:40,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:40,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:13:40,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 10:13:40,345 INFO L182 omatonBuilderFactory]: Interpolants [2256#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 2257#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 2258#(<= |foo_#in~size| 0), 2252#true, 2253#false, 2254#(<= 0 main_~i~1), 2255#(<= 1 main_~i~1)] [2018-02-02 10:13:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 55 proven. 47 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-02 10:13:40,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:13:40,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:13:40,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:13:40,346 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 7 states. [2018-02-02 10:13:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:40,429 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2018-02-02 10:13:40,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:13:40,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-02-02 10:13:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:40,430 INFO L225 Difference]: With dead ends: 118 [2018-02-02 10:13:40,431 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:13:40,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:13:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:13:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2018-02-02 10:13:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 10:13:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-02-02 10:13:40,438 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 109 [2018-02-02 10:13:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:40,438 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-02-02 10:13:40,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:13:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-02-02 10:13:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-02 10:13:40,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:40,440 INFO L351 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:40,440 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:40,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1378714658, now seen corresponding path program 7 times [2018-02-02 10:13:40,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:40,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-02-02 10:13:40,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:40,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:13:40,527 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-02-02 10:13:40,527 INFO L182 omatonBuilderFactory]: Interpolants [2485#true, 2486#false, 2487#(= main_~i~1 0), 2488#(<= main_~i~1 1), 2489#(<= main_~i~1 2), 2490#(<= main_~i~1 3), 2491#(<= main_~i~1 4), 2492#(<= main_~i~1 5)] [2018-02-02 10:13:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-02-02 10:13:40,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:13:40,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:13:40,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:13:40,529 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 8 states. [2018-02-02 10:13:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:40,663 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-02-02 10:13:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:13:40,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2018-02-02 10:13:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:40,667 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:13:40,668 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:13:40,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:13:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:13:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2018-02-02 10:13:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:13:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2018-02-02 10:13:40,670 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 133 [2018-02-02 10:13:40,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:40,670 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2018-02-02 10:13:40,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:13:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2018-02-02 10:13:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-02 10:13:40,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:40,672 INFO L351 BasicCegarLoop]: trace histogram [17, 11, 11, 11, 11, 11, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:40,672 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:40,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1643945613, now seen corresponding path program 8 times [2018-02-02 10:13:40,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:40,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-02-02 10:13:40,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:40,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:13:40,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-02 10:13:40,775 INFO L182 omatonBuilderFactory]: Interpolants [2768#(<= main_~i~1 2), 2769#(<= main_~i~1 3), 2770#(<= main_~i~1 4), 2771#(<= main_~i~1 5), 2772#(<= main_~i~1 6), 2764#true, 2765#false, 2766#(= main_~i~1 0), 2767#(<= main_~i~1 1)] [2018-02-02 10:13:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-02-02 10:13:40,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:13:40,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:13:40,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:13:40,776 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand 9 states. [2018-02-02 10:13:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:40,883 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-02-02 10:13:40,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:13:40,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2018-02-02 10:13:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:40,884 INFO L225 Difference]: With dead ends: 170 [2018-02-02 10:13:40,884 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:13:40,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:13:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:13:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 128. [2018-02-02 10:13:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:13:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2018-02-02 10:13:40,887 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 157 [2018-02-02 10:13:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:40,887 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2018-02-02 10:13:40,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:13:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2018-02-02 10:13:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-02-02 10:13:40,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:40,888 INFO L351 BasicCegarLoop]: trace histogram [20, 13, 13, 13, 13, 13, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:40,889 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:40,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2137351228, now seen corresponding path program 9 times [2018-02-02 10:13:40,889 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:40,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 234 proven. 10 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-02-02 10:13:40,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:40,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:13:40,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-02-02 10:13:40,964 INFO L182 omatonBuilderFactory]: Interpolants [3072#false, 3073#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 3074#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 3075#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 3076#(<= |foo_#in~size| 1), 3077#(<= main_~i~1 1), 3078#(<= main_~i~1 2), 3071#true] [2018-02-02 10:13:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 234 proven. 10 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-02-02 10:13:40,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:13:40,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:13:40,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:13:40,965 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand 8 states. [2018-02-02 10:13:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:41,073 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2018-02-02 10:13:41,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:13:41,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2018-02-02 10:13:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:41,075 INFO L225 Difference]: With dead ends: 195 [2018-02-02 10:13:41,075 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 10:13:41,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:13:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 10:13:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 137. [2018-02-02 10:13:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:13:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-02-02 10:13:41,081 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 181 [2018-02-02 10:13:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:41,081 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-02-02 10:13:41,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:13:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-02-02 10:13:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 10:13:41,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:41,083 INFO L351 BasicCegarLoop]: trace histogram [21, 14, 14, 14, 14, 14, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:41,083 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:41,083 INFO L82 PathProgramCache]: Analyzing trace with hash 567902348, now seen corresponding path program 10 times [2018-02-02 10:13:41,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:41,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 148 proven. 172 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-02-02 10:13:41,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:41,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:13:41,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 17 proven. 65 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-02-02 10:13:41,203 INFO L182 omatonBuilderFactory]: Interpolants [3424#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 3425#(<= |foo_#in~size| 1), 3417#true, 3418#false, 3419#(<= 0 main_~i~1), 3420#(<= 1 main_~i~1), 3421#(<= 2 main_~i~1), 3422#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 3423#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-02 10:13:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 148 proven. 172 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-02-02 10:13:41,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:13:41,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:13:41,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:13:41,204 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 9 states. [2018-02-02 10:13:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:41,318 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2018-02-02 10:13:41,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:13:41,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 187 [2018-02-02 10:13:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:41,320 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:13:41,320 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:13:41,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:13:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:13:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2018-02-02 10:13:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:13:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2018-02-02 10:13:41,324 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 187 [2018-02-02 10:13:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:41,324 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2018-02-02 10:13:41,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:13:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2018-02-02 10:13:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-02-02 10:13:41,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:41,327 INFO L351 BasicCegarLoop]: trace histogram [25, 18, 18, 18, 18, 18, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:41,327 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:41,327 INFO L82 PathProgramCache]: Analyzing trace with hash 564145964, now seen corresponding path program 11 times [2018-02-02 10:13:41,328 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:41,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2018-02-02 10:13:41,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:41,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:13:41,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-02-02 10:13:41,469 INFO L182 omatonBuilderFactory]: Interpolants [3718#true, 3719#false, 3720#(= main_~i~1 0), 3721#(<= main_~i~1 1), 3722#(<= main_~i~1 2), 3723#(<= main_~i~1 3), 3724#(<= main_~i~1 4), 3725#(<= main_~i~1 5), 3726#(<= main_~i~1 6), 3727#(<= main_~i~1 7)] [2018-02-02 10:13:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2018-02-02 10:13:41,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:13:41,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:13:41,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:13:41,470 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand 10 states. [2018-02-02 10:13:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:41,573 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2018-02-02 10:13:41,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:13:41,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 211 [2018-02-02 10:13:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:41,575 INFO L225 Difference]: With dead ends: 195 [2018-02-02 10:13:41,576 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 10:13:41,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:13:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 10:13:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 148. [2018-02-02 10:13:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:13:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 165 transitions. [2018-02-02 10:13:41,581 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 165 transitions. Word has length 211 [2018-02-02 10:13:41,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:41,581 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 165 transitions. [2018-02-02 10:13:41,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:13:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 165 transitions. [2018-02-02 10:13:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-02-02 10:13:41,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:41,583 INFO L351 BasicCegarLoop]: trace histogram [29, 21, 21, 21, 21, 21, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:41,583 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:41,583 INFO L82 PathProgramCache]: Analyzing trace with hash -250985339, now seen corresponding path program 12 times [2018-02-02 10:13:41,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:41,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1948 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-02-02 10:13:41,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:41,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:13:41,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-02 10:13:41,780 INFO L182 omatonBuilderFactory]: Interpolants [4080#(<= main_~i~1 7), 4081#(<= main_~i~1 8), 4071#true, 4072#false, 4073#(= main_~i~1 0), 4074#(<= main_~i~1 1), 4075#(<= main_~i~1 2), 4076#(<= main_~i~1 3), 4077#(<= main_~i~1 4), 4078#(<= main_~i~1 5), 4079#(<= main_~i~1 6)] [2018-02-02 10:13:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1948 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-02-02 10:13:41,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:13:41,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:13:41,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:13:41,782 INFO L87 Difference]: Start difference. First operand 148 states and 165 transitions. Second operand 11 states. [2018-02-02 10:13:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:41,900 INFO L93 Difference]: Finished difference Result 211 states and 223 transitions. [2018-02-02 10:13:41,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:13:41,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 241 [2018-02-02 10:13:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:41,902 INFO L225 Difference]: With dead ends: 211 [2018-02-02 10:13:41,902 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 10:13:41,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:13:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 10:13:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 159. [2018-02-02 10:13:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:13:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 178 transitions. [2018-02-02 10:13:41,907 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 178 transitions. Word has length 241 [2018-02-02 10:13:41,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:41,907 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 178 transitions. [2018-02-02 10:13:41,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:13:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 178 transitions. [2018-02-02 10:13:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-02-02 10:13:41,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:41,908 INFO L351 BasicCegarLoop]: trace histogram [33, 24, 24, 24, 24, 24, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:41,908 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:41,909 INFO L82 PathProgramCache]: Analyzing trace with hash -934332386, now seen corresponding path program 13 times [2018-02-02 10:13:41,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:41,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2538 backedges. 542 proven. 24 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2018-02-02 10:13:42,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:42,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:13:42,107 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2018-02-02 10:13:42,107 INFO L182 omatonBuilderFactory]: Interpolants [4452#true, 4453#false, 4454#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 4455#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 4456#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 4457#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 4458#(<= |foo_#in~size| 2), 4459#(<= main_~i~1 2), 4460#(<= main_~i~1 3)] [2018-02-02 10:13:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2538 backedges. 542 proven. 24 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2018-02-02 10:13:42,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:13:42,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:13:42,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:13:42,109 INFO L87 Difference]: Start difference. First operand 159 states and 178 transitions. Second operand 9 states. [2018-02-02 10:13:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:42,261 INFO L93 Difference]: Finished difference Result 242 states and 281 transitions. [2018-02-02 10:13:42,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:13:42,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 271 [2018-02-02 10:13:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:42,264 INFO L225 Difference]: With dead ends: 242 [2018-02-02 10:13:42,265 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 10:13:42,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:13:42,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 10:13:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 168. [2018-02-02 10:13:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:13:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2018-02-02 10:13:42,271 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 271 [2018-02-02 10:13:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:42,271 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 195 transitions. [2018-02-02 10:13:42,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:13:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 195 transitions. [2018-02-02 10:13:42,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-02 10:13:42,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:42,273 INFO L351 BasicCegarLoop]: trace histogram [34, 25, 25, 25, 25, 25, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:42,273 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1214647962, now seen corresponding path program 14 times [2018-02-02 10:13:42,274 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:42,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 684 proven. 44 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2018-02-02 10:13:42,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:42,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:13:42,510 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2018-02-02 10:13:42,511 INFO L182 omatonBuilderFactory]: Interpolants [4880#false, 4881#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 4882#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 4883#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 4884#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 4885#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 4886#(<= |foo_#in~size| 3), 4887#(<= main_~i~1 3), 4888#(<= main_~i~1 4), 4879#true] [2018-02-02 10:13:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 684 proven. 44 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2018-02-02 10:13:42,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:13:42,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:13:42,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:13:42,513 INFO L87 Difference]: Start difference. First operand 168 states and 195 transitions. Second operand 10 states. [2018-02-02 10:13:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:42,672 INFO L93 Difference]: Finished difference Result 251 states and 305 transitions. [2018-02-02 10:13:42,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:13:42,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 277 [2018-02-02 10:13:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:42,674 INFO L225 Difference]: With dead ends: 251 [2018-02-02 10:13:42,674 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 10:13:42,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:13:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 10:13:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 174. [2018-02-02 10:13:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:13:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2018-02-02 10:13:42,681 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 277 [2018-02-02 10:13:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:42,681 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2018-02-02 10:13:42,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:13:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2018-02-02 10:13:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-02-02 10:13:42,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:42,683 INFO L351 BasicCegarLoop]: trace histogram [35, 26, 26, 26, 26, 26, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:42,683 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:42,683 INFO L82 PathProgramCache]: Analyzing trace with hash -923364178, now seen corresponding path program 15 times [2018-02-02 10:13:42,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:42,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2868 backedges. 307 proven. 419 refuted. 0 times theorem prover too weak. 2142 trivial. 0 not checked. [2018-02-02 10:13:42,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:42,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:13:42,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 37 proven. 112 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-02-02 10:13:42,880 INFO L182 omatonBuilderFactory]: Interpolants [5328#(<= 2 main_~i~1), 5329#(<= 3 main_~i~1), 5330#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 5331#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 5332#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 5333#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 5334#(<= |foo_#in~size| 2), 5324#true, 5325#false, 5326#(<= 0 main_~i~1), 5327#(<= 1 main_~i~1)] [2018-02-02 10:13:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2868 backedges. 307 proven. 419 refuted. 0 times theorem prover too weak. 2142 trivial. 0 not checked. [2018-02-02 10:13:42,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:13:42,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:13:42,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:13:42,881 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand 11 states. [2018-02-02 10:13:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:43,039 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2018-02-02 10:13:43,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:13:43,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 283 [2018-02-02 10:13:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:43,041 INFO L225 Difference]: With dead ends: 192 [2018-02-02 10:13:43,041 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 10:13:43,041 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:13:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 10:13:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 177. [2018-02-02 10:13:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 10:13:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 206 transitions. [2018-02-02 10:13:43,044 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 206 transitions. Word has length 283 [2018-02-02 10:13:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:43,044 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 206 transitions. [2018-02-02 10:13:43,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:13:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 206 transitions. [2018-02-02 10:13:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-02-02 10:13:43,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:43,046 INFO L351 BasicCegarLoop]: trace histogram [40, 31, 31, 31, 31, 31, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:43,046 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2059980374, now seen corresponding path program 16 times [2018-02-02 10:13:43,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:43,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3798 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 3564 trivial. 0 not checked. [2018-02-02 10:13:43,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:43,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:13:43,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-02-02 10:13:43,205 INFO L182 omatonBuilderFactory]: Interpolants [5712#(= main_~i~1 0), 5713#(<= main_~i~1 1), 5714#(<= main_~i~1 2), 5715#(<= main_~i~1 3), 5716#(<= main_~i~1 4), 5717#(<= main_~i~1 5), 5718#(<= main_~i~1 6), 5719#(<= main_~i~1 7), 5720#(<= main_~i~1 8), 5721#(<= main_~i~1 9), 5710#true, 5711#false] [2018-02-02 10:13:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3798 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 3564 trivial. 0 not checked. [2018-02-02 10:13:43,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:13:43,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:13:43,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:13:43,206 INFO L87 Difference]: Start difference. First operand 177 states and 206 transitions. Second operand 12 states. [2018-02-02 10:13:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:43,330 INFO L93 Difference]: Finished difference Result 255 states and 280 transitions. [2018-02-02 10:13:43,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:13:43,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 313 [2018-02-02 10:13:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:43,332 INFO L225 Difference]: With dead ends: 255 [2018-02-02 10:13:43,332 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 10:13:43,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:13:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 10:13:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 188. [2018-02-02 10:13:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 10:13:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2018-02-02 10:13:43,339 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 313 [2018-02-02 10:13:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:43,340 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2018-02-02 10:13:43,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:13:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2018-02-02 10:13:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-02-02 10:13:43,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:43,342 INFO L351 BasicCegarLoop]: trace histogram [45, 35, 35, 35, 35, 35, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:43,342 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:43,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1455300087, now seen corresponding path program 17 times [2018-02-02 10:13:43,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:43,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 866 proven. 191 refuted. 0 times theorem prover too weak. 3773 trivial. 0 not checked. [2018-02-02 10:13:43,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:43,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:13:43,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 179 proven. 26 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2018-02-02 10:13:43,618 INFO L182 omatonBuilderFactory]: Interpolants [6165#true, 6166#false, 6167#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 6168#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 6169#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 6170#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 6171#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 6172#(<= |foo_#in~size| 3), 6173#(<= main_~i~1 3), 6174#(<= main_~i~1 4), 6175#(<= main_~i~1 5)] [2018-02-02 10:13:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 866 proven. 191 refuted. 0 times theorem prover too weak. 3773 trivial. 0 not checked. [2018-02-02 10:13:43,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:13:43,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:13:43,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:13:43,620 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand 11 states. [2018-02-02 10:13:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:43,772 INFO L93 Difference]: Finished difference Result 315 states and 375 transitions. [2018-02-02 10:13:43,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:13:43,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 349 [2018-02-02 10:13:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:43,774 INFO L225 Difference]: With dead ends: 315 [2018-02-02 10:13:43,774 INFO L226 Difference]: Without dead ends: 315 [2018-02-02 10:13:43,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:13:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-02 10:13:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 188. [2018-02-02 10:13:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 10:13:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2018-02-02 10:13:43,779 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 349 [2018-02-02 10:13:43,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:43,779 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2018-02-02 10:13:43,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:13:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2018-02-02 10:13:43,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-02-02 10:13:43,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:43,781 INFO L351 BasicCegarLoop]: trace histogram [46, 36, 36, 36, 36, 36, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:43,781 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:43,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1944406335, now seen corresponding path program 18 times [2018-02-02 10:13:43,782 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:43,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5060 backedges. 1165 proven. 70 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-02-02 10:13:44,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:44,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:13:44,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2018-02-02 10:13:44,012 INFO L182 omatonBuilderFactory]: Interpolants [6689#true, 6690#false, 6691#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 6692#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 6693#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 6694#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 6695#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 6696#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 6697#(<= |foo_#in~size| 4), 6698#(<= main_~i~1 4), 6699#(<= main_~i~1 5)] [2018-02-02 10:13:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5060 backedges. 1165 proven. 70 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-02-02 10:13:44,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:13:44,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:13:44,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:13:44,014 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand 11 states. [2018-02-02 10:13:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:44,177 INFO L93 Difference]: Finished difference Result 279 states and 343 transitions. [2018-02-02 10:13:44,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:13:44,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 355 [2018-02-02 10:13:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:44,179 INFO L225 Difference]: With dead ends: 279 [2018-02-02 10:13:44,179 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 10:13:44,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:13:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 10:13:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 197. [2018-02-02 10:13:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 10:13:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 238 transitions. [2018-02-02 10:13:44,183 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 238 transitions. Word has length 355 [2018-02-02 10:13:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:44,183 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 238 transitions. [2018-02-02 10:13:44,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:13:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 238 transitions. [2018-02-02 10:13:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-02-02 10:13:44,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:44,185 INFO L351 BasicCegarLoop]: trace histogram [47, 37, 37, 37, 37, 37, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:44,186 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash -162732601, now seen corresponding path program 19 times [2018-02-02 10:13:44,186 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:44,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5296 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 5006 trivial. 0 not checked. [2018-02-02 10:13:44,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:44,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:13:44,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-02-02 10:13:44,481 INFO L182 omatonBuilderFactory]: Interpolants [7200#(<= main_~i~1 10), 7188#true, 7189#false, 7190#(= main_~i~1 0), 7191#(<= main_~i~1 1), 7192#(<= main_~i~1 2), 7193#(<= main_~i~1 3), 7194#(<= main_~i~1 4), 7195#(<= main_~i~1 5), 7196#(<= main_~i~1 6), 7197#(<= main_~i~1 7), 7198#(<= main_~i~1 8), 7199#(<= main_~i~1 9)] [2018-02-02 10:13:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5296 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 5006 trivial. 0 not checked. [2018-02-02 10:13:44,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:13:44,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:13:44,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:13:44,482 INFO L87 Difference]: Start difference. First operand 197 states and 238 transitions. Second operand 13 states. [2018-02-02 10:13:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:44,612 INFO L93 Difference]: Finished difference Result 300 states and 347 transitions. [2018-02-02 10:13:44,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:13:44,612 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 361 [2018-02-02 10:13:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:44,614 INFO L225 Difference]: With dead ends: 300 [2018-02-02 10:13:44,614 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 10:13:44,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:13:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 10:13:44,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 208. [2018-02-02 10:13:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:13:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2018-02-02 10:13:44,621 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 361 [2018-02-02 10:13:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:44,621 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2018-02-02 10:13:44,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:13:44,622 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2018-02-02 10:13:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-02-02 10:13:44,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:44,624 INFO L351 BasicCegarLoop]: trace histogram [52, 41, 41, 41, 41, 41, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:44,624 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:44,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1615990632, now seen corresponding path program 20 times [2018-02-02 10:13:44,625 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:44,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6504 backedges. 918 proven. 370 refuted. 0 times theorem prover too weak. 5216 trivial. 0 not checked. [2018-02-02 10:13:44,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:44,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:13:44,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 179 proven. 52 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2018-02-02 10:13:44,945 INFO L182 omatonBuilderFactory]: Interpolants [7712#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 7713#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 7714#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 7715#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 7716#(<= |foo_#in~size| 3), 7717#(<= main_~i~1 3), 7718#(<= main_~i~1 4), 7719#(<= main_~i~1 5), 7720#(<= main_~i~1 6), 7709#true, 7710#false, 7711#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-02 10:13:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6504 backedges. 918 proven. 370 refuted. 0 times theorem prover too weak. 5216 trivial. 0 not checked. [2018-02-02 10:13:44,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:13:44,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:13:44,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:13:44,946 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand 12 states. [2018-02-02 10:13:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:45,139 INFO L93 Difference]: Finished difference Result 384 states and 495 transitions. [2018-02-02 10:13:45,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:13:45,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 397 [2018-02-02 10:13:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:45,141 INFO L225 Difference]: With dead ends: 384 [2018-02-02 10:13:45,141 INFO L226 Difference]: Without dead ends: 384 [2018-02-02 10:13:45,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:13:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-02 10:13:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 208. [2018-02-02 10:13:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:13:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2018-02-02 10:13:45,147 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 397 [2018-02-02 10:13:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:45,148 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2018-02-02 10:13:45,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:13:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2018-02-02 10:13:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-02-02 10:13:45,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:45,149 INFO L351 BasicCegarLoop]: trace histogram [53, 42, 42, 42, 42, 42, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:45,149 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash -284521808, now seen corresponding path program 21 times [2018-02-02 10:13:45,150 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:45,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6772 backedges. 1223 proven. 281 refuted. 0 times theorem prover too weak. 5268 trivial. 0 not checked. [2018-02-02 10:13:45,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:45,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:13:45,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 199 proven. 32 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2018-02-02 10:13:45,470 INFO L182 omatonBuilderFactory]: Interpolants [8323#true, 8324#false, 8325#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 8326#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 8327#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 8328#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 8329#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 8330#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 8331#(<= |foo_#in~size| 4), 8332#(<= main_~i~1 4), 8333#(<= main_~i~1 5), 8334#(<= main_~i~1 6)] [2018-02-02 10:13:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6772 backedges. 1223 proven. 281 refuted. 0 times theorem prover too weak. 5268 trivial. 0 not checked. [2018-02-02 10:13:45,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:13:45,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:13:45,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:13:45,471 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand 12 states. [2018-02-02 10:13:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:45,630 INFO L93 Difference]: Finished difference Result 349 states and 443 transitions. [2018-02-02 10:13:45,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:13:45,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 403 [2018-02-02 10:13:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:45,633 INFO L225 Difference]: With dead ends: 349 [2018-02-02 10:13:45,633 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 10:13:45,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:13:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 10:13:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 208. [2018-02-02 10:13:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:13:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2018-02-02 10:13:45,642 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 403 [2018-02-02 10:13:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:45,642 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2018-02-02 10:13:45,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:13:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2018-02-02 10:13:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-02-02 10:13:45,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:45,646 INFO L351 BasicCegarLoop]: trace histogram [54, 43, 43, 43, 43, 43, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:45,646 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:45,646 INFO L82 PathProgramCache]: Analyzing trace with hash 40105784, now seen corresponding path program 22 times [2018-02-02 10:13:45,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:45,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7046 backedges. 1618 proven. 102 refuted. 0 times theorem prover too weak. 5326 trivial. 0 not checked. [2018-02-02 10:13:45,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:45,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:13:45,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2018-02-02 10:13:45,991 INFO L182 omatonBuilderFactory]: Interpolants [8912#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 8913#(<= |foo_#in~size| 5), 8914#(<= main_~i~1 5), 8915#(<= main_~i~1 6), 8904#true, 8905#false, 8906#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 8907#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 8908#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 8909#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 8910#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 8911#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-02 10:13:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7046 backedges. 1618 proven. 102 refuted. 0 times theorem prover too weak. 5326 trivial. 0 not checked. [2018-02-02 10:13:45,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:13:45,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:13:45,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:13:45,992 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand 12 states. [2018-02-02 10:13:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:46,216 INFO L93 Difference]: Finished difference Result 307 states and 397 transitions. [2018-02-02 10:13:46,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:13:46,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 409 [2018-02-02 10:13:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:46,219 INFO L225 Difference]: With dead ends: 307 [2018-02-02 10:13:46,219 INFO L226 Difference]: Without dead ends: 307 [2018-02-02 10:13:46,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:13:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-02 10:13:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 217. [2018-02-02 10:13:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 10:13:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 272 transitions. [2018-02-02 10:13:46,226 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 272 transitions. Word has length 409 [2018-02-02 10:13:46,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:46,226 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 272 transitions. [2018-02-02 10:13:46,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:13:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 272 transitions. [2018-02-02 10:13:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-02-02 10:13:46,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:46,229 INFO L351 BasicCegarLoop]: trace histogram [55, 44, 44, 44, 44, 44, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:46,229 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash 944076032, now seen corresponding path program 23 times [2018-02-02 10:13:46,230 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:46,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 550 proven. 902 refuted. 0 times theorem prover too weak. 5874 trivial. 0 not checked. [2018-02-02 10:13:46,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:46,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:13:46,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 63 proven. 165 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-02-02 10:13:46,683 INFO L182 omatonBuilderFactory]: Interpolants [9454#true, 9455#false, 9456#(<= 0 main_~i~1), 9457#(<= 1 main_~i~1), 9458#(<= 2 main_~i~1), 9459#(<= 3 main_~i~1), 9460#(<= 4 main_~i~1), 9461#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 9462#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 9463#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 9464#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 9465#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 9466#(<= |foo_#in~size| 3)] [2018-02-02 10:13:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 550 proven. 902 refuted. 0 times theorem prover too weak. 5874 trivial. 0 not checked. [2018-02-02 10:13:46,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:13:46,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:13:46,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:13:46,684 INFO L87 Difference]: Start difference. First operand 217 states and 272 transitions. Second operand 13 states. [2018-02-02 10:13:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:46,940 INFO L93 Difference]: Finished difference Result 237 states and 281 transitions. [2018-02-02 10:13:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:13:46,940 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 415 [2018-02-02 10:13:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:46,941 INFO L225 Difference]: With dead ends: 237 [2018-02-02 10:13:46,941 INFO L226 Difference]: Without dead ends: 237 [2018-02-02 10:13:46,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:13:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-02 10:13:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 217. [2018-02-02 10:13:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 10:13:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 265 transitions. [2018-02-02 10:13:46,947 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 265 transitions. Word has length 415 [2018-02-02 10:13:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:46,947 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 265 transitions. [2018-02-02 10:13:46,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:13:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 265 transitions. [2018-02-02 10:13:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-02-02 10:13:46,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:46,951 INFO L351 BasicCegarLoop]: trace histogram [59, 48, 48, 48, 48, 48, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:46,951 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:46,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1208160864, now seen corresponding path program 24 times [2018-02-02 10:13:46,952 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:46,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8506 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 8154 trivial. 0 not checked. [2018-02-02 10:13:47,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:47,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:13:47,377 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2018-02-02 10:13:47,377 INFO L182 omatonBuilderFactory]: Interpolants [9929#true, 9930#false, 9931#(= main_~i~1 0), 9932#(<= main_~i~1 1), 9933#(<= main_~i~1 2), 9934#(<= main_~i~1 3), 9935#(<= main_~i~1 4), 9936#(<= main_~i~1 5), 9937#(<= main_~i~1 6), 9938#(<= main_~i~1 7), 9939#(<= main_~i~1 8), 9940#(<= main_~i~1 9), 9941#(<= main_~i~1 10), 9942#(<= main_~i~1 11)] [2018-02-02 10:13:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8506 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 8154 trivial. 0 not checked. [2018-02-02 10:13:47,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:13:47,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:13:47,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:13:47,379 INFO L87 Difference]: Start difference. First operand 217 states and 265 transitions. Second operand 14 states. [2018-02-02 10:13:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:47,480 INFO L93 Difference]: Finished difference Result 325 states and 378 transitions. [2018-02-02 10:13:47,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:13:47,480 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 439 [2018-02-02 10:13:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:47,481 INFO L225 Difference]: With dead ends: 325 [2018-02-02 10:13:47,481 INFO L226 Difference]: Without dead ends: 325 [2018-02-02 10:13:47,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:13:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-02 10:13:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 228. [2018-02-02 10:13:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 10:13:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2018-02-02 10:13:47,487 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 439 [2018-02-02 10:13:47,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:47,488 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2018-02-02 10:13:47,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:13:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2018-02-02 10:13:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-02-02 10:13:47,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:47,490 INFO L351 BasicCegarLoop]: trace histogram [65, 53, 53, 53, 53, 53, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:47,490 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:47,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1519885879, now seen corresponding path program 25 times [2018-02-02 10:13:47,491 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:47,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10356 backedges. 1409 proven. 530 refuted. 0 times theorem prover too weak. 8417 trivial. 0 not checked. [2018-02-02 10:13:47,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:47,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:13:47,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 235 proven. 64 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2018-02-02 10:13:47,830 INFO L182 omatonBuilderFactory]: Interpolants [10496#true, 10497#false, 10498#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 10499#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 10500#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 10501#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 10502#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 10503#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 10504#(<= |foo_#in~size| 4), 10505#(<= main_~i~1 4), 10506#(<= main_~i~1 5), 10507#(<= main_~i~1 6), 10508#(<= main_~i~1 7)] [2018-02-02 10:13:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10356 backedges. 1409 proven. 530 refuted. 0 times theorem prover too weak. 8417 trivial. 0 not checked. [2018-02-02 10:13:47,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:13:47,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:13:47,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:13:47,831 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand 13 states. [2018-02-02 10:13:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:47,987 INFO L93 Difference]: Finished difference Result 424 states and 554 transitions. [2018-02-02 10:13:47,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:13:47,987 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 481 [2018-02-02 10:13:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:47,989 INFO L225 Difference]: With dead ends: 424 [2018-02-02 10:13:47,989 INFO L226 Difference]: Without dead ends: 424 [2018-02-02 10:13:47,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:13:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-02-02 10:13:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 228. [2018-02-02 10:13:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 10:13:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2018-02-02 10:13:47,995 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 481 [2018-02-02 10:13:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:47,995 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2018-02-02 10:13:47,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:13:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2018-02-02 10:13:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-02-02 10:13:47,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:47,997 INFO L351 BasicCegarLoop]: trace histogram [66, 54, 54, 54, 54, 54, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:47,997 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:47,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1863901103, now seen corresponding path program 26 times [2018-02-02 10:13:47,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:48,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10698 backedges. 1834 proven. 389 refuted. 0 times theorem prover too weak. 8475 trivial. 0 not checked. [2018-02-02 10:13:48,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:48,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:13:48,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 261 proven. 38 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2018-02-02 10:13:48,406 INFO L182 omatonBuilderFactory]: Interpolants [11173#true, 11174#false, 11175#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 11176#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 11177#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 11178#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 11179#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 11180#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 11181#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 11182#(<= |foo_#in~size| 5), 11183#(<= main_~i~1 5), 11184#(<= main_~i~1 6), 11185#(<= main_~i~1 7)] [2018-02-02 10:13:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10698 backedges. 1834 proven. 389 refuted. 0 times theorem prover too weak. 8475 trivial. 0 not checked. [2018-02-02 10:13:48,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:13:48,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:13:48,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:13:48,407 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand 13 states. [2018-02-02 10:13:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:48,579 INFO L93 Difference]: Finished difference Result 383 states and 493 transitions. [2018-02-02 10:13:48,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:13:48,580 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 487 [2018-02-02 10:13:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:48,582 INFO L225 Difference]: With dead ends: 383 [2018-02-02 10:13:48,582 INFO L226 Difference]: Without dead ends: 383 [2018-02-02 10:13:48,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:13:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-02-02 10:13:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 228. [2018-02-02 10:13:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 10:13:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2018-02-02 10:13:48,587 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 487 [2018-02-02 10:13:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:48,588 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2018-02-02 10:13:48,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:13:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2018-02-02 10:13:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2018-02-02 10:13:48,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:48,590 INFO L351 BasicCegarLoop]: trace histogram [67, 55, 55, 55, 55, 55, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:48,590 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:48,591 INFO L82 PathProgramCache]: Analyzing trace with hash 751206425, now seen corresponding path program 27 times [2018-02-02 10:13:48,591 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:48,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 11046 backedges. 2367 proven. 140 refuted. 0 times theorem prover too weak. 8539 trivial. 0 not checked. [2018-02-02 10:13:48,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:48,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:13:48,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2018-02-02 10:13:48,943 INFO L182 omatonBuilderFactory]: Interpolants [11811#true, 11812#false, 11813#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 11814#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 11815#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 11816#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 11817#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 11818#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 11819#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 11820#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 11821#(<= |foo_#in~size| 6), 11822#(<= main_~i~1 6), 11823#(<= main_~i~1 7)] [2018-02-02 10:13:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11046 backedges. 2367 proven. 140 refuted. 0 times theorem prover too weak. 8539 trivial. 0 not checked. [2018-02-02 10:13:48,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:13:48,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:13:48,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:13:48,944 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand 13 states. [2018-02-02 10:13:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:49,080 INFO L93 Difference]: Finished difference Result 335 states and 439 transitions. [2018-02-02 10:13:49,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:13:49,081 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 493 [2018-02-02 10:13:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:49,082 INFO L225 Difference]: With dead ends: 335 [2018-02-02 10:13:49,082 INFO L226 Difference]: Without dead ends: 335 [2018-02-02 10:13:49,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:13:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-02-02 10:13:49,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 237. [2018-02-02 10:13:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 10:13:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 300 transitions. [2018-02-02 10:13:49,089 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 300 transitions. Word has length 493 [2018-02-02 10:13:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:49,089 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 300 transitions. [2018-02-02 10:13:49,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:13:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 300 transitions. [2018-02-02 10:13:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-02-02 10:13:49,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:49,093 INFO L351 BasicCegarLoop]: trace histogram [68, 56, 56, 56, 56, 56, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:49,093 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1593577761, now seen corresponding path program 28 times [2018-02-02 10:13:49,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:49,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 10980 trivial. 0 not checked. [2018-02-02 10:13:49,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:49,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:13:49,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2018-02-02 10:13:49,483 INFO L182 omatonBuilderFactory]: Interpolants [12416#(<= main_~i~1 2), 12417#(<= main_~i~1 3), 12418#(<= main_~i~1 4), 12419#(<= main_~i~1 5), 12420#(<= main_~i~1 6), 12421#(<= main_~i~1 7), 12422#(<= main_~i~1 8), 12423#(<= main_~i~1 9), 12424#(<= main_~i~1 10), 12425#(<= main_~i~1 11), 12426#(<= main_~i~1 12), 12412#true, 12413#false, 12414#(= main_~i~1 0), 12415#(<= main_~i~1 1)] [2018-02-02 10:13:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 10980 trivial. 0 not checked. [2018-02-02 10:13:49,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:13:49,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:13:49,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:13:49,484 INFO L87 Difference]: Start difference. First operand 237 states and 300 transitions. Second operand 15 states. [2018-02-02 10:13:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:49,583 INFO L93 Difference]: Finished difference Result 376 states and 464 transitions. [2018-02-02 10:13:49,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:13:49,583 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 499 [2018-02-02 10:13:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:49,584 INFO L225 Difference]: With dead ends: 376 [2018-02-02 10:13:49,584 INFO L226 Difference]: Without dead ends: 376 [2018-02-02 10:13:49,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:13:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-02-02 10:13:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 248. [2018-02-02 10:13:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:13:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2018-02-02 10:13:49,591 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 499 [2018-02-02 10:13:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:49,591 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2018-02-02 10:13:49,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:13:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2018-02-02 10:13:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-02-02 10:13:49,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:49,595 INFO L351 BasicCegarLoop]: trace histogram [74, 61, 61, 61, 61, 61, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:49,596 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:49,596 INFO L82 PathProgramCache]: Analyzing trace with hash 192428490, now seen corresponding path program 29 times [2018-02-02 10:13:49,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:49,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 13528 backedges. 1467 proven. 817 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2018-02-02 10:13:50,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:50,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:13:50,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 235 proven. 96 refuted. 0 times theorem prover too weak. 1544 trivial. 0 not checked. [2018-02-02 10:13:50,008 INFO L182 omatonBuilderFactory]: Interpolants [13056#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 13057#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 13058#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 13059#(<= |foo_#in~size| 4), 13060#(<= main_~i~1 4), 13061#(<= main_~i~1 5), 13062#(<= main_~i~1 6), 13063#(<= main_~i~1 7), 13064#(<= main_~i~1 8), 13051#true, 13052#false, 13053#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 13054#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 13055#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-02 10:13:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 13528 backedges. 1467 proven. 817 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2018-02-02 10:13:50,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:13:50,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:13:50,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:13:50,009 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 14 states. [2018-02-02 10:13:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:50,164 INFO L93 Difference]: Finished difference Result 503 states and 710 transitions. [2018-02-02 10:13:50,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:13:50,164 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 541 [2018-02-02 10:13:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:50,167 INFO L225 Difference]: With dead ends: 503 [2018-02-02 10:13:50,167 INFO L226 Difference]: Without dead ends: 503 [2018-02-02 10:13:50,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:13:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-02 10:13:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 248. [2018-02-02 10:13:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:13:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2018-02-02 10:13:50,175 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 541 [2018-02-02 10:13:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:50,175 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2018-02-02 10:13:50,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:13:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2018-02-02 10:13:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-02-02 10:13:50,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:50,178 INFO L351 BasicCegarLoop]: trace histogram [75, 62, 62, 62, 62, 62, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:50,178 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:50,178 INFO L82 PathProgramCache]: Analyzing trace with hash -778879918, now seen corresponding path program 30 times [2018-02-02 10:13:50,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:50,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 13920 backedges. 1898 proven. 720 refuted. 0 times theorem prover too weak. 11302 trivial. 0 not checked. [2018-02-02 10:13:50,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:50,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:13:50,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 261 proven. 76 refuted. 0 times theorem prover too weak. 1544 trivial. 0 not checked. [2018-02-02 10:13:50,569 INFO L182 omatonBuilderFactory]: Interpolants [13828#true, 13829#false, 13830#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 13831#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 13832#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 13833#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 13834#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 13835#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 13836#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 13837#(<= |foo_#in~size| 5), 13838#(<= main_~i~1 5), 13839#(<= main_~i~1 6), 13840#(<= main_~i~1 7), 13841#(<= main_~i~1 8)] [2018-02-02 10:13:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 13920 backedges. 1898 proven. 720 refuted. 0 times theorem prover too weak. 11302 trivial. 0 not checked. [2018-02-02 10:13:50,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:13:50,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:13:50,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:13:50,570 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 14 states. [2018-02-02 10:13:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:50,749 INFO L93 Difference]: Finished difference Result 464 states and 648 transitions. [2018-02-02 10:13:50,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:13:50,749 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 547 [2018-02-02 10:13:50,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:50,751 INFO L225 Difference]: With dead ends: 464 [2018-02-02 10:13:50,751 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 10:13:50,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:13:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 10:13:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 248. [2018-02-02 10:13:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:13:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2018-02-02 10:13:50,759 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 547 [2018-02-02 10:13:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:50,760 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2018-02-02 10:13:50,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:13:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2018-02-02 10:13:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-02-02 10:13:50,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:50,764 INFO L351 BasicCegarLoop]: trace histogram [76, 63, 63, 63, 63, 63, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:50,764 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash 258441242, now seen corresponding path program 31 times [2018-02-02 10:13:50,765 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:50,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14318 backedges. 2437 proven. 515 refuted. 0 times theorem prover too weak. 11366 trivial. 0 not checked. [2018-02-02 10:13:51,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:51,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:13:51,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 305 proven. 44 refuted. 0 times theorem prover too weak. 1544 trivial. 0 not checked. [2018-02-02 10:13:51,200 INFO L182 omatonBuilderFactory]: Interpolants [14568#true, 14569#false, 14570#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 14571#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 14572#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 14573#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 14574#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 14575#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 14576#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 14577#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 14578#(<= |foo_#in~size| 6), 14579#(<= main_~i~1 6), 14580#(<= main_~i~1 7), 14581#(<= main_~i~1 8)] [2018-02-02 10:13:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14318 backedges. 2437 proven. 515 refuted. 0 times theorem prover too weak. 11366 trivial. 0 not checked. [2018-02-02 10:13:51,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:13:51,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:13:51,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:13:51,201 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 14 states. [2018-02-02 10:13:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:51,412 INFO L93 Difference]: Finished difference Result 417 states and 570 transitions. [2018-02-02 10:13:51,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:13:51,413 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 553 [2018-02-02 10:13:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:51,415 INFO L225 Difference]: With dead ends: 417 [2018-02-02 10:13:51,415 INFO L226 Difference]: Without dead ends: 417 [2018-02-02 10:13:51,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:13:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-02-02 10:13:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 248. [2018-02-02 10:13:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:13:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2018-02-02 10:13:51,423 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 553 [2018-02-02 10:13:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:51,423 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2018-02-02 10:13:51,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:13:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2018-02-02 10:13:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-02-02 10:13:51,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:51,427 INFO L351 BasicCegarLoop]: trace histogram [77, 64, 64, 64, 64, 64, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:51,428 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash -273509086, now seen corresponding path program 32 times [2018-02-02 10:13:51,429 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:51,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 14722 backedges. 3102 proven. 184 refuted. 0 times theorem prover too weak. 11436 trivial. 0 not checked. [2018-02-02 10:13:51,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:51,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:13:51,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 1544 trivial. 0 not checked. [2018-02-02 10:13:51,897 INFO L182 omatonBuilderFactory]: Interpolants [15264#false, 15265#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 15266#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 15267#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 15268#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 15269#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 15270#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 15271#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 15272#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 15273#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 15274#(<= |foo_#in~size| 7), 15275#(<= main_~i~1 7), 15276#(<= main_~i~1 8), 15263#true] [2018-02-02 10:13:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14722 backedges. 3102 proven. 184 refuted. 0 times theorem prover too weak. 11436 trivial. 0 not checked. [2018-02-02 10:13:51,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:13:51,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:13:51,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:13:51,898 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 14 states. [2018-02-02 10:13:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:52,103 INFO L93 Difference]: Finished difference Result 363 states and 499 transitions. [2018-02-02 10:13:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:13:52,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 559 [2018-02-02 10:13:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:52,104 INFO L225 Difference]: With dead ends: 363 [2018-02-02 10:13:52,104 INFO L226 Difference]: Without dead ends: 363 [2018-02-02 10:13:52,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:13:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-02 10:13:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 257. [2018-02-02 10:13:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-02 10:13:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 337 transitions. [2018-02-02 10:13:52,111 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 337 transitions. Word has length 559 [2018-02-02 10:13:52,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:52,112 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 337 transitions. [2018-02-02 10:13:52,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:13:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 337 transitions. [2018-02-02 10:13:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2018-02-02 10:13:52,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:52,116 INFO L351 BasicCegarLoop]: trace histogram [78, 65, 65, 65, 65, 65, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:52,116 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:52,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2327702, now seen corresponding path program 33 times [2018-02-02 10:13:52,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:52,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15132 backedges. 895 proven. 1615 refuted. 0 times theorem prover too weak. 12622 trivial. 0 not checked. [2018-02-02 10:13:52,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:52,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:13:52,548 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1896 backedges. 95 proven. 233 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-02 10:13:52,549 INFO L182 omatonBuilderFactory]: Interpolants [15915#true, 15916#false, 15917#(<= 0 main_~i~1), 15918#(<= 1 main_~i~1), 15919#(<= 2 main_~i~1), 15920#(<= 3 main_~i~1), 15921#(<= 4 main_~i~1), 15922#(<= 5 main_~i~1), 15923#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 15924#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 15925#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 15926#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 15927#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 15928#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 15929#(<= |foo_#in~size| 4)] [2018-02-02 10:13:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15132 backedges. 895 proven. 1615 refuted. 0 times theorem prover too weak. 12622 trivial. 0 not checked. [2018-02-02 10:13:52,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:13:52,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:13:52,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:13:52,549 INFO L87 Difference]: Start difference. First operand 257 states and 337 transitions. Second operand 15 states. [2018-02-02 10:13:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:52,771 INFO L93 Difference]: Finished difference Result 282 states and 349 transitions. [2018-02-02 10:13:52,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:13:52,771 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 565 [2018-02-02 10:13:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:52,772 INFO L225 Difference]: With dead ends: 282 [2018-02-02 10:13:52,772 INFO L226 Difference]: Without dead ends: 282 [2018-02-02 10:13:52,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:13:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-02 10:13:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 257. [2018-02-02 10:13:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-02 10:13:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 329 transitions. [2018-02-02 10:13:52,776 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 329 transitions. Word has length 565 [2018-02-02 10:13:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:52,776 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 329 transitions. [2018-02-02 10:13:52,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:13:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 329 transitions. [2018-02-02 10:13:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-02-02 10:13:52,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:52,779 INFO L351 BasicCegarLoop]: trace histogram [82, 69, 69, 69, 69, 69, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:52,779 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash 912832778, now seen corresponding path program 34 times [2018-02-02 10:13:52,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:52,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16832 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 16338 trivial. 0 not checked. [2018-02-02 10:13:53,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:53,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:13:53,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked. [2018-02-02 10:13:53,198 INFO L182 omatonBuilderFactory]: Interpolants [16480#false, 16481#(= main_~i~1 0), 16482#(<= main_~i~1 1), 16483#(<= main_~i~1 2), 16484#(<= main_~i~1 3), 16485#(<= main_~i~1 4), 16486#(<= main_~i~1 5), 16487#(<= main_~i~1 6), 16488#(<= main_~i~1 7), 16489#(<= main_~i~1 8), 16490#(<= main_~i~1 9), 16491#(<= main_~i~1 10), 16492#(<= main_~i~1 11), 16493#(<= main_~i~1 12), 16494#(<= main_~i~1 13), 16479#true] [2018-02-02 10:13:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16832 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 16338 trivial. 0 not checked. [2018-02-02 10:13:53,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:13:53,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:13:53,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:13:53,199 INFO L87 Difference]: Start difference. First operand 257 states and 329 transitions. Second operand 16 states. [2018-02-02 10:13:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:53,331 INFO L93 Difference]: Finished difference Result 401 states and 497 transitions. [2018-02-02 10:13:53,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:13:53,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 589 [2018-02-02 10:13:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:53,333 INFO L225 Difference]: With dead ends: 401 [2018-02-02 10:13:53,333 INFO L226 Difference]: Without dead ends: 401 [2018-02-02 10:13:53,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:13:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-02 10:13:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 268. [2018-02-02 10:13:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 10:13:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 345 transitions. [2018-02-02 10:13:53,337 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 345 transitions. Word has length 589 [2018-02-02 10:13:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:53,338 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 345 transitions. [2018-02-02 10:13:53,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:13:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 345 transitions. [2018-02-02 10:13:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2018-02-02 10:13:53,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:53,340 INFO L351 BasicCegarLoop]: trace histogram [89, 75, 75, 75, 75, 75, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:53,341 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1858343931, now seen corresponding path program 35 times [2018-02-02 10:13:53,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:53,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 19870 backedges. 2114 proven. 1095 refuted. 0 times theorem prover too weak. 16661 trivial. 0 not checked. [2018-02-02 10:13:53,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:53,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:13:53,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 297 proven. 114 refuted. 0 times theorem prover too weak. 2040 trivial. 0 not checked. [2018-02-02 10:13:53,766 INFO L182 omatonBuilderFactory]: Interpolants [17164#true, 17165#false, 17166#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 17167#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 17168#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 17169#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 17170#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 17171#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 17172#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 17173#(<= |foo_#in~size| 5), 17174#(<= main_~i~1 5), 17175#(<= main_~i~1 6), 17176#(<= main_~i~1 7), 17177#(<= main_~i~1 8), 17178#(<= main_~i~1 9)] [2018-02-02 10:13:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 19870 backedges. 2114 proven. 1095 refuted. 0 times theorem prover too weak. 16661 trivial. 0 not checked. [2018-02-02 10:13:53,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:13:53,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:13:53,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:13:53,767 INFO L87 Difference]: Start difference. First operand 268 states and 345 transitions. Second operand 15 states. [2018-02-02 10:13:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:53,943 INFO L93 Difference]: Finished difference Result 549 states and 787 transitions. [2018-02-02 10:13:53,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:13:53,943 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 637 [2018-02-02 10:13:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:53,946 INFO L225 Difference]: With dead ends: 549 [2018-02-02 10:13:53,946 INFO L226 Difference]: Without dead ends: 549 [2018-02-02 10:13:53,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:13:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-02-02 10:13:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 268. [2018-02-02 10:13:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 10:13:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 345 transitions. [2018-02-02 10:13:53,955 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 345 transitions. Word has length 637 [2018-02-02 10:13:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:53,956 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 345 transitions. [2018-02-02 10:13:53,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:13:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 345 transitions. [2018-02-02 10:13:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2018-02-02 10:13:53,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:53,959 INFO L351 BasicCegarLoop]: trace histogram [90, 76, 76, 76, 76, 76, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:53,960 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1904767549, now seen corresponding path program 36 times [2018-02-02 10:13:53,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:53,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 20348 backedges. 2683 proven. 940 refuted. 0 times theorem prover too weak. 16725 trivial. 0 not checked. [2018-02-02 10:13:54,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:54,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:13:54,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2457 backedges. 329 proven. 88 refuted. 0 times theorem prover too weak. 2040 trivial. 0 not checked. [2018-02-02 10:13:54,422 INFO L182 omatonBuilderFactory]: Interpolants [18016#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 18017#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 18018#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 18019#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 18020#(<= |foo_#in~size| 6), 18021#(<= main_~i~1 6), 18022#(<= main_~i~1 7), 18023#(<= main_~i~1 8), 18024#(<= main_~i~1 9), 18010#true, 18011#false, 18012#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 18013#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 18014#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 18015#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3))] [2018-02-02 10:13:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 20348 backedges. 2683 proven. 940 refuted. 0 times theorem prover too weak. 16725 trivial. 0 not checked. [2018-02-02 10:13:54,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:13:54,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:13:54,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:13:54,423 INFO L87 Difference]: Start difference. First operand 268 states and 345 transitions. Second operand 15 states. [2018-02-02 10:13:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:54,583 INFO L93 Difference]: Finished difference Result 504 states and 715 transitions. [2018-02-02 10:13:54,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:13:54,583 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 643 [2018-02-02 10:13:54,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:54,585 INFO L225 Difference]: With dead ends: 504 [2018-02-02 10:13:54,585 INFO L226 Difference]: Without dead ends: 504 [2018-02-02 10:13:54,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:13:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-02-02 10:13:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 268. [2018-02-02 10:13:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 10:13:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 345 transitions. [2018-02-02 10:13:54,590 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 345 transitions. Word has length 643 [2018-02-02 10:13:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:54,590 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 345 transitions. [2018-02-02 10:13:54,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:13:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 345 transitions. [2018-02-02 10:13:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-02-02 10:13:54,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:54,593 INFO L351 BasicCegarLoop]: trace histogram [91, 77, 77, 77, 77, 77, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:54,593 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:54,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1208842037, now seen corresponding path program 37 times [2018-02-02 10:13:54,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:54,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20832 backedges. 3378 proven. 659 refuted. 0 times theorem prover too weak. 16795 trivial. 0 not checked. [2018-02-02 10:13:55,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:55,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:13:55,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 379 proven. 50 refuted. 0 times theorem prover too weak. 2040 trivial. 0 not checked. [2018-02-02 10:13:55,014 INFO L182 omatonBuilderFactory]: Interpolants [18816#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 18817#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 18818#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 18819#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 18820#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 18821#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 18822#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 18823#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 18824#(<= |foo_#in~size| 7), 18825#(<= main_~i~1 7), 18826#(<= main_~i~1 8), 18827#(<= main_~i~1 9), 18813#true, 18814#false, 18815#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-02 10:13:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 20832 backedges. 3378 proven. 659 refuted. 0 times theorem prover too weak. 16795 trivial. 0 not checked. [2018-02-02 10:13:55,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:13:55,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:13:55,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:13:55,015 INFO L87 Difference]: Start difference. First operand 268 states and 345 transitions. Second operand 15 states. [2018-02-02 10:13:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:55,229 INFO L93 Difference]: Finished difference Result 451 states and 626 transitions. [2018-02-02 10:13:55,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:13:55,230 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 649 [2018-02-02 10:13:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:55,232 INFO L225 Difference]: With dead ends: 451 [2018-02-02 10:13:55,232 INFO L226 Difference]: Without dead ends: 451 [2018-02-02 10:13:55,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:13:55,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-02 10:13:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 268. [2018-02-02 10:13:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 10:13:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 345 transitions. [2018-02-02 10:13:55,237 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 345 transitions. Word has length 649 [2018-02-02 10:13:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:55,238 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 345 transitions. [2018-02-02 10:13:55,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:13:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 345 transitions. [2018-02-02 10:13:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2018-02-02 10:13:55,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:55,241 INFO L351 BasicCegarLoop]: trace histogram [92, 78, 78, 78, 78, 78, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:55,241 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:55,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2028141293, now seen corresponding path program 38 times [2018-02-02 10:13:55,242 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:55,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 21322 backedges. 4217 proven. 234 refuted. 0 times theorem prover too weak. 16871 trivial. 0 not checked. [2018-02-02 10:13:55,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:55,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:13:55,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 2040 trivial. 0 not checked. [2018-02-02 10:13:55,748 INFO L182 omatonBuilderFactory]: Interpolants [19565#true, 19566#false, 19567#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 19568#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 19569#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 19570#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 19571#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 19572#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 19573#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 19574#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 19575#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 19576#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 19577#(<= |foo_#in~size| 8), 19578#(<= main_~i~1 8), 19579#(<= main_~i~1 9)] [2018-02-02 10:13:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 21322 backedges. 4217 proven. 234 refuted. 0 times theorem prover too weak. 16871 trivial. 0 not checked. [2018-02-02 10:13:55,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:13:55,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:13:55,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:13:55,749 INFO L87 Difference]: Start difference. First operand 268 states and 345 transitions. Second operand 15 states. [2018-02-02 10:13:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:55,950 INFO L93 Difference]: Finished difference Result 391 states and 545 transitions. [2018-02-02 10:13:55,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:13:55,950 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 655 [2018-02-02 10:13:55,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:55,952 INFO L225 Difference]: With dead ends: 391 [2018-02-02 10:13:55,952 INFO L226 Difference]: Without dead ends: 391 [2018-02-02 10:13:55,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:13:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-02 10:13:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 277. [2018-02-02 10:13:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-02 10:13:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 367 transitions. [2018-02-02 10:13:55,957 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 367 transitions. Word has length 655 [2018-02-02 10:13:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:55,957 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 367 transitions. [2018-02-02 10:13:55,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:13:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 367 transitions. [2018-02-02 10:13:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2018-02-02 10:13:55,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:55,960 INFO L351 BasicCegarLoop]: trace histogram [93, 79, 79, 79, 79, 79, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:55,960 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:55,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2143980901, now seen corresponding path program 39 times [2018-02-02 10:13:55,961 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:55,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 21818 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 21244 trivial. 0 not checked. [2018-02-02 10:13:56,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:56,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:13:56,466 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2472 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2472 trivial. 0 not checked. [2018-02-02 10:13:56,467 INFO L182 omatonBuilderFactory]: Interpolants [20268#true, 20269#false, 20270#(= main_~i~1 0), 20271#(<= main_~i~1 1), 20272#(<= main_~i~1 2), 20273#(<= main_~i~1 3), 20274#(<= main_~i~1 4), 20275#(<= main_~i~1 5), 20276#(<= main_~i~1 6), 20277#(<= main_~i~1 7), 20278#(<= main_~i~1 8), 20279#(<= main_~i~1 9), 20280#(<= main_~i~1 10), 20281#(<= main_~i~1 11), 20282#(<= main_~i~1 12), 20283#(<= main_~i~1 13), 20284#(<= main_~i~1 14)] [2018-02-02 10:13:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 21818 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 21244 trivial. 0 not checked. [2018-02-02 10:13:56,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:13:56,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:13:56,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:13:56,467 INFO L87 Difference]: Start difference. First operand 277 states and 367 transitions. Second operand 17 states. [2018-02-02 10:13:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:56,604 INFO L93 Difference]: Finished difference Result 458 states and 605 transitions. [2018-02-02 10:13:56,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:13:56,604 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 661 [2018-02-02 10:13:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:56,605 INFO L225 Difference]: With dead ends: 458 [2018-02-02 10:13:56,605 INFO L226 Difference]: Without dead ends: 458 [2018-02-02 10:13:56,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:13:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-02 10:13:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 288. [2018-02-02 10:13:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-02 10:13:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-02-02 10:13:56,610 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 661 [2018-02-02 10:13:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:56,610 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-02-02 10:13:56,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:13:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-02-02 10:13:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-02-02 10:13:56,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:56,616 INFO L351 BasicCegarLoop]: trace histogram [100, 85, 85, 85, 85, 85, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:56,616 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1727743116, now seen corresponding path program 40 times [2018-02-02 10:13:56,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:56,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 25260 backedges. 2178 proven. 1514 refuted. 0 times theorem prover too weak. 21568 trivial. 0 not checked. [2018-02-02 10:13:57,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:57,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:13:57,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 297 proven. 152 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-02-02 10:13:57,164 INFO L182 omatonBuilderFactory]: Interpolants [21031#true, 21032#false, 21033#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 21034#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 21035#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 21036#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 21037#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 21038#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 21039#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 21040#(<= |foo_#in~size| 5), 21041#(<= main_~i~1 5), 21042#(<= main_~i~1 6), 21043#(<= main_~i~1 7), 21044#(<= main_~i~1 8), 21045#(<= main_~i~1 9), 21046#(<= main_~i~1 10)] [2018-02-02 10:13:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 25260 backedges. 2178 proven. 1514 refuted. 0 times theorem prover too weak. 21568 trivial. 0 not checked. [2018-02-02 10:13:57,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:13:57,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:13:57,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:13:57,165 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 16 states. [2018-02-02 10:13:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:57,342 INFO L93 Difference]: Finished difference Result 634 states and 979 transitions. [2018-02-02 10:13:57,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:13:57,342 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 709 [2018-02-02 10:13:57,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:57,345 INFO L225 Difference]: With dead ends: 634 [2018-02-02 10:13:57,345 INFO L226 Difference]: Without dead ends: 634 [2018-02-02 10:13:57,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:13:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-02-02 10:13:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 288. [2018-02-02 10:13:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-02 10:13:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-02-02 10:13:57,352 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 709 [2018-02-02 10:13:57,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:57,353 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-02-02 10:13:57,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:13:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-02-02 10:13:57,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2018-02-02 10:13:57,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:57,356 INFO L351 BasicCegarLoop]: trace histogram [101, 86, 86, 86, 86, 86, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:57,357 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash 757741140, now seen corresponding path program 41 times [2018-02-02 10:13:57,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:57,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 25800 backedges. 2753 proven. 1415 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2018-02-02 10:13:57,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:57,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:13:57,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2946 backedges. 329 proven. 132 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-02-02 10:13:57,913 INFO L182 omatonBuilderFactory]: Interpolants [21984#false, 21985#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 21986#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 21987#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 21988#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 21989#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 21990#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 21991#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 21992#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 21993#(<= |foo_#in~size| 6), 21994#(<= main_~i~1 6), 21995#(<= main_~i~1 7), 21996#(<= main_~i~1 8), 21997#(<= main_~i~1 9), 21998#(<= main_~i~1 10), 21983#true] [2018-02-02 10:13:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25800 backedges. 2753 proven. 1415 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2018-02-02 10:13:57,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:13:57,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:13:57,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:13:57,914 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 16 states. [2018-02-02 10:13:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:58,122 INFO L93 Difference]: Finished difference Result 595 states and 911 transitions. [2018-02-02 10:13:58,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:13:58,123 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 715 [2018-02-02 10:13:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:58,127 INFO L225 Difference]: With dead ends: 595 [2018-02-02 10:13:58,127 INFO L226 Difference]: Without dead ends: 595 [2018-02-02 10:13:58,128 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:13:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-02-02 10:13:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 288. [2018-02-02 10:13:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-02 10:13:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-02-02 10:13:58,150 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 715 [2018-02-02 10:13:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:58,150 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-02-02 10:13:58,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:13:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-02-02 10:13:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2018-02-02 10:13:58,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:58,157 INFO L351 BasicCegarLoop]: trace histogram [102, 87, 87, 87, 87, 87, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:58,157 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1350658396, now seen corresponding path program 42 times [2018-02-02 10:13:58,158 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:58,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 26346 backedges. 3454 proven. 1190 refuted. 0 times theorem prover too weak. 21702 trivial. 0 not checked. [2018-02-02 10:13:58,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:58,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:13:58,791 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 379 proven. 100 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-02-02 10:13:58,791 INFO L182 omatonBuilderFactory]: Interpolants [22912#(<= main_~i~1 9), 22913#(<= main_~i~1 10), 22898#true, 22899#false, 22900#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 22901#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 22902#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 22903#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 22904#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 22905#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 22906#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 22907#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 22908#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 22909#(<= |foo_#in~size| 7), 22910#(<= main_~i~1 7), 22911#(<= main_~i~1 8)] [2018-02-02 10:13:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 26346 backedges. 3454 proven. 1190 refuted. 0 times theorem prover too weak. 21702 trivial. 0 not checked. [2018-02-02 10:13:58,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:13:58,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:13:58,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:13:58,792 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 16 states. [2018-02-02 10:13:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:58,971 INFO L93 Difference]: Finished difference Result 544 states and 821 transitions. [2018-02-02 10:13:58,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:13:58,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 721 [2018-02-02 10:13:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:58,973 INFO L225 Difference]: With dead ends: 544 [2018-02-02 10:13:58,974 INFO L226 Difference]: Without dead ends: 544 [2018-02-02 10:13:58,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:13:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-02-02 10:13:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 288. [2018-02-02 10:13:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-02 10:13:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-02-02 10:13:58,980 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 721 [2018-02-02 10:13:58,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:58,980 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-02-02 10:13:58,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:13:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-02-02 10:13:58,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2018-02-02 10:13:58,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:58,985 INFO L351 BasicCegarLoop]: trace histogram [103, 88, 88, 88, 88, 88, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:58,986 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:58,986 INFO L82 PathProgramCache]: Analyzing trace with hash -991371868, now seen corresponding path program 43 times [2018-02-02 10:13:58,986 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:59,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:13:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 26898 backedges. 4299 proven. 821 refuted. 0 times theorem prover too weak. 21778 trivial. 0 not checked. [2018-02-02 10:13:59,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:13:59,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:13:59,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:13:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2976 backedges. 435 proven. 56 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-02-02 10:13:59,547 INFO L182 omatonBuilderFactory]: Interpolants [23776#(<= |foo_#in~size| 8), 23777#(<= main_~i~1 8), 23778#(<= main_~i~1 9), 23779#(<= main_~i~1 10), 23764#true, 23765#false, 23766#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 23767#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 23768#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 23769#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 23770#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 23771#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 23772#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 23773#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 23774#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 23775#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9))] [2018-02-02 10:13:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 26898 backedges. 4299 proven. 821 refuted. 0 times theorem prover too weak. 21778 trivial. 0 not checked. [2018-02-02 10:13:59,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:13:59,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:13:59,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:13:59,548 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 16 states. [2018-02-02 10:13:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:13:59,732 INFO L93 Difference]: Finished difference Result 485 states and 712 transitions. [2018-02-02 10:13:59,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:13:59,732 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 727 [2018-02-02 10:13:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:13:59,734 INFO L225 Difference]: With dead ends: 485 [2018-02-02 10:13:59,734 INFO L226 Difference]: Without dead ends: 485 [2018-02-02 10:13:59,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:13:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-02 10:13:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 288. [2018-02-02 10:13:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-02 10:13:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-02-02 10:13:59,739 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 727 [2018-02-02 10:13:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:13:59,739 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-02-02 10:13:59,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:13:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-02-02 10:13:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2018-02-02 10:13:59,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:13:59,743 INFO L351 BasicCegarLoop]: trace histogram [104, 89, 89, 89, 89, 89, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:13:59,743 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:13:59,743 INFO L82 PathProgramCache]: Analyzing trace with hash 900662060, now seen corresponding path program 44 times [2018-02-02 10:13:59,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:13:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:13:59,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 27456 backedges. 5306 proven. 290 refuted. 0 times theorem prover too weak. 21860 trivial. 0 not checked. [2018-02-02 10:14:00,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:00,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:14:00,350 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2982 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-02-02 10:14:00,351 INFO L182 omatonBuilderFactory]: Interpolants [24576#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 24577#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 24578#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 24579#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 24580#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 24581#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 24582#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 24583#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 24584#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 24585#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 24586#(<= |foo_#in~size| 9), 24587#(<= main_~i~1 9), 24588#(<= main_~i~1 10), 24573#true, 24574#false, 24575#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-02 10:14:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 27456 backedges. 5306 proven. 290 refuted. 0 times theorem prover too weak. 21860 trivial. 0 not checked. [2018-02-02 10:14:00,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:14:00,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:14:00,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:14:00,351 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 16 states. [2018-02-02 10:14:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:00,530 INFO L93 Difference]: Finished difference Result 419 states and 611 transitions. [2018-02-02 10:14:00,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:14:00,531 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 733 [2018-02-02 10:14:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:00,532 INFO L225 Difference]: With dead ends: 419 [2018-02-02 10:14:00,532 INFO L226 Difference]: Without dead ends: 419 [2018-02-02 10:14:00,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:14:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-02-02 10:14:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 297. [2018-02-02 10:14:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-02 10:14:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 407 transitions. [2018-02-02 10:14:00,536 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 407 transitions. Word has length 733 [2018-02-02 10:14:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:00,537 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 407 transitions. [2018-02-02 10:14:00,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:14:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 407 transitions. [2018-02-02 10:14:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-02-02 10:14:00,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:00,542 INFO L351 BasicCegarLoop]: trace histogram [105, 90, 90, 90, 90, 90, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:00,542 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash -682837516, now seen corresponding path program 45 times [2018-02-02 10:14:00,543 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:00,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 28020 backedges. 1360 proven. 2632 refuted. 0 times theorem prover too weak. 24028 trivial. 0 not checked. [2018-02-02 10:14:01,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:01,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:14:01,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 133 proven. 313 refuted. 0 times theorem prover too weak. 2533 trivial. 0 not checked. [2018-02-02 10:14:01,137 INFO L182 omatonBuilderFactory]: Interpolants [25327#true, 25328#false, 25329#(<= 0 main_~i~1), 25330#(<= 1 main_~i~1), 25331#(<= 2 main_~i~1), 25332#(<= 3 main_~i~1), 25333#(<= 4 main_~i~1), 25334#(<= 5 main_~i~1), 25335#(<= 6 main_~i~1), 25336#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 25337#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 25338#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 25339#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 25340#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 25341#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 25342#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 25343#(<= |foo_#in~size| 5)] [2018-02-02 10:14:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28020 backedges. 1360 proven. 2632 refuted. 0 times theorem prover too weak. 24028 trivial. 0 not checked. [2018-02-02 10:14:01,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:14:01,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:14:01,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:14:01,138 INFO L87 Difference]: Start difference. First operand 297 states and 407 transitions. Second operand 17 states. [2018-02-02 10:14:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:01,410 INFO L93 Difference]: Finished difference Result 327 states and 422 transitions. [2018-02-02 10:14:01,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:14:01,410 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 739 [2018-02-02 10:14:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:01,411 INFO L225 Difference]: With dead ends: 327 [2018-02-02 10:14:01,411 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 10:14:01,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:14:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 10:14:01,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 297. [2018-02-02 10:14:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-02 10:14:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 398 transitions. [2018-02-02 10:14:01,415 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 398 transitions. Word has length 739 [2018-02-02 10:14:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:01,415 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 398 transitions. [2018-02-02 10:14:01,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:14:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 398 transitions. [2018-02-02 10:14:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2018-02-02 10:14:01,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:01,419 INFO L351 BasicCegarLoop]: trace histogram [109, 94, 94, 94, 94, 94, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:01,419 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash 115276948, now seen corresponding path program 46 times [2018-02-02 10:14:01,420 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:01,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 30336 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 29676 trivial. 0 not checked. [2018-02-02 10:14:02,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:02,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:14:02,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-02-02 10:14:02,156 INFO L182 omatonBuilderFactory]: Interpolants [25984#(<= main_~i~1 2), 25985#(<= main_~i~1 3), 25986#(<= main_~i~1 4), 25987#(<= main_~i~1 5), 25988#(<= main_~i~1 6), 25989#(<= main_~i~1 7), 25990#(<= main_~i~1 8), 25991#(<= main_~i~1 9), 25992#(<= main_~i~1 10), 25993#(<= main_~i~1 11), 25994#(<= main_~i~1 12), 25995#(<= main_~i~1 13), 25996#(<= main_~i~1 14), 25997#(<= main_~i~1 15), 25980#true, 25981#false, 25982#(= main_~i~1 0), 25983#(<= main_~i~1 1)] [2018-02-02 10:14:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 30336 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 29676 trivial. 0 not checked. [2018-02-02 10:14:02,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:14:02,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:14:02,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:14:02,157 INFO L87 Difference]: Start difference. First operand 297 states and 398 transitions. Second operand 18 states. [2018-02-02 10:14:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:02,276 INFO L93 Difference]: Finished difference Result 483 states and 640 transitions. [2018-02-02 10:14:02,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:14:02,276 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 763 [2018-02-02 10:14:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:02,278 INFO L225 Difference]: With dead ends: 483 [2018-02-02 10:14:02,278 INFO L226 Difference]: Without dead ends: 483 [2018-02-02 10:14:02,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:14:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-02 10:14:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 308. [2018-02-02 10:14:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-02 10:14:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 415 transitions. [2018-02-02 10:14:02,283 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 415 transitions. Word has length 763 [2018-02-02 10:14:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:02,284 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 415 transitions. [2018-02-02 10:14:02,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:14:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 415 transitions. [2018-02-02 10:14:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2018-02-02 10:14:02,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:02,288 INFO L351 BasicCegarLoop]: trace histogram [117, 101, 101, 101, 101, 101, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:02,288 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:02,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1696216947, now seen corresponding path program 47 times [2018-02-02 10:14:02,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:02,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 35004 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 34252 trivial. 0 not checked. [2018-02-02 10:14:03,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:03,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:14:03,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3690 trivial. 0 not checked. [2018-02-02 10:14:03,045 INFO L182 omatonBuilderFactory]: Interpolants [26789#true, 26790#false, 26791#(= main_~i~1 0), 26792#(<= main_~i~1 1), 26793#(<= main_~i~1 2), 26794#(<= main_~i~1 3), 26795#(<= main_~i~1 4), 26796#(<= main_~i~1 5), 26797#(<= main_~i~1 6), 26798#(<= main_~i~1 7), 26799#(<= main_~i~1 8), 26800#(<= main_~i~1 9), 26801#(<= main_~i~1 10), 26802#(<= main_~i~1 11), 26803#(<= main_~i~1 12), 26804#(<= main_~i~1 13), 26805#(<= main_~i~1 14), 26806#(<= main_~i~1 15), 26807#(<= main_~i~1 16)] [2018-02-02 10:14:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 35004 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 34252 trivial. 0 not checked. [2018-02-02 10:14:03,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:14:03,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:14:03,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:14:03,046 INFO L87 Difference]: Start difference. First operand 308 states and 415 transitions. Second operand 19 states. [2018-02-02 10:14:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:03,240 INFO L93 Difference]: Finished difference Result 499 states and 661 transitions. [2018-02-02 10:14:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:14:03,240 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 817 [2018-02-02 10:14:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:03,243 INFO L225 Difference]: With dead ends: 499 [2018-02-02 10:14:03,243 INFO L226 Difference]: Without dead ends: 499 [2018-02-02 10:14:03,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:14:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-02 10:14:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 319. [2018-02-02 10:14:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-02 10:14:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 432 transitions. [2018-02-02 10:14:03,250 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 432 transitions. Word has length 817 [2018-02-02 10:14:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:03,251 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 432 transitions. [2018-02-02 10:14:03,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:14:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 432 transitions. [2018-02-02 10:14:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2018-02-02 10:14:03,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:03,257 INFO L351 BasicCegarLoop]: trace histogram [125, 108, 108, 108, 108, 108, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:03,258 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:03,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1091387334, now seen corresponding path program 48 times [2018-02-02 10:14:03,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:03,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 40006 backedges. 7094 proven. 352 refuted. 0 times theorem prover too weak. 32560 trivial. 0 not checked. [2018-02-02 10:14:04,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:04,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:14:04,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-02 10:14:04,077 INFO L182 omatonBuilderFactory]: Interpolants [27626#true, 27627#false, 27628#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 27629#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 27630#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 27631#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 27632#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 27633#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 27634#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 27635#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 27636#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 27637#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 27638#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 27639#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 27640#(<= |foo_#in~size| 10), 27641#(<= main_~i~1 10), 27642#(<= main_~i~1 11)] [2018-02-02 10:14:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 40006 backedges. 7094 proven. 352 refuted. 0 times theorem prover too weak. 32560 trivial. 0 not checked. [2018-02-02 10:14:04,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:14:04,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:14:04,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:14:04,078 INFO L87 Difference]: Start difference. First operand 319 states and 432 transitions. Second operand 17 states. [2018-02-02 10:14:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:04,346 INFO L93 Difference]: Finished difference Result 466 states and 693 transitions. [2018-02-02 10:14:04,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:14:04,346 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 871 [2018-02-02 10:14:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:04,348 INFO L225 Difference]: With dead ends: 466 [2018-02-02 10:14:04,348 INFO L226 Difference]: Without dead ends: 466 [2018-02-02 10:14:04,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:14:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-02-02 10:14:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 325. [2018-02-02 10:14:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 10:14:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 439 transitions. [2018-02-02 10:14:04,353 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 439 transitions. Word has length 871 [2018-02-02 10:14:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:04,353 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 439 transitions. [2018-02-02 10:14:04,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:14:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 439 transitions. [2018-02-02 10:14:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2018-02-02 10:14:04,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:04,357 INFO L351 BasicCegarLoop]: trace histogram [126, 109, 109, 109, 109, 109, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:04,358 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash 747477774, now seen corresponding path program 49 times [2018-02-02 10:14:04,358 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:04,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:05,182 INFO L134 CoverageAnalysis]: Checked inductivity of 40688 backedges. 7708 proven. 420 refuted. 0 times theorem prover too weak. 32560 trivial. 0 not checked. [2018-02-02 10:14:05,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:05,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:14:05,182 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-02 10:14:05,183 INFO L182 omatonBuilderFactory]: Interpolants [28458#true, 28459#false, 28460#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 28461#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 28462#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 28463#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 28464#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 28465#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 28466#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 28467#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 28468#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 28469#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 28470#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 28471#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 28472#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 28473#(<= |foo_#in~size| 11), 28474#(<= main_~i~1 11), 28475#(<= main_~i~1 12)] [2018-02-02 10:14:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 40688 backedges. 7708 proven. 420 refuted. 0 times theorem prover too weak. 32560 trivial. 0 not checked. [2018-02-02 10:14:05,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:14:05,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:14:05,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:14:05,184 INFO L87 Difference]: Start difference. First operand 325 states and 439 transitions. Second operand 18 states. [2018-02-02 10:14:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:05,435 INFO L93 Difference]: Finished difference Result 475 states and 733 transitions. [2018-02-02 10:14:05,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:14:05,435 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 877 [2018-02-02 10:14:05,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:05,437 INFO L225 Difference]: With dead ends: 475 [2018-02-02 10:14:05,437 INFO L226 Difference]: Without dead ends: 475 [2018-02-02 10:14:05,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:14:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-02 10:14:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 331. [2018-02-02 10:14:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-02 10:14:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 446 transitions. [2018-02-02 10:14:05,443 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 446 transitions. Word has length 877 [2018-02-02 10:14:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:05,443 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 446 transitions. [2018-02-02 10:14:05,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:14:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 446 transitions. [2018-02-02 10:14:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2018-02-02 10:14:05,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:05,448 INFO L351 BasicCegarLoop]: trace histogram [127, 110, 110, 110, 110, 110, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:05,448 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:05,448 INFO L82 PathProgramCache]: Analyzing trace with hash 803102806, now seen corresponding path program 50 times [2018-02-02 10:14:05,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:05,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 41376 backedges. 1963 proven. 3611 refuted. 0 times theorem prover too weak. 35802 trivial. 0 not checked. [2018-02-02 10:14:06,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:06,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:14:06,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 177 proven. 411 refuted. 0 times theorem prover too weak. 3705 trivial. 0 not checked. [2018-02-02 10:14:06,308 INFO L182 omatonBuilderFactory]: Interpolants [29312#(<= 2 main_~i~1), 29313#(<= 3 main_~i~1), 29314#(<= 4 main_~i~1), 29315#(<= 5 main_~i~1), 29316#(<= 6 main_~i~1), 29317#(<= 7 main_~i~1), 29318#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 29319#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 29320#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 29321#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 29322#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 29323#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 29324#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 29325#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 29326#(<= |foo_#in~size| 6), 29308#true, 29309#false, 29310#(<= 0 main_~i~1), 29311#(<= 1 main_~i~1)] [2018-02-02 10:14:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 41376 backedges. 1963 proven. 3611 refuted. 0 times theorem prover too weak. 35802 trivial. 0 not checked. [2018-02-02 10:14:06,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:14:06,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:14:06,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:14:06,309 INFO L87 Difference]: Start difference. First operand 331 states and 446 transitions. Second operand 19 states. [2018-02-02 10:14:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:06,674 INFO L93 Difference]: Finished difference Result 366 states and 464 transitions. [2018-02-02 10:14:06,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:14:06,675 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 883 [2018-02-02 10:14:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:06,676 INFO L225 Difference]: With dead ends: 366 [2018-02-02 10:14:06,676 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 10:14:06,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:14:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 10:14:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 331. [2018-02-02 10:14:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-02 10:14:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 436 transitions. [2018-02-02 10:14:06,680 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 436 transitions. Word has length 883 [2018-02-02 10:14:06,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:06,680 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 436 transitions. [2018-02-02 10:14:06,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:14:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 436 transitions. [2018-02-02 10:14:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2018-02-02 10:14:06,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:06,685 INFO L351 BasicCegarLoop]: trace histogram [133, 116, 116, 116, 116, 116, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:06,685 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:06,686 INFO L82 PathProgramCache]: Analyzing trace with hash 495732550, now seen corresponding path program 51 times [2018-02-02 10:14:06,686 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:06,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 45630 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 44780 trivial. 0 not checked. [2018-02-02 10:14:07,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:07,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:14:07,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4527 trivial. 0 not checked. [2018-02-02 10:14:07,581 INFO L182 omatonBuilderFactory]: Interpolants [30048#(<= main_~i~1 8), 30049#(<= main_~i~1 9), 30050#(<= main_~i~1 10), 30051#(<= main_~i~1 11), 30052#(<= main_~i~1 12), 30053#(<= main_~i~1 13), 30054#(<= main_~i~1 14), 30055#(<= main_~i~1 15), 30056#(<= main_~i~1 16), 30057#(<= main_~i~1 17), 30038#true, 30039#false, 30040#(= main_~i~1 0), 30041#(<= main_~i~1 1), 30042#(<= main_~i~1 2), 30043#(<= main_~i~1 3), 30044#(<= main_~i~1 4), 30045#(<= main_~i~1 5), 30046#(<= main_~i~1 6), 30047#(<= main_~i~1 7)] [2018-02-02 10:14:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 45630 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 44780 trivial. 0 not checked. [2018-02-02 10:14:07,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:14:07,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:14:07,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:14:07,582 INFO L87 Difference]: Start difference. First operand 331 states and 436 transitions. Second operand 20 states. [2018-02-02 10:14:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:07,721 INFO L93 Difference]: Finished difference Result 495 states and 620 transitions. [2018-02-02 10:14:07,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:14:07,721 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 919 [2018-02-02 10:14:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:07,724 INFO L225 Difference]: With dead ends: 495 [2018-02-02 10:14:07,724 INFO L226 Difference]: Without dead ends: 495 [2018-02-02 10:14:07,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:14:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-02-02 10:14:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 342. [2018-02-02 10:14:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-02 10:14:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 452 transitions. [2018-02-02 10:14:07,729 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 452 transitions. Word has length 919 [2018-02-02 10:14:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:07,729 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 452 transitions. [2018-02-02 10:14:07,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:14:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 452 transitions. [2018-02-02 10:14:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 980 [2018-02-02 10:14:07,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:07,735 INFO L351 BasicCegarLoop]: trace histogram [142, 124, 124, 124, 124, 124, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:07,735 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1400240071, now seen corresponding path program 52 times [2018-02-02 10:14:07,736 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:07,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 52092 backedges. 6828 proven. 1125 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-02 10:14:08,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:08,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:14:08,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5238 backedges. 630 proven. 62 refuted. 0 times theorem prover too weak. 4546 trivial. 0 not checked. [2018-02-02 10:14:08,668 INFO L182 omatonBuilderFactory]: Interpolants [30895#true, 30896#false, 30897#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 30898#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 30899#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 30900#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 30901#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 30902#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 30903#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 30904#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 30905#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 30906#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 30907#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 30908#(<= |foo_#in~size| 9), 30909#(<= main_~i~1 9), 30910#(<= main_~i~1 10), 30911#(<= main_~i~1 11)] [2018-02-02 10:14:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 52092 backedges. 6828 proven. 1125 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-02 10:14:08,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:14:08,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:14:08,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:14:08,670 INFO L87 Difference]: Start difference. First operand 342 states and 452 transitions. Second operand 17 states. [2018-02-02 10:14:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:08,868 INFO L93 Difference]: Finished difference Result 580 states and 883 transitions. [2018-02-02 10:14:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:14:08,868 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 979 [2018-02-02 10:14:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:08,871 INFO L225 Difference]: With dead ends: 580 [2018-02-02 10:14:08,871 INFO L226 Difference]: Without dead ends: 580 [2018-02-02 10:14:08,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=513, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:14:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-02-02 10:14:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 342. [2018-02-02 10:14:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-02 10:14:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 452 transitions. [2018-02-02 10:14:08,876 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 452 transitions. Word has length 979 [2018-02-02 10:14:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:08,876 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 452 transitions. [2018-02-02 10:14:08,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:14:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 452 transitions. [2018-02-02 10:14:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2018-02-02 10:14:08,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:08,881 INFO L351 BasicCegarLoop]: trace histogram [143, 125, 125, 125, 125, 125, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:08,881 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:08,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1861613809, now seen corresponding path program 53 times [2018-02-02 10:14:08,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:08,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 52872 backedges. 7466 proven. 1267 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-02 10:14:09,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:09,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:14:09,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5244 backedges. 630 proven. 68 refuted. 0 times theorem prover too weak. 4546 trivial. 0 not checked. [2018-02-02 10:14:09,836 INFO L182 omatonBuilderFactory]: Interpolants [31872#(<= main_~i~1 11), 31873#(<= main_~i~1 12), 31856#true, 31857#false, 31858#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 31859#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 31860#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 31861#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 31862#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 31863#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 31864#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 31865#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 31866#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 31867#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 31868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 31869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 31870#(<= |foo_#in~size| 10), 31871#(<= main_~i~1 10)] [2018-02-02 10:14:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 52872 backedges. 7466 proven. 1267 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-02 10:14:09,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:14:09,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:14:09,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:14:09,837 INFO L87 Difference]: Start difference. First operand 342 states and 452 transitions. Second operand 18 states. [2018-02-02 10:14:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:10,072 INFO L93 Difference]: Finished difference Result 583 states and 933 transitions. [2018-02-02 10:14:10,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:14:10,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 985 [2018-02-02 10:14:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:10,076 INFO L225 Difference]: With dead ends: 583 [2018-02-02 10:14:10,076 INFO L226 Difference]: Without dead ends: 583 [2018-02-02 10:14:10,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=282, Invalid=588, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:14:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-02-02 10:14:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 342. [2018-02-02 10:14:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-02 10:14:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 452 transitions. [2018-02-02 10:14:10,084 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 452 transitions. Word has length 985 [2018-02-02 10:14:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:10,084 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 452 transitions. [2018-02-02 10:14:10,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:14:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 452 transitions. [2018-02-02 10:14:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 992 [2018-02-02 10:14:10,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:10,089 INFO L351 BasicCegarLoop]: trace histogram [144, 126, 126, 126, 126, 126, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:10,089 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:10,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1378385833, now seen corresponding path program 54 times [2018-02-02 10:14:10,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:10,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 53658 backedges. 8104 proven. 1415 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-02 10:14:11,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:11,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:14:11,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 630 proven. 74 refuted. 0 times theorem prover too weak. 4546 trivial. 0 not checked. [2018-02-02 10:14:11,097 INFO L182 omatonBuilderFactory]: Interpolants [32832#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 32833#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 32834#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 32835#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 32836#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 32837#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 32838#(<= |foo_#in~size| 11), 32839#(<= main_~i~1 11), 32840#(<= main_~i~1 12), 32841#(<= main_~i~1 13), 32823#true, 32824#false, 32825#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 32826#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 32827#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 32828#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 32829#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 32830#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 32831#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6))] [2018-02-02 10:14:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 53658 backedges. 8104 proven. 1415 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-02 10:14:11,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:14:11,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:14:11,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:14:11,098 INFO L87 Difference]: Start difference. First operand 342 states and 452 transitions. Second operand 19 states. [2018-02-02 10:14:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:11,365 INFO L93 Difference]: Finished difference Result 587 states and 937 transitions. [2018-02-02 10:14:11,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:14:11,365 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 991 [2018-02-02 10:14:11,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:11,368 INFO L225 Difference]: With dead ends: 587 [2018-02-02 10:14:11,368 INFO L226 Difference]: Without dead ends: 587 [2018-02-02 10:14:11,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=324, Invalid=668, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:14:11,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-02-02 10:14:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 339. [2018-02-02 10:14:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-02 10:14:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 433 transitions. [2018-02-02 10:14:11,374 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 433 transitions. Word has length 991 [2018-02-02 10:14:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:11,374 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 433 transitions. [2018-02-02 10:14:11,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:14:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 433 transitions. [2018-02-02 10:14:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2018-02-02 10:14:11,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:11,380 INFO L351 BasicCegarLoop]: trace histogram [145, 127, 127, 127, 127, 127, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:11,380 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash -274275425, now seen corresponding path program 55 times [2018-02-02 10:14:11,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:11,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 54450 backedges. 9717 proven. 494 refuted. 0 times theorem prover too weak. 44239 trivial. 0 not checked. [2018-02-02 10:14:12,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:12,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:14:12,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5259 backedges. 713 proven. 0 refuted. 0 times theorem prover too weak. 4546 trivial. 0 not checked. [2018-02-02 10:14:12,405 INFO L182 omatonBuilderFactory]: Interpolants [33794#true, 33795#false, 33796#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 33797#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 33798#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 33799#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 33800#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 33801#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 33802#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 33803#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 33804#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 33805#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 33806#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 33807#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 33808#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 33809#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 33810#(<= |foo_#in~size| 12), 33811#(<= main_~i~1 12), 33812#(<= main_~i~1 13)] [2018-02-02 10:14:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 54450 backedges. 9717 proven. 494 refuted. 0 times theorem prover too weak. 44239 trivial. 0 not checked. [2018-02-02 10:14:12,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:14:12,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:14:12,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:14:12,407 INFO L87 Difference]: Start difference. First operand 339 states and 433 transitions. Second operand 19 states. [2018-02-02 10:14:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:12,639 INFO L93 Difference]: Finished difference Result 503 states and 787 transitions. [2018-02-02 10:14:12,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:14:12,639 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 997 [2018-02-02 10:14:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:12,642 INFO L225 Difference]: With dead ends: 503 [2018-02-02 10:14:12,642 INFO L226 Difference]: Without dead ends: 503 [2018-02-02 10:14:12,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:14:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-02 10:14:12,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 348. [2018-02-02 10:14:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 10:14:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 459 transitions. [2018-02-02 10:14:12,648 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 459 transitions. Word has length 997 [2018-02-02 10:14:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:12,649 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 459 transitions. [2018-02-02 10:14:12,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:14:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 459 transitions. [2018-02-02 10:14:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1004 [2018-02-02 10:14:12,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:12,655 INFO L351 BasicCegarLoop]: trace histogram [146, 128, 128, 128, 128, 128, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:12,655 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:12,655 INFO L82 PathProgramCache]: Analyzing trace with hash 860436519, now seen corresponding path program 56 times [2018-02-02 10:14:12,656 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:12,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 55248 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 54294 trivial. 0 not checked. [2018-02-02 10:14:13,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:13,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:14:13,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2018-02-02 10:14:13,680 INFO L182 omatonBuilderFactory]: Interpolants [34692#true, 34693#false, 34694#(= main_~i~1 0), 34695#(<= main_~i~1 1), 34696#(<= main_~i~1 2), 34697#(<= main_~i~1 3), 34698#(<= main_~i~1 4), 34699#(<= main_~i~1 5), 34700#(<= main_~i~1 6), 34701#(<= main_~i~1 7), 34702#(<= main_~i~1 8), 34703#(<= main_~i~1 9), 34704#(<= main_~i~1 10), 34705#(<= main_~i~1 11), 34706#(<= main_~i~1 12), 34707#(<= main_~i~1 13), 34708#(<= main_~i~1 14), 34709#(<= main_~i~1 15), 34710#(<= main_~i~1 16), 34711#(<= main_~i~1 17), 34712#(<= main_~i~1 18)] [2018-02-02 10:14:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 55248 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 54294 trivial. 0 not checked. [2018-02-02 10:14:13,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:14:13,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:14:13,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:14:13,681 INFO L87 Difference]: Start difference. First operand 348 states and 459 transitions. Second operand 21 states. [2018-02-02 10:14:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:13,830 INFO L93 Difference]: Finished difference Result 517 states and 647 transitions. [2018-02-02 10:14:13,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:14:13,830 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1003 [2018-02-02 10:14:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:13,832 INFO L225 Difference]: With dead ends: 517 [2018-02-02 10:14:13,832 INFO L226 Difference]: Without dead ends: 517 [2018-02-02 10:14:13,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:14:13,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-02 10:14:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 359. [2018-02-02 10:14:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-02 10:14:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-02-02 10:14:13,836 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 1003 [2018-02-02 10:14:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:13,837 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-02-02 10:14:13,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:14:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-02-02 10:14:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2018-02-02 10:14:13,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:13,842 INFO L351 BasicCegarLoop]: trace histogram [155, 136, 136, 136, 136, 136, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:13,842 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:13,842 INFO L82 PathProgramCache]: Analyzing trace with hash -870443480, now seen corresponding path program 57 times [2018-02-02 10:14:13,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:13,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 62338 backedges. 6234 proven. 1806 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-02 10:14:14,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:14,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:14:14,888 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6021 backedges. 624 proven. 112 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-02 10:14:14,889 INFO L182 omatonBuilderFactory]: Interpolants [35589#true, 35590#false, 35591#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 35592#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 35593#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 35594#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 35595#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 35596#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 35597#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 35598#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 35599#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 35600#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 35601#(<= |foo_#in~size| 8), 35602#(<= main_~i~1 8), 35603#(<= main_~i~1 9), 35604#(<= main_~i~1 10), 35605#(<= main_~i~1 11)] [2018-02-02 10:14:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 62338 backedges. 6234 proven. 1806 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-02 10:14:14,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:14:14,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:14:14,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:14:14,890 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 17 states. [2018-02-02 10:14:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:15,085 INFO L93 Difference]: Finished difference Result 698 states and 1093 transitions. [2018-02-02 10:14:15,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:14:15,086 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1063 [2018-02-02 10:14:15,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:15,089 INFO L225 Difference]: With dead ends: 698 [2018-02-02 10:14:15,090 INFO L226 Difference]: Without dead ends: 698 [2018-02-02 10:14:15,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:14:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-02-02 10:14:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 359. [2018-02-02 10:14:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-02 10:14:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-02-02 10:14:15,097 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 1063 [2018-02-02 10:14:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:15,097 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-02-02 10:14:15,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:14:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-02-02 10:14:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1070 [2018-02-02 10:14:15,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:15,103 INFO L351 BasicCegarLoop]: trace histogram [156, 137, 137, 137, 137, 137, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:15,103 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash -479133328, now seen corresponding path program 58 times [2018-02-02 10:14:15,104 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:15,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 63192 backedges. 6866 proven. 2028 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-02 10:14:16,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:16,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:14:16,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6033 backedges. 624 proven. 124 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-02 10:14:16,222 INFO L182 omatonBuilderFactory]: Interpolants [36683#true, 36684#false, 36685#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 36686#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 36687#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 36688#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 36689#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 36690#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 36691#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 36692#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 36693#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 36694#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 36695#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 36696#(<= |foo_#in~size| 9), 36697#(<= main_~i~1 9), 36698#(<= main_~i~1 10), 36699#(<= main_~i~1 11), 36700#(<= main_~i~1 12)] [2018-02-02 10:14:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 63192 backedges. 6866 proven. 2028 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-02 10:14:16,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:14:16,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:14:16,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:14:16,223 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 18 states. [2018-02-02 10:14:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:16,443 INFO L93 Difference]: Finished difference Result 701 states and 1160 transitions. [2018-02-02 10:14:16,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:14:16,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1069 [2018-02-02 10:14:16,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:16,447 INFO L225 Difference]: With dead ends: 701 [2018-02-02 10:14:16,447 INFO L226 Difference]: Without dead ends: 701 [2018-02-02 10:14:16,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:14:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-02-02 10:14:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 359. [2018-02-02 10:14:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-02 10:14:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-02-02 10:14:16,456 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 1069 [2018-02-02 10:14:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:16,456 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-02-02 10:14:16,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:14:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-02-02 10:14:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1076 [2018-02-02 10:14:16,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:16,462 INFO L351 BasicCegarLoop]: trace histogram [157, 138, 138, 138, 138, 138, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:16,462 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:16,462 INFO L82 PathProgramCache]: Analyzing trace with hash -295151944, now seen corresponding path program 59 times [2018-02-02 10:14:16,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:16,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 64052 backedges. 7498 proven. 2256 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-02 10:14:17,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:17,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:14:17,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6045 backedges. 624 proven. 136 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-02 10:14:17,625 INFO L182 omatonBuilderFactory]: Interpolants [37792#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 37793#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 37794#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 37795#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 37796#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 37797#(<= |foo_#in~size| 10), 37798#(<= main_~i~1 10), 37799#(<= main_~i~1 11), 37800#(<= main_~i~1 12), 37801#(<= main_~i~1 13), 37783#true, 37784#false, 37785#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 37786#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 37787#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 37788#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 37789#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 37790#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 37791#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6))] [2018-02-02 10:14:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 64052 backedges. 7498 proven. 2256 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-02 10:14:17,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:14:17,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:14:17,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:14:17,627 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 19 states. [2018-02-02 10:14:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:17,830 INFO L93 Difference]: Finished difference Result 704 states and 1227 transitions. [2018-02-02 10:14:17,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:14:17,831 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1075 [2018-02-02 10:14:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:17,836 INFO L225 Difference]: With dead ends: 704 [2018-02-02 10:14:17,836 INFO L226 Difference]: Without dead ends: 704 [2018-02-02 10:14:17,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=287, Invalid=643, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:14:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-02-02 10:14:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 359. [2018-02-02 10:14:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-02 10:14:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-02-02 10:14:17,847 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 1075 [2018-02-02 10:14:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:17,847 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-02-02 10:14:17,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:14:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-02-02 10:14:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1082 [2018-02-02 10:14:17,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:17,854 INFO L351 BasicCegarLoop]: trace histogram [158, 139, 139, 139, 139, 139, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:17,854 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash -158558720, now seen corresponding path program 60 times [2018-02-02 10:14:17,854 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:17,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 64918 backedges. 8130 proven. 2490 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-02 10:14:19,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:19,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:14:19,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6057 backedges. 624 proven. 148 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-02 10:14:19,051 INFO L182 omatonBuilderFactory]: Interpolants [38889#true, 38890#false, 38891#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 38892#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 38893#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 38894#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 38895#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 38896#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 38897#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 38898#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 38899#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 38900#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 38901#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 38902#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 38903#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 38904#(<= |foo_#in~size| 11), 38905#(<= main_~i~1 11), 38906#(<= main_~i~1 12), 38907#(<= main_~i~1 13), 38908#(<= main_~i~1 14)] [2018-02-02 10:14:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 64918 backedges. 8130 proven. 2490 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-02 10:14:19,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:14:19,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:14:19,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:14:19,052 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 20 states. [2018-02-02 10:14:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:19,378 INFO L93 Difference]: Finished difference Result 704 states and 1227 transitions. [2018-02-02 10:14:19,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:14:19,378 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1081 [2018-02-02 10:14:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:19,383 INFO L225 Difference]: With dead ends: 704 [2018-02-02 10:14:19,383 INFO L226 Difference]: Without dead ends: 704 [2018-02-02 10:14:19,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=329, Invalid=727, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:14:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-02-02 10:14:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 356. [2018-02-02 10:14:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-02-02 10:14:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 455 transitions. [2018-02-02 10:14:19,392 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 455 transitions. Word has length 1081 [2018-02-02 10:14:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:19,393 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 455 transitions. [2018-02-02 10:14:19,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:14:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 455 transitions. [2018-02-02 10:14:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1088 [2018-02-02 10:14:19,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:19,399 INFO L351 BasicCegarLoop]: trace histogram [159, 140, 140, 140, 140, 140, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:19,399 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash -586793144, now seen corresponding path program 61 times [2018-02-02 10:14:19,400 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:19,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 65790 backedges. 9743 proven. 1649 refuted. 0 times theorem prover too weak. 54398 trivial. 0 not checked. [2018-02-02 10:14:20,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:20,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:14:20,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6072 backedges. 707 proven. 80 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-02 10:14:20,617 INFO L182 omatonBuilderFactory]: Interpolants [40000#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 40001#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 40002#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 40003#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 40004#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 40005#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 40006#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 40007#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 40008#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 40009#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 40010#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 40011#(<= |foo_#in~size| 12), 40012#(<= main_~i~1 12), 40013#(<= main_~i~1 13), 40014#(<= main_~i~1 14), 39995#true, 39996#false, 39997#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 39998#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 39999#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-02 10:14:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 65790 backedges. 9743 proven. 1649 refuted. 0 times theorem prover too weak. 54398 trivial. 0 not checked. [2018-02-02 10:14:20,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:14:20,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:14:20,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:14:20,618 INFO L87 Difference]: Start difference. First operand 356 states and 455 transitions. Second operand 20 states. [2018-02-02 10:14:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:20,898 INFO L93 Difference]: Finished difference Result 621 states and 1041 transitions. [2018-02-02 10:14:20,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:14:20,898 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1087 [2018-02-02 10:14:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:20,903 INFO L225 Difference]: With dead ends: 621 [2018-02-02 10:14:20,903 INFO L226 Difference]: Without dead ends: 621 [2018-02-02 10:14:20,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:14:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-02-02 10:14:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 356. [2018-02-02 10:14:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-02-02 10:14:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 455 transitions. [2018-02-02 10:14:20,911 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 455 transitions. Word has length 1087 [2018-02-02 10:14:20,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:20,911 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 455 transitions. [2018-02-02 10:14:20,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:14:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 455 transitions. [2018-02-02 10:14:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2018-02-02 10:14:20,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:20,917 INFO L351 BasicCegarLoop]: trace histogram [160, 141, 141, 141, 141, 141, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:20,917 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1136698928, now seen corresponding path program 62 times [2018-02-02 10:14:20,917 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:20,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 66668 backedges. 11590 proven. 574 refuted. 0 times theorem prover too weak. 54504 trivial. 0 not checked. [2018-02-02 10:14:22,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:22,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:14:22,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6078 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-02 10:14:22,198 INFO L182 omatonBuilderFactory]: Interpolants [41024#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 41025#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 41026#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 41027#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 41028#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 41029#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 41030#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 41031#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 41032#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 41033#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 41034#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 41035#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 41036#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 41037#(<= |foo_#in~size| 13), 41038#(<= main_~i~1 13), 41039#(<= main_~i~1 14), 41020#true, 41021#false, 41022#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 41023#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-02 10:14:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 66668 backedges. 11590 proven. 574 refuted. 0 times theorem prover too weak. 54504 trivial. 0 not checked. [2018-02-02 10:14:22,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:14:22,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:14:22,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:14:22,199 INFO L87 Difference]: Start difference. First operand 356 states and 455 transitions. Second operand 20 states. [2018-02-02 10:14:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:22,443 INFO L93 Difference]: Finished difference Result 531 states and 865 transitions. [2018-02-02 10:14:22,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:14:22,443 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1093 [2018-02-02 10:14:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:22,447 INFO L225 Difference]: With dead ends: 531 [2018-02-02 10:14:22,447 INFO L226 Difference]: Without dead ends: 531 [2018-02-02 10:14:22,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:14:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-02 10:14:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 365. [2018-02-02 10:14:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-02 10:14:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 482 transitions. [2018-02-02 10:14:22,454 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 482 transitions. Word has length 1093 [2018-02-02 10:14:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:22,455 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 482 transitions. [2018-02-02 10:14:22,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:14:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 482 transitions. [2018-02-02 10:14:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1100 [2018-02-02 10:14:22,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:22,460 INFO L351 BasicCegarLoop]: trace histogram [161, 142, 142, 142, 142, 142, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:22,460 INFO L371 AbstractCegarLoop]: === Iteration 72 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:22,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1833076120, now seen corresponding path program 63 times [2018-02-02 10:14:22,461 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:22,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 67552 backedges. 2722 proven. 5294 refuted. 0 times theorem prover too weak. 59536 trivial. 0 not checked. [2018-02-02 10:14:23,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:23,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:14:23,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6075 backedges. 227 proven. 521 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-02 10:14:23,750 INFO L182 omatonBuilderFactory]: Interpolants [41984#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 41985#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 41986#(<= |foo_#in~size| 7), 41966#true, 41967#false, 41968#(<= 0 main_~i~1), 41969#(<= 1 main_~i~1), 41970#(<= 2 main_~i~1), 41971#(<= 3 main_~i~1), 41972#(<= 4 main_~i~1), 41973#(<= 5 main_~i~1), 41974#(<= 6 main_~i~1), 41975#(<= 7 main_~i~1), 41976#(<= 8 main_~i~1), 41977#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 41978#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 41979#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 41980#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 41981#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 41982#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 41983#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6))] [2018-02-02 10:14:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 67552 backedges. 2722 proven. 5294 refuted. 0 times theorem prover too weak. 59536 trivial. 0 not checked. [2018-02-02 10:14:23,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:14:23,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:14:23,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:14:23,751 INFO L87 Difference]: Start difference. First operand 365 states and 482 transitions. Second operand 21 states. [2018-02-02 10:14:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:23,979 INFO L93 Difference]: Finished difference Result 408 states and 523 transitions. [2018-02-02 10:14:23,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:14:23,979 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1099 [2018-02-02 10:14:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:23,981 INFO L225 Difference]: With dead ends: 408 [2018-02-02 10:14:23,981 INFO L226 Difference]: Without dead ends: 408 [2018-02-02 10:14:23,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:14:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-02-02 10:14:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 368. [2018-02-02 10:14:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-02 10:14:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 491 transitions. [2018-02-02 10:14:23,985 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 491 transitions. Word has length 1099 [2018-02-02 10:14:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:23,985 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 491 transitions. [2018-02-02 10:14:23,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:14:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 491 transitions. [2018-02-02 10:14:23,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2018-02-02 10:14:23,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:23,991 INFO L351 BasicCegarLoop]: trace histogram [169, 150, 150, 150, 150, 150, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:23,991 INFO L371 AbstractCegarLoop]: === Iteration 73 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:23,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1868763864, now seen corresponding path program 64 times [2018-02-02 10:14:23,992 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:24,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 74840 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 73776 trivial. 0 not checked. [2018-02-02 10:14:25,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:25,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:14:25,377 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6363 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6363 trivial. 0 not checked. [2018-02-02 10:14:25,377 INFO L182 omatonBuilderFactory]: Interpolants [42784#(<= main_~i~1 3), 42785#(<= main_~i~1 4), 42786#(<= main_~i~1 5), 42787#(<= main_~i~1 6), 42788#(<= main_~i~1 7), 42789#(<= main_~i~1 8), 42790#(<= main_~i~1 9), 42791#(<= main_~i~1 10), 42792#(<= main_~i~1 11), 42793#(<= main_~i~1 12), 42794#(<= main_~i~1 13), 42795#(<= main_~i~1 14), 42796#(<= main_~i~1 15), 42797#(<= main_~i~1 16), 42798#(<= main_~i~1 17), 42799#(<= main_~i~1 18), 42800#(<= main_~i~1 19), 42779#true, 42780#false, 42781#(= main_~i~1 0), 42782#(<= main_~i~1 1), 42783#(<= main_~i~1 2)] [2018-02-02 10:14:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 74840 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 73776 trivial. 0 not checked. [2018-02-02 10:14:25,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:14:25,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:14:25,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:14:25,379 INFO L87 Difference]: Start difference. First operand 368 states and 491 transitions. Second operand 22 states. [2018-02-02 10:14:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:25,574 INFO L93 Difference]: Finished difference Result 542 states and 683 transitions. [2018-02-02 10:14:25,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:14:25,574 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1147 [2018-02-02 10:14:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:25,576 INFO L225 Difference]: With dead ends: 542 [2018-02-02 10:14:25,576 INFO L226 Difference]: Without dead ends: 542 [2018-02-02 10:14:25,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:14:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-02-02 10:14:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 379. [2018-02-02 10:14:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-02 10:14:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 507 transitions. [2018-02-02 10:14:25,581 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 507 transitions. Word has length 1147 [2018-02-02 10:14:25,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:25,581 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 507 transitions. [2018-02-02 10:14:25,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:14:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 507 transitions. [2018-02-02 10:14:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2018-02-02 10:14:25,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:25,588 INFO L351 BasicCegarLoop]: trace histogram [179, 159, 159, 159, 159, 159, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:25,588 INFO L371 AbstractCegarLoop]: === Iteration 74 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:25,588 INFO L82 PathProgramCache]: Analyzing trace with hash -131833823, now seen corresponding path program 65 times [2018-02-02 10:14:25,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:25,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 84046 backedges. 6782 proven. 2685 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-02 10:14:27,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:27,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:14:27,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 696 proven. 168 refuted. 0 times theorem prover too weak. 6381 trivial. 0 not checked. [2018-02-02 10:14:27,062 INFO L182 omatonBuilderFactory]: Interpolants [43722#true, 43723#false, 43724#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 43725#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 43726#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 43727#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 43728#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 43729#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 43730#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 43731#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 43732#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 43733#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 43734#(<= |foo_#in~size| 8), 43735#(<= main_~i~1 8), 43736#(<= main_~i~1 9), 43737#(<= main_~i~1 10), 43738#(<= main_~i~1 11), 43739#(<= main_~i~1 12)] [2018-02-02 10:14:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 84046 backedges. 6782 proven. 2685 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-02 10:14:27,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:14:27,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:14:27,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:14:27,063 INFO L87 Difference]: Start difference. First operand 379 states and 507 transitions. Second operand 18 states. [2018-02-02 10:14:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:27,311 INFO L93 Difference]: Finished difference Result 819 states and 1327 transitions. [2018-02-02 10:14:27,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:14:27,312 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1213 [2018-02-02 10:14:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:27,315 INFO L225 Difference]: With dead ends: 819 [2018-02-02 10:14:27,315 INFO L226 Difference]: Without dead ends: 819 [2018-02-02 10:14:27,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:14:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-02-02 10:14:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 382. [2018-02-02 10:14:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 10:14:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 528 transitions. [2018-02-02 10:14:27,323 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 528 transitions. Word has length 1213 [2018-02-02 10:14:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:27,323 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 528 transitions. [2018-02-02 10:14:27,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:14:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 528 transitions. [2018-02-02 10:14:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1220 [2018-02-02 10:14:27,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:27,330 INFO L351 BasicCegarLoop]: trace histogram [180, 160, 160, 160, 160, 160, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:27,330 INFO L371 AbstractCegarLoop]: === Iteration 75 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:14:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash 647193961, now seen corresponding path program 66 times [2018-02-02 10:14:27,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:27,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 10:14:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 85040 backedges. 7462 proven. 2999 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-02 10:14:28,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:28,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:14:28,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7239 backedges. 672 proven. 186 refuted. 0 times theorem prover too weak. 6381 trivial. 0 not checked. [2018-02-02 10:14:28,787 INFO L182 omatonBuilderFactory]: Interpolants [44961#true, 44962#false, 44963#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 44964#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 44965#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 44966#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 44967#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 44968#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 44969#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 44970#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 44971#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 44972#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 44973#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 44974#(<= |foo_#in~size| 9), 44975#(<= main_~i~1 9), 44976#(<= main_~i~1 10), 44977#(<= main_~i~1 11), 44978#(<= main_~i~1 12), 44979#(<= main_~i~1 13)] [2018-02-02 10:14:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 85040 backedges. 7462 proven. 2999 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-02 10:14:28,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:14:28,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:14:28,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:14:28,788 INFO L87 Difference]: Start difference. First operand 382 states and 528 transitions. Second operand 19 states. [2018-02-02 10:14:28,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 10:14:28,789 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:14:28,793 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:14:28,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:14:28 BoogieIcfgContainer [2018-02-02 10:14:28,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:14:28,794 INFO L168 Benchmark]: Toolchain (without parser) took 51116.61 ms. Allocated memory was 403.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 357.0 MB in the beginning and 1.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 992.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:14:28,794 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 403.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:14:28,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.18 ms. Allocated memory is still 403.2 MB. Free memory was 357.0 MB in the beginning and 349.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:14:28,795 INFO L168 Benchmark]: Boogie Preprocessor took 25.85 ms. Allocated memory is still 403.2 MB. Free memory was 349.1 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:14:28,795 INFO L168 Benchmark]: RCFGBuilder took 206.68 ms. Allocated memory is still 403.2 MB. Free memory was 346.4 MB in the beginning and 329.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:14:28,795 INFO L168 Benchmark]: TraceAbstraction took 50745.80 ms. Allocated memory was 403.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 329.2 MB in the beginning and 1.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 964.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:14:28,796 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.15 ms. Allocated memory is still 403.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 135.18 ms. Allocated memory is still 403.2 MB. Free memory was 357.0 MB in the beginning and 349.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.85 ms. Allocated memory is still 403.2 MB. Free memory was 349.1 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 206.68 ms. Allocated memory is still 403.2 MB. Free memory was 346.4 MB in the beginning and 329.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50745.80 ms. Allocated memory was 403.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 329.2 MB in the beginning and 1.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 964.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 2 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 2 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 2 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 2 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 2 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (382states) and interpolant automaton (currently 2 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 50.6s OverallTime, 75 OverallIterations, 180 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2452 SDtfs, 8356 SDslu, 17706 SDs, 0 SdLazy, 18976 SolverSat, 1609 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1372 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 1227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3382 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1609926/1665951 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 74 MinimizatonAttempts, 9553 StatesRemovedByMinimization, 73 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 26.8s InterpolantComputationTime, 40147 NumberOfCodeBlocks, 40147 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 40072 ConstructedInterpolants, 0 QuantifiedInterpolants, 44359205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 75 InterpolantComputations, 7 PerfectInterpolantSequences, 1609926/1665951 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-14-28-801.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-14-28-801.csv Completed graceful shutdown