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_false-valid-deref-write.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:10:41,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:10:41,236 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:10:41,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:10:41,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:10:41,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:10:41,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:10:41,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:10:41,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:10:41,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:10:41,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:10:41,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:10:41,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:10:41,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:10:41,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:10:41,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:10:41,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:10:41,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:10:41,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:10:41,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:10:41,264 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:10:41,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:10:41,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:10:41,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:10:41,266 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:10:41,267 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:10:41,267 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:10:41,268 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:10:41,268 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:10:41,269 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:10:41,269 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:10:41,269 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:10:41,280 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:10:41,280 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:10:41,281 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:10:41,281 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:10:41,282 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:10:41,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:10:41,282 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:10:41,282 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:10:41,282 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:10:41,283 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:10:41,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:10:41,283 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:10:41,283 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:10:41,283 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:10:41,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:10:41,284 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:10:41,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:10:41,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:10:41,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:10:41,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:10:41,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:10:41,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:10:41,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:10:41,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:10:41,324 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:10:41,327 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:10:41,328 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:10:41,329 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:10:41,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-02-02 10:10:41,448 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:10:41,449 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:10:41,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:10:41,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:10:41,453 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:10:41,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:10:41" (1/1) ... [2018-02-02 10:10:41,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648881c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:41, skipping insertion in model container [2018-02-02 10:10:41,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:10:41" (1/1) ... [2018-02-02 10:10:41,467 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:10:41,477 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:10:41,562 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:10:41,574 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:10:41,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:41 WrapperNode [2018-02-02 10:10:41,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:10:41,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:10:41,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:10:41,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:10:41,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:41" (1/1) ... [2018-02-02 10:10:41,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:41" (1/1) ... [2018-02-02 10:10:41,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:41" (1/1) ... [2018-02-02 10:10:41,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:41" (1/1) ... [2018-02-02 10:10:41,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:41" (1/1) ... [2018-02-02 10:10:41,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:41" (1/1) ... [2018-02-02 10:10:41,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:41" (1/1) ... [2018-02-02 10:10:41,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:10:41,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:10:41,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:10:41,603 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:10:41,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:41" (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:10:41,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:10:41,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:10:41,640 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 10:10:41,640 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:10:41,641 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:10:41,641 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:10:41,641 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:10:41,641 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:10:41,641 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:10:41,641 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 10:10:41,641 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:10:41,641 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:10:41,642 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:10:41,783 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:10:41,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:10:41 BoogieIcfgContainer [2018-02-02 10:10:41,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:10:41,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:10:41,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:10:41,787 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:10:41,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:10:41" (1/3) ... [2018-02-02 10:10:41,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ec33d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:10:41, skipping insertion in model container [2018-02-02 10:10:41,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:41" (2/3) ... [2018-02-02 10:10:41,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ec33d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:10:41, skipping insertion in model container [2018-02-02 10:10:41,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:10:41" (3/3) ... [2018-02-02 10:10:41,790 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-02-02 10:10:41,797 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:10:41,802 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-02 10:10:41,837 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:10:41,837 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:10:41,837 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:10:41,837 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:10:41,837 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:10:41,837 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:10:41,837 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:10:41,837 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:10:41,838 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:10:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 10:10:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 10:10:41,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:41,854 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:41,855 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:41,858 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-02 10:10:41,891 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:41,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:41,978 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:10:41,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:41,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:10:41,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:41,981 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:10:41,981 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-02-02 10:10:41,981 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:10:41,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:10:41,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:10:41,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:10:41,991 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 10:10:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:42,047 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-02 10:10:42,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:10:42,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 10:10:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:42,056 INFO L225 Difference]: With dead ends: 63 [2018-02-02 10:10:42,056 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 10:10:42,057 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:10:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 10:10:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-02 10:10:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:10:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-02 10:10:42,131 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-02 10:10:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:42,132 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-02 10:10:42,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:10:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-02 10:10:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:10:42,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:42,133 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:10:42,133 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:42,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-02 10:10:42,134 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:42,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:42,172 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:10:42,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:42,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:10:42,173 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:42,173 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:10:42,173 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= foo_~i~0 0)] [2018-02-02 10:10:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:42,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:10:42,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:10:42,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:10:42,176 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-02 10:10:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:42,203 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-02 10:10:42,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:10:42,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 10:10:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:42,205 INFO L225 Difference]: With dead ends: 60 [2018-02-02 10:10:42,205 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 10:10:42,206 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:10:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 10:10:42,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-02 10:10:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 10:10:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-02 10:10:42,209 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-02 10:10:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:42,209 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-02 10:10:42,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:10:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-02 10:10:42,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:10:42,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:42,210 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:10:42,210 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:42,210 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-02 10:10:42,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:42,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:42,328 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:10:42,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:42,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:10:42,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:42,329 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:10:42,329 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:10:42,329 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:10:42,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:10:42,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:10:42,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:10:42,330 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-02 10:10:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:42,428 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-02 10:10:42,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:10:42,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-02 10:10:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:42,429 INFO L225 Difference]: With dead ends: 54 [2018-02-02 10:10:42,430 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 10:10:42,430 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:10:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 10:10:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-02 10:10:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 10:10:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-02 10:10:42,436 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-02 10:10:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:42,436 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-02 10:10:42,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:10:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-02 10:10:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:10:42,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:42,437 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:10:42,437 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:42,437 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-02 10:10:42,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:42,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:10:42,477 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:10:42,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:42,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:10:42,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:42,478 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:10:42,478 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:10:42,478 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:10:42,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:10:42,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:10:42,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:42,479 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-02 10:10:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:42,515 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-02 10:10:42,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:10:42,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:10:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:42,517 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:10:42,517 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:10:42,517 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:10:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:10:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 10:10:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:10:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 10:10:42,520 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-02 10:10:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:42,520 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 10:10:42,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:10:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 10:10:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:10:42,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:42,521 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:10:42,521 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:42,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-02 10:10:42,522 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:42,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:42,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:42,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-02 10:10:42,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:42,567 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:10:42,568 INFO L182 omatonBuilderFactory]: Interpolants [501#true, 502#false, 503#(= foo_~i~0 0), 504#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))] [2018-02-02 10:10:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:42,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:10:42,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:10:42,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:10:42,568 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-02-02 10:10:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:42,586 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-02-02 10:10:42,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:10:42,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 10:10:42,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:42,587 INFO L225 Difference]: With dead ends: 65 [2018-02-02 10:10:42,587 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 10:10:42,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:10:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 10:10:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-02-02 10:10:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 10:10:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-02-02 10:10:42,590 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 22 [2018-02-02 10:10:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:42,590 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-02-02 10:10:42,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:10:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-02-02 10:10:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:10:42,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:42,591 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:10:42,591 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:42,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-02 10:10:42,591 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:42,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:42,627 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:10:42,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:42,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:10:42,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:42,628 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:10:42,628 INFO L182 omatonBuilderFactory]: Interpolants [626#true, 627#false, 628#(<= 0 main_~i~1), 629#(<= 1 main_~i~1), 630#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-02-02 10:10:42,628 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:10:42,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:10:42,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:10:42,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:42,629 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2018-02-02 10:10:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:42,655 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-02 10:10:42,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:10:42,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:10:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:42,656 INFO L225 Difference]: With dead ends: 66 [2018-02-02 10:10:42,656 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 10:10:42,656 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:10:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 10:10:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-02-02 10:10:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 10:10:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-02 10:10:42,659 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2018-02-02 10:10:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:42,659 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-02 10:10:42,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:10:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-02 10:10:42,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:10:42,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:42,660 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:42,660 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:42,660 INFO L82 PathProgramCache]: Analyzing trace with hash -280350351, now seen corresponding path program 2 times [2018-02-02 10:10:42,660 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:42,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:42,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:42,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:10:42,702 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:42,702 INFO L182 omatonBuilderFactory]: Interpolants [752#(<= |foo_#in~size| 1), 753#(<= foo_~size 1), 754#(<= foo_~size (+ foo_~i~0 1)), 755#(<= foo_~size foo_~i~0), 756#(<= (+ foo_~size 1) foo_~i~0), 749#true, 750#false, 751#(= main_~i~1 0)] [2018-02-02 10:10:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:42,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:10:42,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:10:42,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:10:42,703 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 8 states. [2018-02-02 10:10:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:42,850 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-02-02 10:10:42,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:10:42,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-02 10:10:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:42,851 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:10:42,851 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:10:42,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:10:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:10:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-02-02 10:10:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 10:10:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-02 10:10:42,856 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2018-02-02 10:10:42,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:42,856 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-02 10:10:42,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:10:42,856 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-02 10:10:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:10:42,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:42,857 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:10:42,857 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:42,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-02 10:10:42,858 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:42,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:42,895 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:10:42,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:42,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:10:42,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:42,896 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:10:42,897 INFO L182 omatonBuilderFactory]: Interpolants [917#true, 918#false, 919#(= main_~i~1 0), 920#(<= main_~i~1 1)] [2018-02-02 10:10:42,897 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:10:42,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:10:42,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:10:42,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:10:42,898 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 4 states. [2018-02-02 10:10:42,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:42,928 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-02-02 10:10:42,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:10:42,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-02 10:10:42,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:42,929 INFO L225 Difference]: With dead ends: 98 [2018-02-02 10:10:42,929 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 10:10:42,930 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:10:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 10:10:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2018-02-02 10:10:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:10:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-02 10:10:42,934 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 31 [2018-02-02 10:10:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:42,934 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-02 10:10:42,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:10:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-02 10:10:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:10:42,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:42,934 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:10:42,935 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:42,935 INFO L82 PathProgramCache]: Analyzing trace with hash -193392944, now seen corresponding path program 1 times [2018-02-02 10:10:42,935 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:42,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:10:42,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:42,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:10:42,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:42,988 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:10:42,988 INFO L182 omatonBuilderFactory]: Interpolants [1104#(and (= foo_~i~0 0) (<= (+ |foo_#in~size| 1) foo_~i~0)), 1105#(<= (+ |foo_#in~size| 1) 0), 1100#true, 1101#false, 1102#(<= 0 main_~i~1), 1103#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-02 10:10:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:10:42,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:10:42,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:10:42,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:10:42,989 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-02 10:10:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:43,050 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-02-02 10:10:43,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:10:43,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-02-02 10:10:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:43,051 INFO L225 Difference]: With dead ends: 87 [2018-02-02 10:10:43,051 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 10:10:43,051 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:10:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 10:10:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 10:10:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:10:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-02 10:10:43,055 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 40 [2018-02-02 10:10:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:43,055 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-02 10:10:43,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:10:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-02 10:10:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:10:43,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:43,056 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:43,056 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1033895800, now seen corresponding path program 2 times [2018-02-02 10:10:43,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:43,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:10:43,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:43,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:10:43,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:43,119 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:10:43,119 INFO L182 omatonBuilderFactory]: Interpolants [1280#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 1281#(<= |foo_#in~size| 0), 1276#true, 1277#false, 1278#(<= 0 main_~i~1), 1279#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-02 10:10:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:10:43,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:10:43,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:10:43,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:10:43,120 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-02-02 10:10:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:43,162 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-02 10:10:43,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:10:43,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-02-02 10:10:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:43,163 INFO L225 Difference]: With dead ends: 90 [2018-02-02 10:10:43,163 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 10:10:43,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:10:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 10:10:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-02-02 10:10:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:10:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-02-02 10:10:43,167 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 46 [2018-02-02 10:10:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:43,167 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-02-02 10:10:43,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:10:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-02-02 10:10:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:10:43,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:43,169 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:43,169 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash -821508032, now seen corresponding path program 3 times [2018-02-02 10:10:43,170 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:43,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 10:10:43,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:43,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:10:43,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:43,231 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:10:43,231 INFO L182 omatonBuilderFactory]: Interpolants [1456#false, 1457#(= foo_~i~0 0), 1458#(and (<= 1 foo_~i~0) (<= foo_~i~0 1)), 1459#(and (<= 2 foo_~i~0) (<= foo_~i~0 2)), 1455#true] [2018-02-02 10:10:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 10:10:43,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:10:43,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:10:43,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:43,232 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 5 states. [2018-02-02 10:10:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:43,265 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-02 10:10:43,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:10:43,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-02 10:10:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:43,266 INFO L225 Difference]: With dead ends: 93 [2018-02-02 10:10:43,267 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 10:10:43,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 10:10:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2018-02-02 10:10:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:10:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-02-02 10:10:43,271 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 52 [2018-02-02 10:10:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:43,271 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-02-02 10:10:43,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:10:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-02-02 10:10:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:10:43,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:43,272 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:43,272 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:43,272 INFO L82 PathProgramCache]: Analyzing trace with hash -828115272, now seen corresponding path program 4 times [2018-02-02 10:10:43,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:43,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:10:43,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:43,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:10:43,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:43,379 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:10:43,379 INFO L182 omatonBuilderFactory]: Interpolants [1648#(<= foo_~size foo_~i~0), 1649#(<= (+ foo_~size 1) foo_~i~0), 1640#true, 1641#false, 1642#(= main_~i~1 0), 1643#(<= main_~i~1 1), 1644#(<= |foo_#in~size| 2), 1645#(<= foo_~size 2), 1646#(<= foo_~size (+ foo_~i~0 2)), 1647#(<= foo_~size (+ foo_~i~0 1))] [2018-02-02 10:10:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:10:43,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:10:43,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:10:43,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:10:43,379 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 10 states. [2018-02-02 10:10:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:43,496 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2018-02-02 10:10:43,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:10:43,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-02-02 10:10:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:43,497 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:10:43,497 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:10:43,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:10:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:10:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2018-02-02 10:10:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 10:10:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-02 10:10:43,500 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 58 [2018-02-02 10:10:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:43,500 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-02 10:10:43,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:10:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-02 10:10:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:10:43,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:43,501 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:43,501 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:43,501 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 1 times [2018-02-02 10:10:43,502 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:43,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:10:43,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:43,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:10:43,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:43,580 INFO L182 omatonBuilderFactory]: Interpolants [1904#(<= |foo_#in~size| 31), 1905#(<= main_~i~1 30), 1906#(<= main_~i~1 31), 1899#true, 1900#false, 1901#(<= |foo_#in~size| foo_~size), 1902#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 31)), 1903#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 32))] [2018-02-02 10:10:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:10:43,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:10:43,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:10:43,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:10:43,581 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 8 states. [2018-02-02 10:10:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:43,655 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-02 10:10:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:10:43,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-02-02 10:10:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:43,656 INFO L225 Difference]: With dead ends: 92 [2018-02-02 10:10:43,656 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:10:43,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:10:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:10:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-02 10:10:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 10:10:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-02 10:10:43,664 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 67 [2018-02-02 10:10:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:43,664 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-02 10:10:43,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:10:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-02 10:10:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:10:43,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:43,665 INFO L351 BasicCegarLoop]: trace histogram [10, 8, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:43,665 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:43,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1534196039, now seen corresponding path program 5 times [2018-02-02 10:10:43,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:43,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 10:10:43,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:43,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:10:43,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:43,735 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:10:43,735 INFO L182 omatonBuilderFactory]: Interpolants [2100#true, 2101#false, 2102#(<= 0 main_~i~1), 2103#(<= 1 main_~i~1), 2104#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 2105#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 2106#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 2107#(<= |foo_#in~size| 1)] [2018-02-02 10:10:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 10:10:43,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:10:43,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:10:43,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:10:43,736 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 8 states. [2018-02-02 10:10:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:43,783 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-02-02 10:10:43,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:10:43,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-02-02 10:10:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:43,784 INFO L225 Difference]: With dead ends: 101 [2018-02-02 10:10:43,785 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:10:43,785 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:10:43,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:10:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-02-02 10:10:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 10:10:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-02-02 10:10:43,788 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 82 [2018-02-02 10:10:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:43,788 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-02-02 10:10:43,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:10:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-02-02 10:10:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:10:43,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:43,789 INFO L351 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:43,789 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:43,789 INFO L82 PathProgramCache]: Analyzing trace with hash -85555777, now seen corresponding path program 6 times [2018-02-02 10:10:43,790 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:43,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-02 10:10:43,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:43,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:10:43,875 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:43,876 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:10:43,876 INFO L182 omatonBuilderFactory]: Interpolants [2304#false, 2305#(= foo_~i~0 0), 2306#(<= foo_~i~0 1), 2307#(<= foo_~i~0 2), 2308#(and (<= 0 foo_~i~0) (<= foo_~i~0 2)), 2309#(and (<= 1 foo_~i~0) (<= foo_~i~0 3)), 2303#true] [2018-02-02 10:10:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-02 10:10:43,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:10:43,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:10:43,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:10:43,877 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 7 states. [2018-02-02 10:10:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:43,931 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-02-02 10:10:43,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:10:43,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2018-02-02 10:10:43,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:43,932 INFO L225 Difference]: With dead ends: 104 [2018-02-02 10:10:43,932 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 10:10:43,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:10:43,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 10:10:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-02-02 10:10:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 10:10:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-02-02 10:10:43,936 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 88 [2018-02-02 10:10:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:43,936 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-02-02 10:10:43,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:10:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-02-02 10:10:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:10:43,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:43,937 INFO L351 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:43,937 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash 414669047, now seen corresponding path program 7 times [2018-02-02 10:10:43,938 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:43,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 194 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-02 10:10:44,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:44,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:10:44,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:44,039 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:10:44,040 INFO L182 omatonBuilderFactory]: Interpolants [2516#true, 2517#false, 2518#(= main_~i~1 0), 2519#(<= main_~i~1 1), 2520#(<= main_~i~1 2), 2521#(<= |foo_#in~size| 3), 2522#(<= foo_~size 3), 2523#(<= foo_~size (+ foo_~i~0 3)), 2524#(<= foo_~size (+ foo_~i~0 2)), 2525#(<= foo_~size (+ foo_~i~0 1)), 2526#(<= foo_~size foo_~i~0), 2527#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-02 10:10:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 194 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-02 10:10:44,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:10:44,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:10:44,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:10:44,041 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 12 states. [2018-02-02 10:10:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:44,174 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-02-02 10:10:44,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:10:44,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-02-02 10:10:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:44,175 INFO L225 Difference]: With dead ends: 136 [2018-02-02 10:10:44,175 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 10:10:44,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:10:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 10:10:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-02-02 10:10:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 10:10:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2018-02-02 10:10:44,178 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 94 [2018-02-02 10:10:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:44,178 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2018-02-02 10:10:44,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:10:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2018-02-02 10:10:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-02 10:10:44,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:44,179 INFO L351 BasicCegarLoop]: trace histogram [16, 13, 12, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:44,183 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash 347418750, now seen corresponding path program 8 times [2018-02-02 10:10:44,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:44,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:10:44,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:44,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:10:44,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:44,267 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:10:44,267 INFO L182 omatonBuilderFactory]: Interpolants [2816#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 2817#(<= |foo_#in~size| 2), 2808#true, 2809#false, 2810#(<= 0 main_~i~1), 2811#(<= 1 main_~i~1), 2812#(<= 2 main_~i~1), 2813#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 2814#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 2815#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-02 10:10:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:10:44,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:10:44,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:10:44,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:10:44,268 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 10 states. [2018-02-02 10:10:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:44,338 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2018-02-02 10:10:44,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:10:44,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-02-02 10:10:44,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:44,339 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:10:44,339 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 10:10:44,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:10:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 10:10:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-02-02 10:10:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 10:10:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-02-02 10:10:44,342 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 124 [2018-02-02 10:10:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:44,342 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-02-02 10:10:44,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:10:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-02-02 10:10:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-02-02 10:10:44,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:44,343 INFO L351 BasicCegarLoop]: trace histogram [17, 14, 13, 13, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:44,343 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:44,343 INFO L82 PathProgramCache]: Analyzing trace with hash 714000310, now seen corresponding path program 9 times [2018-02-02 10:10:44,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:44,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-02 10:10:44,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:44,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:10:44,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:44,435 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:10:44,435 INFO L182 omatonBuilderFactory]: Interpolants [3104#(and (<= 3 foo_~i~0) (<= foo_~i~0 3)), 3105#(and (<= foo_~i~0 4) (<= 4 foo_~i~0)), 3099#true, 3100#false, 3101#(= foo_~i~0 0), 3102#(and (<= 1 foo_~i~0) (<= foo_~i~0 1)), 3103#(and (<= 2 foo_~i~0) (<= foo_~i~0 2))] [2018-02-02 10:10:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-02 10:10:44,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:10:44,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:10:44,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:10:44,436 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 7 states. [2018-02-02 10:10:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:44,509 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-02-02 10:10:44,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:10:44,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-02-02 10:10:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:44,510 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:10:44,510 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:10:44,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:10:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:10:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2018-02-02 10:10:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:10:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-02-02 10:10:44,514 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 130 [2018-02-02 10:10:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:44,515 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-02-02 10:10:44,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:10:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-02-02 10:10:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-02 10:10:44,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:44,517 INFO L351 BasicCegarLoop]: trace histogram [18, 15, 14, 14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:44,517 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:44,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1770915246, now seen corresponding path program 10 times [2018-02-02 10:10:44,518 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:44,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 397 proven. 44 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-02 10:10:44,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:44,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:10:44,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:44,682 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:10:44,682 INFO L182 omatonBuilderFactory]: Interpolants [3392#true, 3393#false, 3394#(= main_~i~1 0), 3395#(<= main_~i~1 1), 3396#(<= main_~i~1 2), 3397#(<= main_~i~1 3), 3398#(<= |foo_#in~size| 4), 3399#(<= foo_~size 4), 3400#(<= foo_~size (+ foo_~i~0 4)), 3401#(<= foo_~size (+ foo_~i~0 3)), 3402#(<= foo_~size (+ foo_~i~0 2)), 3403#(<= foo_~size (+ foo_~i~0 1)), 3404#(<= foo_~size foo_~i~0), 3405#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-02 10:10:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 397 proven. 44 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-02 10:10:44,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:10:44,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:10:44,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:10:44,683 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 14 states. [2018-02-02 10:10:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:44,872 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-02-02 10:10:44,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:10:44,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2018-02-02 10:10:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:44,873 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:10:44,873 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 10:10:44,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:10:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 10:10:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-02-02 10:10:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:10:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 185 transitions. [2018-02-02 10:10:44,877 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 185 transitions. Word has length 136 [2018-02-02 10:10:44,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:44,877 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 185 transitions. [2018-02-02 10:10:44,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:10:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2018-02-02 10:10:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 10:10:44,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:44,879 INFO L351 BasicCegarLoop]: trace histogram [23, 19, 18, 18, 18, 18, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:44,879 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:44,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1745720749, now seen corresponding path program 11 times [2018-02-02 10:10:44,880 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:44,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-02-02 10:10:45,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:45,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:10:45,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:45,057 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:10:45,058 INFO L182 omatonBuilderFactory]: Interpolants [3792#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 3793#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 3794#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 3795#(<= |foo_#in~size| 3), 3784#true, 3785#false, 3786#(<= 0 main_~i~1), 3787#(<= 1 main_~i~1), 3788#(<= 2 main_~i~1), 3789#(<= 3 main_~i~1), 3790#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 3791#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-02 10:10:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-02-02 10:10:45,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:10:45,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:10:45,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:10:45,059 INFO L87 Difference]: Start difference. First operand 182 states and 185 transitions. Second operand 12 states. [2018-02-02 10:10:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:45,190 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2018-02-02 10:10:45,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:10:45,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 172 [2018-02-02 10:10:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:45,191 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:10:45,191 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 10:10:45,191 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:10:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 10:10:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-02-02 10:10:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:10:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-02-02 10:10:45,195 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 172 [2018-02-02 10:10:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:45,196 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-02-02 10:10:45,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:10:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-02-02 10:10:45,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-02 10:10:45,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:45,197 INFO L351 BasicCegarLoop]: trace histogram [24, 20, 19, 19, 19, 19, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:45,197 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:45,197 INFO L82 PathProgramCache]: Analyzing trace with hash 655613349, now seen corresponding path program 12 times [2018-02-02 10:10:45,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:45,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-02-02 10:10:45,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:45,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:10:45,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:45,309 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:10:45,309 INFO L182 omatonBuilderFactory]: Interpolants [4176#false, 4177#(= foo_~i~0 0), 4178#(<= foo_~i~0 1), 4179#(<= foo_~i~0 2), 4180#(<= foo_~i~0 3), 4181#(<= foo_~i~0 4), 4182#(and (<= foo_~i~0 4) (<= 0 foo_~i~0)), 4183#(and (<= 1 foo_~i~0) (<= foo_~i~0 5)), 4175#true] [2018-02-02 10:10:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-02-02 10:10:45,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:10:45,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:10:45,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:10:45,310 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 9 states. [2018-02-02 10:10:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:45,406 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-02-02 10:10:45,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:10:45,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2018-02-02 10:10:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:45,407 INFO L225 Difference]: With dead ends: 194 [2018-02-02 10:10:45,407 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 10:10:45,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:10:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 10:10:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2018-02-02 10:10:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 10:10:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-02-02 10:10:45,411 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 178 [2018-02-02 10:10:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:45,411 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-02-02 10:10:45,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:10:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-02-02 10:10:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-02 10:10:45,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:45,412 INFO L351 BasicCegarLoop]: trace histogram [25, 21, 20, 20, 20, 20, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:45,413 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1948298333, now seen corresponding path program 13 times [2018-02-02 10:10:45,413 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:45,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 697 proven. 69 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-02-02 10:10:45,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:45,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:10:45,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:45,630 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:10:45,630 INFO L182 omatonBuilderFactory]: Interpolants [4576#(= main_~i~1 0), 4577#(<= main_~i~1 1), 4578#(<= main_~i~1 2), 4579#(<= main_~i~1 3), 4580#(<= main_~i~1 4), 4581#(<= |foo_#in~size| 5), 4582#(<= foo_~size 5), 4583#(<= foo_~size (+ foo_~i~0 5)), 4584#(<= foo_~size (+ foo_~i~0 4)), 4585#(<= foo_~size (+ foo_~i~0 3)), 4586#(<= foo_~size (+ foo_~i~0 2)), 4587#(<= foo_~size (+ foo_~i~0 1)), 4588#(<= foo_~size foo_~i~0), 4589#(<= (+ foo_~size 1) foo_~i~0), 4574#true, 4575#false] [2018-02-02 10:10:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 697 proven. 69 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-02-02 10:10:45,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:10:45,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:10:45,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:10:45,631 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 16 states. [2018-02-02 10:10:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:45,856 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2018-02-02 10:10:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:10:45,857 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 184 [2018-02-02 10:10:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:45,858 INFO L225 Difference]: With dead ends: 238 [2018-02-02 10:10:45,858 INFO L226 Difference]: Without dead ends: 238 [2018-02-02 10:10:45,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:10:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-02 10:10:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-02-02 10:10:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-02 10:10:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 239 transitions. [2018-02-02 10:10:45,864 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 239 transitions. Word has length 184 [2018-02-02 10:10:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:45,864 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 239 transitions. [2018-02-02 10:10:45,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:10:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 239 transitions. [2018-02-02 10:10:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-02-02 10:10:45,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:45,865 INFO L351 BasicCegarLoop]: trace histogram [31, 26, 25, 25, 25, 25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:45,865 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:45,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1371544148, now seen corresponding path program 14 times [2018-02-02 10:10:45,866 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:45,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1404 proven. 70 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-02-02 10:10:46,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:46,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:10:46,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:46,084 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:10:46,084 INFO L182 omatonBuilderFactory]: Interpolants [5088#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 5089#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 5090#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 5091#(<= |foo_#in~size| 4), 5078#true, 5079#false, 5080#(<= 0 main_~i~1), 5081#(<= 1 main_~i~1), 5082#(<= 2 main_~i~1), 5083#(<= 3 main_~i~1), 5084#(<= 4 main_~i~1), 5085#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 5086#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 5087#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-02 10:10:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1404 proven. 70 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-02-02 10:10:46,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:10:46,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:10:46,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:10:46,085 INFO L87 Difference]: Start difference. First operand 236 states and 239 transitions. Second operand 14 states. [2018-02-02 10:10:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:46,237 INFO L93 Difference]: Finished difference Result 245 states and 246 transitions. [2018-02-02 10:10:46,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:10:46,237 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 226 [2018-02-02 10:10:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:46,238 INFO L225 Difference]: With dead ends: 245 [2018-02-02 10:10:46,238 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 10:10:46,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:10:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 10:10:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-02-02 10:10:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-02 10:10:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 237 transitions. [2018-02-02 10:10:46,242 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 237 transitions. Word has length 226 [2018-02-02 10:10:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:46,243 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 237 transitions. [2018-02-02 10:10:46,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:10:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 237 transitions. [2018-02-02 10:10:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-02 10:10:46,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:46,244 INFO L351 BasicCegarLoop]: trace histogram [32, 27, 26, 26, 26, 26, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:46,244 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1000315148, now seen corresponding path program 15 times [2018-02-02 10:10:46,245 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:46,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:10:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-02 10:10:46,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:46,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:10:46,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:46,399 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:10:46,400 INFO L182 omatonBuilderFactory]: Interpolants [5584#(<= foo_~i~0 1), 5585#(<= foo_~i~0 2), 5586#(<= foo_~i~0 3), 5587#(<= foo_~i~0 4), 5588#(and (<= foo_~i~0 4) (<= 0 foo_~i~0)), 5589#(and (<= 1 foo_~i~0) (<= foo_~i~0 5)), 5590#(and (<= foo_~i~0 6) (<= 2 foo_~i~0)), 5581#true, 5582#false, 5583#(= foo_~i~0 0)] [2018-02-02 10:10:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-02 10:10:46,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:10:46,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:10:46,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:10:46,401 INFO L87 Difference]: Start difference. First operand 236 states and 237 transitions. Second operand 10 states. [2018-02-02 10:10:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:46,503 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2018-02-02 10:10:46,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:10:46,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 232 [2018-02-02 10:10:46,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:46,505 INFO L225 Difference]: With dead ends: 248 [2018-02-02 10:10:46,505 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 10:10:46,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:10:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 10:10:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2018-02-02 10:10:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 10:10:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 244 transitions. [2018-02-02 10:10:46,511 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 244 transitions. Word has length 232 [2018-02-02 10:10:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:46,512 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 244 transitions. [2018-02-02 10:10:46,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:10:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 244 transitions. [2018-02-02 10:10:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-02-02 10:10:46,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:46,513 INFO L351 BasicCegarLoop]: trace histogram [33, 28, 27, 27, 27, 27, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:46,513 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash 710278788, now seen corresponding path program 16 times [2018-02-02 10:10:46,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:46,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1112 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-02-02 10:10:46,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:46,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:10:46,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:46,742 INFO L182 omatonBuilderFactory]: Interpolants [6091#true, 6092#false, 6093#(= main_~i~1 0), 6094#(<= main_~i~1 1), 6095#(<= main_~i~1 2), 6096#(<= main_~i~1 3), 6097#(<= main_~i~1 4), 6098#(<= main_~i~1 5), 6099#(<= |foo_#in~size| 6), 6100#(<= foo_~size 6), 6101#(<= foo_~size (+ foo_~i~0 6)), 6102#(<= foo_~size (+ foo_~i~0 5)), 6103#(<= foo_~size (+ foo_~i~0 4)), 6104#(<= foo_~size (+ foo_~i~0 3)), 6105#(<= foo_~size (+ foo_~i~0 2)), 6106#(<= foo_~size (+ foo_~i~0 1)), 6107#(<= foo_~size foo_~i~0), 6108#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-02 10:10:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1112 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-02-02 10:10:46,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:10:46,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:10:46,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:10:46,743 INFO L87 Difference]: Start difference. First operand 242 states and 244 transitions. Second operand 18 states. [2018-02-02 10:10:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:46,959 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2018-02-02 10:10:46,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:10:46,959 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 238 [2018-02-02 10:10:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:46,960 INFO L225 Difference]: With dead ends: 298 [2018-02-02 10:10:46,960 INFO L226 Difference]: Without dead ends: 298 [2018-02-02 10:10:46,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:10:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-02 10:10:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2018-02-02 10:10:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 10:10:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2018-02-02 10:10:46,963 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 238 [2018-02-02 10:10:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:46,964 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2018-02-02 10:10:46,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:10:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2018-02-02 10:10:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-02-02 10:10:46,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:46,965 INFO L351 BasicCegarLoop]: trace histogram [40, 34, 33, 33, 33, 33, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:46,965 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:46,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1500368397, now seen corresponding path program 17 times [2018-02-02 10:10:46,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:46,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 2231 proven. 102 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-02-02 10:10:47,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:47,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:10:47,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:47,251 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:10:47,251 INFO L182 omatonBuilderFactory]: Interpolants [6720#false, 6721#(<= 0 main_~i~1), 6722#(<= 1 main_~i~1), 6723#(<= 2 main_~i~1), 6724#(<= 3 main_~i~1), 6725#(<= 4 main_~i~1), 6726#(<= 5 main_~i~1), 6727#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 6728#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 6729#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 6730#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 6731#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 6732#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 6733#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 6734#(<= |foo_#in~size| 5), 6719#true] [2018-02-02 10:10:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 2231 proven. 102 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-02-02 10:10:47,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:10:47,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:10:47,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:10:47,253 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 16 states. [2018-02-02 10:10:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:47,508 INFO L93 Difference]: Finished difference Result 305 states and 306 transitions. [2018-02-02 10:10:47,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:10:47,511 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 286 [2018-02-02 10:10:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:47,512 INFO L225 Difference]: With dead ends: 305 [2018-02-02 10:10:47,512 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 10:10:47,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:10:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 10:10:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-02-02 10:10:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 10:10:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2018-02-02 10:10:47,518 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 286 [2018-02-02 10:10:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:47,518 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2018-02-02 10:10:47,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:10:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2018-02-02 10:10:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-02 10:10:47,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:47,521 INFO L351 BasicCegarLoop]: trace histogram [41, 35, 34, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:47,521 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:47,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1441975659, now seen corresponding path program 18 times [2018-02-02 10:10:47,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:47,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-02-02 10:10:47,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:47,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:10:47,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:47,741 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:10:47,741 INFO L182 omatonBuilderFactory]: Interpolants [7346#true, 7347#false, 7348#(= foo_~i~0 0), 7349#(<= foo_~i~0 1), 7350#(<= foo_~i~0 2), 7351#(<= foo_~i~0 3), 7352#(<= foo_~i~0 4), 7353#(<= foo_~i~0 5), 7354#(<= foo_~i~0 6), 7355#(and (<= foo_~i~0 6) (<= 0 foo_~i~0)), 7356#(and (<= foo_~i~0 7) (<= 1 foo_~i~0))] [2018-02-02 10:10:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-02-02 10:10:47,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:10:47,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:10:47,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:10:47,744 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand 11 states. [2018-02-02 10:10:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:47,885 INFO L93 Difference]: Finished difference Result 308 states and 310 transitions. [2018-02-02 10:10:47,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:10:47,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 292 [2018-02-02 10:10:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:47,887 INFO L225 Difference]: With dead ends: 308 [2018-02-02 10:10:47,887 INFO L226 Difference]: Without dead ends: 308 [2018-02-02 10:10:47,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:10:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-02 10:10:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2018-02-02 10:10:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-02 10:10:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 304 transitions. [2018-02-02 10:10:47,893 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 304 transitions. Word has length 292 [2018-02-02 10:10:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:47,894 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 304 transitions. [2018-02-02 10:10:47,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:10:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 304 transitions. [2018-02-02 10:10:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-02-02 10:10:47,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:47,896 INFO L351 BasicCegarLoop]: trace histogram [42, 36, 35, 35, 35, 35, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:47,896 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1608658851, now seen corresponding path program 19 times [2018-02-02 10:10:47,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:47,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4317 backedges. 1660 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-02 10:10:48,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:48,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:10:48,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:48,248 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:10:48,248 INFO L182 omatonBuilderFactory]: Interpolants [7979#true, 7980#false, 7981#(= main_~i~1 0), 7982#(<= main_~i~1 1), 7983#(<= main_~i~1 2), 7984#(<= main_~i~1 3), 7985#(<= main_~i~1 4), 7986#(<= main_~i~1 5), 7987#(<= main_~i~1 6), 7988#(<= |foo_#in~size| 7), 7989#(<= foo_~size 7), 7990#(<= foo_~size (+ foo_~i~0 7)), 7991#(<= foo_~size (+ foo_~i~0 6)), 7992#(<= foo_~size (+ foo_~i~0 5)), 7993#(<= foo_~size (+ foo_~i~0 4)), 7994#(<= foo_~size (+ foo_~i~0 3)), 7995#(<= foo_~size (+ foo_~i~0 2)), 7996#(<= foo_~size (+ foo_~i~0 1)), 7997#(<= foo_~size foo_~i~0), 7998#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-02 10:10:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4317 backedges. 1660 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-02 10:10:48,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:10:48,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:10:48,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:10:48,250 INFO L87 Difference]: Start difference. First operand 302 states and 304 transitions. Second operand 20 states. [2018-02-02 10:10:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:48,591 INFO L93 Difference]: Finished difference Result 364 states and 367 transitions. [2018-02-02 10:10:48,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:10:48,591 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 298 [2018-02-02 10:10:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:48,592 INFO L225 Difference]: With dead ends: 364 [2018-02-02 10:10:48,592 INFO L226 Difference]: Without dead ends: 364 [2018-02-02 10:10:48,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:10:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-02 10:10:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2018-02-02 10:10:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-02 10:10:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 365 transitions. [2018-02-02 10:10:48,597 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 365 transitions. Word has length 298 [2018-02-02 10:10:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:48,597 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 365 transitions. [2018-02-02 10:10:48,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:10:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 365 transitions. [2018-02-02 10:10:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-02-02 10:10:48,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:48,598 INFO L351 BasicCegarLoop]: trace histogram [50, 43, 42, 42, 42, 42, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:48,599 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:48,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1060515318, now seen corresponding path program 20 times [2018-02-02 10:10:48,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:48,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-02-02 10:10:48,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:48,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:10:48,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:48,958 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:10:48,958 INFO L182 omatonBuilderFactory]: Interpolants [8743#true, 8744#false, 8745#(<= 0 main_~i~1), 8746#(<= 1 main_~i~1), 8747#(<= 2 main_~i~1), 8748#(<= 3 main_~i~1), 8749#(<= 4 main_~i~1), 8750#(<= 5 main_~i~1), 8751#(<= 6 main_~i~1), 8752#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 8753#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 8754#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 8755#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 8756#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 8757#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 8758#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 8759#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 8760#(<= |foo_#in~size| 6)] [2018-02-02 10:10:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-02-02 10:10:48,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:10:48,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:10:48,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:10:48,960 INFO L87 Difference]: Start difference. First operand 362 states and 365 transitions. Second operand 18 states. [2018-02-02 10:10:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:49,220 INFO L93 Difference]: Finished difference Result 371 states and 372 transitions. [2018-02-02 10:10:49,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:10:49,220 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 352 [2018-02-02 10:10:49,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:49,221 INFO L225 Difference]: With dead ends: 371 [2018-02-02 10:10:49,222 INFO L226 Difference]: Without dead ends: 365 [2018-02-02 10:10:49,222 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:10:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-02 10:10:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2018-02-02 10:10:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-02 10:10:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 363 transitions. [2018-02-02 10:10:49,228 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 363 transitions. Word has length 352 [2018-02-02 10:10:49,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:49,228 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 363 transitions. [2018-02-02 10:10:49,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:10:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 363 transitions. [2018-02-02 10:10:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-02-02 10:10:49,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:49,230 INFO L351 BasicCegarLoop]: trace histogram [51, 44, 43, 43, 43, 43, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:49,230 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:49,230 INFO L82 PathProgramCache]: Analyzing trace with hash -211464126, now seen corresponding path program 21 times [2018-02-02 10:10:49,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:49,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-02-02 10:10:49,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:49,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:10:49,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:49,509 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:10:49,509 INFO L182 omatonBuilderFactory]: Interpolants [9506#true, 9507#false, 9508#(= foo_~i~0 0), 9509#(and (<= 1 foo_~i~0) (<= foo_~i~0 1)), 9510#(and (<= 2 foo_~i~0) (<= foo_~i~0 2)), 9511#(and (<= 3 foo_~i~0) (<= foo_~i~0 3)), 9512#(and (<= foo_~i~0 4) (<= 4 foo_~i~0)), 9513#(and (<= 5 foo_~i~0) (<= foo_~i~0 5)), 9514#(and (<= foo_~i~0 6) (<= 6 foo_~i~0)), 9515#(and (<= foo_~i~0 7) (<= 7 foo_~i~0)), 9516#(and (<= 8 foo_~i~0) (<= foo_~i~0 8))] [2018-02-02 10:10:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-02-02 10:10:49,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:10:49,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:10:49,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:10:49,510 INFO L87 Difference]: Start difference. First operand 362 states and 363 transitions. Second operand 11 states. [2018-02-02 10:10:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:49,661 INFO L93 Difference]: Finished difference Result 374 states and 376 transitions. [2018-02-02 10:10:49,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:10:49,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 358 [2018-02-02 10:10:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:49,663 INFO L225 Difference]: With dead ends: 374 [2018-02-02 10:10:49,663 INFO L226 Difference]: Without dead ends: 374 [2018-02-02 10:10:49,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:10:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-02-02 10:10:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2018-02-02 10:10:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-02 10:10:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 370 transitions. [2018-02-02 10:10:49,669 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 370 transitions. Word has length 358 [2018-02-02 10:10:49,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:49,670 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 370 transitions. [2018-02-02 10:10:49,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:10:49,670 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 370 transitions. [2018-02-02 10:10:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-02-02 10:10:49,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:49,672 INFO L351 BasicCegarLoop]: trace histogram [52, 45, 44, 44, 44, 44, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:49,672 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:49,672 INFO L82 PathProgramCache]: Analyzing trace with hash -146344646, now seen corresponding path program 22 times [2018-02-02 10:10:49,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:49,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 2359 proven. 180 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-02-02 10:10:50,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:50,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:10:50,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:50,154 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:10:50,154 INFO L182 omatonBuilderFactory]: Interpolants [10272#(<= foo_~size (+ foo_~i~0 7)), 10273#(<= foo_~size (+ foo_~i~0 6)), 10274#(<= foo_~size (+ foo_~i~0 5)), 10275#(<= foo_~size (+ foo_~i~0 4)), 10276#(<= foo_~size (+ foo_~i~0 3)), 10277#(<= foo_~size (+ foo_~i~0 2)), 10278#(<= foo_~size (+ foo_~i~0 1)), 10279#(<= foo_~size foo_~i~0), 10280#(<= (+ foo_~size 1) foo_~i~0), 10259#true, 10260#false, 10261#(= main_~i~1 0), 10262#(<= main_~i~1 1), 10263#(<= main_~i~1 2), 10264#(<= main_~i~1 3), 10265#(<= main_~i~1 4), 10266#(<= main_~i~1 5), 10267#(<= main_~i~1 6), 10268#(<= main_~i~1 7), 10269#(<= |foo_#in~size| 8), 10270#(<= foo_~size 8), 10271#(<= foo_~size (+ foo_~i~0 8))] [2018-02-02 10:10:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 2359 proven. 180 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-02-02 10:10:50,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:10:50,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:10:50,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:10:50,155 INFO L87 Difference]: Start difference. First operand 368 states and 370 transitions. Second operand 22 states. [2018-02-02 10:10:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:50,470 INFO L93 Difference]: Finished difference Result 436 states and 439 transitions. [2018-02-02 10:10:50,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:10:50,470 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 364 [2018-02-02 10:10:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:50,471 INFO L225 Difference]: With dead ends: 436 [2018-02-02 10:10:50,471 INFO L226 Difference]: Without dead ends: 436 [2018-02-02 10:10:50,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:10:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-02 10:10:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-02-02 10:10:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 10:10:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 437 transitions. [2018-02-02 10:10:50,475 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 437 transitions. Word has length 364 [2018-02-02 10:10:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:50,475 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 437 transitions. [2018-02-02 10:10:50,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:10:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 437 transitions. [2018-02-02 10:10:50,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-02-02 10:10:50,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:50,477 INFO L351 BasicCegarLoop]: trace histogram [61, 53, 52, 52, 52, 52, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:50,477 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:50,477 INFO L82 PathProgramCache]: Analyzing trace with hash -894569959, now seen corresponding path program 23 times [2018-02-02 10:10:50,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:50,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9336 backedges. 4716 proven. 184 refuted. 0 times theorem prover too weak. 4436 trivial. 0 not checked. [2018-02-02 10:10:50,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:50,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:10:50,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:50,872 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:10:50,873 INFO L182 omatonBuilderFactory]: Interpolants [11171#true, 11172#false, 11173#(<= 0 main_~i~1), 11174#(<= 1 main_~i~1), 11175#(<= 2 main_~i~1), 11176#(<= 3 main_~i~1), 11177#(<= 4 main_~i~1), 11178#(<= 5 main_~i~1), 11179#(<= 6 main_~i~1), 11180#(<= 7 main_~i~1), 11181#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 11182#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 11183#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 11184#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 11185#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 11186#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 11187#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 11188#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 11189#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 11190#(<= |foo_#in~size| 7)] [2018-02-02 10:10:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9336 backedges. 4716 proven. 184 refuted. 0 times theorem prover too weak. 4436 trivial. 0 not checked. [2018-02-02 10:10:50,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:10:50,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:10:50,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:10:50,874 INFO L87 Difference]: Start difference. First operand 434 states and 437 transitions. Second operand 20 states. [2018-02-02 10:10:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:51,162 INFO L93 Difference]: Finished difference Result 443 states and 444 transitions. [2018-02-02 10:10:51,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:10:51,162 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 424 [2018-02-02 10:10:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:51,164 INFO L225 Difference]: With dead ends: 443 [2018-02-02 10:10:51,164 INFO L226 Difference]: Without dead ends: 437 [2018-02-02 10:10:51,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:10:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-02 10:10:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 434. [2018-02-02 10:10:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 10:10:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 435 transitions. [2018-02-02 10:10:51,171 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 435 transitions. Word has length 424 [2018-02-02 10:10:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:51,171 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 435 transitions. [2018-02-02 10:10:51,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:10:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 435 transitions. [2018-02-02 10:10:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-02-02 10:10:51,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:51,174 INFO L351 BasicCegarLoop]: trace histogram [62, 54, 53, 53, 53, 53, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:51,174 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:51,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1459193583, now seen corresponding path program 24 times [2018-02-02 10:10:51,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:51,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-02 10:10:51,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:51,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:10:51,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:51,547 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:10:51,547 INFO L182 omatonBuilderFactory]: Interpolants [12082#true, 12083#false, 12084#(= foo_~i~0 0), 12085#(<= foo_~i~0 1), 12086#(<= foo_~i~0 2), 12087#(<= foo_~i~0 3), 12088#(<= foo_~i~0 4), 12089#(<= foo_~i~0 5), 12090#(<= foo_~i~0 6), 12091#(<= foo_~i~0 7), 12092#(<= foo_~i~0 8), 12093#(and (<= 0 foo_~i~0) (<= foo_~i~0 8)), 12094#(and (<= 1 foo_~i~0) (<= foo_~i~0 9))] [2018-02-02 10:10:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-02 10:10:51,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:10:51,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:10:51,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:10:51,549 INFO L87 Difference]: Start difference. First operand 434 states and 435 transitions. Second operand 13 states. [2018-02-02 10:10:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:51,673 INFO L93 Difference]: Finished difference Result 446 states and 448 transitions. [2018-02-02 10:10:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:10:51,673 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 430 [2018-02-02 10:10:51,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:51,675 INFO L225 Difference]: With dead ends: 446 [2018-02-02 10:10:51,675 INFO L226 Difference]: Without dead ends: 446 [2018-02-02 10:10:51,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:10:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-02-02 10:10:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2018-02-02 10:10:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-02 10:10:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 442 transitions. [2018-02-02 10:10:51,681 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 442 transitions. Word has length 430 [2018-02-02 10:10:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:51,682 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 442 transitions. [2018-02-02 10:10:51,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:10:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 442 transitions. [2018-02-02 10:10:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-02-02 10:10:51,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:51,684 INFO L351 BasicCegarLoop]: trace histogram [63, 55, 54, 54, 54, 54, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:51,685 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:51,685 INFO L82 PathProgramCache]: Analyzing trace with hash -275511607, now seen corresponding path program 25 times [2018-02-02 10:10:51,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:51,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 3227 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-02-02 10:10:52,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:52,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:10:52,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:52,128 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:10:52,128 INFO L182 omatonBuilderFactory]: Interpolants [12997#true, 12998#false, 12999#(= main_~i~1 0), 13000#(<= main_~i~1 1), 13001#(<= main_~i~1 2), 13002#(<= main_~i~1 3), 13003#(<= main_~i~1 4), 13004#(<= main_~i~1 5), 13005#(<= main_~i~1 6), 13006#(<= main_~i~1 7), 13007#(<= main_~i~1 8), 13008#(<= |foo_#in~size| 9), 13009#(<= foo_~size 9), 13010#(<= foo_~size (+ foo_~i~0 9)), 13011#(<= foo_~size (+ foo_~i~0 8)), 13012#(<= foo_~size (+ foo_~i~0 7)), 13013#(<= foo_~size (+ foo_~i~0 6)), 13014#(<= foo_~size (+ foo_~i~0 5)), 13015#(<= foo_~size (+ foo_~i~0 4)), 13016#(<= foo_~size (+ foo_~i~0 3)), 13017#(<= foo_~size (+ foo_~i~0 2)), 13018#(<= foo_~size (+ foo_~i~0 1)), 13019#(<= foo_~size foo_~i~0), 13020#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-02 10:10:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 3227 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-02-02 10:10:52,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:10:52,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:10:52,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:10:52,130 INFO L87 Difference]: Start difference. First operand 440 states and 442 transitions. Second operand 24 states. [2018-02-02 10:10:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:52,474 INFO L93 Difference]: Finished difference Result 514 states and 517 transitions. [2018-02-02 10:10:52,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:10:52,474 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 436 [2018-02-02 10:10:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:52,476 INFO L225 Difference]: With dead ends: 514 [2018-02-02 10:10:52,476 INFO L226 Difference]: Without dead ends: 514 [2018-02-02 10:10:52,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:10:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-02-02 10:10:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2018-02-02 10:10:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-02-02 10:10:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 515 transitions. [2018-02-02 10:10:52,484 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 515 transitions. Word has length 436 [2018-02-02 10:10:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:52,484 INFO L432 AbstractCegarLoop]: Abstraction has 512 states and 515 transitions. [2018-02-02 10:10:52,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:10:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 515 transitions. [2018-02-02 10:10:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-02-02 10:10:52,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:52,488 INFO L351 BasicCegarLoop]: trace histogram [73, 64, 63, 63, 63, 63, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:52,488 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:52,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1015516064, now seen corresponding path program 26 times [2018-02-02 10:10:52,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:52,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-02-02 10:10:53,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:53,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:10:53,035 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:53,035 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:10:53,035 INFO L182 omatonBuilderFactory]: Interpolants [14080#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 14081#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 14082#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 14083#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 14084#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 14085#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 14086#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 14087#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 14088#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 14089#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 14090#(<= |foo_#in~size| 8), 14069#true, 14070#false, 14071#(<= 0 main_~i~1), 14072#(<= 1 main_~i~1), 14073#(<= 2 main_~i~1), 14074#(<= 3 main_~i~1), 14075#(<= 4 main_~i~1), 14076#(<= 5 main_~i~1), 14077#(<= 6 main_~i~1), 14078#(<= 7 main_~i~1), 14079#(<= 8 main_~i~1)] [2018-02-02 10:10:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-02-02 10:10:53,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:10:53,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:10:53,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:10:53,036 INFO L87 Difference]: Start difference. First operand 512 states and 515 transitions. Second operand 22 states. [2018-02-02 10:10:53,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:53,332 INFO L93 Difference]: Finished difference Result 521 states and 522 transitions. [2018-02-02 10:10:53,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:10:53,333 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 502 [2018-02-02 10:10:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:53,335 INFO L225 Difference]: With dead ends: 521 [2018-02-02 10:10:53,335 INFO L226 Difference]: Without dead ends: 515 [2018-02-02 10:10:53,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:10:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-02-02 10:10:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 512. [2018-02-02 10:10:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-02-02 10:10:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 513 transitions. [2018-02-02 10:10:53,343 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 513 transitions. Word has length 502 [2018-02-02 10:10:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:53,343 INFO L432 AbstractCegarLoop]: Abstraction has 512 states and 513 transitions. [2018-02-02 10:10:53,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:10:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 513 transitions. [2018-02-02 10:10:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-02-02 10:10:53,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:53,347 INFO L351 BasicCegarLoop]: trace histogram [74, 65, 64, 64, 64, 64, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:53,347 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:53,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1558061400, now seen corresponding path program 27 times [2018-02-02 10:10:53,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:53,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-02-02 10:10:53,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:53,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:10:53,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:53,809 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:10:53,809 INFO L182 omatonBuilderFactory]: Interpolants [15140#true, 15141#false, 15142#(= foo_~i~0 0), 15143#(<= foo_~i~0 1), 15144#(<= foo_~i~0 2), 15145#(<= foo_~i~0 3), 15146#(<= foo_~i~0 4), 15147#(<= foo_~i~0 5), 15148#(<= foo_~i~0 6), 15149#(<= foo_~i~0 7), 15150#(<= foo_~i~0 8), 15151#(and (<= 0 foo_~i~0) (<= foo_~i~0 8)), 15152#(and (<= 1 foo_~i~0) (<= foo_~i~0 9)), 15153#(and (<= foo_~i~0 10) (<= 2 foo_~i~0))] [2018-02-02 10:10:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-02-02 10:10:53,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:10:53,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:10:53,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:10:53,810 INFO L87 Difference]: Start difference. First operand 512 states and 513 transitions. Second operand 14 states. [2018-02-02 10:10:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:53,980 INFO L93 Difference]: Finished difference Result 524 states and 526 transitions. [2018-02-02 10:10:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:10:53,980 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 508 [2018-02-02 10:10:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:53,981 INFO L225 Difference]: With dead ends: 524 [2018-02-02 10:10:53,981 INFO L226 Difference]: Without dead ends: 524 [2018-02-02 10:10:53,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:10:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-02-02 10:10:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 518. [2018-02-02 10:10:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-02-02 10:10:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 520 transitions. [2018-02-02 10:10:53,985 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 520 transitions. Word has length 508 [2018-02-02 10:10:53,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:53,986 INFO L432 AbstractCegarLoop]: Abstraction has 518 states and 520 transitions. [2018-02-02 10:10:53,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:10:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 520 transitions. [2018-02-02 10:10:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-02-02 10:10:53,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:53,988 INFO L351 BasicCegarLoop]: trace histogram [75, 66, 65, 65, 65, 65, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:53,988 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash -387441200, now seen corresponding path program 28 times [2018-02-02 10:10:53,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:54,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 4282 proven. 284 refuted. 0 times theorem prover too weak. 9774 trivial. 0 not checked. [2018-02-02 10:10:54,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:54,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:10:54,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:54,498 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:10:54,498 INFO L182 omatonBuilderFactory]: Interpolants [16214#true, 16215#false, 16216#(= main_~i~1 0), 16217#(<= main_~i~1 1), 16218#(<= main_~i~1 2), 16219#(<= main_~i~1 3), 16220#(<= main_~i~1 4), 16221#(<= main_~i~1 5), 16222#(<= main_~i~1 6), 16223#(<= main_~i~1 7), 16224#(<= main_~i~1 8), 16225#(<= main_~i~1 9), 16226#(<= |foo_#in~size| 10), 16227#(<= foo_~size 10), 16228#(<= foo_~size (+ foo_~i~0 10)), 16229#(<= foo_~size (+ foo_~i~0 9)), 16230#(<= foo_~size (+ foo_~i~0 8)), 16231#(<= foo_~size (+ foo_~i~0 7)), 16232#(<= foo_~size (+ foo_~i~0 6)), 16233#(<= foo_~size (+ foo_~i~0 5)), 16234#(<= foo_~size (+ foo_~i~0 4)), 16235#(<= foo_~size (+ foo_~i~0 3)), 16236#(<= foo_~size (+ foo_~i~0 2)), 16237#(<= foo_~size (+ foo_~i~0 1)), 16238#(<= foo_~size foo_~i~0), 16239#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-02 10:10:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 4282 proven. 284 refuted. 0 times theorem prover too weak. 9774 trivial. 0 not checked. [2018-02-02 10:10:54,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:10:54,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:10:54,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:10:54,499 INFO L87 Difference]: Start difference. First operand 518 states and 520 transitions. Second operand 26 states. [2018-02-02 10:10:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:54,747 INFO L93 Difference]: Finished difference Result 598 states and 601 transitions. [2018-02-02 10:10:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:10:54,747 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 514 [2018-02-02 10:10:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:54,748 INFO L225 Difference]: With dead ends: 598 [2018-02-02 10:10:54,748 INFO L226 Difference]: Without dead ends: 598 [2018-02-02 10:10:54,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:10:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-02-02 10:10:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2018-02-02 10:10:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-02-02 10:10:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 599 transitions. [2018-02-02 10:10:54,754 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 599 transitions. Word has length 514 [2018-02-02 10:10:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:54,754 INFO L432 AbstractCegarLoop]: Abstraction has 596 states and 599 transitions. [2018-02-02 10:10:54,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:10:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 599 transitions. [2018-02-02 10:10:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-02-02 10:10:54,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:54,758 INFO L351 BasicCegarLoop]: trace histogram [86, 76, 75, 75, 75, 75, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:54,758 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:54,758 INFO L82 PathProgramCache]: Analyzing trace with hash 595794463, now seen corresponding path program 29 times [2018-02-02 10:10:54,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:54,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 8549 proven. 290 refuted. 0 times theorem prover too weak. 10146 trivial. 0 not checked. [2018-02-02 10:10:55,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:55,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:10:55,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:55,371 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:10:55,371 INFO L182 omatonBuilderFactory]: Interpolants [17472#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 17473#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 17474#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 17475#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 17476#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 17477#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 17478#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 17479#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 17480#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 17481#(<= |foo_#in~size| 9), 17458#true, 17459#false, 17460#(<= 0 main_~i~1), 17461#(<= 1 main_~i~1), 17462#(<= 2 main_~i~1), 17463#(<= 3 main_~i~1), 17464#(<= 4 main_~i~1), 17465#(<= 5 main_~i~1), 17466#(<= 6 main_~i~1), 17467#(<= 7 main_~i~1), 17468#(<= 8 main_~i~1), 17469#(<= 9 main_~i~1), 17470#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 17471#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-02 10:10:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 8549 proven. 290 refuted. 0 times theorem prover too weak. 10146 trivial. 0 not checked. [2018-02-02 10:10:55,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:10:55,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:10:55,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:10:55,372 INFO L87 Difference]: Start difference. First operand 596 states and 599 transitions. Second operand 24 states. [2018-02-02 10:10:55,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:55,677 INFO L93 Difference]: Finished difference Result 605 states and 606 transitions. [2018-02-02 10:10:55,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:10:55,677 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 586 [2018-02-02 10:10:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:55,678 INFO L225 Difference]: With dead ends: 605 [2018-02-02 10:10:55,678 INFO L226 Difference]: Without dead ends: 599 [2018-02-02 10:10:55,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:10:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-02-02 10:10:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2018-02-02 10:10:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-02-02 10:10:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 597 transitions. [2018-02-02 10:10:55,682 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 597 transitions. Word has length 586 [2018-02-02 10:10:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:55,682 INFO L432 AbstractCegarLoop]: Abstraction has 596 states and 597 transitions. [2018-02-02 10:10:55,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:10:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 597 transitions. [2018-02-02 10:10:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-02-02 10:10:55,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:55,685 INFO L351 BasicCegarLoop]: trace histogram [87, 77, 76, 76, 76, 76, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:55,685 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:55,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1034822807, now seen corresponding path program 30 times [2018-02-02 10:10:55,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:55,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-02-02 10:10:56,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:56,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:10:56,141 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:56,142 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:10:56,142 INFO L182 omatonBuilderFactory]: Interpolants [18701#true, 18702#false, 18703#(= foo_~i~0 0), 18704#(<= foo_~i~0 1), 18705#(<= foo_~i~0 2), 18706#(<= foo_~i~0 3), 18707#(<= foo_~i~0 4), 18708#(<= foo_~i~0 5), 18709#(<= foo_~i~0 6), 18710#(<= foo_~i~0 7), 18711#(<= foo_~i~0 8), 18712#(<= foo_~i~0 9), 18713#(<= foo_~i~0 10), 18714#(and (<= 0 foo_~i~0) (<= foo_~i~0 10)), 18715#(and (<= 1 foo_~i~0) (<= foo_~i~0 11))] [2018-02-02 10:10:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-02-02 10:10:56,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:10:56,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:10:56,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:10:56,143 INFO L87 Difference]: Start difference. First operand 596 states and 597 transitions. Second operand 15 states. [2018-02-02 10:10:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:56,290 INFO L93 Difference]: Finished difference Result 608 states and 610 transitions. [2018-02-02 10:10:56,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:10:56,291 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 592 [2018-02-02 10:10:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:56,292 INFO L225 Difference]: With dead ends: 608 [2018-02-02 10:10:56,292 INFO L226 Difference]: Without dead ends: 608 [2018-02-02 10:10:56,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:10:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-02-02 10:10:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2018-02-02 10:10:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-02-02 10:10:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 604 transitions. [2018-02-02 10:10:56,296 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 604 transitions. Word has length 592 [2018-02-02 10:10:56,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:56,297 INFO L432 AbstractCegarLoop]: Abstraction has 602 states and 604 transitions. [2018-02-02 10:10:56,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:10:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 604 transitions. [2018-02-02 10:10:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-02-02 10:10:56,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:56,300 INFO L351 BasicCegarLoop]: trace histogram [88, 78, 77, 77, 77, 77, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:56,300 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:56,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1525516849, now seen corresponding path program 31 times [2018-02-02 10:10:56,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:56,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:10:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 5542 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-02-02 10:10:57,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:57,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:10:57,098 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:57,098 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:10:57,098 INFO L182 omatonBuilderFactory]: Interpolants [19968#(<= foo_~size (+ foo_~i~0 4)), 19969#(<= foo_~size (+ foo_~i~0 3)), 19970#(<= foo_~size (+ foo_~i~0 2)), 19971#(<= foo_~size (+ foo_~i~0 1)), 19972#(<= foo_~size foo_~i~0), 19973#(<= (+ foo_~size 1) foo_~i~0), 19946#true, 19947#false, 19948#(= main_~i~1 0), 19949#(<= main_~i~1 1), 19950#(<= main_~i~1 2), 19951#(<= main_~i~1 3), 19952#(<= main_~i~1 4), 19953#(<= main_~i~1 5), 19954#(<= main_~i~1 6), 19955#(<= main_~i~1 7), 19956#(<= main_~i~1 8), 19957#(<= main_~i~1 9), 19958#(<= main_~i~1 10), 19959#(<= |foo_#in~size| 11), 19960#(<= foo_~size 11), 19961#(<= foo_~size (+ foo_~i~0 11)), 19962#(<= foo_~size (+ foo_~i~0 10)), 19963#(<= foo_~size (+ foo_~i~0 9)), 19964#(<= foo_~size (+ foo_~i~0 8)), 19965#(<= foo_~size (+ foo_~i~0 7)), 19966#(<= foo_~size (+ foo_~i~0 6)), 19967#(<= foo_~size (+ foo_~i~0 5))] [2018-02-02 10:10:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 5542 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-02-02 10:10:57,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:10:57,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:10:57,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:10:57,100 INFO L87 Difference]: Start difference. First operand 602 states and 604 transitions. Second operand 28 states. [2018-02-02 10:10:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:57,581 INFO L93 Difference]: Finished difference Result 688 states and 691 transitions. [2018-02-02 10:10:57,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:10:57,582 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 598 [2018-02-02 10:10:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:57,583 INFO L225 Difference]: With dead ends: 688 [2018-02-02 10:10:57,583 INFO L226 Difference]: Without dead ends: 688 [2018-02-02 10:10:57,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:10:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-02-02 10:10:57,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 686. [2018-02-02 10:10:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-02-02 10:10:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 689 transitions. [2018-02-02 10:10:57,590 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 689 transitions. Word has length 598 [2018-02-02 10:10:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:57,591 INFO L432 AbstractCegarLoop]: Abstraction has 686 states and 689 transitions. [2018-02-02 10:10:57,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:10:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 689 transitions. [2018-02-02 10:10:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-02-02 10:10:57,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:57,595 INFO L351 BasicCegarLoop]: trace histogram [100, 89, 88, 88, 88, 88, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:57,596 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:57,596 INFO L82 PathProgramCache]: Analyzing trace with hash 775068438, now seen corresponding path program 32 times [2018-02-02 10:10:57,596 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:57,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:10:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 11061 proven. 352 refuted. 0 times theorem prover too weak. 14492 trivial. 0 not checked. [2018-02-02 10:10:58,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:58,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:10:58,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:58,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:10:58,559 INFO L182 omatonBuilderFactory]: Interpolants [21376#(<= 0 main_~i~1), 21377#(<= 1 main_~i~1), 21378#(<= 2 main_~i~1), 21379#(<= 3 main_~i~1), 21380#(<= 4 main_~i~1), 21381#(<= 5 main_~i~1), 21382#(<= 6 main_~i~1), 21383#(<= 7 main_~i~1), 21384#(<= 8 main_~i~1), 21385#(<= 9 main_~i~1), 21386#(<= 10 main_~i~1), 21387#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 21388#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 21389#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 21390#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 21391#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 21392#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 21393#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 21394#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 21395#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 21396#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 21397#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 21398#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 21399#(<= |foo_#in~size| 10), 21374#true, 21375#false] [2018-02-02 10:10:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 11061 proven. 352 refuted. 0 times theorem prover too weak. 14492 trivial. 0 not checked. [2018-02-02 10:10:58,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:10:58,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:10:58,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:10:58,560 INFO L87 Difference]: Start difference. First operand 686 states and 689 transitions. Second operand 26 states. [2018-02-02 10:10:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:58,930 INFO L93 Difference]: Finished difference Result 695 states and 696 transitions. [2018-02-02 10:10:58,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:10:58,930 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 676 [2018-02-02 10:10:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:58,932 INFO L225 Difference]: With dead ends: 695 [2018-02-02 10:10:58,932 INFO L226 Difference]: Without dead ends: 689 [2018-02-02 10:10:58,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=960, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:10:58,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-02-02 10:10:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 686. [2018-02-02 10:10:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-02-02 10:10:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 687 transitions. [2018-02-02 10:10:58,936 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 687 transitions. Word has length 676 [2018-02-02 10:10:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:58,936 INFO L432 AbstractCegarLoop]: Abstraction has 686 states and 687 transitions. [2018-02-02 10:10:58,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:10:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 687 transitions. [2018-02-02 10:10:58,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2018-02-02 10:10:58,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:58,940 INFO L351 BasicCegarLoop]: trace histogram [101, 90, 89, 89, 89, 89, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:58,940 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:58,941 INFO L82 PathProgramCache]: Analyzing trace with hash -436969394, now seen corresponding path program 33 times [2018-02-02 10:10:58,941 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:58,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:10:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-02-02 10:10:59,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:59,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:10:59,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:59,438 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:10:59,438 INFO L182 omatonBuilderFactory]: Interpolants [22816#(and (<= 4 foo_~i~0) (<= foo_~i~0 12)), 22801#true, 22802#false, 22803#(= foo_~i~0 0), 22804#(<= foo_~i~0 1), 22805#(<= foo_~i~0 2), 22806#(<= foo_~i~0 3), 22807#(<= foo_~i~0 4), 22808#(<= foo_~i~0 5), 22809#(<= foo_~i~0 6), 22810#(<= foo_~i~0 7), 22811#(<= foo_~i~0 8), 22812#(and (<= 0 foo_~i~0) (<= foo_~i~0 8)), 22813#(and (<= 1 foo_~i~0) (<= foo_~i~0 9)), 22814#(and (<= foo_~i~0 10) (<= 2 foo_~i~0)), 22815#(and (<= foo_~i~0 11) (<= 3 foo_~i~0))] [2018-02-02 10:10:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-02-02 10:10:59,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:10:59,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:10:59,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:10:59,439 INFO L87 Difference]: Start difference. First operand 686 states and 687 transitions. Second operand 16 states. [2018-02-02 10:10:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:59,661 INFO L93 Difference]: Finished difference Result 698 states and 700 transitions. [2018-02-02 10:10:59,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:10:59,661 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 682 [2018-02-02 10:10:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:59,663 INFO L225 Difference]: With dead ends: 698 [2018-02-02 10:10:59,663 INFO L226 Difference]: Without dead ends: 698 [2018-02-02 10:10:59,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:10:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-02-02 10:10:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 692. [2018-02-02 10:10:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-02-02 10:10:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 694 transitions. [2018-02-02 10:10:59,667 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 694 transitions. Word has length 682 [2018-02-02 10:10:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:59,668 INFO L432 AbstractCegarLoop]: Abstraction has 692 states and 694 transitions. [2018-02-02 10:10:59,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:10:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 694 transitions. [2018-02-02 10:10:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-02-02 10:10:59,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:59,671 INFO L351 BasicCegarLoop]: trace histogram [102, 91, 90, 90, 90, 90, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:59,671 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:10:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1628752966, now seen corresponding path program 34 times [2018-02-02 10:10:59,671 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:59,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 7025 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-02-02 10:11:00,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:00,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:11:00,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:00,680 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:11:00,680 INFO L182 omatonBuilderFactory]: Interpolants [24256#(<= foo_~size (+ foo_~i~0 1)), 24257#(<= foo_~size foo_~i~0), 24258#(<= (+ foo_~size 1) foo_~i~0), 24229#true, 24230#false, 24231#(= main_~i~1 0), 24232#(<= main_~i~1 1), 24233#(<= main_~i~1 2), 24234#(<= main_~i~1 3), 24235#(<= main_~i~1 4), 24236#(<= main_~i~1 5), 24237#(<= main_~i~1 6), 24238#(<= main_~i~1 7), 24239#(<= main_~i~1 8), 24240#(<= main_~i~1 9), 24241#(<= main_~i~1 10), 24242#(<= main_~i~1 11), 24243#(<= |foo_#in~size| 12), 24244#(<= foo_~size 12), 24245#(<= foo_~size (+ foo_~i~0 12)), 24246#(<= foo_~size (+ foo_~i~0 11)), 24247#(<= foo_~size (+ foo_~i~0 10)), 24248#(<= foo_~size (+ foo_~i~0 9)), 24249#(<= foo_~size (+ foo_~i~0 8)), 24250#(<= foo_~size (+ foo_~i~0 7)), 24251#(<= foo_~size (+ foo_~i~0 6)), 24252#(<= foo_~size (+ foo_~i~0 5)), 24253#(<= foo_~size (+ foo_~i~0 4)), 24254#(<= foo_~size (+ foo_~i~0 3)), 24255#(<= foo_~size (+ foo_~i~0 2))] [2018-02-02 10:11:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 7025 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-02-02 10:11:00,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:11:00,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:11:00,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:11:00,681 INFO L87 Difference]: Start difference. First operand 692 states and 694 transitions. Second operand 30 states. [2018-02-02 10:11:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:01,174 INFO L93 Difference]: Finished difference Result 784 states and 787 transitions. [2018-02-02 10:11:01,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:11:01,174 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 688 [2018-02-02 10:11:01,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:01,176 INFO L225 Difference]: With dead ends: 784 [2018-02-02 10:11:01,176 INFO L226 Difference]: Without dead ends: 784 [2018-02-02 10:11:01,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=466, Invalid=1426, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:11:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-02-02 10:11:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2018-02-02 10:11:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-02-02 10:11:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 785 transitions. [2018-02-02 10:11:01,182 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 785 transitions. Word has length 688 [2018-02-02 10:11:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:01,182 INFO L432 AbstractCegarLoop]: Abstraction has 782 states and 785 transitions. [2018-02-02 10:11:01,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:11:01,182 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 785 transitions. [2018-02-02 10:11:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-02-02 10:11:01,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:01,186 INFO L351 BasicCegarLoop]: trace histogram [115, 103, 102, 102, 102, 102, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:01,186 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash 47189509, now seen corresponding path program 35 times [2018-02-02 10:11:01,187 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:01,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 14018 proven. 420 refuted. 0 times theorem prover too weak. 20098 trivial. 0 not checked. [2018-02-02 10:11:02,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:02,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:11:02,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:02,222 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:11:02,222 INFO L182 omatonBuilderFactory]: Interpolants [25856#(<= 1 main_~i~1), 25857#(<= 2 main_~i~1), 25858#(<= 3 main_~i~1), 25859#(<= 4 main_~i~1), 25860#(<= 5 main_~i~1), 25861#(<= 6 main_~i~1), 25862#(<= 7 main_~i~1), 25863#(<= 8 main_~i~1), 25864#(<= 9 main_~i~1), 25865#(<= 10 main_~i~1), 25866#(<= 11 main_~i~1), 25867#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 25868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 25869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 25870#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 25871#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 25872#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 25873#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 25874#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 25875#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 25876#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 25877#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 25878#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 25879#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 25880#(<= |foo_#in~size| 11), 25853#true, 25854#false, 25855#(<= 0 main_~i~1)] [2018-02-02 10:11:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 14018 proven. 420 refuted. 0 times theorem prover too weak. 20098 trivial. 0 not checked. [2018-02-02 10:11:02,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:11:02,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:11:02,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:11:02,224 INFO L87 Difference]: Start difference. First operand 782 states and 785 transitions. Second operand 28 states. [2018-02-02 10:11:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:02,763 INFO L93 Difference]: Finished difference Result 791 states and 792 transitions. [2018-02-02 10:11:02,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:11:02,763 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 772 [2018-02-02 10:11:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:02,765 INFO L225 Difference]: With dead ends: 791 [2018-02-02 10:11:02,765 INFO L226 Difference]: Without dead ends: 785 [2018-02-02 10:11:02,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=1131, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:11:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-02-02 10:11:02,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 782. [2018-02-02 10:11:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-02-02 10:11:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 783 transitions. [2018-02-02 10:11:02,769 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 783 transitions. Word has length 772 [2018-02-02 10:11:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:02,770 INFO L432 AbstractCegarLoop]: Abstraction has 782 states and 783 transitions. [2018-02-02 10:11:02,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:11:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 783 transitions. [2018-02-02 10:11:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-02-02 10:11:02,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:02,773 INFO L351 BasicCegarLoop]: trace histogram [116, 104, 103, 103, 103, 103, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:02,773 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:02,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1773325315, now seen corresponding path program 36 times [2018-02-02 10:11:02,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:02,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7626 proven. 507 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-02-02 10:11:03,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:03,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:11:03,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:03,496 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:11:03,496 INFO L182 omatonBuilderFactory]: Interpolants [27488#(<= foo_~i~0 10), 27489#(<= foo_~i~0 11), 27490#(<= foo_~i~0 12), 27491#(and (<= foo_~i~0 12) (<= 0 foo_~i~0)), 27492#(and (<= 1 foo_~i~0) (<= foo_~i~0 13)), 27476#true, 27477#false, 27478#(= foo_~i~0 0), 27479#(<= foo_~i~0 1), 27480#(<= foo_~i~0 2), 27481#(<= foo_~i~0 3), 27482#(<= foo_~i~0 4), 27483#(<= foo_~i~0 5), 27484#(<= foo_~i~0 6), 27485#(<= foo_~i~0 7), 27486#(<= foo_~i~0 8), 27487#(<= foo_~i~0 9)] [2018-02-02 10:11:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7626 proven. 507 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-02-02 10:11:03,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:11:03,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:11:03,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:11:03,497 INFO L87 Difference]: Start difference. First operand 782 states and 783 transitions. Second operand 17 states. [2018-02-02 10:11:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:03,675 INFO L93 Difference]: Finished difference Result 794 states and 796 transitions. [2018-02-02 10:11:03,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:11:03,675 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 778 [2018-02-02 10:11:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:03,678 INFO L225 Difference]: With dead ends: 794 [2018-02-02 10:11:03,678 INFO L226 Difference]: Without dead ends: 794 [2018-02-02 10:11:03,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=303, Invalid=509, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:11:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-02-02 10:11:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 788. [2018-02-02 10:11:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-02-02 10:11:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 790 transitions. [2018-02-02 10:11:03,686 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 790 transitions. Word has length 778 [2018-02-02 10:11:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:03,687 INFO L432 AbstractCegarLoop]: Abstraction has 788 states and 790 transitions. [2018-02-02 10:11:03,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:11:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 790 transitions. [2018-02-02 10:11:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-02-02 10:11:03,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:03,690 INFO L351 BasicCegarLoop]: trace histogram [117, 105, 104, 104, 104, 104, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:03,690 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:03,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1537597621, now seen corresponding path program 37 times [2018-02-02 10:11:03,691 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:03,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 8749 proven. 485 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-02-02 10:11:04,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:04,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:11:04,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:04,848 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:11:04,848 INFO L182 omatonBuilderFactory]: Interpolants [29120#(<= foo_~size (+ foo_~i~0 9)), 29121#(<= foo_~size (+ foo_~i~0 8)), 29122#(<= foo_~size (+ foo_~i~0 7)), 29123#(<= foo_~size (+ foo_~i~0 6)), 29124#(<= foo_~size (+ foo_~i~0 5)), 29125#(<= foo_~size (+ foo_~i~0 4)), 29126#(<= foo_~size (+ foo_~i~0 3)), 29127#(<= foo_~size (+ foo_~i~0 2)), 29128#(<= foo_~size (+ foo_~i~0 1)), 29129#(<= foo_~size foo_~i~0), 29130#(<= (+ foo_~size 1) foo_~i~0), 29099#true, 29100#false, 29101#(= main_~i~1 0), 29102#(<= main_~i~1 1), 29103#(<= main_~i~1 2), 29104#(<= main_~i~1 3), 29105#(<= main_~i~1 4), 29106#(<= main_~i~1 5), 29107#(<= main_~i~1 6), 29108#(<= main_~i~1 7), 29109#(<= main_~i~1 8), 29110#(<= main_~i~1 9), 29111#(<= main_~i~1 10), 29112#(<= main_~i~1 11), 29113#(<= main_~i~1 12), 29114#(<= |foo_#in~size| 13), 29115#(<= foo_~size 13), 29116#(<= foo_~size (+ foo_~i~0 13)), 29117#(<= foo_~size (+ foo_~i~0 12)), 29118#(<= foo_~size (+ foo_~i~0 11)), 29119#(<= foo_~size (+ foo_~i~0 10))] [2018-02-02 10:11:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 8749 proven. 485 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-02-02 10:11:04,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:11:04,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:11:04,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:11:04,849 INFO L87 Difference]: Start difference. First operand 788 states and 790 transitions. Second operand 32 states. [2018-02-02 10:11:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:05,392 INFO L93 Difference]: Finished difference Result 886 states and 889 transitions. [2018-02-02 10:11:05,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:11:05,392 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 784 [2018-02-02 10:11:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:05,394 INFO L225 Difference]: With dead ends: 886 [2018-02-02 10:11:05,394 INFO L226 Difference]: Without dead ends: 886 [2018-02-02 10:11:05,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=529, Invalid=1633, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:11:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-02-02 10:11:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2018-02-02 10:11:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-02-02 10:11:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 887 transitions. [2018-02-02 10:11:05,399 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 887 transitions. Word has length 784 [2018-02-02 10:11:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:05,400 INFO L432 AbstractCegarLoop]: Abstraction has 884 states and 887 transitions. [2018-02-02 10:11:05,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:11:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 887 transitions. [2018-02-02 10:11:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-02-02 10:11:05,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:05,403 INFO L351 BasicCegarLoop]: trace histogram [131, 118, 117, 117, 117, 117, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:05,403 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:05,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1027574676, now seen corresponding path program 38 times [2018-02-02 10:11:05,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:05,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 17456 proven. 494 refuted. 0 times theorem prover too weak. 27186 trivial. 0 not checked. [2018-02-02 10:11:06,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:06,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:11:06,592 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:11:06,592 INFO L182 omatonBuilderFactory]: Interpolants [30931#true, 30932#false, 30933#(<= 0 main_~i~1), 30934#(<= 1 main_~i~1), 30935#(<= 2 main_~i~1), 30936#(<= 3 main_~i~1), 30937#(<= 4 main_~i~1), 30938#(<= 5 main_~i~1), 30939#(<= 6 main_~i~1), 30940#(<= 7 main_~i~1), 30941#(<= 8 main_~i~1), 30942#(<= 9 main_~i~1), 30943#(<= 10 main_~i~1), 30944#(<= 11 main_~i~1), 30945#(<= 12 main_~i~1), 30946#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 30947#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 30948#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 30949#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 30950#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 30951#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 30952#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 30953#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 30954#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 30955#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 30956#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 30957#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 30958#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 30959#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 30960#(<= |foo_#in~size| 12)] [2018-02-02 10:11:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 17456 proven. 494 refuted. 0 times theorem prover too weak. 27186 trivial. 0 not checked. [2018-02-02 10:11:06,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:11:06,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:11:06,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:11:06,594 INFO L87 Difference]: Start difference. First operand 884 states and 887 transitions. Second operand 30 states. [2018-02-02 10:11:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:07,063 INFO L93 Difference]: Finished difference Result 893 states and 894 transitions. [2018-02-02 10:11:07,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:11:07,064 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 874 [2018-02-02 10:11:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:07,065 INFO L225 Difference]: With dead ends: 893 [2018-02-02 10:11:07,065 INFO L226 Difference]: Without dead ends: 887 [2018-02-02 10:11:07,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=1316, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:11:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-02-02 10:11:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 884. [2018-02-02 10:11:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-02-02 10:11:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 885 transitions. [2018-02-02 10:11:07,071 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 885 transitions. Word has length 874 [2018-02-02 10:11:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:07,072 INFO L432 AbstractCegarLoop]: Abstraction has 884 states and 885 transitions. [2018-02-02 10:11:07,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:11:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 885 transitions. [2018-02-02 10:11:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2018-02-02 10:11:07,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:07,076 INFO L351 BasicCegarLoop]: trace histogram [132, 119, 118, 118, 118, 118, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:07,076 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:07,076 INFO L82 PathProgramCache]: Analyzing trace with hash -894009052, now seen corresponding path program 39 times [2018-02-02 10:11:07,077 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:07,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-02-02 10:11:07,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:07,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:11:07,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:07,848 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:11:07,848 INFO L182 omatonBuilderFactory]: Interpolants [32768#(<= foo_~i~0 4), 32769#(<= foo_~i~0 5), 32770#(<= foo_~i~0 6), 32771#(<= foo_~i~0 7), 32772#(<= foo_~i~0 8), 32773#(<= foo_~i~0 9), 32774#(<= foo_~i~0 10), 32775#(<= foo_~i~0 11), 32776#(<= foo_~i~0 12), 32777#(and (<= foo_~i~0 12) (<= 0 foo_~i~0)), 32778#(and (<= 1 foo_~i~0) (<= foo_~i~0 13)), 32779#(and (<= foo_~i~0 14) (<= 2 foo_~i~0)), 32762#true, 32763#false, 32764#(= foo_~i~0 0), 32765#(<= foo_~i~0 1), 32766#(<= foo_~i~0 2), 32767#(<= foo_~i~0 3)] [2018-02-02 10:11:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-02-02 10:11:07,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:11:07,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:11:07,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:11:07,849 INFO L87 Difference]: Start difference. First operand 884 states and 885 transitions. Second operand 18 states. [2018-02-02 10:11:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:08,039 INFO L93 Difference]: Finished difference Result 896 states and 898 transitions. [2018-02-02 10:11:08,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:11:08,040 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 880 [2018-02-02 10:11:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:08,041 INFO L225 Difference]: With dead ends: 896 [2018-02-02 10:11:08,041 INFO L226 Difference]: Without dead ends: 896 [2018-02-02 10:11:08,041 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:11:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-02-02 10:11:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 890. [2018-02-02 10:11:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-02-02 10:11:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 892 transitions. [2018-02-02 10:11:08,046 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 892 transitions. Word has length 880 [2018-02-02 10:11:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:08,046 INFO L432 AbstractCegarLoop]: Abstraction has 890 states and 892 transitions. [2018-02-02 10:11:08,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:11:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 892 transitions. [2018-02-02 10:11:08,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2018-02-02 10:11:08,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:08,050 INFO L351 BasicCegarLoop]: trace histogram [133, 120, 119, 119, 119, 119, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:08,050 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:08,050 INFO L82 PathProgramCache]: Analyzing trace with hash 741635228, now seen corresponding path program 40 times [2018-02-02 10:11:08,051 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:08,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 10732 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-02-02 10:11:09,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:09,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:11:09,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:09,382 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:11:09,382 INFO L182 omatonBuilderFactory]: Interpolants [34624#(<= foo_~size foo_~i~0), 34625#(<= (+ foo_~size 1) foo_~i~0), 34592#true, 34593#false, 34594#(= main_~i~1 0), 34595#(<= main_~i~1 1), 34596#(<= main_~i~1 2), 34597#(<= main_~i~1 3), 34598#(<= main_~i~1 4), 34599#(<= main_~i~1 5), 34600#(<= main_~i~1 6), 34601#(<= main_~i~1 7), 34602#(<= main_~i~1 8), 34603#(<= main_~i~1 9), 34604#(<= main_~i~1 10), 34605#(<= main_~i~1 11), 34606#(<= main_~i~1 12), 34607#(<= main_~i~1 13), 34608#(<= |foo_#in~size| 14), 34609#(<= foo_~size 14), 34610#(<= foo_~size (+ foo_~i~0 14)), 34611#(<= foo_~size (+ foo_~i~0 13)), 34612#(<= foo_~size (+ foo_~i~0 12)), 34613#(<= foo_~size (+ foo_~i~0 11)), 34614#(<= foo_~size (+ foo_~i~0 10)), 34615#(<= foo_~size (+ foo_~i~0 9)), 34616#(<= foo_~size (+ foo_~i~0 8)), 34617#(<= foo_~size (+ foo_~i~0 7)), 34618#(<= foo_~size (+ foo_~i~0 6)), 34619#(<= foo_~size (+ foo_~i~0 5)), 34620#(<= foo_~size (+ foo_~i~0 4)), 34621#(<= foo_~size (+ foo_~i~0 3)), 34622#(<= foo_~size (+ foo_~i~0 2)), 34623#(<= foo_~size (+ foo_~i~0 1))] [2018-02-02 10:11:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 10732 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-02-02 10:11:09,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:11:09,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:11:09,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:11:09,383 INFO L87 Difference]: Start difference. First operand 890 states and 892 transitions. Second operand 34 states. [2018-02-02 10:11:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:09,992 INFO L93 Difference]: Finished difference Result 994 states and 997 transitions. [2018-02-02 10:11:09,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:11:09,992 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 886 [2018-02-02 10:11:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:09,994 INFO L225 Difference]: With dead ends: 994 [2018-02-02 10:11:09,994 INFO L226 Difference]: Without dead ends: 994 [2018-02-02 10:11:09,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=596, Invalid=1854, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:11:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-02-02 10:11:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 992. [2018-02-02 10:11:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-02-02 10:11:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 995 transitions. [2018-02-02 10:11:09,999 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 995 transitions. Word has length 886 [2018-02-02 10:11:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:10,000 INFO L432 AbstractCegarLoop]: Abstraction has 992 states and 995 transitions. [2018-02-02 10:11:10,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:11:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 995 transitions. [2018-02-02 10:11:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-02-02 10:11:10,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:10,004 INFO L351 BasicCegarLoop]: trace histogram [148, 134, 133, 133, 133, 133, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:10,005 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1908977205, now seen corresponding path program 41 times [2018-02-02 10:11:10,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:10,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-02-02 10:11:11,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:11,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:11:11,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:11,589 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:11:11,590 INFO L182 omatonBuilderFactory]: Interpolants [36672#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 36673#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 36674#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 36675#(<= |foo_#in~size| 13), 36644#true, 36645#false, 36646#(<= 0 main_~i~1), 36647#(<= 1 main_~i~1), 36648#(<= 2 main_~i~1), 36649#(<= 3 main_~i~1), 36650#(<= 4 main_~i~1), 36651#(<= 5 main_~i~1), 36652#(<= 6 main_~i~1), 36653#(<= 7 main_~i~1), 36654#(<= 8 main_~i~1), 36655#(<= 9 main_~i~1), 36656#(<= 10 main_~i~1), 36657#(<= 11 main_~i~1), 36658#(<= 12 main_~i~1), 36659#(<= 13 main_~i~1), 36660#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 36661#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 36662#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 36663#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 36664#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 36665#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 36666#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 36667#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 36668#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 36669#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 36670#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 36671#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11))] [2018-02-02 10:11:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-02-02 10:11:11,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:11:11,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:11:11,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:11:11,592 INFO L87 Difference]: Start difference. First operand 992 states and 995 transitions. Second operand 32 states. [2018-02-02 10:11:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:11,896 INFO L93 Difference]: Finished difference Result 1001 states and 1002 transitions. [2018-02-02 10:11:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:11:11,896 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 982 [2018-02-02 10:11:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:11,898 INFO L225 Difference]: With dead ends: 1001 [2018-02-02 10:11:11,898 INFO L226 Difference]: Without dead ends: 995 [2018-02-02 10:11:11,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=1515, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:11:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2018-02-02 10:11:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 992. [2018-02-02 10:11:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-02-02 10:11:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 993 transitions. [2018-02-02 10:11:11,903 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 993 transitions. Word has length 982 [2018-02-02 10:11:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:11,903 INFO L432 AbstractCegarLoop]: Abstraction has 992 states and 993 transitions. [2018-02-02 10:11:11,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:11:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 993 transitions. [2018-02-02 10:11:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2018-02-02 10:11:11,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:11,908 INFO L351 BasicCegarLoop]: trace histogram [149, 135, 134, 134, 134, 134, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:11,908 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:11,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1435708227, now seen corresponding path program 42 times [2018-02-02 10:11:11,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:11,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-02-02 10:11:12,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:12,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:11:12,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:11:12,890 INFO L182 omatonBuilderFactory]: Interpolants [38695#true, 38696#false, 38697#(= foo_~i~0 0), 38698#(<= foo_~i~0 1), 38699#(<= foo_~i~0 2), 38700#(<= foo_~i~0 3), 38701#(<= foo_~i~0 4), 38702#(<= foo_~i~0 5), 38703#(<= foo_~i~0 6), 38704#(<= foo_~i~0 7), 38705#(<= foo_~i~0 8), 38706#(<= foo_~i~0 9), 38707#(<= foo_~i~0 10), 38708#(<= foo_~i~0 11), 38709#(<= foo_~i~0 12), 38710#(<= foo_~i~0 13), 38711#(<= foo_~i~0 14), 38712#(and (<= foo_~i~0 14) (<= 0 foo_~i~0)), 38713#(and (<= foo_~i~0 15) (<= 1 foo_~i~0))] [2018-02-02 10:11:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-02-02 10:11:12,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:11:12,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:11:12,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:11:12,891 INFO L87 Difference]: Start difference. First operand 992 states and 993 transitions. Second operand 19 states. [2018-02-02 10:11:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:13,076 INFO L93 Difference]: Finished difference Result 1004 states and 1006 transitions. [2018-02-02 10:11:13,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:11:13,076 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 988 [2018-02-02 10:11:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:13,078 INFO L225 Difference]: With dead ends: 1004 [2018-02-02 10:11:13,078 INFO L226 Difference]: Without dead ends: 1004 [2018-02-02 10:11:13,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:11:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-02-02 10:11:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 998. [2018-02-02 10:11:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-02-02 10:11:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1000 transitions. [2018-02-02 10:11:13,083 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1000 transitions. Word has length 988 [2018-02-02 10:11:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:13,083 INFO L432 AbstractCegarLoop]: Abstraction has 998 states and 1000 transitions. [2018-02-02 10:11:13,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:11:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1000 transitions. [2018-02-02 10:11:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2018-02-02 10:11:13,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:13,088 INFO L351 BasicCegarLoop]: trace histogram [150, 136, 135, 135, 135, 135, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:13,088 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1833618299, now seen corresponding path program 43 times [2018-02-02 10:11:13,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:13,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 12992 proven. 649 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-02-02 10:11:14,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:14,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 10:11:14,791 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:14,791 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:11:14,791 INFO L182 omatonBuilderFactory]: Interpolants [40768#(<= foo_~size (+ foo_~i~0 10)), 40769#(<= foo_~size (+ foo_~i~0 9)), 40770#(<= foo_~size (+ foo_~i~0 8)), 40771#(<= foo_~size (+ foo_~i~0 7)), 40772#(<= foo_~size (+ foo_~i~0 6)), 40773#(<= foo_~size (+ foo_~i~0 5)), 40774#(<= foo_~size (+ foo_~i~0 4)), 40775#(<= foo_~size (+ foo_~i~0 3)), 40776#(<= foo_~size (+ foo_~i~0 2)), 40777#(<= foo_~size (+ foo_~i~0 1)), 40778#(<= foo_~size foo_~i~0), 40779#(<= (+ foo_~size 1) foo_~i~0), 40744#true, 40745#false, 40746#(= main_~i~1 0), 40747#(<= main_~i~1 1), 40748#(<= main_~i~1 2), 40749#(<= main_~i~1 3), 40750#(<= main_~i~1 4), 40751#(<= main_~i~1 5), 40752#(<= main_~i~1 6), 40753#(<= main_~i~1 7), 40754#(<= main_~i~1 8), 40755#(<= main_~i~1 9), 40756#(<= main_~i~1 10), 40757#(<= main_~i~1 11), 40758#(<= main_~i~1 12), 40759#(<= main_~i~1 13), 40760#(<= main_~i~1 14), 40761#(<= |foo_#in~size| 15), 40762#(<= foo_~size 15), 40763#(<= foo_~size (+ foo_~i~0 15)), 40764#(<= foo_~size (+ foo_~i~0 14)), 40765#(<= foo_~size (+ foo_~i~0 13)), 40766#(<= foo_~size (+ foo_~i~0 12)), 40767#(<= foo_~size (+ foo_~i~0 11))] [2018-02-02 10:11:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 12992 proven. 649 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-02-02 10:11:14,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:11:14,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:11:14,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:11:14,793 INFO L87 Difference]: Start difference. First operand 998 states and 1000 transitions. Second operand 36 states. [2018-02-02 10:11:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:15,465 INFO L93 Difference]: Finished difference Result 1108 states and 1111 transitions. [2018-02-02 10:11:15,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:11:15,465 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 994 [2018-02-02 10:11:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:15,468 INFO L225 Difference]: With dead ends: 1108 [2018-02-02 10:11:15,468 INFO L226 Difference]: Without dead ends: 1108 [2018-02-02 10:11:15,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=667, Invalid=2089, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:11:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2018-02-02 10:11:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1106. [2018-02-02 10:11:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-02-02 10:11:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1109 transitions. [2018-02-02 10:11:15,477 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1109 transitions. Word has length 994 [2018-02-02 10:11:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:15,477 INFO L432 AbstractCegarLoop]: Abstraction has 1106 states and 1109 transitions. [2018-02-02 10:11:15,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 10:11:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1109 transitions. [2018-02-02 10:11:15,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2018-02-02 10:11:15,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:15,482 INFO L351 BasicCegarLoop]: trace histogram [166, 151, 150, 150, 150, 150, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:15,482 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:15,483 INFO L82 PathProgramCache]: Analyzing trace with hash 305834914, now seen corresponding path program 44 times [2018-02-02 10:11:15,483 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:15,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 73365 backedges. 25919 proven. 660 refuted. 0 times theorem prover too weak. 46786 trivial. 0 not checked. [2018-02-02 10:11:17,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:17,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:11:17,397 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:17,397 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:11:17,397 INFO L182 omatonBuilderFactory]: Interpolants [43028#true, 43029#false, 43030#(<= 0 main_~i~1), 43031#(<= 1 main_~i~1), 43032#(<= 2 main_~i~1), 43033#(<= 3 main_~i~1), 43034#(<= 4 main_~i~1), 43035#(<= 5 main_~i~1), 43036#(<= 6 main_~i~1), 43037#(<= 7 main_~i~1), 43038#(<= 8 main_~i~1), 43039#(<= 9 main_~i~1), 43040#(<= 10 main_~i~1), 43041#(<= 11 main_~i~1), 43042#(<= 12 main_~i~1), 43043#(<= 13 main_~i~1), 43044#(<= 14 main_~i~1), 43045#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 43046#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 43047#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 43048#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 43049#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 43050#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 43051#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 43052#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 43053#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 43054#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 43055#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 43056#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 43057#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 43058#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 43059#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 43060#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 43061#(<= |foo_#in~size| 14)] [2018-02-02 10:11:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 73365 backedges. 25919 proven. 660 refuted. 0 times theorem prover too weak. 46786 trivial. 0 not checked. [2018-02-02 10:11:17,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:11:17,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:11:17,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:11:17,399 INFO L87 Difference]: Start difference. First operand 1106 states and 1109 transitions. Second operand 34 states. [2018-02-02 10:11:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:18,043 INFO L93 Difference]: Finished difference Result 1115 states and 1116 transitions. [2018-02-02 10:11:18,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 10:11:18,043 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1096 [2018-02-02 10:11:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:18,045 INFO L225 Difference]: With dead ends: 1115 [2018-02-02 10:11:18,045 INFO L226 Difference]: Without dead ends: 1109 [2018-02-02 10:11:18,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=528, Invalid=1728, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:11:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2018-02-02 10:11:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1106. [2018-02-02 10:11:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-02-02 10:11:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1107 transitions. [2018-02-02 10:11:18,051 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1107 transitions. Word has length 1096 [2018-02-02 10:11:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:18,051 INFO L432 AbstractCegarLoop]: Abstraction has 1106 states and 1107 transitions. [2018-02-02 10:11:18,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:11:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1107 transitions. [2018-02-02 10:11:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2018-02-02 10:11:18,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:18,056 INFO L351 BasicCegarLoop]: trace histogram [167, 152, 151, 151, 151, 151, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:18,056 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1521424346, now seen corresponding path program 45 times [2018-02-02 10:11:18,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:18,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-02-02 10:11:19,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:19,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:11:19,383 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:19,383 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:11:19,383 INFO L182 omatonBuilderFactory]: Interpolants [45312#false, 45313#(= foo_~i~0 0), 45314#(and (<= 1 foo_~i~0) (<= foo_~i~0 1)), 45315#(and (<= 2 foo_~i~0) (<= foo_~i~0 2)), 45316#(and (<= 3 foo_~i~0) (<= foo_~i~0 3)), 45317#(and (<= foo_~i~0 4) (<= 4 foo_~i~0)), 45318#(and (<= 5 foo_~i~0) (<= foo_~i~0 5)), 45319#(and (<= foo_~i~0 6) (<= 6 foo_~i~0)), 45320#(and (<= foo_~i~0 7) (<= 7 foo_~i~0)), 45321#(and (<= 8 foo_~i~0) (<= foo_~i~0 8)), 45322#(and (<= foo_~i~0 9) (<= 9 foo_~i~0)), 45323#(and (<= 10 foo_~i~0) (<= foo_~i~0 10)), 45324#(and (<= 11 foo_~i~0) (<= foo_~i~0 11)), 45325#(and (<= foo_~i~0 12) (<= 12 foo_~i~0)), 45326#(and (<= 13 foo_~i~0) (<= foo_~i~0 13)), 45327#(and (<= foo_~i~0 14) (<= 14 foo_~i~0)), 45328#(and (<= foo_~i~0 15) (<= 15 foo_~i~0)), 45329#(and (<= 16 foo_~i~0) (<= foo_~i~0 16)), 45311#true] [2018-02-02 10:11:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-02-02 10:11:19,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:11:19,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:11:19,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:11:19,384 INFO L87 Difference]: Start difference. First operand 1106 states and 1107 transitions. Second operand 19 states. [2018-02-02 10:11:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:19,854 INFO L93 Difference]: Finished difference Result 1118 states and 1120 transitions. [2018-02-02 10:11:19,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:11:19,855 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1102 [2018-02-02 10:11:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:19,857 INFO L225 Difference]: With dead ends: 1118 [2018-02-02 10:11:19,857 INFO L226 Difference]: Without dead ends: 1118 [2018-02-02 10:11:19,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:11:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2018-02-02 10:11:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1112. [2018-02-02 10:11:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-02-02 10:11:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1114 transitions. [2018-02-02 10:11:19,863 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1114 transitions. Word has length 1102 [2018-02-02 10:11:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:19,863 INFO L432 AbstractCegarLoop]: Abstraction has 1112 states and 1114 transitions. [2018-02-02 10:11:19,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:11:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1114 transitions. [2018-02-02 10:11:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2018-02-02 10:11:19,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:19,869 INFO L351 BasicCegarLoop]: trace histogram [168, 153, 152, 152, 152, 152, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:19,869 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:19,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1687333586, now seen corresponding path program 46 times [2018-02-02 10:11:19,870 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:19,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 15547 proven. 740 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-02-02 10:11:21,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:21,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 10:11:21,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:21,970 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:11:21,971 INFO L182 omatonBuilderFactory]: Interpolants [47560#true, 47561#false, 47562#(= main_~i~1 0), 47563#(<= main_~i~1 1), 47564#(<= main_~i~1 2), 47565#(<= main_~i~1 3), 47566#(<= main_~i~1 4), 47567#(<= main_~i~1 5), 47568#(<= main_~i~1 6), 47569#(<= main_~i~1 7), 47570#(<= main_~i~1 8), 47571#(<= main_~i~1 9), 47572#(<= main_~i~1 10), 47573#(<= main_~i~1 11), 47574#(<= main_~i~1 12), 47575#(<= main_~i~1 13), 47576#(<= main_~i~1 14), 47577#(<= main_~i~1 15), 47578#(<= |foo_#in~size| 16), 47579#(<= foo_~size 16), 47580#(<= foo_~size (+ foo_~i~0 16)), 47581#(<= foo_~size (+ foo_~i~0 15)), 47582#(<= foo_~size (+ foo_~i~0 14)), 47583#(<= foo_~size (+ foo_~i~0 13)), 47584#(<= foo_~size (+ foo_~i~0 12)), 47585#(<= foo_~size (+ foo_~i~0 11)), 47586#(<= foo_~size (+ foo_~i~0 10)), 47587#(<= foo_~size (+ foo_~i~0 9)), 47588#(<= foo_~size (+ foo_~i~0 8)), 47589#(<= foo_~size (+ foo_~i~0 7)), 47590#(<= foo_~size (+ foo_~i~0 6)), 47591#(<= foo_~size (+ foo_~i~0 5)), 47592#(<= foo_~size (+ foo_~i~0 4)), 47593#(<= foo_~size (+ foo_~i~0 3)), 47594#(<= foo_~size (+ foo_~i~0 2)), 47595#(<= foo_~size (+ foo_~i~0 1)), 47596#(<= foo_~size foo_~i~0), 47597#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-02 10:11:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 15547 proven. 740 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-02-02 10:11:21,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 10:11:21,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 10:11:21,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:11:21,972 INFO L87 Difference]: Start difference. First operand 1112 states and 1114 transitions. Second operand 38 states. [2018-02-02 10:11:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:22,712 INFO L93 Difference]: Finished difference Result 1228 states and 1231 transitions. [2018-02-02 10:11:22,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:11:22,712 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1108 [2018-02-02 10:11:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:22,714 INFO L225 Difference]: With dead ends: 1228 [2018-02-02 10:11:22,714 INFO L226 Difference]: Without dead ends: 1228 [2018-02-02 10:11:22,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=742, Invalid=2338, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:11:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-02-02 10:11:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1226. [2018-02-02 10:11:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-02-02 10:11:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1229 transitions. [2018-02-02 10:11:22,720 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1229 transitions. Word has length 1108 [2018-02-02 10:11:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:22,720 INFO L432 AbstractCegarLoop]: Abstraction has 1226 states and 1229 transitions. [2018-02-02 10:11:22,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 10:11:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1229 transitions. [2018-02-02 10:11:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2018-02-02 10:11:22,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:22,729 INFO L351 BasicCegarLoop]: trace histogram [185, 169, 168, 168, 168, 168, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:22,730 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1655146865, now seen corresponding path program 47 times [2018-02-02 10:11:22,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:22,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-02-02 10:11:25,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:25,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 10:11:25,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:11:25,292 INFO L182 omatonBuilderFactory]: Interpolants [50112#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 50113#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 50114#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 50115#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 50116#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 50117#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 50118#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 50119#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 50120#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 50121#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 50122#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 50123#(<= |foo_#in~size| 15), 50088#true, 50089#false, 50090#(<= 0 main_~i~1), 50091#(<= 1 main_~i~1), 50092#(<= 2 main_~i~1), 50093#(<= 3 main_~i~1), 50094#(<= 4 main_~i~1), 50095#(<= 5 main_~i~1), 50096#(<= 6 main_~i~1), 50097#(<= 7 main_~i~1), 50098#(<= 8 main_~i~1), 50099#(<= 9 main_~i~1), 50100#(<= 10 main_~i~1), 50101#(<= 11 main_~i~1), 50102#(<= 12 main_~i~1), 50103#(<= 13 main_~i~1), 50104#(<= 14 main_~i~1), 50105#(<= 15 main_~i~1), 50106#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 50107#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 50108#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 50109#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 50110#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 50111#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-02 10:11:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-02-02 10:11:25,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:11:25,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:11:25,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=935, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:11:25,293 INFO L87 Difference]: Start difference. First operand 1226 states and 1229 transitions. Second operand 36 states. [2018-02-02 10:11:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:25,856 INFO L93 Difference]: Finished difference Result 1235 states and 1236 transitions. [2018-02-02 10:11:25,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 10:11:25,857 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1216 [2018-02-02 10:11:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:25,859 INFO L225 Difference]: With dead ends: 1235 [2018-02-02 10:11:25,859 INFO L226 Difference]: Without dead ends: 1229 [2018-02-02 10:11:25,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=1955, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:11:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-02-02 10:11:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1226. [2018-02-02 10:11:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-02-02 10:11:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1227 transitions. [2018-02-02 10:11:25,865 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1227 transitions. Word has length 1216 [2018-02-02 10:11:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:25,865 INFO L432 AbstractCegarLoop]: Abstraction has 1226 states and 1227 transitions. [2018-02-02 10:11:25,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 10:11:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1227 transitions. [2018-02-02 10:11:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2018-02-02 10:11:25,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:25,872 INFO L351 BasicCegarLoop]: trace histogram [186, 170, 169, 169, 169, 169, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:25,872 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:25,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1276924311, now seen corresponding path program 48 times [2018-02-02 10:11:25,872 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:25,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-02-02 10:11:27,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:27,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:11:27,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:27,388 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:11:27,389 INFO L182 omatonBuilderFactory]: Interpolants [52615#true, 52616#false, 52617#(= foo_~i~0 0), 52618#(<= foo_~i~0 1), 52619#(<= foo_~i~0 2), 52620#(<= foo_~i~0 3), 52621#(<= foo_~i~0 4), 52622#(<= foo_~i~0 5), 52623#(<= foo_~i~0 6), 52624#(<= foo_~i~0 7), 52625#(<= foo_~i~0 8), 52626#(<= foo_~i~0 9), 52627#(<= foo_~i~0 10), 52628#(<= foo_~i~0 11), 52629#(<= foo_~i~0 12), 52630#(<= foo_~i~0 13), 52631#(<= foo_~i~0 14), 52632#(<= foo_~i~0 15), 52633#(<= foo_~i~0 16), 52634#(and (<= 0 foo_~i~0) (<= foo_~i~0 16)), 52635#(and (<= 1 foo_~i~0) (<= foo_~i~0 17))] [2018-02-02 10:11:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-02-02 10:11:27,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:11:27,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:11:27,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:11:27,390 INFO L87 Difference]: Start difference. First operand 1226 states and 1227 transitions. Second operand 21 states. [2018-02-02 10:11:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:27,604 INFO L93 Difference]: Finished difference Result 1238 states and 1240 transitions. [2018-02-02 10:11:27,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:11:27,605 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1222 [2018-02-02 10:11:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:27,607 INFO L225 Difference]: With dead ends: 1238 [2018-02-02 10:11:27,607 INFO L226 Difference]: Without dead ends: 1238 [2018-02-02 10:11:27,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=497, Invalid=835, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:11:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-02-02 10:11:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1232. [2018-02-02 10:11:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2018-02-02 10:11:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1234 transitions. [2018-02-02 10:11:27,613 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1234 transitions. Word has length 1222 [2018-02-02 10:11:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:27,613 INFO L432 AbstractCegarLoop]: Abstraction has 1232 states and 1234 transitions. [2018-02-02 10:11:27,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:11:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1234 transitions. [2018-02-02 10:11:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-02-02 10:11:27,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:27,620 INFO L351 BasicCegarLoop]: trace histogram [187, 171, 170, 170, 170, 170, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:27,620 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2048514593, now seen corresponding path program 49 times [2018-02-02 10:11:27,620 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:27,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 18415 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-02-02 10:11:30,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:30,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 10:11:30,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:30,317 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:11:30,317 INFO L182 omatonBuilderFactory]: Interpolants [55168#(<= foo_~size (+ foo_~i~0 8)), 55169#(<= foo_~size (+ foo_~i~0 7)), 55170#(<= foo_~size (+ foo_~i~0 6)), 55171#(<= foo_~size (+ foo_~i~0 5)), 55172#(<= foo_~size (+ foo_~i~0 4)), 55173#(<= foo_~size (+ foo_~i~0 3)), 55174#(<= foo_~size (+ foo_~i~0 2)), 55175#(<= foo_~size (+ foo_~i~0 1)), 55176#(<= foo_~size foo_~i~0), 55177#(<= (+ foo_~size 1) foo_~i~0), 55138#true, 55139#false, 55140#(= main_~i~1 0), 55141#(<= main_~i~1 1), 55142#(<= main_~i~1 2), 55143#(<= main_~i~1 3), 55144#(<= main_~i~1 4), 55145#(<= main_~i~1 5), 55146#(<= main_~i~1 6), 55147#(<= main_~i~1 7), 55148#(<= main_~i~1 8), 55149#(<= main_~i~1 9), 55150#(<= main_~i~1 10), 55151#(<= main_~i~1 11), 55152#(<= main_~i~1 12), 55153#(<= main_~i~1 13), 55154#(<= main_~i~1 14), 55155#(<= main_~i~1 15), 55156#(<= main_~i~1 16), 55157#(<= |foo_#in~size| 17), 55158#(<= foo_~size 17), 55159#(<= foo_~size (+ foo_~i~0 17)), 55160#(<= foo_~size (+ foo_~i~0 16)), 55161#(<= foo_~size (+ foo_~i~0 15)), 55162#(<= foo_~size (+ foo_~i~0 14)), 55163#(<= foo_~size (+ foo_~i~0 13)), 55164#(<= foo_~size (+ foo_~i~0 12)), 55165#(<= foo_~size (+ foo_~i~0 11)), 55166#(<= foo_~size (+ foo_~i~0 10)), 55167#(<= foo_~size (+ foo_~i~0 9))] [2018-02-02 10:11:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 18415 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-02-02 10:11:30,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 10:11:30,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 10:11:30,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:11:30,319 INFO L87 Difference]: Start difference. First operand 1232 states and 1234 transitions. Second operand 40 states. [2018-02-02 10:11:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:31,274 INFO L93 Difference]: Finished difference Result 1354 states and 1357 transitions. [2018-02-02 10:11:31,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 10:11:31,274 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1228 [2018-02-02 10:11:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:31,277 INFO L225 Difference]: With dead ends: 1354 [2018-02-02 10:11:31,277 INFO L226 Difference]: Without dead ends: 1354 [2018-02-02 10:11:31,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=821, Invalid=2601, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:11:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-02-02 10:11:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-02-02 10:11:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-02-02 10:11:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1355 transitions. [2018-02-02 10:11:31,284 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1355 transitions. Word has length 1228 [2018-02-02 10:11:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:31,284 INFO L432 AbstractCegarLoop]: Abstraction has 1352 states and 1355 transitions. [2018-02-02 10:11:31,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 10:11:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1355 transitions. [2018-02-02 10:11:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1343 [2018-02-02 10:11:31,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:31,297 INFO L351 BasicCegarLoop]: trace histogram [205, 188, 187, 187, 187, 187, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:31,297 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1362556088, now seen corresponding path program 50 times [2018-02-02 10:11:31,298 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:31,359 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:11:33,790 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:11:33,793 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:11:33,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:11:33 BoogieIcfgContainer [2018-02-02 10:11:33,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:11:33,794 INFO L168 Benchmark]: Toolchain (without parser) took 52346.10 ms. Allocated memory was 404.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 362.4 MB in the beginning and 474.6 MB in the end (delta: -112.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-02-02 10:11:33,795 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:11:33,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.88 ms. Allocated memory is still 404.2 MB. Free memory was 362.4 MB in the beginning and 354.5 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:11:33,795 INFO L168 Benchmark]: Boogie Preprocessor took 23.12 ms. Allocated memory is still 404.2 MB. Free memory was 354.5 MB in the beginning and 351.9 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:11:33,795 INFO L168 Benchmark]: RCFGBuilder took 181.66 ms. Allocated memory is still 404.2 MB. Free memory was 351.9 MB in the beginning and 336.2 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:11:33,796 INFO L168 Benchmark]: TraceAbstraction took 52008.81 ms. Allocated memory was 404.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 334.9 MB in the beginning and 474.6 MB in the end (delta: -139.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-02-02 10:11:33,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.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 129.88 ms. Allocated memory is still 404.2 MB. Free memory was 362.4 MB in the beginning and 354.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.12 ms. Allocated memory is still 404.2 MB. Free memory was 354.5 MB in the beginning and 351.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 181.66 ms. Allocated memory is still 404.2 MB. Free memory was 351.9 MB in the beginning and 336.2 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52008.81 ms. Allocated memory was 404.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 334.9 MB in the beginning and 474.6 MB in the end (delta: -139.8 MB). Peak memory consumption was 1.9 GB. 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 analyzing trace of length 1343 with TraceHistMax 205, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1343 with TraceHistMax 205, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1343 with TraceHistMax 205, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 1343 with TraceHistMax 205, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 1343 with TraceHistMax 205, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 1343 with TraceHistMax 205, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 51.9s OverallTime, 59 OverallIterations, 205 TraceHistogramMax, 14.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1637 SDtfs, 4432 SDslu, 12523 SDs, 0 SdLazy, 32154 SolverSat, 682 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1411 GetRequests, 95 SyntacticMatches, 6 SemanticMatches, 1310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7649 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1352occurred in iteration=58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1160150/1174983 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 58 MinimizatonAttempts, 260 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 26.7s InterpolantComputationTime, 25808 NumberOfCodeBlocks, 25808 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 25750 ConstructedInterpolants, 0 QuantifiedInterpolants, 30754982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 6 PerfectInterpolantSequences, 1160150/1174983 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-11-33-802.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-11-33-802.csv Completed graceful shutdown