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_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 10:43:10,857 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 10:43:10,858 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 10:43:10,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 10:43:10,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 10:43:10,876 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 10:43:10,877 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 10:43:10,879 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 10:43:10,880 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 10:43:10,881 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 10:43:10,882 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 10:43:10,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 10:43:10,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 10:43:10,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 10:43:10,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 10:43:10,887 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 10:43:10,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 10:43:10,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 10:43:10,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 10:43:10,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 10:43:10,894 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 10:43:10,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 10:43:10,895 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 10:43:10,896 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 10:43:10,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 10:43:10,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 10:43:10,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 10:43:10,898 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 10:43:10,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 10:43:10,898 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 10:43:10,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 10:43:10,899 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_NoArray.epf
[2018-02-02 10:43:10,909 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 10:43:10,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 10:43:10,911 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 10:43:10,911 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 10:43:10,911 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 10:43:10,911 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 10:43:10,911 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 10:43:10,911 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 10:43:10,911 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 10:43:10,912 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 10:43:10,912 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 10:43:10,912 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 10:43:10,912 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 10:43:10,912 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 10:43:10,912 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 10:43:10,912 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 10:43:10,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 10:43:10,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 10:43:10,913 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 10:43:10,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 10:43:10,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 10:43:10,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 10:43:10,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation
[2018-02-02 10:43:10,914 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol
[2018-02-02 10:43:10,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 10:43:10,953 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 10:43:10,957 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 10:43:10,958 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 10:43:10,958 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 10:43:10,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c
[2018-02-02 10:43:11,057 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 10:43:11,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 10:43:11,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 10:43:11,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 10:43:11,066 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 10:43:11,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:43:11" (1/1) ...
[2018-02-02 10:43:11,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e0a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:43:11, skipping insertion in model container
[2018-02-02 10:43:11,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:43:11" (1/1) ...
[2018-02-02 10:43:11,084 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:43:11,098 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:43:11,181 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:43:11,194 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:43:11,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:43:11 WrapperNode
[2018-02-02 10:43:11,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 10:43:11,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 10:43:11,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 10:43:11,200 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 10:43:11,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:43:11" (1/1) ...
[2018-02-02 10:43:11,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:43:11" (1/1) ...
[2018-02-02 10:43:11,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:43:11" (1/1) ...
[2018-02-02 10:43:11,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:43:11" (1/1) ...
[2018-02-02 10:43:11,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:43:11" (1/1) ...
[2018-02-02 10:43:11,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:43:11" (1/1) ...
[2018-02-02 10:43:11,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:43:11" (1/1) ...
[2018-02-02 10:43:11,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 10:43:11,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 10:43:11,221 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 10:43:11,221 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 10:43:11,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:43:11" (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:43:11,262 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 10:43:11,263 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 10:43:11,263 INFO L136 BoogieDeclarations]: Found implementation of procedure foo
[2018-02-02 10:43:11,263 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 10:43:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-02 10:43:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-02 10:43:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 10:43:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 10:43:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 10:43:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure foo
[2018-02-02 10:43:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 10:43:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 10:43:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 10:43:11,484 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 10:43:11,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:43:11 BoogieIcfgContainer
[2018-02-02 10:43:11,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 10:43:11,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 10:43:11,485 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 10:43:11,488 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 10:43:11,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:43:11" (1/3) ...
[2018-02-02 10:43:11,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cce6f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:43:11, skipping insertion in model container
[2018-02-02 10:43:11,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:43:11" (2/3) ...
[2018-02-02 10:43:11,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cce6f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:43:11, skipping insertion in model container
[2018-02-02 10:43:11,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:43:11" (3/3) ...
[2018-02-02 10:43:11,496 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c
[2018-02-02 10:43:11,505 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-02-02 10:43:11,512 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations.
[2018-02-02 10:43:11,539 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 10:43:11,540 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 10:43:11,540 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation
[2018-02-02 10:43:11,540 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL
[2018-02-02 10:43:11,540 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 10:43:11,540 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 10:43:11,540 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 10:43:11,540 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 10:43:11,541 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 10:43:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states.
[2018-02-02 10:43:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-02-02 10:43:11,562 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:11,575 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:11,575 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:11,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1202729229, now seen corresponding path program 1 times
[2018-02-02 10:43:11,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:11,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:11,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:43:11,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:43:11,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 10:43:11,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:11,706 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:43:11,707 INFO L182 omatonBuilderFactory]: Interpolants [52#true, 53#false]
[2018-02-02 10:43:11,707 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:43:11,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-02-02 10:43:11,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-02-02 10:43:11,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-02-02 10:43:11,723 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states.
[2018-02-02 10:43:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:11,742 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions.
[2018-02-02 10:43:11,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2018-02-02 10:43:11,744 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13
[2018-02-02 10:43:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:11,753 INFO L225 Difference]: With dead ends: 49
[2018-02-02 10:43:11,753 INFO L226 Difference]: Without dead ends: 46
[2018-02-02 10:43:11,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-02-02 10:43:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2018-02-02 10:43:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46.
[2018-02-02 10:43:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states.
[2018-02-02 10:43:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions.
[2018-02-02 10:43:11,787 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13
[2018-02-02 10:43:11,787 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:11,787 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions.
[2018-02-02 10:43:11,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-02-02 10:43:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions.
[2018-02-02 10:43:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-02 10:43:11,788 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:11,788 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:11,788 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:11,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1812590093, now seen corresponding path program 1 times
[2018-02-02 10:43:11,790 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:11,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:11,837 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:43:11,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:43:11,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 10:43:11,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:11,838 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:43:11,838 INFO L182 omatonBuilderFactory]: Interpolants [149#true, 150#false, 151#(= main_~i~1 0)]
[2018-02-02 10:43:11,838 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:43:11,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 10:43:11,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 10:43:11,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 10:43:11,840 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states.
[2018-02-02 10:43:11,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:11,898 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions.
[2018-02-02 10:43:11,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 10:43:11,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2018-02-02 10:43:11,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:11,900 INFO L225 Difference]: With dead ends: 67
[2018-02-02 10:43:11,900 INFO L226 Difference]: Without dead ends: 67
[2018-02-02 10:43:11,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:43:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2018-02-02 10:43:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50.
[2018-02-02 10:43:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2018-02-02 10:43:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions.
[2018-02-02 10:43:11,908 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 14
[2018-02-02 10:43:11,908 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:11,908 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions.
[2018-02-02 10:43:11,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 10:43:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions.
[2018-02-02 10:43:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-02-02 10:43:11,908 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:11,908 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:11,909 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash -267768884, now seen corresponding path program 1 times
[2018-02-02 10:43:11,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:11,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:12,007 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:43:12,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:43:12,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:43:12,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:12,008 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:43:12,008 INFO L182 omatonBuilderFactory]: Interpolants [272#(= 0 |foo_#in~size|), 273#(and (= foo_~size 0) (= foo_~i~0 0)), 269#true, 270#false, 271#(= 0 main_~i~1)]
[2018-02-02 10:43:12,008 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:43:12,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:43:12,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:43:12,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:43:12,008 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states.
[2018-02-02 10:43:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:12,107 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions.
[2018-02-02 10:43:12,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:43:12,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2018-02-02 10:43:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:12,109 INFO L225 Difference]: With dead ends: 73
[2018-02-02 10:43:12,109 INFO L226 Difference]: Without dead ends: 73
[2018-02-02 10:43:12,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 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:43:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2018-02-02 10:43:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57.
[2018-02-02 10:43:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states.
[2018-02-02 10:43:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions.
[2018-02-02 10:43:12,115 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15
[2018-02-02 10:43:12,115 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:12,115 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions.
[2018-02-02 10:43:12,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:43:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions.
[2018-02-02 10:43:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-02 10:43:12,116 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:12,116 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:12,116 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181562, now seen corresponding path program 1 times
[2018-02-02 10:43:12,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:12,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:12,151 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:43:12,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:43:12,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 10:43:12,152 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:12,152 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:43:12,152 INFO L182 omatonBuilderFactory]: Interpolants [406#true, 407#false, 408#(= 1 (select |#valid| |main_~#b~0.base|))]
[2018-02-02 10:43:12,152 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:43:12,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 10:43:12,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 10:43:12,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 10:43:12,153 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states.
[2018-02-02 10:43:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:12,179 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions.
[2018-02-02 10:43:12,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 10:43:12,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19
[2018-02-02 10:43:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:12,182 INFO L225 Difference]: With dead ends: 55
[2018-02-02 10:43:12,183 INFO L226 Difference]: Without dead ends: 55
[2018-02-02 10:43:12,183 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:43:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2018-02-02 10:43:12,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55.
[2018-02-02 10:43:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-02-02 10:43:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions.
[2018-02-02 10:43:12,188 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19
[2018-02-02 10:43:12,188 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:12,188 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions.
[2018-02-02 10:43:12,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 10:43:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions.
[2018-02-02 10:43:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-02 10:43:12,189 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:12,189 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:12,189 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:12,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181563, now seen corresponding path program 1 times
[2018-02-02 10:43:12,190 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:12,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:43:12,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:43:12,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 10:43:12,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:12,260 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:43:12,260 INFO L182 omatonBuilderFactory]: Interpolants [519#true, 520#false, 521#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400)), 522#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (= main_~i~1 0))]
[2018-02-02 10:43:12,260 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:43:12,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:43:12,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:43:12,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:43:12,261 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states.
[2018-02-02 10:43:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:12,293 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions.
[2018-02-02 10:43:12,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 10:43:12,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19
[2018-02-02 10:43:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:12,294 INFO L225 Difference]: With dead ends: 65
[2018-02-02 10:43:12,294 INFO L226 Difference]: Without dead ends: 65
[2018-02-02 10:43:12,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:43:12,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2018-02-02 10:43:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58.
[2018-02-02 10:43:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states.
[2018-02-02 10:43:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions.
[2018-02-02 10:43:12,297 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19
[2018-02-02 10:43:12,297 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:12,297 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions.
[2018-02-02 10:43:12,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:43:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions.
[2018-02-02 10:43:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 10:43:12,297 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:12,298 INFO L351 BasicCegarLoop]: trace histogram [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:43:12,298 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2060273317, now seen corresponding path program 1 times
[2018-02-02 10:43:12,298 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:12,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:43:12,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:43:12,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:43:12,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:12,346 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:43:12,346 INFO L182 omatonBuilderFactory]: Interpolants [646#true, 647#false, 648#(<= |foo_#in~size| |foo_#in~n|), 649#(and (= foo_~i~0 0) (<= foo_~size foo_~n)), 650#(and (= foo_~i~0 0) (<= (+ foo_~i~0 1) foo_~n))]
[2018-02-02 10:43:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:43:12,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:43:12,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:43:12,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:43:12,347 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states.
[2018-02-02 10:43:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:12,389 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions.
[2018-02-02 10:43:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:43:12,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28
[2018-02-02 10:43:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:12,391 INFO L225 Difference]: With dead ends: 69
[2018-02-02 10:43:12,391 INFO L226 Difference]: Without dead ends: 69
[2018-02-02 10:43:12,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:43:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2018-02-02 10:43:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61.
[2018-02-02 10:43:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2018-02-02 10:43:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions.
[2018-02-02 10:43:12,395 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28
[2018-02-02 10:43:12,396 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:12,396 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions.
[2018-02-02 10:43:12,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:43:12,396 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions.
[2018-02-02 10:43:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-02 10:43:12,397 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:12,397 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:12,397 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:12,397 INFO L82 PathProgramCache]: Analyzing trace with hash 556036660, now seen corresponding path program 1 times
[2018-02-02 10:43:12,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:12,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:43:12,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:12,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-02-02 10:43:12,525 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:12,526 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:43:12,526 INFO L182 omatonBuilderFactory]: Interpolants [785#true, 786#false, 787#(and (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 788#(and (<= main_~i~1 99) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 789#(and (<= main_~i~1 100) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 790#(and (= 0 |foo_#in~b.offset|) (<= |foo_#in~n| 100) (= 400 (select |#length| |foo_#in~b.base|))), 791#(and (= (select |#length| foo_~b.base) 400) (<= foo_~n 100) (= foo_~b.offset 0)), 792#(and (<= foo_~i~0 99) (= (select |#length| foo_~b.base) 400) (<= 0 foo_~i~0) (= foo_~b.offset 0))]
[2018-02-02 10:43:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:43:12,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 10:43:12,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 10:43:12,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:43:12,527 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states.
[2018-02-02 10:43:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:12,626 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions.
[2018-02-02 10:43:12,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 10:43:12,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29
[2018-02-02 10:43:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:12,626 INFO L225 Difference]: With dead ends: 63
[2018-02-02 10:43:12,626 INFO L226 Difference]: Without dead ends: 63
[2018-02-02 10:43:12,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:43:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2018-02-02 10:43:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60.
[2018-02-02 10:43:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states.
[2018-02-02 10:43:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions.
[2018-02-02 10:43:12,629 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29
[2018-02-02 10:43:12,629 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:12,629 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions.
[2018-02-02 10:43:12,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 10:43:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions.
[2018-02-02 10:43:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-02 10:43:12,630 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:12,630 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:12,630 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:12,630 INFO L82 PathProgramCache]: Analyzing trace with hash 556036659, now seen corresponding path program 1 times
[2018-02-02 10:43:12,631 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:12,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:43:12,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:43:12,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:43:12,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:12,678 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:43:12,678 INFO L182 omatonBuilderFactory]: Interpolants [922#true, 923#false, 924#(= 1 (select |#valid| |main_~#b~0.base|)), 925#(= 1 (select |#valid| |foo_#in~b.base|)), 926#(= 1 (select |#valid| foo_~b.base))]
[2018-02-02 10:43:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:43:12,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:43:12,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:43:12,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:43:12,679 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states.
[2018-02-02 10:43:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:12,713 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions.
[2018-02-02 10:43:12,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:43:12,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29
[2018-02-02 10:43:12,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:12,715 INFO L225 Difference]: With dead ends: 59
[2018-02-02 10:43:12,715 INFO L226 Difference]: Without dead ends: 59
[2018-02-02 10:43:12,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:43:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2018-02-02 10:43:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59.
[2018-02-02 10:43:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2018-02-02 10:43:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions.
[2018-02-02 10:43:12,718 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 29
[2018-02-02 10:43:12,718 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:12,722 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions.
[2018-02-02 10:43:12,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:43:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions.
[2018-02-02 10:43:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-02 10:43:12,723 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:12,723 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:12,723 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:12,723 INFO L82 PathProgramCache]: Analyzing trace with hash -848422454, now seen corresponding path program 1 times
[2018-02-02 10:43:12,724 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:12,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:43:12,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:43:12,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:43:12,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:12,826 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:43:12,826 INFO L182 omatonBuilderFactory]: Interpolants [1048#true, 1049#false, 1050#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400)), 1051#(and (= |main_~#b~0.offset| 0) (<= 0 (+ (* 4 main_~i~1) |main_~#b~0.offset|)) (= (select |#length| |main_~#b~0.base|) 400)), 1052#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (<= 4 (+ (* 4 main_~i~1) |main_~#b~0.offset|))), 1053#(and (<= main_~i~1 99) (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (<= 4 (+ (* 4 main_~i~1) |main_~#b~0.offset|)))]
[2018-02-02 10:43:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:43:12,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:43:12,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:43:12,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:43:12,827 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states.
[2018-02-02 10:43:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:12,890 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions.
[2018-02-02 10:43:12,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:43:12,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32
[2018-02-02 10:43:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:12,891 INFO L225 Difference]: With dead ends: 64
[2018-02-02 10:43:12,891 INFO L226 Difference]: Without dead ends: 64
[2018-02-02 10:43:12,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:43:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2018-02-02 10:43:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54.
[2018-02-02 10:43:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-02-02 10:43:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions.
[2018-02-02 10:43:12,895 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 32
[2018-02-02 10:43:12,895 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:12,895 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions.
[2018-02-02 10:43:12,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:43:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions.
[2018-02-02 10:43:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-02 10:43:12,896 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:12,896 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, 1]
[2018-02-02 10:43:12,896 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:12,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1529051221, now seen corresponding path program 1 times
[2018-02-02 10:43:12,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:12,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:12,934 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:43:12,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:12,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4
[2018-02-02 10:43:12,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:12,934 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:43:12,934 INFO L182 omatonBuilderFactory]: Interpolants [1172#true, 1173#false, 1174#(= main_~i~1 0), 1175#(<= main_~i~1 1)]
[2018-02-02 10:43:12,935 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:43:12,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:43:12,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:43:12,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:43:12,935 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states.
[2018-02-02 10:43:12,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:12,967 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions.
[2018-02-02 10:43:12,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 10:43:12,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32
[2018-02-02 10:43:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:12,968 INFO L225 Difference]: With dead ends: 83
[2018-02-02 10:43:12,968 INFO L226 Difference]: Without dead ends: 83
[2018-02-02 10:43:12,968 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:43:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2018-02-02 10:43:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65.
[2018-02-02 10:43:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states.
[2018-02-02 10:43:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions.
[2018-02-02 10:43:12,971 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32
[2018-02-02 10:43:12,971 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:12,972 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions.
[2018-02-02 10:43:12,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:43:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions.
[2018-02-02 10:43:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-02-02 10:43:12,972 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:12,973 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:12,973 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:12,973 INFO L82 PathProgramCache]: Analyzing trace with hash -736270445, now seen corresponding path program 1 times
[2018-02-02 10:43:12,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:12,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:43:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:43:13,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:13,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-02-02 10:43:13,058 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:13,058 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:43:13,058 INFO L182 omatonBuilderFactory]: Interpolants [1328#(<= |foo_#in~size| 1), 1329#(<= foo_~size 1), 1330#(<= foo_~size (+ foo_~i~0 1)), 1331#(<= foo_~size foo_~i~0), 1324#true, 1325#false, 1326#(= main_~i~1 0), 1327#(<= main_~i~1 1)]
[2018-02-02 10:43:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:43:13,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 10:43:13,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 10:43:13,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:43:13,059 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 8 states.
[2018-02-02 10:43:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:13,162 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions.
[2018-02-02 10:43:13,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 10:43:13,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34
[2018-02-02 10:43:13,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:13,163 INFO L225 Difference]: With dead ends: 95
[2018-02-02 10:43:13,163 INFO L226 Difference]: Without dead ends: 95
[2018-02-02 10:43:13,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:43:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2018-02-02 10:43:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78.
[2018-02-02 10:43:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states.
[2018-02-02 10:43:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions.
[2018-02-02 10:43:13,168 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 34
[2018-02-02 10:43:13,168 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:13,168 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions.
[2018-02-02 10:43:13,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 10:43:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions.
[2018-02-02 10:43:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-02-02 10:43:13,169 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:13,169 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 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:43:13,169 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash 733800956, now seen corresponding path program 2 times
[2018-02-02 10:43:13,170 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:13,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:43:13,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:13,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2018-02-02 10:43:13,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:13,204 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:43:13,205 INFO L182 omatonBuilderFactory]: Interpolants [1511#true, 1512#false, 1513#(= main_~i~1 0), 1514#(<= main_~i~1 1), 1515#(<= main_~i~1 2)]
[2018-02-02 10:43:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:43:13,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:43:13,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:43:13,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:43:13,206 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 5 states.
[2018-02-02 10:43:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:13,248 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions.
[2018-02-02 10:43:13,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:43:13,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45
[2018-02-02 10:43:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:13,249 INFO L225 Difference]: With dead ends: 112
[2018-02-02 10:43:13,249 INFO L226 Difference]: Without dead ends: 112
[2018-02-02 10:43:13,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:43:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2018-02-02 10:43:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 89.
[2018-02-02 10:43:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2018-02-02 10:43:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions.
[2018-02-02 10:43:13,254 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 45
[2018-02-02 10:43:13,254 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:13,254 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions.
[2018-02-02 10:43:13,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:43:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions.
[2018-02-02 10:43:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-02-02 10:43:13,255 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:13,255 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:13,255 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash 611219876, now seen corresponding path program 2 times
[2018-02-02 10:43:13,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:13,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-02-02 10:43:13,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:13,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-02-02 10:43:13,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:13,347 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:43:13,347 INFO L182 omatonBuilderFactory]: Interpolants [1717#true, 1718#false, 1719#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 1720#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~i~0)), 1721#(<= |foo_#in~size| 0), 1722#(<= main_~i~1 0), 1723#(<= main_~i~1 1), 1724#(<= |foo_#in~size| 1), 1725#(<= foo_~size 1), 1726#(<= foo_~size (+ foo_~i~0 1)), 1727#(<= foo_~size foo_~i~0)]
[2018-02-02 10:43:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-02-02 10:43:13,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:43:13,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:43:13,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:43:13,348 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 11 states.
[2018-02-02 10:43:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:13,484 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions.
[2018-02-02 10:43:13,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 10:43:13,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47
[2018-02-02 10:43:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:13,485 INFO L225 Difference]: With dead ends: 137
[2018-02-02 10:43:13,485 INFO L226 Difference]: Without dead ends: 137
[2018-02-02 10:43:13,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:43:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states.
[2018-02-02 10:43:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114.
[2018-02-02 10:43:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-02-02 10:43:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions.
[2018-02-02 10:43:13,490 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 47
[2018-02-02 10:43:13,491 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:13,491 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions.
[2018-02-02 10:43:13,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:43:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions.
[2018-02-02 10:43:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-02-02 10:43:13,493 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:13,493 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:13,493 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:13,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1268780948, now seen corresponding path program 3 times
[2018-02-02 10:43:13,494 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:13,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2018-02-02 10:43:13,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:13,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-02-02 10:43:13,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:13,587 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:43:13,587 INFO L182 omatonBuilderFactory]: Interpolants [1987#true, 1988#false, 1989#(<= |foo_#in~size| |foo_#in~n|), 1990#(<= foo_~size foo_~n), 1991#(and (<= 0 foo_~i~0) (<= foo_~size foo_~n)), 1992#(and (<= 1 foo_~i~0) (<= foo_~size foo_~n)), 1993#(and (<= 1 foo_~i~0) (<= (+ foo_~i~0 1) foo_~n))]
[2018-02-02 10:43:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2018-02-02 10:43:13,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 10:43:13,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 10:43:13,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:43:13,588 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 7 states.
[2018-02-02 10:43:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:13,653 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions.
[2018-02-02 10:43:13,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:43:13,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53
[2018-02-02 10:43:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:13,656 INFO L225 Difference]: With dead ends: 116
[2018-02-02 10:43:13,656 INFO L226 Difference]: Without dead ends: 116
[2018-02-02 10:43:13,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:43:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2018-02-02 10:43:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112.
[2018-02-02 10:43:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states.
[2018-02-02 10:43:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions.
[2018-02-02 10:43:13,663 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 53
[2018-02-02 10:43:13,663 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:13,663 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions.
[2018-02-02 10:43:13,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 10:43:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions.
[2018-02-02 10:43:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-02 10:43:13,665 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:13,665 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:13,665 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:13,665 INFO L82 PathProgramCache]: Analyzing trace with hash 17999059, now seen corresponding path program 1 times
[2018-02-02 10:43:13,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:13,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2018-02-02 10:43:13,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:13,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-02-02 10:43:13,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:13,716 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:43:13,716 INFO L182 omatonBuilderFactory]: Interpolants [2228#true, 2229#false, 2230#(= main_~i~1 0), 2231#(<= main_~i~1 1), 2232#(<= main_~i~1 2), 2233#(<= main_~i~1 3)]
[2018-02-02 10:43:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2018-02-02 10:43:13,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:43:13,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:43:13,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:43:13,717 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 6 states.
[2018-02-02 10:43:13,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:13,757 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions.
[2018-02-02 10:43:13,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:43:13,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64
[2018-02-02 10:43:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:13,758 INFO L225 Difference]: With dead ends: 170
[2018-02-02 10:43:13,758 INFO L226 Difference]: Without dead ends: 170
[2018-02-02 10:43:13,758 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:43:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2018-02-02 10:43:13,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 131.
[2018-02-02 10:43:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states.
[2018-02-02 10:43:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions.
[2018-02-02 10:43:13,764 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 64
[2018-02-02 10:43:13,764 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:13,764 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions.
[2018-02-02 10:43:13,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:43:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions.
[2018-02-02 10:43:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2018-02-02 10:43:13,765 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:13,765 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:13,765 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:13,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1865253668, now seen corresponding path program 2 times
[2018-02-02 10:43:13,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:13,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2018-02-02 10:43:13,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:13,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-02-02 10:43:13,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:43:13,823 INFO L182 omatonBuilderFactory]: Interpolants [2535#true, 2536#false, 2537#(= main_~i~1 0), 2538#(<= main_~i~1 1), 2539#(<= main_~i~1 2), 2540#(<= main_~i~1 3), 2541#(<= main_~i~1 4)]
[2018-02-02 10:43:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2018-02-02 10:43:13,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 10:43:13,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 10:43:13,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:43:13,824 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 7 states.
[2018-02-02 10:43:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:13,874 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions.
[2018-02-02 10:43:13,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:43:13,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77
[2018-02-02 10:43:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:13,875 INFO L225 Difference]: With dead ends: 194
[2018-02-02 10:43:13,876 INFO L226 Difference]: Without dead ends: 194
[2018-02-02 10:43:13,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:43:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states.
[2018-02-02 10:43:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150.
[2018-02-02 10:43:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states.
[2018-02-02 10:43:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions.
[2018-02-02 10:43:13,881 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 77
[2018-02-02 10:43:13,881 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:13,881 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions.
[2018-02-02 10:43:13,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 10:43:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions.
[2018-02-02 10:43:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2018-02-02 10:43:13,883 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:13,883 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:13,883 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:13,884 INFO L82 PathProgramCache]: Analyzing trace with hash 123220083, now seen corresponding path program 3 times
[2018-02-02 10:43:13,884 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:13,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2018-02-02 10:43:13,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:13,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-02-02 10:43:13,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-02-02 10:43:13,936 INFO L182 omatonBuilderFactory]: Interpolants [2886#true, 2887#false, 2888#(= main_~i~1 0), 2889#(<= main_~i~1 1), 2890#(<= main_~i~1 2), 2891#(<= main_~i~1 3), 2892#(<= main_~i~1 4), 2893#(<= main_~i~1 5)]
[2018-02-02 10:43:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2018-02-02 10:43:13,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 10:43:13,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 10:43:13,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:43:13,937 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 8 states.
[2018-02-02 10:43:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:13,998 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions.
[2018-02-02 10:43:13,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 10:43:13,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90
[2018-02-02 10:43:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:14,000 INFO L225 Difference]: With dead ends: 218
[2018-02-02 10:43:14,000 INFO L226 Difference]: Without dead ends: 218
[2018-02-02 10:43:14,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:43:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2018-02-02 10:43:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 169.
[2018-02-02 10:43:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states.
[2018-02-02 10:43:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 193 transitions.
[2018-02-02 10:43:14,006 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 193 transitions. Word has length 90
[2018-02-02 10:43:14,006 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:14,006 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 193 transitions.
[2018-02-02 10:43:14,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 10:43:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 193 transitions.
[2018-02-02 10:43:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2018-02-02 10:43:14,007 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:14,007 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:14,007 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash 404740996, now seen corresponding path program 4 times
[2018-02-02 10:43:14,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:14,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked.
[2018-02-02 10:43:14,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:14,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-02-02 10:43:14,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2018-02-02 10:43:14,077 INFO L182 omatonBuilderFactory]: Interpolants [3281#true, 3282#false, 3283#(= main_~i~1 0), 3284#(<= main_~i~1 1), 3285#(<= main_~i~1 2), 3286#(<= main_~i~1 3), 3287#(<= main_~i~1 4), 3288#(<= main_~i~1 5), 3289#(<= main_~i~1 6)]
[2018-02-02 10:43:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked.
[2018-02-02 10:43:14,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 10:43:14,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 10:43:14,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72
[2018-02-02 10:43:14,077 INFO L87 Difference]: Start difference. First operand 169 states and 193 transitions. Second operand 9 states.
[2018-02-02 10:43:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:14,146 INFO L93 Difference]: Finished difference Result 242 states and 269 transitions.
[2018-02-02 10:43:14,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 10:43:14,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103
[2018-02-02 10:43:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:14,147 INFO L225 Difference]: With dead ends: 242
[2018-02-02 10:43:14,147 INFO L226 Difference]: Without dead ends: 242
[2018-02-02 10:43:14,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72
[2018-02-02 10:43:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states.
[2018-02-02 10:43:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 188.
[2018-02-02 10:43:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states.
[2018-02-02 10:43:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 217 transitions.
[2018-02-02 10:43:14,153 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 217 transitions. Word has length 103
[2018-02-02 10:43:14,154 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:14,154 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 217 transitions.
[2018-02-02 10:43:14,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 10:43:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 217 transitions.
[2018-02-02 10:43:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2018-02-02 10:43:14,155 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:14,155 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:14,155 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:14,155 INFO L82 PathProgramCache]: Analyzing trace with hash -400526317, now seen corresponding path program 5 times
[2018-02-02 10:43:14,156 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:14,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked.
[2018-02-02 10:43:14,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:14,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-02-02 10:43:14,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2018-02-02 10:43:14,230 INFO L182 omatonBuilderFactory]: Interpolants [3728#(<= main_~i~1 6), 3729#(<= main_~i~1 7), 3720#true, 3721#false, 3722#(= main_~i~1 0), 3723#(<= main_~i~1 1), 3724#(<= main_~i~1 2), 3725#(<= main_~i~1 3), 3726#(<= main_~i~1 4), 3727#(<= main_~i~1 5)]
[2018-02-02 10:43:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked.
[2018-02-02 10:43:14,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 10:43:14,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 10:43:14,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:43:14,231 INFO L87 Difference]: Start difference. First operand 188 states and 217 transitions. Second operand 10 states.
[2018-02-02 10:43:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:14,357 INFO L93 Difference]: Finished difference Result 266 states and 297 transitions.
[2018-02-02 10:43:14,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-02 10:43:14,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116
[2018-02-02 10:43:14,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:14,358 INFO L225 Difference]: With dead ends: 266
[2018-02-02 10:43:14,358 INFO L226 Difference]: Without dead ends: 266
[2018-02-02 10:43:14,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:43:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2018-02-02 10:43:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 207.
[2018-02-02 10:43:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states.
[2018-02-02 10:43:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions.
[2018-02-02 10:43:14,371 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 116
[2018-02-02 10:43:14,372 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:14,372 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions.
[2018-02-02 10:43:14,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 10:43:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions.
[2018-02-02 10:43:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2018-02-02 10:43:14,374 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:14,374 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:14,374 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash -222659612, now seen corresponding path program 6 times
[2018-02-02 10:43:14,375 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:14,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked.
[2018-02-02 10:43:14,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:14,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-02-02 10:43:14,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2018-02-02 10:43:14,490 INFO L182 omatonBuilderFactory]: Interpolants [4208#(<= main_~i~1 3), 4209#(<= main_~i~1 4), 4210#(<= main_~i~1 5), 4211#(<= main_~i~1 6), 4212#(<= main_~i~1 7), 4213#(<= main_~i~1 8), 4203#true, 4204#false, 4205#(= main_~i~1 0), 4206#(<= main_~i~1 1), 4207#(<= main_~i~1 2)]
[2018-02-02 10:43:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked.
[2018-02-02 10:43:14,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:43:14,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:43:14,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:43:14,491 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand 11 states.
[2018-02-02 10:43:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:14,592 INFO L93 Difference]: Finished difference Result 290 states and 325 transitions.
[2018-02-02 10:43:14,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 10:43:14,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129
[2018-02-02 10:43:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:14,593 INFO L225 Difference]: With dead ends: 290
[2018-02-02 10:43:14,593 INFO L226 Difference]: Without dead ends: 290
[2018-02-02 10:43:14,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:43:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states.
[2018-02-02 10:43:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 226.
[2018-02-02 10:43:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states.
[2018-02-02 10:43:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 265 transitions.
[2018-02-02 10:43:14,598 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 265 transitions. Word has length 129
[2018-02-02 10:43:14,598 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:14,599 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 265 transitions.
[2018-02-02 10:43:14,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:43:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 265 transitions.
[2018-02-02 10:43:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2018-02-02 10:43:14,600 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:14,600 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:14,601 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:14,601 INFO L82 PathProgramCache]: Analyzing trace with hash -386568269, now seen corresponding path program 7 times
[2018-02-02 10:43:14,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:14,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked.
[2018-02-02 10:43:14,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:14,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-02-02 10:43:14,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked.
[2018-02-02 10:43:14,693 INFO L182 omatonBuilderFactory]: Interpolants [4736#(<= main_~i~1 4), 4737#(<= main_~i~1 5), 4738#(<= main_~i~1 6), 4739#(<= main_~i~1 7), 4740#(<= main_~i~1 8), 4741#(<= main_~i~1 9), 4730#true, 4731#false, 4732#(= main_~i~1 0), 4733#(<= main_~i~1 1), 4734#(<= main_~i~1 2), 4735#(<= main_~i~1 3)]
[2018-02-02 10:43:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked.
[2018-02-02 10:43:14,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-02 10:43:14,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-02 10:43:14,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:43:14,694 INFO L87 Difference]: Start difference. First operand 226 states and 265 transitions. Second operand 12 states.
[2018-02-02 10:43:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:14,820 INFO L93 Difference]: Finished difference Result 314 states and 353 transitions.
[2018-02-02 10:43:14,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-02-02 10:43:14,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 142
[2018-02-02 10:43:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:14,822 INFO L225 Difference]: With dead ends: 314
[2018-02-02 10:43:14,822 INFO L226 Difference]: Without dead ends: 314
[2018-02-02 10:43:14,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:43:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states.
[2018-02-02 10:43:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245.
[2018-02-02 10:43:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states.
[2018-02-02 10:43:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 289 transitions.
[2018-02-02 10:43:14,829 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 289 transitions. Word has length 142
[2018-02-02 10:43:14,830 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:14,830 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 289 transitions.
[2018-02-02 10:43:14,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-02 10:43:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 289 transitions.
[2018-02-02 10:43:14,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2018-02-02 10:43:14,832 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:14,832 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:14,832 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1984732092, now seen corresponding path program 8 times
[2018-02-02 10:43:14,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:14,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked.
[2018-02-02 10:43:14,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:14,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2018-02-02 10:43:14,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked.
[2018-02-02 10:43:14,992 INFO L182 omatonBuilderFactory]: Interpolants [5312#(<= main_~i~1 9), 5313#(<= main_~i~1 10), 5301#true, 5302#false, 5303#(= main_~i~1 0), 5304#(<= main_~i~1 1), 5305#(<= main_~i~1 2), 5306#(<= main_~i~1 3), 5307#(<= main_~i~1 4), 5308#(<= main_~i~1 5), 5309#(<= main_~i~1 6), 5310#(<= main_~i~1 7), 5311#(<= main_~i~1 8)]
[2018-02-02 10:43:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked.
[2018-02-02 10:43:14,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 10:43:14,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 10:43:14,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:43:14,993 INFO L87 Difference]: Start difference. First operand 245 states and 289 transitions. Second operand 13 states.
[2018-02-02 10:43:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:15,119 INFO L93 Difference]: Finished difference Result 338 states and 381 transitions.
[2018-02-02 10:43:15,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-02 10:43:15,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155
[2018-02-02 10:43:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:15,120 INFO L225 Difference]: With dead ends: 338
[2018-02-02 10:43:15,120 INFO L226 Difference]: Without dead ends: 338
[2018-02-02 10:43:15,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:43:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states.
[2018-02-02 10:43:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 264.
[2018-02-02 10:43:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states.
[2018-02-02 10:43:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions.
[2018-02-02 10:43:15,125 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 155
[2018-02-02 10:43:15,125 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:15,125 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions.
[2018-02-02 10:43:15,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 10:43:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions.
[2018-02-02 10:43:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2018-02-02 10:43:15,126 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:15,126 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:15,126 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:15,126 INFO L82 PathProgramCache]: Analyzing trace with hash 383853395, now seen corresponding path program 9 times
[2018-02-02 10:43:15,127 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:15,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked.
[2018-02-02 10:43:15,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:15,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2018-02-02 10:43:15,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked.
[2018-02-02 10:43:15,262 INFO L182 omatonBuilderFactory]: Interpolants [5920#(<= main_~i~1 2), 5921#(<= main_~i~1 3), 5922#(<= main_~i~1 4), 5923#(<= main_~i~1 5), 5924#(<= main_~i~1 6), 5925#(<= main_~i~1 7), 5926#(<= main_~i~1 8), 5927#(<= main_~i~1 9), 5928#(<= main_~i~1 10), 5929#(<= main_~i~1 11), 5916#true, 5917#false, 5918#(= main_~i~1 0), 5919#(<= main_~i~1 1)]
[2018-02-02 10:43:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked.
[2018-02-02 10:43:15,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-02 10:43:15,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-02 10:43:15,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:43:15,263 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand 14 states.
[2018-02-02 10:43:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:15,455 INFO L93 Difference]: Finished difference Result 362 states and 409 transitions.
[2018-02-02 10:43:15,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-02 10:43:15,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 168
[2018-02-02 10:43:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:15,457 INFO L225 Difference]: With dead ends: 362
[2018-02-02 10:43:15,457 INFO L226 Difference]: Without dead ends: 362
[2018-02-02 10:43:15,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:43:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states.
[2018-02-02 10:43:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 283.
[2018-02-02 10:43:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states.
[2018-02-02 10:43:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 337 transitions.
[2018-02-02 10:43:15,465 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 337 transitions. Word has length 168
[2018-02-02 10:43:15,465 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:15,465 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 337 transitions.
[2018-02-02 10:43:15,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-02 10:43:15,465 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 337 transitions.
[2018-02-02 10:43:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2018-02-02 10:43:15,468 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:15,468 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:15,468 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:15,469 INFO L82 PathProgramCache]: Analyzing trace with hash -801074012, now seen corresponding path program 10 times
[2018-02-02 10:43:15,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:15,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2018-02-02 10:43:15,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:15,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2018-02-02 10:43:15,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked.
[2018-02-02 10:43:15,641 INFO L182 omatonBuilderFactory]: Interpolants [6575#true, 6576#false, 6577#(= main_~i~1 0), 6578#(<= main_~i~1 1), 6579#(<= main_~i~1 2), 6580#(<= main_~i~1 3), 6581#(<= main_~i~1 4), 6582#(<= main_~i~1 5), 6583#(<= main_~i~1 6), 6584#(<= main_~i~1 7), 6585#(<= main_~i~1 8), 6586#(<= main_~i~1 9), 6587#(<= main_~i~1 10), 6588#(<= main_~i~1 11), 6589#(<= main_~i~1 12)]
[2018-02-02 10:43:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2018-02-02 10:43:15,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 10:43:15,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 10:43:15,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:43:15,642 INFO L87 Difference]: Start difference. First operand 283 states and 337 transitions. Second operand 15 states.
[2018-02-02 10:43:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:15,806 INFO L93 Difference]: Finished difference Result 386 states and 437 transitions.
[2018-02-02 10:43:15,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-02 10:43:15,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 181
[2018-02-02 10:43:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:15,807 INFO L225 Difference]: With dead ends: 386
[2018-02-02 10:43:15,808 INFO L226 Difference]: Without dead ends: 386
[2018-02-02 10:43:15,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:43:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states.
[2018-02-02 10:43:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 302.
[2018-02-02 10:43:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states.
[2018-02-02 10:43:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 361 transitions.
[2018-02-02 10:43:15,812 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 361 transitions. Word has length 181
[2018-02-02 10:43:15,813 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:15,813 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 361 transitions.
[2018-02-02 10:43:15,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 10:43:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 361 transitions.
[2018-02-02 10:43:15,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2018-02-02 10:43:15,814 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:15,814 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:15,814 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:15,814 INFO L82 PathProgramCache]: Analyzing trace with hash -429027597, now seen corresponding path program 11 times
[2018-02-02 10:43:15,815 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:15,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked.
[2018-02-02 10:43:16,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:16,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2018-02-02 10:43:16,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked.
[2018-02-02 10:43:16,011 INFO L182 omatonBuilderFactory]: Interpolants [7278#true, 7279#false, 7280#(= main_~i~1 0), 7281#(<= main_~i~1 1), 7282#(<= main_~i~1 2), 7283#(<= main_~i~1 3), 7284#(<= main_~i~1 4), 7285#(<= main_~i~1 5), 7286#(<= main_~i~1 6), 7287#(<= main_~i~1 7), 7288#(<= main_~i~1 8), 7289#(<= main_~i~1 9), 7290#(<= main_~i~1 10), 7291#(<= main_~i~1 11), 7292#(<= main_~i~1 12), 7293#(<= main_~i~1 13)]
[2018-02-02 10:43:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked.
[2018-02-02 10:43:16,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:43:16,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:43:16,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:43:16,012 INFO L87 Difference]: Start difference. First operand 302 states and 361 transitions. Second operand 16 states.
[2018-02-02 10:43:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:16,192 INFO L93 Difference]: Finished difference Result 410 states and 465 transitions.
[2018-02-02 10:43:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 10:43:16,192 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 194
[2018-02-02 10:43:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:16,194 INFO L225 Difference]: With dead ends: 410
[2018-02-02 10:43:16,194 INFO L226 Difference]: Without dead ends: 410
[2018-02-02 10:43:16,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:43:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states.
[2018-02-02 10:43:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 321.
[2018-02-02 10:43:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states.
[2018-02-02 10:43:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 385 transitions.
[2018-02-02 10:43:16,202 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 385 transitions. Word has length 194
[2018-02-02 10:43:16,203 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:16,203 INFO L432 AbstractCegarLoop]: Abstraction has 321 states and 385 transitions.
[2018-02-02 10:43:16,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:43:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 385 transitions.
[2018-02-02 10:43:16,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208
[2018-02-02 10:43:16,204 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:16,204 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:16,205 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:16,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2112353020, now seen corresponding path program 12 times
[2018-02-02 10:43:16,205 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:16,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked.
[2018-02-02 10:43:16,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:16,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17
[2018-02-02 10:43:16,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked.
[2018-02-02 10:43:16,427 INFO L182 omatonBuilderFactory]: Interpolants [8032#(<= main_~i~1 5), 8033#(<= main_~i~1 6), 8034#(<= main_~i~1 7), 8035#(<= main_~i~1 8), 8036#(<= main_~i~1 9), 8037#(<= main_~i~1 10), 8038#(<= main_~i~1 11), 8039#(<= main_~i~1 12), 8040#(<= main_~i~1 13), 8041#(<= main_~i~1 14), 8025#true, 8026#false, 8027#(= main_~i~1 0), 8028#(<= main_~i~1 1), 8029#(<= main_~i~1 2), 8030#(<= main_~i~1 3), 8031#(<= main_~i~1 4)]
[2018-02-02 10:43:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked.
[2018-02-02 10:43:16,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-02 10:43:16,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-02 10:43:16,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:43:16,428 INFO L87 Difference]: Start difference. First operand 321 states and 385 transitions. Second operand 17 states.
[2018-02-02 10:43:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:16,601 INFO L93 Difference]: Finished difference Result 434 states and 493 transitions.
[2018-02-02 10:43:16,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-02-02 10:43:16,602 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 207
[2018-02-02 10:43:16,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:16,604 INFO L225 Difference]: With dead ends: 434
[2018-02-02 10:43:16,604 INFO L226 Difference]: Without dead ends: 434
[2018-02-02 10:43:16,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:43:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states.
[2018-02-02 10:43:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 340.
[2018-02-02 10:43:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states.
[2018-02-02 10:43:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 409 transitions.
[2018-02-02 10:43:16,613 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 409 transitions. Word has length 207
[2018-02-02 10:43:16,614 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:16,614 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 409 transitions.
[2018-02-02 10:43:16,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-02 10:43:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 409 transitions.
[2018-02-02 10:43:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221
[2018-02-02 10:43:16,618 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:16,618 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:16,618 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash -744181101, now seen corresponding path program 13 times
[2018-02-02 10:43:16,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:16,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked.
[2018-02-02 10:43:16,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:16,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:43:16,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked.
[2018-02-02 10:43:16,888 INFO L182 omatonBuilderFactory]: Interpolants [8832#(<= main_~i~1 14), 8833#(<= main_~i~1 15), 8816#true, 8817#false, 8818#(= main_~i~1 0), 8819#(<= main_~i~1 1), 8820#(<= main_~i~1 2), 8821#(<= main_~i~1 3), 8822#(<= main_~i~1 4), 8823#(<= main_~i~1 5), 8824#(<= main_~i~1 6), 8825#(<= main_~i~1 7), 8826#(<= main_~i~1 8), 8827#(<= main_~i~1 9), 8828#(<= main_~i~1 10), 8829#(<= main_~i~1 11), 8830#(<= main_~i~1 12), 8831#(<= main_~i~1 13)]
[2018-02-02 10:43:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked.
[2018-02-02 10:43:16,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-02 10:43:16,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-02 10:43:16,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:43:16,889 INFO L87 Difference]: Start difference. First operand 340 states and 409 transitions. Second operand 18 states.
[2018-02-02 10:43:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:17,099 INFO L93 Difference]: Finished difference Result 458 states and 521 transitions.
[2018-02-02 10:43:17,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-02 10:43:17,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 220
[2018-02-02 10:43:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:17,102 INFO L225 Difference]: With dead ends: 458
[2018-02-02 10:43:17,102 INFO L226 Difference]: Without dead ends: 458
[2018-02-02 10:43:17,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:43:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states.
[2018-02-02 10:43:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 359.
[2018-02-02 10:43:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states.
[2018-02-02 10:43:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 433 transitions.
[2018-02-02 10:43:17,112 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 433 transitions. Word has length 220
[2018-02-02 10:43:17,112 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:17,112 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 433 transitions.
[2018-02-02 10:43:17,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-02 10:43:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 433 transitions.
[2018-02-02 10:43:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2018-02-02 10:43:17,115 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:17,115 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:17,115 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:17,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2089824924, now seen corresponding path program 14 times
[2018-02-02 10:43:17,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:17,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked.
[2018-02-02 10:43:17,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:17,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:43:17,439 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked.
[2018-02-02 10:43:17,440 INFO L182 omatonBuilderFactory]: Interpolants [9664#(<= main_~i~1 11), 9665#(<= main_~i~1 12), 9666#(<= main_~i~1 13), 9667#(<= main_~i~1 14), 9668#(<= main_~i~1 15), 9669#(<= main_~i~1 16), 9651#true, 9652#false, 9653#(= main_~i~1 0), 9654#(<= main_~i~1 1), 9655#(<= main_~i~1 2), 9656#(<= main_~i~1 3), 9657#(<= main_~i~1 4), 9658#(<= main_~i~1 5), 9659#(<= main_~i~1 6), 9660#(<= main_~i~1 7), 9661#(<= main_~i~1 8), 9662#(<= main_~i~1 9), 9663#(<= main_~i~1 10)]
[2018-02-02 10:43:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked.
[2018-02-02 10:43:17,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:43:17,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:43:17,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:43:17,441 INFO L87 Difference]: Start difference. First operand 359 states and 433 transitions. Second operand 19 states.
[2018-02-02 10:43:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:17,645 INFO L93 Difference]: Finished difference Result 482 states and 549 transitions.
[2018-02-02 10:43:17,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-02 10:43:17,646 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 233
[2018-02-02 10:43:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:17,648 INFO L225 Difference]: With dead ends: 482
[2018-02-02 10:43:17,648 INFO L226 Difference]: Without dead ends: 482
[2018-02-02 10:43:17,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:43:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states.
[2018-02-02 10:43:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378.
[2018-02-02 10:43:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states.
[2018-02-02 10:43:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 457 transitions.
[2018-02-02 10:43:17,658 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 457 transitions. Word has length 233
[2018-02-02 10:43:17,659 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:17,659 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 457 transitions.
[2018-02-02 10:43:17,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:43:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 457 transitions.
[2018-02-02 10:43:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2018-02-02 10:43:17,661 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:17,661 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:17,661 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:17,662 INFO L82 PathProgramCache]: Analyzing trace with hash 34639411, now seen corresponding path program 15 times
[2018-02-02 10:43:17,662 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:17,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked.
[2018-02-02 10:43:17,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:17,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20
[2018-02-02 10:43:17,955 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked.
[2018-02-02 10:43:17,956 INFO L182 omatonBuilderFactory]: Interpolants [10530#true, 10531#false, 10532#(= main_~i~1 0), 10533#(<= main_~i~1 1), 10534#(<= main_~i~1 2), 10535#(<= main_~i~1 3), 10536#(<= main_~i~1 4), 10537#(<= main_~i~1 5), 10538#(<= main_~i~1 6), 10539#(<= main_~i~1 7), 10540#(<= main_~i~1 8), 10541#(<= main_~i~1 9), 10542#(<= main_~i~1 10), 10543#(<= main_~i~1 11), 10544#(<= main_~i~1 12), 10545#(<= main_~i~1 13), 10546#(<= main_~i~1 14), 10547#(<= main_~i~1 15), 10548#(<= main_~i~1 16), 10549#(<= main_~i~1 17)]
[2018-02-02 10:43:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked.
[2018-02-02 10:43:17,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 10:43:17,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 10:43:17,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:43:17,957 INFO L87 Difference]: Start difference. First operand 378 states and 457 transitions. Second operand 20 states.
[2018-02-02 10:43:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:18,224 INFO L93 Difference]: Finished difference Result 506 states and 577 transitions.
[2018-02-02 10:43:18,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-02 10:43:18,225 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 246
[2018-02-02 10:43:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:18,226 INFO L225 Difference]: With dead ends: 506
[2018-02-02 10:43:18,226 INFO L226 Difference]: Without dead ends: 506
[2018-02-02 10:43:18,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380
[2018-02-02 10:43:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states.
[2018-02-02 10:43:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 397.
[2018-02-02 10:43:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states.
[2018-02-02 10:43:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 481 transitions.
[2018-02-02 10:43:18,233 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 481 transitions. Word has length 246
[2018-02-02 10:43:18,233 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:18,233 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 481 transitions.
[2018-02-02 10:43:18,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 10:43:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 481 transitions.
[2018-02-02 10:43:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260
[2018-02-02 10:43:18,235 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:18,235 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:18,235 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1090377156, now seen corresponding path program 16 times
[2018-02-02 10:43:18,235 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:18,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked.
[2018-02-02 10:43:18,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:18,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21
[2018-02-02 10:43:18,525 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked.
[2018-02-02 10:43:18,526 INFO L182 omatonBuilderFactory]: Interpolants [11456#(<= main_~i~1 1), 11457#(<= main_~i~1 2), 11458#(<= main_~i~1 3), 11459#(<= main_~i~1 4), 11460#(<= main_~i~1 5), 11461#(<= main_~i~1 6), 11462#(<= main_~i~1 7), 11463#(<= main_~i~1 8), 11464#(<= main_~i~1 9), 11465#(<= main_~i~1 10), 11466#(<= main_~i~1 11), 11467#(<= main_~i~1 12), 11468#(<= main_~i~1 13), 11469#(<= main_~i~1 14), 11470#(<= main_~i~1 15), 11471#(<= main_~i~1 16), 11472#(<= main_~i~1 17), 11473#(<= main_~i~1 18), 11453#true, 11454#false, 11455#(= main_~i~1 0)]
[2018-02-02 10:43:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked.
[2018-02-02 10:43:18,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-02 10:43:18,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-02 10:43:18,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420
[2018-02-02 10:43:18,528 INFO L87 Difference]: Start difference. First operand 397 states and 481 transitions. Second operand 21 states.
[2018-02-02 10:43:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:18,725 INFO L93 Difference]: Finished difference Result 530 states and 605 transitions.
[2018-02-02 10:43:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-02-02 10:43:18,726 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 259
[2018-02-02 10:43:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:18,728 INFO L225 Difference]: With dead ends: 530
[2018-02-02 10:43:18,728 INFO L226 Difference]: Without dead ends: 530
[2018-02-02 10:43:18,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420
[2018-02-02 10:43:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states.
[2018-02-02 10:43:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 416.
[2018-02-02 10:43:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states.
[2018-02-02 10:43:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 505 transitions.
[2018-02-02 10:43:18,738 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 505 transitions. Word has length 259
[2018-02-02 10:43:18,739 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:18,739 INFO L432 AbstractCegarLoop]: Abstraction has 416 states and 505 transitions.
[2018-02-02 10:43:18,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-02 10:43:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 505 transitions.
[2018-02-02 10:43:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273
[2018-02-02 10:43:18,742 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:18,742 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:18,742 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:18,742 INFO L82 PathProgramCache]: Analyzing trace with hash -591715885, now seen corresponding path program 17 times
[2018-02-02 10:43:18,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:18,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked.
[2018-02-02 10:43:19,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:19,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22
[2018-02-02 10:43:19,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked.
[2018-02-02 10:43:19,119 INFO L182 omatonBuilderFactory]: Interpolants [12420#true, 12421#false, 12422#(= main_~i~1 0), 12423#(<= main_~i~1 1), 12424#(<= main_~i~1 2), 12425#(<= main_~i~1 3), 12426#(<= main_~i~1 4), 12427#(<= main_~i~1 5), 12428#(<= main_~i~1 6), 12429#(<= main_~i~1 7), 12430#(<= main_~i~1 8), 12431#(<= main_~i~1 9), 12432#(<= main_~i~1 10), 12433#(<= main_~i~1 11), 12434#(<= main_~i~1 12), 12435#(<= main_~i~1 13), 12436#(<= main_~i~1 14), 12437#(<= main_~i~1 15), 12438#(<= main_~i~1 16), 12439#(<= main_~i~1 17), 12440#(<= main_~i~1 18), 12441#(<= main_~i~1 19)]
[2018-02-02 10:43:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked.
[2018-02-02 10:43:19,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-02-02 10:43:19,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-02-02 10:43:19,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462
[2018-02-02 10:43:19,121 INFO L87 Difference]: Start difference. First operand 416 states and 505 transitions. Second operand 22 states.
[2018-02-02 10:43:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:19,364 INFO L93 Difference]: Finished difference Result 554 states and 633 transitions.
[2018-02-02 10:43:19,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-02 10:43:19,364 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 272
[2018-02-02 10:43:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:19,366 INFO L225 Difference]: With dead ends: 554
[2018-02-02 10:43:19,366 INFO L226 Difference]: Without dead ends: 554
[2018-02-02 10:43:19,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462
[2018-02-02 10:43:19,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states.
[2018-02-02 10:43:19,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 435.
[2018-02-02 10:43:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states.
[2018-02-02 10:43:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 529 transitions.
[2018-02-02 10:43:19,376 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 529 transitions. Word has length 272
[2018-02-02 10:43:19,376 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:19,376 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 529 transitions.
[2018-02-02 10:43:19,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-02-02 10:43:19,377 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 529 transitions.
[2018-02-02 10:43:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286
[2018-02-02 10:43:19,379 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:19,379 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:43:19,379 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:19,380 INFO L82 PathProgramCache]: Analyzing trace with hash 267920932, now seen corresponding path program 18 times
[2018-02-02 10:43:19,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:19,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked.
[2018-02-02 10:43:19,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:19,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23
[2018-02-02 10:43:19,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked.
[2018-02-02 10:43:19,751 INFO L182 omatonBuilderFactory]: Interpolants [13440#(<= main_~i~1 7), 13441#(<= main_~i~1 8), 13442#(<= main_~i~1 9), 13443#(<= main_~i~1 10), 13444#(<= main_~i~1 11), 13445#(<= main_~i~1 12), 13446#(<= main_~i~1 13), 13447#(<= main_~i~1 14), 13448#(<= main_~i~1 15), 13449#(<= main_~i~1 16), 13450#(<= main_~i~1 17), 13451#(<= main_~i~1 18), 13452#(<= main_~i~1 19), 13453#(<= main_~i~1 20), 13431#true, 13432#false, 13433#(= main_~i~1 0), 13434#(<= main_~i~1 1), 13435#(<= main_~i~1 2), 13436#(<= main_~i~1 3), 13437#(<= main_~i~1 4), 13438#(<= main_~i~1 5), 13439#(<= main_~i~1 6)]
[2018-02-02 10:43:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked.
[2018-02-02 10:43:19,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-02 10:43:19,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-02 10:43:19,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506
[2018-02-02 10:43:19,752 INFO L87 Difference]: Start difference. First operand 435 states and 529 transitions. Second operand 23 states.
[2018-02-02 10:43:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:19,933 INFO L93 Difference]: Finished difference Result 578 states and 661 transitions.
[2018-02-02 10:43:19,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:43:19,934 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 285
[2018-02-02 10:43:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:19,936 INFO L225 Difference]: With dead ends: 578
[2018-02-02 10:43:19,936 INFO L226 Difference]: Without dead ends: 578
[2018-02-02 10:43:19,937 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506
[2018-02-02 10:43:19,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states.
[2018-02-02 10:43:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 454.
[2018-02-02 10:43:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states.
[2018-02-02 10:43:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 553 transitions.
[2018-02-02 10:43:19,946 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 553 transitions. Word has length 285
[2018-02-02 10:43:19,947 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:19,947 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 553 transitions.
[2018-02-02 10:43:19,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-02 10:43:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 553 transitions.
[2018-02-02 10:43:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299
[2018-02-02 10:43:19,950 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:19,950 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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:43:19,950 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1238471309, now seen corresponding path program 19 times
[2018-02-02 10:43:19,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:19,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked.
[2018-02-02 10:43:20,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:20,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24
[2018-02-02 10:43:20,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked.
[2018-02-02 10:43:20,356 INFO L182 omatonBuilderFactory]: Interpolants [14496#(<= main_~i~1 8), 14497#(<= main_~i~1 9), 14498#(<= main_~i~1 10), 14499#(<= main_~i~1 11), 14500#(<= main_~i~1 12), 14501#(<= main_~i~1 13), 14502#(<= main_~i~1 14), 14503#(<= main_~i~1 15), 14504#(<= main_~i~1 16), 14505#(<= main_~i~1 17), 14506#(<= main_~i~1 18), 14507#(<= main_~i~1 19), 14508#(<= main_~i~1 20), 14509#(<= main_~i~1 21), 14486#true, 14487#false, 14488#(= main_~i~1 0), 14489#(<= main_~i~1 1), 14490#(<= main_~i~1 2), 14491#(<= main_~i~1 3), 14492#(<= main_~i~1 4), 14493#(<= main_~i~1 5), 14494#(<= main_~i~1 6), 14495#(<= main_~i~1 7)]
[2018-02-02 10:43:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked.
[2018-02-02 10:43:20,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-02 10:43:20,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-02 10:43:20,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:43:20,358 INFO L87 Difference]: Start difference. First operand 454 states and 553 transitions. Second operand 24 states.
[2018-02-02 10:43:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:20,586 INFO L93 Difference]: Finished difference Result 602 states and 689 transitions.
[2018-02-02 10:43:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-02-02 10:43:20,586 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 298
[2018-02-02 10:43:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:20,588 INFO L225 Difference]: With dead ends: 602
[2018-02-02 10:43:20,588 INFO L226 Difference]: Without dead ends: 602
[2018-02-02 10:43:20,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:43:20,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states.
[2018-02-02 10:43:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 473.
[2018-02-02 10:43:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states.
[2018-02-02 10:43:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 577 transitions.
[2018-02-02 10:43:20,598 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 577 transitions. Word has length 298
[2018-02-02 10:43:20,599 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:20,599 INFO L432 AbstractCegarLoop]: Abstraction has 473 states and 577 transitions.
[2018-02-02 10:43:20,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-02 10:43:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 577 transitions.
[2018-02-02 10:43:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312
[2018-02-02 10:43:20,601 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:20,602 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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:43:20,602 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1911243132, now seen corresponding path program 20 times
[2018-02-02 10:43:20,603 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:20,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3091 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked.
[2018-02-02 10:43:21,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:21,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25
[2018-02-02 10:43:21,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked.
[2018-02-02 10:43:21,048 INFO L182 omatonBuilderFactory]: Interpolants [15585#true, 15586#false, 15587#(= main_~i~1 0), 15588#(<= main_~i~1 1), 15589#(<= main_~i~1 2), 15590#(<= main_~i~1 3), 15591#(<= main_~i~1 4), 15592#(<= main_~i~1 5), 15593#(<= main_~i~1 6), 15594#(<= main_~i~1 7), 15595#(<= main_~i~1 8), 15596#(<= main_~i~1 9), 15597#(<= main_~i~1 10), 15598#(<= main_~i~1 11), 15599#(<= main_~i~1 12), 15600#(<= main_~i~1 13), 15601#(<= main_~i~1 14), 15602#(<= main_~i~1 15), 15603#(<= main_~i~1 16), 15604#(<= main_~i~1 17), 15605#(<= main_~i~1 18), 15606#(<= main_~i~1 19), 15607#(<= main_~i~1 20), 15608#(<= main_~i~1 21), 15609#(<= main_~i~1 22)]
[2018-02-02 10:43:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3091 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked.
[2018-02-02 10:43:21,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-02-02 10:43:21,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-02-02 10:43:21,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600
[2018-02-02 10:43:21,049 INFO L87 Difference]: Start difference. First operand 473 states and 577 transitions. Second operand 25 states.
[2018-02-02 10:43:21,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:21,264 INFO L93 Difference]: Finished difference Result 626 states and 717 transitions.
[2018-02-02 10:43:21,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-02-02 10:43:21,265 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 311
[2018-02-02 10:43:21,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:21,267 INFO L225 Difference]: With dead ends: 626
[2018-02-02 10:43:21,267 INFO L226 Difference]: Without dead ends: 626
[2018-02-02 10:43:21,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600
[2018-02-02 10:43:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states.
[2018-02-02 10:43:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 492.
[2018-02-02 10:43:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states.
[2018-02-02 10:43:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 601 transitions.
[2018-02-02 10:43:21,277 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 601 transitions. Word has length 311
[2018-02-02 10:43:21,277 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:21,277 INFO L432 AbstractCegarLoop]: Abstraction has 492 states and 601 transitions.
[2018-02-02 10:43:21,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-02-02 10:43:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 601 transitions.
[2018-02-02 10:43:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325
[2018-02-02 10:43:21,280 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:21,281 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 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:43:21,281 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:21,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1752461587, now seen corresponding path program 21 times
[2018-02-02 10:43:21,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:21,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked.
[2018-02-02 10:43:21,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:21,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26
[2018-02-02 10:43:21,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked.
[2018-02-02 10:43:21,773 INFO L182 omatonBuilderFactory]: Interpolants [16728#true, 16729#false, 16730#(= main_~i~1 0), 16731#(<= main_~i~1 1), 16732#(<= main_~i~1 2), 16733#(<= main_~i~1 3), 16734#(<= main_~i~1 4), 16735#(<= main_~i~1 5), 16736#(<= main_~i~1 6), 16737#(<= main_~i~1 7), 16738#(<= main_~i~1 8), 16739#(<= main_~i~1 9), 16740#(<= main_~i~1 10), 16741#(<= main_~i~1 11), 16742#(<= main_~i~1 12), 16743#(<= main_~i~1 13), 16744#(<= main_~i~1 14), 16745#(<= main_~i~1 15), 16746#(<= main_~i~1 16), 16747#(<= main_~i~1 17), 16748#(<= main_~i~1 18), 16749#(<= main_~i~1 19), 16750#(<= main_~i~1 20), 16751#(<= main_~i~1 21), 16752#(<= main_~i~1 22), 16753#(<= main_~i~1 23)]
[2018-02-02 10:43:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked.
[2018-02-02 10:43:21,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-02-02 10:43:21,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-02-02 10:43:21,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650
[2018-02-02 10:43:21,774 INFO L87 Difference]: Start difference. First operand 492 states and 601 transitions. Second operand 26 states.
[2018-02-02 10:43:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:22,057 INFO L93 Difference]: Finished difference Result 650 states and 745 transitions.
[2018-02-02 10:43:22,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-02-02 10:43:22,058 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 324
[2018-02-02 10:43:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:22,059 INFO L225 Difference]: With dead ends: 650
[2018-02-02 10:43:22,059 INFO L226 Difference]: Without dead ends: 650
[2018-02-02 10:43:22,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650
[2018-02-02 10:43:22,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states.
[2018-02-02 10:43:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 511.
[2018-02-02 10:43:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states.
[2018-02-02 10:43:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 625 transitions.
[2018-02-02 10:43:22,068 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 625 transitions. Word has length 324
[2018-02-02 10:43:22,069 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:22,069 INFO L432 AbstractCegarLoop]: Abstraction has 511 states and 625 transitions.
[2018-02-02 10:43:22,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-02-02 10:43:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 625 transitions.
[2018-02-02 10:43:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338
[2018-02-02 10:43:22,072 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:22,072 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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:43:22,072 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 25796324, now seen corresponding path program 22 times
[2018-02-02 10:43:22,073 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:22,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked.
[2018-02-02 10:43:22,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:22,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27
[2018-02-02 10:43:22,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked.
[2018-02-02 10:43:22,570 INFO L182 omatonBuilderFactory]: Interpolants [17920#(<= main_~i~1 3), 17921#(<= main_~i~1 4), 17922#(<= main_~i~1 5), 17923#(<= main_~i~1 6), 17924#(<= main_~i~1 7), 17925#(<= main_~i~1 8), 17926#(<= main_~i~1 9), 17927#(<= main_~i~1 10), 17928#(<= main_~i~1 11), 17929#(<= main_~i~1 12), 17930#(<= main_~i~1 13), 17931#(<= main_~i~1 14), 17932#(<= main_~i~1 15), 17933#(<= main_~i~1 16), 17934#(<= main_~i~1 17), 17935#(<= main_~i~1 18), 17936#(<= main_~i~1 19), 17937#(<= main_~i~1 20), 17938#(<= main_~i~1 21), 17939#(<= main_~i~1 22), 17940#(<= main_~i~1 23), 17941#(<= main_~i~1 24), 17915#true, 17916#false, 17917#(= main_~i~1 0), 17918#(<= main_~i~1 1), 17919#(<= main_~i~1 2)]
[2018-02-02 10:43:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked.
[2018-02-02 10:43:22,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-02-02 10:43:22,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-02-02 10:43:22,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702
[2018-02-02 10:43:22,571 INFO L87 Difference]: Start difference. First operand 511 states and 625 transitions. Second operand 27 states.
[2018-02-02 10:43:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:22,795 INFO L93 Difference]: Finished difference Result 674 states and 773 transitions.
[2018-02-02 10:43:22,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-02-02 10:43:22,796 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 337
[2018-02-02 10:43:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:22,797 INFO L225 Difference]: With dead ends: 674
[2018-02-02 10:43:22,797 INFO L226 Difference]: Without dead ends: 674
[2018-02-02 10:43:22,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702
[2018-02-02 10:43:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states.
[2018-02-02 10:43:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 530.
[2018-02-02 10:43:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states.
[2018-02-02 10:43:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 649 transitions.
[2018-02-02 10:43:22,807 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 649 transitions. Word has length 337
[2018-02-02 10:43:22,807 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:22,807 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 649 transitions.
[2018-02-02 10:43:22,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-02-02 10:43:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 649 transitions.
[2018-02-02 10:43:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351
[2018-02-02 10:43:22,810 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:22,811 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 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:43:22,811 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:22,811 INFO L82 PathProgramCache]: Analyzing trace with hash -183030605, now seen corresponding path program 23 times
[2018-02-02 10:43:22,812 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:22,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4000 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked.
[2018-02-02 10:43:23,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:23,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28
[2018-02-02 10:43:23,276 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1452 trivial. 0 not checked.
[2018-02-02 10:43:23,276 INFO L182 omatonBuilderFactory]: Interpolants [19146#true, 19147#false, 19148#(= main_~i~1 0), 19149#(<= main_~i~1 1), 19150#(<= main_~i~1 2), 19151#(<= main_~i~1 3), 19152#(<= main_~i~1 4), 19153#(<= main_~i~1 5), 19154#(<= main_~i~1 6), 19155#(<= main_~i~1 7), 19156#(<= main_~i~1 8), 19157#(<= main_~i~1 9), 19158#(<= main_~i~1 10), 19159#(<= main_~i~1 11), 19160#(<= main_~i~1 12), 19161#(<= main_~i~1 13), 19162#(<= main_~i~1 14), 19163#(<= main_~i~1 15), 19164#(<= main_~i~1 16), 19165#(<= main_~i~1 17), 19166#(<= main_~i~1 18), 19167#(<= main_~i~1 19), 19168#(<= main_~i~1 20), 19169#(<= main_~i~1 21), 19170#(<= main_~i~1 22), 19171#(<= main_~i~1 23), 19172#(<= main_~i~1 24), 19173#(<= main_~i~1 25)]
[2018-02-02 10:43:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4000 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked.
[2018-02-02 10:43:23,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states
[2018-02-02 10:43:23,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2018-02-02 10:43:23,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756
[2018-02-02 10:43:23,277 INFO L87 Difference]: Start difference. First operand 530 states and 649 transitions. Second operand 28 states.
[2018-02-02 10:43:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:23,584 INFO L93 Difference]: Finished difference Result 698 states and 801 transitions.
[2018-02-02 10:43:23,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-02-02 10:43:23,584 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 350
[2018-02-02 10:43:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:23,586 INFO L225 Difference]: With dead ends: 698
[2018-02-02 10:43:23,586 INFO L226 Difference]: Without dead ends: 698
[2018-02-02 10:43:23,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756
[2018-02-02 10:43:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states.
[2018-02-02 10:43:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 549.
[2018-02-02 10:43:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states.
[2018-02-02 10:43:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 673 transitions.
[2018-02-02 10:43:23,593 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 673 transitions. Word has length 350
[2018-02-02 10:43:23,594 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:23,594 INFO L432 AbstractCegarLoop]: Abstraction has 549 states and 673 transitions.
[2018-02-02 10:43:23,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states.
[2018-02-02 10:43:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 673 transitions.
[2018-02-02 10:43:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364
[2018-02-02 10:43:23,596 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:23,596 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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:43:23,597 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:23,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1190344892, now seen corresponding path program 24 times
[2018-02-02 10:43:23,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:23,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked.
[2018-02-02 10:43:24,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:24,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29
[2018-02-02 10:43:24,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1587 trivial. 0 not checked.
[2018-02-02 10:43:24,077 INFO L182 omatonBuilderFactory]: Interpolants [20421#true, 20422#false, 20423#(= main_~i~1 0), 20424#(<= main_~i~1 1), 20425#(<= main_~i~1 2), 20426#(<= main_~i~1 3), 20427#(<= main_~i~1 4), 20428#(<= main_~i~1 5), 20429#(<= main_~i~1 6), 20430#(<= main_~i~1 7), 20431#(<= main_~i~1 8), 20432#(<= main_~i~1 9), 20433#(<= main_~i~1 10), 20434#(<= main_~i~1 11), 20435#(<= main_~i~1 12), 20436#(<= main_~i~1 13), 20437#(<= main_~i~1 14), 20438#(<= main_~i~1 15), 20439#(<= main_~i~1 16), 20440#(<= main_~i~1 17), 20441#(<= main_~i~1 18), 20442#(<= main_~i~1 19), 20443#(<= main_~i~1 20), 20444#(<= main_~i~1 21), 20445#(<= main_~i~1 22), 20446#(<= main_~i~1 23), 20447#(<= main_~i~1 24), 20448#(<= main_~i~1 25), 20449#(<= main_~i~1 26)]
[2018-02-02 10:43:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked.
[2018-02-02 10:43:24,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states
[2018-02-02 10:43:24,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2018-02-02 10:43:24,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812
[2018-02-02 10:43:24,078 INFO L87 Difference]: Start difference. First operand 549 states and 673 transitions. Second operand 29 states.
[2018-02-02 10:43:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:24,408 INFO L93 Difference]: Finished difference Result 722 states and 829 transitions.
[2018-02-02 10:43:24,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-02 10:43:24,408 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 363
[2018-02-02 10:43:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:24,409 INFO L225 Difference]: With dead ends: 722
[2018-02-02 10:43:24,410 INFO L226 Difference]: Without dead ends: 722
[2018-02-02 10:43:24,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812
[2018-02-02 10:43:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states.
[2018-02-02 10:43:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 568.
[2018-02-02 10:43:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states.
[2018-02-02 10:43:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 697 transitions.
[2018-02-02 10:43:24,416 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 697 transitions. Word has length 363
[2018-02-02 10:43:24,417 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:24,417 INFO L432 AbstractCegarLoop]: Abstraction has 568 states and 697 transitions.
[2018-02-02 10:43:24,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states.
[2018-02-02 10:43:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 697 transitions.
[2018-02-02 10:43:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377
[2018-02-02 10:43:24,420 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:24,420 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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:43:24,420 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:24,420 INFO L82 PathProgramCache]: Analyzing trace with hash 622895187, now seen corresponding path program 25 times
[2018-02-02 10:43:24,421 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:24,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4671 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked.
[2018-02-02 10:43:24,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:24,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30
[2018-02-02 10:43:24,971 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1728 trivial. 0 not checked.
[2018-02-02 10:43:24,972 INFO L182 omatonBuilderFactory]: Interpolants [21760#(<= main_~i~1 18), 21761#(<= main_~i~1 19), 21762#(<= main_~i~1 20), 21763#(<= main_~i~1 21), 21764#(<= main_~i~1 22), 21765#(<= main_~i~1 23), 21766#(<= main_~i~1 24), 21767#(<= main_~i~1 25), 21768#(<= main_~i~1 26), 21769#(<= main_~i~1 27), 21740#true, 21741#false, 21742#(= main_~i~1 0), 21743#(<= main_~i~1 1), 21744#(<= main_~i~1 2), 21745#(<= main_~i~1 3), 21746#(<= main_~i~1 4), 21747#(<= main_~i~1 5), 21748#(<= main_~i~1 6), 21749#(<= main_~i~1 7), 21750#(<= main_~i~1 8), 21751#(<= main_~i~1 9), 21752#(<= main_~i~1 10), 21753#(<= main_~i~1 11), 21754#(<= main_~i~1 12), 21755#(<= main_~i~1 13), 21756#(<= main_~i~1 14), 21757#(<= main_~i~1 15), 21758#(<= main_~i~1 16), 21759#(<= main_~i~1 17)]
[2018-02-02 10:43:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4671 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked.
[2018-02-02 10:43:24,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states
[2018-02-02 10:43:24,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2018-02-02 10:43:24,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870
[2018-02-02 10:43:24,973 INFO L87 Difference]: Start difference. First operand 568 states and 697 transitions. Second operand 30 states.
[2018-02-02 10:43:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:25,278 INFO L93 Difference]: Finished difference Result 746 states and 857 transitions.
[2018-02-02 10:43:25,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-02-02 10:43:25,278 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 376
[2018-02-02 10:43:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:25,281 INFO L225 Difference]: With dead ends: 746
[2018-02-02 10:43:25,281 INFO L226 Difference]: Without dead ends: 746
[2018-02-02 10:43:25,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870
[2018-02-02 10:43:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states.
[2018-02-02 10:43:25,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 587.
[2018-02-02 10:43:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states.
[2018-02-02 10:43:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 721 transitions.
[2018-02-02 10:43:25,291 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 721 transitions. Word has length 376
[2018-02-02 10:43:25,291 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:25,292 INFO L432 AbstractCegarLoop]: Abstraction has 587 states and 721 transitions.
[2018-02-02 10:43:25,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states.
[2018-02-02 10:43:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 721 transitions.
[2018-02-02 10:43:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390
[2018-02-02 10:43:25,294 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:25,295 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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:43:25,295 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:25,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1809069988, now seen corresponding path program 26 times
[2018-02-02 10:43:25,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:25,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5026 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 2324 trivial. 0 not checked.
[2018-02-02 10:43:25,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:25,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31
[2018-02-02 10:43:25,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1875 trivial. 0 not checked.
[2018-02-02 10:43:25,872 INFO L182 omatonBuilderFactory]: Interpolants [23104#false, 23105#(= main_~i~1 0), 23106#(<= main_~i~1 1), 23107#(<= main_~i~1 2), 23108#(<= main_~i~1 3), 23109#(<= main_~i~1 4), 23110#(<= main_~i~1 5), 23111#(<= main_~i~1 6), 23112#(<= main_~i~1 7), 23113#(<= main_~i~1 8), 23114#(<= main_~i~1 9), 23115#(<= main_~i~1 10), 23116#(<= main_~i~1 11), 23117#(<= main_~i~1 12), 23118#(<= main_~i~1 13), 23119#(<= main_~i~1 14), 23120#(<= main_~i~1 15), 23121#(<= main_~i~1 16), 23122#(<= main_~i~1 17), 23123#(<= main_~i~1 18), 23124#(<= main_~i~1 19), 23125#(<= main_~i~1 20), 23126#(<= main_~i~1 21), 23127#(<= main_~i~1 22), 23128#(<= main_~i~1 23), 23129#(<= main_~i~1 24), 23130#(<= main_~i~1 25), 23131#(<= main_~i~1 26), 23132#(<= main_~i~1 27), 23133#(<= main_~i~1 28), 23103#true]
[2018-02-02 10:43:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5026 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 2324 trivial. 0 not checked.
[2018-02-02 10:43:25,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states
[2018-02-02 10:43:25,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2018-02-02 10:43:25,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930
[2018-02-02 10:43:25,874 INFO L87 Difference]: Start difference. First operand 587 states and 721 transitions. Second operand 31 states.
[2018-02-02 10:43:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:26,466 INFO L93 Difference]: Finished difference Result 770 states and 885 transitions.
[2018-02-02 10:43:26,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-02-02 10:43:26,466 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 389
[2018-02-02 10:43:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:26,468 INFO L225 Difference]: With dead ends: 770
[2018-02-02 10:43:26,468 INFO L226 Difference]: Without dead ends: 770
[2018-02-02 10:43:26,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930
[2018-02-02 10:43:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states.
[2018-02-02 10:43:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 606.
[2018-02-02 10:43:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states.
[2018-02-02 10:43:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 745 transitions.
[2018-02-02 10:43:26,473 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 745 transitions. Word has length 389
[2018-02-02 10:43:26,473 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:26,473 INFO L432 AbstractCegarLoop]: Abstraction has 606 states and 745 transitions.
[2018-02-02 10:43:26,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states.
[2018-02-02 10:43:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 745 transitions.
[2018-02-02 10:43:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403
[2018-02-02 10:43:26,475 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:26,475 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 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:43:26,475 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash 689622003, now seen corresponding path program 27 times
[2018-02-02 10:43:26,476 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:26,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5394 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked.
[2018-02-02 10:43:27,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:27,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32
[2018-02-02 10:43:27,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked.
[2018-02-02 10:43:27,090 INFO L182 omatonBuilderFactory]: Interpolants [24512#(= main_~i~1 0), 24513#(<= main_~i~1 1), 24514#(<= main_~i~1 2), 24515#(<= main_~i~1 3), 24516#(<= main_~i~1 4), 24517#(<= main_~i~1 5), 24518#(<= main_~i~1 6), 24519#(<= main_~i~1 7), 24520#(<= main_~i~1 8), 24521#(<= main_~i~1 9), 24522#(<= main_~i~1 10), 24523#(<= main_~i~1 11), 24524#(<= main_~i~1 12), 24525#(<= main_~i~1 13), 24526#(<= main_~i~1 14), 24527#(<= main_~i~1 15), 24528#(<= main_~i~1 16), 24529#(<= main_~i~1 17), 24530#(<= main_~i~1 18), 24531#(<= main_~i~1 19), 24532#(<= main_~i~1 20), 24533#(<= main_~i~1 21), 24534#(<= main_~i~1 22), 24535#(<= main_~i~1 23), 24536#(<= main_~i~1 24), 24537#(<= main_~i~1 25), 24538#(<= main_~i~1 26), 24539#(<= main_~i~1 27), 24540#(<= main_~i~1 28), 24541#(<= main_~i~1 29), 24510#true, 24511#false]
[2018-02-02 10:43:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5394 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked.
[2018-02-02 10:43:27,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states
[2018-02-02 10:43:27,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2018-02-02 10:43:27,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992
[2018-02-02 10:43:27,091 INFO L87 Difference]: Start difference. First operand 606 states and 745 transitions. Second operand 32 states.
[2018-02-02 10:43:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:27,500 INFO L93 Difference]: Finished difference Result 794 states and 913 transitions.
[2018-02-02 10:43:27,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-02-02 10:43:27,501 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 402
[2018-02-02 10:43:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:27,502 INFO L225 Difference]: With dead ends: 794
[2018-02-02 10:43:27,502 INFO L226 Difference]: Without dead ends: 794
[2018-02-02 10:43:27,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992
[2018-02-02 10:43:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states.
[2018-02-02 10:43:27,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 625.
[2018-02-02 10:43:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states.
[2018-02-02 10:43:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 769 transitions.
[2018-02-02 10:43:27,511 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 769 transitions. Word has length 402
[2018-02-02 10:43:27,511 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:27,511 INFO L432 AbstractCegarLoop]: Abstraction has 625 states and 769 transitions.
[2018-02-02 10:43:27,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states.
[2018-02-02 10:43:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 769 transitions.
[2018-02-02 10:43:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416
[2018-02-02 10:43:27,514 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:27,514 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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:43:27,514 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:27,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1718226940, now seen corresponding path program 28 times
[2018-02-02 10:43:27,515 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:27,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:43:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5775 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked.
[2018-02-02 10:43:28,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:28,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33
[2018-02-02 10:43:28,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2187 trivial. 0 not checked.
[2018-02-02 10:43:28,138 INFO L182 omatonBuilderFactory]: Interpolants [25984#(<= main_~i~1 21), 25985#(<= main_~i~1 22), 25986#(<= main_~i~1 23), 25987#(<= main_~i~1 24), 25988#(<= main_~i~1 25), 25989#(<= main_~i~1 26), 25990#(<= main_~i~1 27), 25991#(<= main_~i~1 28), 25992#(<= main_~i~1 29), 25993#(<= main_~i~1 30), 25961#true, 25962#false, 25963#(= main_~i~1 0), 25964#(<= main_~i~1 1), 25965#(<= main_~i~1 2), 25966#(<= main_~i~1 3), 25967#(<= main_~i~1 4), 25968#(<= main_~i~1 5), 25969#(<= main_~i~1 6), 25970#(<= main_~i~1 7), 25971#(<= main_~i~1 8), 25972#(<= main_~i~1 9), 25973#(<= main_~i~1 10), 25974#(<= main_~i~1 11), 25975#(<= main_~i~1 12), 25976#(<= main_~i~1 13), 25977#(<= main_~i~1 14), 25978#(<= main_~i~1 15), 25979#(<= main_~i~1 16), 25980#(<= main_~i~1 17), 25981#(<= main_~i~1 18), 25982#(<= main_~i~1 19), 25983#(<= main_~i~1 20)]
[2018-02-02 10:43:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5775 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked.
[2018-02-02 10:43:28,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-02-02 10:43:28,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-02-02 10:43:28,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 10:43:28,139 INFO L87 Difference]: Start difference. First operand 625 states and 769 transitions. Second operand 33 states.
[2018-02-02 10:43:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:28,401 INFO L93 Difference]: Finished difference Result 818 states and 941 transitions.
[2018-02-02 10:43:28,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-02-02 10:43:28,402 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 415
[2018-02-02 10:43:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:28,404 INFO L225 Difference]: With dead ends: 818
[2018-02-02 10:43:28,404 INFO L226 Difference]: Without dead ends: 818
[2018-02-02 10:43:28,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 10:43:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states.
[2018-02-02 10:43:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 644.
[2018-02-02 10:43:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states.
[2018-02-02 10:43:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 793 transitions.
[2018-02-02 10:43:28,413 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 793 transitions. Word has length 415
[2018-02-02 10:43:28,413 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:28,413 INFO L432 AbstractCegarLoop]: Abstraction has 644 states and 793 transitions.
[2018-02-02 10:43:28,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-02-02 10:43:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 793 transitions.
[2018-02-02 10:43:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429
[2018-02-02 10:43:28,416 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:28,417 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 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:43:28,417 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash 957329299, now seen corresponding path program 29 times
[2018-02-02 10:43:28,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:28,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 2852 trivial. 0 not checked.
[2018-02-02 10:43:29,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:29,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34
[2018-02-02 10:43:29,172 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked.
[2018-02-02 10:43:29,172 INFO L182 omatonBuilderFactory]: Interpolants [27456#true, 27457#false, 27458#(= main_~i~1 0), 27459#(<= main_~i~1 1), 27460#(<= main_~i~1 2), 27461#(<= main_~i~1 3), 27462#(<= main_~i~1 4), 27463#(<= main_~i~1 5), 27464#(<= main_~i~1 6), 27465#(<= main_~i~1 7), 27466#(<= main_~i~1 8), 27467#(<= main_~i~1 9), 27468#(<= main_~i~1 10), 27469#(<= main_~i~1 11), 27470#(<= main_~i~1 12), 27471#(<= main_~i~1 13), 27472#(<= main_~i~1 14), 27473#(<= main_~i~1 15), 27474#(<= main_~i~1 16), 27475#(<= main_~i~1 17), 27476#(<= main_~i~1 18), 27477#(<= main_~i~1 19), 27478#(<= main_~i~1 20), 27479#(<= main_~i~1 21), 27480#(<= main_~i~1 22), 27481#(<= main_~i~1 23), 27482#(<= main_~i~1 24), 27483#(<= main_~i~1 25), 27484#(<= main_~i~1 26), 27485#(<= main_~i~1 27), 27486#(<= main_~i~1 28), 27487#(<= main_~i~1 29), 27488#(<= main_~i~1 30), 27489#(<= main_~i~1 31)]
[2018-02-02 10:43:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 2852 trivial. 0 not checked.
[2018-02-02 10:43:29,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states
[2018-02-02 10:43:29,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2018-02-02 10:43:29,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122
[2018-02-02 10:43:29,173 INFO L87 Difference]: Start difference. First operand 644 states and 793 transitions. Second operand 34 states.
[2018-02-02 10:43:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:29,596 INFO L93 Difference]: Finished difference Result 842 states and 969 transitions.
[2018-02-02 10:43:29,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-02-02 10:43:29,597 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 428
[2018-02-02 10:43:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:29,599 INFO L225 Difference]: With dead ends: 842
[2018-02-02 10:43:29,599 INFO L226 Difference]: Without dead ends: 842
[2018-02-02 10:43:29,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122
[2018-02-02 10:43:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states.
[2018-02-02 10:43:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 663.
[2018-02-02 10:43:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states.
[2018-02-02 10:43:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 817 transitions.
[2018-02-02 10:43:29,608 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 817 transitions. Word has length 428
[2018-02-02 10:43:29,608 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:29,608 INFO L432 AbstractCegarLoop]: Abstraction has 663 states and 817 transitions.
[2018-02-02 10:43:29,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states.
[2018-02-02 10:43:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 817 transitions.
[2018-02-02 10:43:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442
[2018-02-02 10:43:29,612 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:29,612 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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:43:29,612 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:29,612 INFO L82 PathProgramCache]: Analyzing trace with hash -360189852, now seen corresponding path program 30 times
[2018-02-02 10:43:29,613 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:29,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6576 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked.
[2018-02-02 10:43:30,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:30,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35
[2018-02-02 10:43:30,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2523 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2523 trivial. 0 not checked.
[2018-02-02 10:43:30,366 INFO L182 omatonBuilderFactory]: Interpolants [28995#true, 28996#false, 28997#(= main_~i~1 0), 28998#(<= main_~i~1 1), 28999#(<= main_~i~1 2), 29000#(<= main_~i~1 3), 29001#(<= main_~i~1 4), 29002#(<= main_~i~1 5), 29003#(<= main_~i~1 6), 29004#(<= main_~i~1 7), 29005#(<= main_~i~1 8), 29006#(<= main_~i~1 9), 29007#(<= main_~i~1 10), 29008#(<= main_~i~1 11), 29009#(<= main_~i~1 12), 29010#(<= main_~i~1 13), 29011#(<= main_~i~1 14), 29012#(<= main_~i~1 15), 29013#(<= main_~i~1 16), 29014#(<= main_~i~1 17), 29015#(<= main_~i~1 18), 29016#(<= main_~i~1 19), 29017#(<= main_~i~1 20), 29018#(<= main_~i~1 21), 29019#(<= main_~i~1 22), 29020#(<= main_~i~1 23), 29021#(<= main_~i~1 24), 29022#(<= main_~i~1 25), 29023#(<= main_~i~1 26), 29024#(<= main_~i~1 27), 29025#(<= main_~i~1 28), 29026#(<= main_~i~1 29), 29027#(<= main_~i~1 30), 29028#(<= main_~i~1 31), 29029#(<= main_~i~1 32)]
[2018-02-02 10:43:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6576 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked.
[2018-02-02 10:43:30,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states
[2018-02-02 10:43:30,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2018-02-02 10:43:30,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190
[2018-02-02 10:43:30,367 INFO L87 Difference]: Start difference. First operand 663 states and 817 transitions. Second operand 35 states.
[2018-02-02 10:43:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:30,770 INFO L93 Difference]: Finished difference Result 866 states and 997 transitions.
[2018-02-02 10:43:30,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-02-02 10:43:30,771 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 441
[2018-02-02 10:43:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:30,773 INFO L225 Difference]: With dead ends: 866
[2018-02-02 10:43:30,773 INFO L226 Difference]: Without dead ends: 866
[2018-02-02 10:43:30,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190
[2018-02-02 10:43:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states.
[2018-02-02 10:43:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 682.
[2018-02-02 10:43:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states.
[2018-02-02 10:43:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 841 transitions.
[2018-02-02 10:43:30,779 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 841 transitions. Word has length 441
[2018-02-02 10:43:30,779 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:30,779 INFO L432 AbstractCegarLoop]: Abstraction has 682 states and 841 transitions.
[2018-02-02 10:43:30,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states.
[2018-02-02 10:43:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 841 transitions.
[2018-02-02 10:43:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455
[2018-02-02 10:43:30,781 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:30,781 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 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:43:30,781 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:30,781 INFO L82 PathProgramCache]: Analyzing trace with hash 881412915, now seen corresponding path program 31 times
[2018-02-02 10:43:30,782 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:30,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked.
[2018-02-02 10:43:31,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:31,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36
[2018-02-02 10:43:31,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2700 trivial. 0 not checked.
[2018-02-02 10:43:31,402 INFO L182 omatonBuilderFactory]: Interpolants [30592#(<= main_~i~1 12), 30593#(<= main_~i~1 13), 30594#(<= main_~i~1 14), 30595#(<= main_~i~1 15), 30596#(<= main_~i~1 16), 30597#(<= main_~i~1 17), 30598#(<= main_~i~1 18), 30599#(<= main_~i~1 19), 30600#(<= main_~i~1 20), 30601#(<= main_~i~1 21), 30602#(<= main_~i~1 22), 30603#(<= main_~i~1 23), 30604#(<= main_~i~1 24), 30605#(<= main_~i~1 25), 30606#(<= main_~i~1 26), 30607#(<= main_~i~1 27), 30608#(<= main_~i~1 28), 30609#(<= main_~i~1 29), 30610#(<= main_~i~1 30), 30611#(<= main_~i~1 31), 30612#(<= main_~i~1 32), 30613#(<= main_~i~1 33), 30578#true, 30579#false, 30580#(= main_~i~1 0), 30581#(<= main_~i~1 1), 30582#(<= main_~i~1 2), 30583#(<= main_~i~1 3), 30584#(<= main_~i~1 4), 30585#(<= main_~i~1 5), 30586#(<= main_~i~1 6), 30587#(<= main_~i~1 7), 30588#(<= main_~i~1 8), 30589#(<= main_~i~1 9), 30590#(<= main_~i~1 10), 30591#(<= main_~i~1 11)]
[2018-02-02 10:43:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked.
[2018-02-02 10:43:31,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states
[2018-02-02 10:43:31,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2018-02-02 10:43:31,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260
[2018-02-02 10:43:31,403 INFO L87 Difference]: Start difference. First operand 682 states and 841 transitions. Second operand 36 states.
[2018-02-02 10:43:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:31,734 INFO L93 Difference]: Finished difference Result 890 states and 1025 transitions.
[2018-02-02 10:43:31,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2018-02-02 10:43:31,734 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 454
[2018-02-02 10:43:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:31,737 INFO L225 Difference]: With dead ends: 890
[2018-02-02 10:43:31,737 INFO L226 Difference]: Without dead ends: 890
[2018-02-02 10:43:31,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260
[2018-02-02 10:43:31,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states.
[2018-02-02 10:43:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 701.
[2018-02-02 10:43:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states.
[2018-02-02 10:43:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 865 transitions.
[2018-02-02 10:43:31,744 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 865 transitions. Word has length 454
[2018-02-02 10:43:31,744 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:31,744 INFO L432 AbstractCegarLoop]: Abstraction has 701 states and 865 transitions.
[2018-02-02 10:43:31,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states.
[2018-02-02 10:43:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 865 transitions.
[2018-02-02 10:43:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468
[2018-02-02 10:43:31,747 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:31,747 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 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:43:31,747 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:31,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1889519420, now seen corresponding path program 32 times
[2018-02-02 10:43:31,747 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:31,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked.
[2018-02-02 10:43:32,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:32,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37
[2018-02-02 10:43:32,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2883 trivial. 0 not checked.
[2018-02-02 10:43:32,438 INFO L182 omatonBuilderFactory]: Interpolants [32205#true, 32206#false, 32207#(= main_~i~1 0), 32208#(<= main_~i~1 1), 32209#(<= main_~i~1 2), 32210#(<= main_~i~1 3), 32211#(<= main_~i~1 4), 32212#(<= main_~i~1 5), 32213#(<= main_~i~1 6), 32214#(<= main_~i~1 7), 32215#(<= main_~i~1 8), 32216#(<= main_~i~1 9), 32217#(<= main_~i~1 10), 32218#(<= main_~i~1 11), 32219#(<= main_~i~1 12), 32220#(<= main_~i~1 13), 32221#(<= main_~i~1 14), 32222#(<= main_~i~1 15), 32223#(<= main_~i~1 16), 32224#(<= main_~i~1 17), 32225#(<= main_~i~1 18), 32226#(<= main_~i~1 19), 32227#(<= main_~i~1 20), 32228#(<= main_~i~1 21), 32229#(<= main_~i~1 22), 32230#(<= main_~i~1 23), 32231#(<= main_~i~1 24), 32232#(<= main_~i~1 25), 32233#(<= main_~i~1 26), 32234#(<= main_~i~1 27), 32235#(<= main_~i~1 28), 32236#(<= main_~i~1 29), 32237#(<= main_~i~1 30), 32238#(<= main_~i~1 31), 32239#(<= main_~i~1 32), 32240#(<= main_~i~1 33), 32241#(<= main_~i~1 34)]
[2018-02-02 10:43:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked.
[2018-02-02 10:43:32,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states
[2018-02-02 10:43:32,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2018-02-02 10:43:32,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332
[2018-02-02 10:43:32,439 INFO L87 Difference]: Start difference. First operand 701 states and 865 transitions. Second operand 37 states.
[2018-02-02 10:43:32,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:32,852 INFO L93 Difference]: Finished difference Result 914 states and 1053 transitions.
[2018-02-02 10:43:32,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2018-02-02 10:43:32,852 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 467
[2018-02-02 10:43:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:32,854 INFO L225 Difference]: With dead ends: 914
[2018-02-02 10:43:32,854 INFO L226 Difference]: Without dead ends: 914
[2018-02-02 10:43:32,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332
[2018-02-02 10:43:32,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states.
[2018-02-02 10:43:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 720.
[2018-02-02 10:43:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states.
[2018-02-02 10:43:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 889 transitions.
[2018-02-02 10:43:32,861 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 889 transitions. Word has length 467
[2018-02-02 10:43:32,861 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:32,861 INFO L432 AbstractCegarLoop]: Abstraction has 720 states and 889 transitions.
[2018-02-02 10:43:32,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states.
[2018-02-02 10:43:32,861 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 889 transitions.
[2018-02-02 10:43:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481
[2018-02-02 10:43:32,863 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:32,863 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 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:43:32,863 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:32,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1116839635, now seen corresponding path program 33 times
[2018-02-02 10:43:32,864 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:32,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked.
[2018-02-02 10:43:33,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:33,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38
[2018-02-02 10:43:33,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3072 trivial. 0 not checked.
[2018-02-02 10:43:33,567 INFO L182 omatonBuilderFactory]: Interpolants [33876#true, 33877#false, 33878#(= main_~i~1 0), 33879#(<= main_~i~1 1), 33880#(<= main_~i~1 2), 33881#(<= main_~i~1 3), 33882#(<= main_~i~1 4), 33883#(<= main_~i~1 5), 33884#(<= main_~i~1 6), 33885#(<= main_~i~1 7), 33886#(<= main_~i~1 8), 33887#(<= main_~i~1 9), 33888#(<= main_~i~1 10), 33889#(<= main_~i~1 11), 33890#(<= main_~i~1 12), 33891#(<= main_~i~1 13), 33892#(<= main_~i~1 14), 33893#(<= main_~i~1 15), 33894#(<= main_~i~1 16), 33895#(<= main_~i~1 17), 33896#(<= main_~i~1 18), 33897#(<= main_~i~1 19), 33898#(<= main_~i~1 20), 33899#(<= main_~i~1 21), 33900#(<= main_~i~1 22), 33901#(<= main_~i~1 23), 33902#(<= main_~i~1 24), 33903#(<= main_~i~1 25), 33904#(<= main_~i~1 26), 33905#(<= main_~i~1 27), 33906#(<= main_~i~1 28), 33907#(<= main_~i~1 29), 33908#(<= main_~i~1 30), 33909#(<= main_~i~1 31), 33910#(<= main_~i~1 32), 33911#(<= main_~i~1 33), 33912#(<= main_~i~1 34), 33913#(<= main_~i~1 35)]
[2018-02-02 10:43:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked.
[2018-02-02 10:43:33,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states
[2018-02-02 10:43:33,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2018-02-02 10:43:33,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406
[2018-02-02 10:43:33,568 INFO L87 Difference]: Start difference. First operand 720 states and 889 transitions. Second operand 38 states.
[2018-02-02 10:43:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:33,997 INFO L93 Difference]: Finished difference Result 938 states and 1081 transitions.
[2018-02-02 10:43:33,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states.
[2018-02-02 10:43:33,998 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 480
[2018-02-02 10:43:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:34,000 INFO L225 Difference]: With dead ends: 938
[2018-02-02 10:43:34,000 INFO L226 Difference]: Without dead ends: 938
[2018-02-02 10:43:34,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406
[2018-02-02 10:43:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states.
[2018-02-02 10:43:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 739.
[2018-02-02 10:43:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states.
[2018-02-02 10:43:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 913 transitions.
[2018-02-02 10:43:34,008 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 913 transitions. Word has length 480
[2018-02-02 10:43:34,008 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:34,008 INFO L432 AbstractCegarLoop]: Abstraction has 739 states and 913 transitions.
[2018-02-02 10:43:34,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states.
[2018-02-02 10:43:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 913 transitions.
[2018-02-02 10:43:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494
[2018-02-02 10:43:34,010 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:34,010 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 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:43:34,011 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1588279004, now seen corresponding path program 34 times
[2018-02-02 10:43:34,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:34,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8334 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 3852 trivial. 0 not checked.
[2018-02-02 10:43:34,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:34,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39
[2018-02-02 10:43:34,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3267 trivial. 0 not checked.
[2018-02-02 10:43:34,868 INFO L182 omatonBuilderFactory]: Interpolants [35591#true, 35592#false, 35593#(= main_~i~1 0), 35594#(<= main_~i~1 1), 35595#(<= main_~i~1 2), 35596#(<= main_~i~1 3), 35597#(<= main_~i~1 4), 35598#(<= main_~i~1 5), 35599#(<= main_~i~1 6), 35600#(<= main_~i~1 7), 35601#(<= main_~i~1 8), 35602#(<= main_~i~1 9), 35603#(<= main_~i~1 10), 35604#(<= main_~i~1 11), 35605#(<= main_~i~1 12), 35606#(<= main_~i~1 13), 35607#(<= main_~i~1 14), 35608#(<= main_~i~1 15), 35609#(<= main_~i~1 16), 35610#(<= main_~i~1 17), 35611#(<= main_~i~1 18), 35612#(<= main_~i~1 19), 35613#(<= main_~i~1 20), 35614#(<= main_~i~1 21), 35615#(<= main_~i~1 22), 35616#(<= main_~i~1 23), 35617#(<= main_~i~1 24), 35618#(<= main_~i~1 25), 35619#(<= main_~i~1 26), 35620#(<= main_~i~1 27), 35621#(<= main_~i~1 28), 35622#(<= main_~i~1 29), 35623#(<= main_~i~1 30), 35624#(<= main_~i~1 31), 35625#(<= main_~i~1 32), 35626#(<= main_~i~1 33), 35627#(<= main_~i~1 34), 35628#(<= main_~i~1 35), 35629#(<= main_~i~1 36)]
[2018-02-02 10:43:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8334 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 3852 trivial. 0 not checked.
[2018-02-02 10:43:34,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states
[2018-02-02 10:43:34,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2018-02-02 10:43:34,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482
[2018-02-02 10:43:34,870 INFO L87 Difference]: Start difference. First operand 739 states and 913 transitions. Second operand 39 states.
[2018-02-02 10:43:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:35,433 INFO L93 Difference]: Finished difference Result 962 states and 1109 transitions.
[2018-02-02 10:43:35,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states.
[2018-02-02 10:43:35,433 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 493
[2018-02-02 10:43:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:35,438 INFO L225 Difference]: With dead ends: 962
[2018-02-02 10:43:35,438 INFO L226 Difference]: Without dead ends: 962
[2018-02-02 10:43:35,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482
[2018-02-02 10:43:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states.
[2018-02-02 10:43:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 758.
[2018-02-02 10:43:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states.
[2018-02-02 10:43:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 937 transitions.
[2018-02-02 10:43:35,454 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 937 transitions. Word has length 493
[2018-02-02 10:43:35,454 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:35,454 INFO L432 AbstractCegarLoop]: Abstraction has 758 states and 937 transitions.
[2018-02-02 10:43:35,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states.
[2018-02-02 10:43:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 937 transitions.
[2018-02-02 10:43:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507
[2018-02-02 10:43:35,461 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:35,461 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 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:43:35,461 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1907534451, now seen corresponding path program 35 times
[2018-02-02 10:43:35,462 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:35,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8806 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked.
[2018-02-02 10:43:36,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:36,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40
[2018-02-02 10:43:36,410 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3468 trivial. 0 not checked.
[2018-02-02 10:43:36,411 INFO L182 omatonBuilderFactory]: Interpolants [37376#(<= main_~i~1 24), 37377#(<= main_~i~1 25), 37378#(<= main_~i~1 26), 37379#(<= main_~i~1 27), 37380#(<= main_~i~1 28), 37381#(<= main_~i~1 29), 37382#(<= main_~i~1 30), 37383#(<= main_~i~1 31), 37384#(<= main_~i~1 32), 37385#(<= main_~i~1 33), 37386#(<= main_~i~1 34), 37387#(<= main_~i~1 35), 37388#(<= main_~i~1 36), 37389#(<= main_~i~1 37), 37350#true, 37351#false, 37352#(= main_~i~1 0), 37353#(<= main_~i~1 1), 37354#(<= main_~i~1 2), 37355#(<= main_~i~1 3), 37356#(<= main_~i~1 4), 37357#(<= main_~i~1 5), 37358#(<= main_~i~1 6), 37359#(<= main_~i~1 7), 37360#(<= main_~i~1 8), 37361#(<= main_~i~1 9), 37362#(<= main_~i~1 10), 37363#(<= main_~i~1 11), 37364#(<= main_~i~1 12), 37365#(<= main_~i~1 13), 37366#(<= main_~i~1 14), 37367#(<= main_~i~1 15), 37368#(<= main_~i~1 16), 37369#(<= main_~i~1 17), 37370#(<= main_~i~1 18), 37371#(<= main_~i~1 19), 37372#(<= main_~i~1 20), 37373#(<= main_~i~1 21), 37374#(<= main_~i~1 22), 37375#(<= main_~i~1 23)]
[2018-02-02 10:43:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8806 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked.
[2018-02-02 10:43:36,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states
[2018-02-02 10:43:36,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2018-02-02 10:43:36,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560
[2018-02-02 10:43:36,412 INFO L87 Difference]: Start difference. First operand 758 states and 937 transitions. Second operand 40 states.
[2018-02-02 10:43:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:36,854 INFO L93 Difference]: Finished difference Result 986 states and 1137 transitions.
[2018-02-02 10:43:36,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states.
[2018-02-02 10:43:36,854 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 506
[2018-02-02 10:43:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:36,856 INFO L225 Difference]: With dead ends: 986
[2018-02-02 10:43:36,856 INFO L226 Difference]: Without dead ends: 986
[2018-02-02 10:43:36,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560
[2018-02-02 10:43:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states.
[2018-02-02 10:43:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 777.
[2018-02-02 10:43:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states.
[2018-02-02 10:43:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 961 transitions.
[2018-02-02 10:43:36,863 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 961 transitions. Word has length 506
[2018-02-02 10:43:36,863 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:36,863 INFO L432 AbstractCegarLoop]: Abstraction has 777 states and 961 transitions.
[2018-02-02 10:43:36,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states.
[2018-02-02 10:43:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 961 transitions.
[2018-02-02 10:43:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520
[2018-02-02 10:43:36,866 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:36,866 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 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:43:36,866 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2112118396, now seen corresponding path program 36 times
[2018-02-02 10:43:36,867 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:36,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9291 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked.
[2018-02-02 10:43:37,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:37,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41
[2018-02-02 10:43:37,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked.
[2018-02-02 10:43:37,763 INFO L182 omatonBuilderFactory]: Interpolants [39168#(<= main_~i~1 13), 39169#(<= main_~i~1 14), 39170#(<= main_~i~1 15), 39171#(<= main_~i~1 16), 39172#(<= main_~i~1 17), 39173#(<= main_~i~1 18), 39174#(<= main_~i~1 19), 39175#(<= main_~i~1 20), 39176#(<= main_~i~1 21), 39177#(<= main_~i~1 22), 39178#(<= main_~i~1 23), 39179#(<= main_~i~1 24), 39180#(<= main_~i~1 25), 39181#(<= main_~i~1 26), 39182#(<= main_~i~1 27), 39183#(<= main_~i~1 28), 39184#(<= main_~i~1 29), 39185#(<= main_~i~1 30), 39186#(<= main_~i~1 31), 39187#(<= main_~i~1 32), 39188#(<= main_~i~1 33), 39189#(<= main_~i~1 34), 39190#(<= main_~i~1 35), 39191#(<= main_~i~1 36), 39192#(<= main_~i~1 37), 39193#(<= main_~i~1 38), 39153#true, 39154#false, 39155#(= main_~i~1 0), 39156#(<= main_~i~1 1), 39157#(<= main_~i~1 2), 39158#(<= main_~i~1 3), 39159#(<= main_~i~1 4), 39160#(<= main_~i~1 5), 39161#(<= main_~i~1 6), 39162#(<= main_~i~1 7), 39163#(<= main_~i~1 8), 39164#(<= main_~i~1 9), 39165#(<= main_~i~1 10), 39166#(<= main_~i~1 11), 39167#(<= main_~i~1 12)]
[2018-02-02 10:43:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9291 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked.
[2018-02-02 10:43:37,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states
[2018-02-02 10:43:37,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2018-02-02 10:43:37,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640
[2018-02-02 10:43:37,764 INFO L87 Difference]: Start difference. First operand 777 states and 961 transitions. Second operand 41 states.
[2018-02-02 10:43:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:38,207 INFO L93 Difference]: Finished difference Result 1010 states and 1165 transitions.
[2018-02-02 10:43:38,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2018-02-02 10:43:38,207 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 519
[2018-02-02 10:43:38,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:38,209 INFO L225 Difference]: With dead ends: 1010
[2018-02-02 10:43:38,209 INFO L226 Difference]: Without dead ends: 1010
[2018-02-02 10:43:38,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640
[2018-02-02 10:43:38,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states.
[2018-02-02 10:43:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 796.
[2018-02-02 10:43:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states.
[2018-02-02 10:43:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 985 transitions.
[2018-02-02 10:43:38,216 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 985 transitions. Word has length 519
[2018-02-02 10:43:38,216 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:38,216 INFO L432 AbstractCegarLoop]: Abstraction has 796 states and 985 transitions.
[2018-02-02 10:43:38,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states.
[2018-02-02 10:43:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 985 transitions.
[2018-02-02 10:43:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533
[2018-02-02 10:43:38,218 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:38,218 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 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:43:38,219 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:38,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1475767827, now seen corresponding path program 37 times
[2018-02-02 10:43:38,219 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:38,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9789 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 4524 trivial. 0 not checked.
[2018-02-02 10:43:39,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:39,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42
[2018-02-02 10:43:39,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3888 trivial. 0 not checked.
[2018-02-02 10:43:39,101 INFO L182 omatonBuilderFactory]: Interpolants [41024#(<= main_~i~1 22), 41025#(<= main_~i~1 23), 41026#(<= main_~i~1 24), 41027#(<= main_~i~1 25), 41028#(<= main_~i~1 26), 41029#(<= main_~i~1 27), 41030#(<= main_~i~1 28), 41031#(<= main_~i~1 29), 41032#(<= main_~i~1 30), 41033#(<= main_~i~1 31), 41034#(<= main_~i~1 32), 41035#(<= main_~i~1 33), 41036#(<= main_~i~1 34), 41037#(<= main_~i~1 35), 41038#(<= main_~i~1 36), 41039#(<= main_~i~1 37), 41040#(<= main_~i~1 38), 41041#(<= main_~i~1 39), 41000#true, 41001#false, 41002#(= main_~i~1 0), 41003#(<= main_~i~1 1), 41004#(<= main_~i~1 2), 41005#(<= main_~i~1 3), 41006#(<= main_~i~1 4), 41007#(<= main_~i~1 5), 41008#(<= main_~i~1 6), 41009#(<= main_~i~1 7), 41010#(<= main_~i~1 8), 41011#(<= main_~i~1 9), 41012#(<= main_~i~1 10), 41013#(<= main_~i~1 11), 41014#(<= main_~i~1 12), 41015#(<= main_~i~1 13), 41016#(<= main_~i~1 14), 41017#(<= main_~i~1 15), 41018#(<= main_~i~1 16), 41019#(<= main_~i~1 17), 41020#(<= main_~i~1 18), 41021#(<= main_~i~1 19), 41022#(<= main_~i~1 20), 41023#(<= main_~i~1 21)]
[2018-02-02 10:43:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9789 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 4524 trivial. 0 not checked.
[2018-02-02 10:43:39,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states
[2018-02-02 10:43:39,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2018-02-02 10:43:39,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722
[2018-02-02 10:43:39,103 INFO L87 Difference]: Start difference. First operand 796 states and 985 transitions. Second operand 42 states.
[2018-02-02 10:43:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:39,500 INFO L93 Difference]: Finished difference Result 1034 states and 1193 transitions.
[2018-02-02 10:43:39,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states.
[2018-02-02 10:43:39,500 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 532
[2018-02-02 10:43:39,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:39,502 INFO L225 Difference]: With dead ends: 1034
[2018-02-02 10:43:39,502 INFO L226 Difference]: Without dead ends: 1034
[2018-02-02 10:43:39,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722
[2018-02-02 10:43:39,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states.
[2018-02-02 10:43:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 815.
[2018-02-02 10:43:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states.
[2018-02-02 10:43:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1009 transitions.
[2018-02-02 10:43:39,510 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1009 transitions. Word has length 532
[2018-02-02 10:43:39,511 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:39,511 INFO L432 AbstractCegarLoop]: Abstraction has 815 states and 1009 transitions.
[2018-02-02 10:43:39,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states.
[2018-02-02 10:43:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1009 transitions.
[2018-02-02 10:43:39,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546
[2018-02-02 10:43:39,514 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:39,514 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 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:43:39,514 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:39,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1005240804, now seen corresponding path program 38 times
[2018-02-02 10:43:39,515 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:39,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10300 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 4760 trivial. 0 not checked.
[2018-02-02 10:43:40,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:40,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43
[2018-02-02 10:43:40,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4107 trivial. 0 not checked.
[2018-02-02 10:43:40,448 INFO L182 omatonBuilderFactory]: Interpolants [42891#true, 42892#false, 42893#(= main_~i~1 0), 42894#(<= main_~i~1 1), 42895#(<= main_~i~1 2), 42896#(<= main_~i~1 3), 42897#(<= main_~i~1 4), 42898#(<= main_~i~1 5), 42899#(<= main_~i~1 6), 42900#(<= main_~i~1 7), 42901#(<= main_~i~1 8), 42902#(<= main_~i~1 9), 42903#(<= main_~i~1 10), 42904#(<= main_~i~1 11), 42905#(<= main_~i~1 12), 42906#(<= main_~i~1 13), 42907#(<= main_~i~1 14), 42908#(<= main_~i~1 15), 42909#(<= main_~i~1 16), 42910#(<= main_~i~1 17), 42911#(<= main_~i~1 18), 42912#(<= main_~i~1 19), 42913#(<= main_~i~1 20), 42914#(<= main_~i~1 21), 42915#(<= main_~i~1 22), 42916#(<= main_~i~1 23), 42917#(<= main_~i~1 24), 42918#(<= main_~i~1 25), 42919#(<= main_~i~1 26), 42920#(<= main_~i~1 27), 42921#(<= main_~i~1 28), 42922#(<= main_~i~1 29), 42923#(<= main_~i~1 30), 42924#(<= main_~i~1 31), 42925#(<= main_~i~1 32), 42926#(<= main_~i~1 33), 42927#(<= main_~i~1 34), 42928#(<= main_~i~1 35), 42929#(<= main_~i~1 36), 42930#(<= main_~i~1 37), 42931#(<= main_~i~1 38), 42932#(<= main_~i~1 39), 42933#(<= main_~i~1 40)]
[2018-02-02 10:43:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10300 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 4760 trivial. 0 not checked.
[2018-02-02 10:43:40,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states
[2018-02-02 10:43:40,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2018-02-02 10:43:40,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806
[2018-02-02 10:43:40,449 INFO L87 Difference]: Start difference. First operand 815 states and 1009 transitions. Second operand 43 states.
[2018-02-02 10:43:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:41,009 INFO L93 Difference]: Finished difference Result 1058 states and 1221 transitions.
[2018-02-02 10:43:41,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states.
[2018-02-02 10:43:41,009 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 545
[2018-02-02 10:43:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:41,011 INFO L225 Difference]: With dead ends: 1058
[2018-02-02 10:43:41,011 INFO L226 Difference]: Without dead ends: 1058
[2018-02-02 10:43:41,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806
[2018-02-02 10:43:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states.
[2018-02-02 10:43:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 834.
[2018-02-02 10:43:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states.
[2018-02-02 10:43:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1033 transitions.
[2018-02-02 10:43:41,018 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1033 transitions. Word has length 545
[2018-02-02 10:43:41,018 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:41,018 INFO L432 AbstractCegarLoop]: Abstraction has 834 states and 1033 transitions.
[2018-02-02 10:43:41,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states.
[2018-02-02 10:43:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1033 transitions.
[2018-02-02 10:43:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559
[2018-02-02 10:43:41,021 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:41,021 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 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:43:41,021 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:41,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1293489741, now seen corresponding path program 39 times
[2018-02-02 10:43:41,021 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:41,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10824 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 5002 trivial. 0 not checked.
[2018-02-02 10:43:42,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:42,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44
[2018-02-02 10:43:42,009 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4332 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4332 trivial. 0 not checked.
[2018-02-02 10:43:42,010 INFO L182 omatonBuilderFactory]: Interpolants [44864#(<= main_~i~1 36), 44865#(<= main_~i~1 37), 44866#(<= main_~i~1 38), 44867#(<= main_~i~1 39), 44868#(<= main_~i~1 40), 44869#(<= main_~i~1 41), 44826#true, 44827#false, 44828#(= main_~i~1 0), 44829#(<= main_~i~1 1), 44830#(<= main_~i~1 2), 44831#(<= main_~i~1 3), 44832#(<= main_~i~1 4), 44833#(<= main_~i~1 5), 44834#(<= main_~i~1 6), 44835#(<= main_~i~1 7), 44836#(<= main_~i~1 8), 44837#(<= main_~i~1 9), 44838#(<= main_~i~1 10), 44839#(<= main_~i~1 11), 44840#(<= main_~i~1 12), 44841#(<= main_~i~1 13), 44842#(<= main_~i~1 14), 44843#(<= main_~i~1 15), 44844#(<= main_~i~1 16), 44845#(<= main_~i~1 17), 44846#(<= main_~i~1 18), 44847#(<= main_~i~1 19), 44848#(<= main_~i~1 20), 44849#(<= main_~i~1 21), 44850#(<= main_~i~1 22), 44851#(<= main_~i~1 23), 44852#(<= main_~i~1 24), 44853#(<= main_~i~1 25), 44854#(<= main_~i~1 26), 44855#(<= main_~i~1 27), 44856#(<= main_~i~1 28), 44857#(<= main_~i~1 29), 44858#(<= main_~i~1 30), 44859#(<= main_~i~1 31), 44860#(<= main_~i~1 32), 44861#(<= main_~i~1 33), 44862#(<= main_~i~1 34), 44863#(<= main_~i~1 35)]
[2018-02-02 10:43:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10824 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 5002 trivial. 0 not checked.
[2018-02-02 10:43:42,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-02-02 10:43:42,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-02-02 10:43:42,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892
[2018-02-02 10:43:42,011 INFO L87 Difference]: Start difference. First operand 834 states and 1033 transitions. Second operand 44 states.
[2018-02-02 10:43:42,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:42,475 INFO L93 Difference]: Finished difference Result 1082 states and 1249 transitions.
[2018-02-02 10:43:42,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states.
[2018-02-02 10:43:42,475 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 558
[2018-02-02 10:43:42,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:42,478 INFO L225 Difference]: With dead ends: 1082
[2018-02-02 10:43:42,478 INFO L226 Difference]: Without dead ends: 1082
[2018-02-02 10:43:42,478 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892
[2018-02-02 10:43:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states.
[2018-02-02 10:43:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 853.
[2018-02-02 10:43:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states.
[2018-02-02 10:43:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1057 transitions.
[2018-02-02 10:43:42,484 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1057 transitions. Word has length 558
[2018-02-02 10:43:42,485 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:42,485 INFO L432 AbstractCegarLoop]: Abstraction has 853 states and 1057 transitions.
[2018-02-02 10:43:42,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-02-02 10:43:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1057 transitions.
[2018-02-02 10:43:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572
[2018-02-02 10:43:42,487 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:42,487 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 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:43:42,488 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash -512218556, now seen corresponding path program 40 times
[2018-02-02 10:43:42,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:42,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 5250 trivial. 0 not checked.
[2018-02-02 10:43:43,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:43,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45
[2018-02-02 10:43:43,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4563 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4563 trivial. 0 not checked.
[2018-02-02 10:43:43,479 INFO L182 omatonBuilderFactory]: Interpolants [46848#(<= main_~i~1 41), 46849#(<= main_~i~1 42), 46805#true, 46806#false, 46807#(= main_~i~1 0), 46808#(<= main_~i~1 1), 46809#(<= main_~i~1 2), 46810#(<= main_~i~1 3), 46811#(<= main_~i~1 4), 46812#(<= main_~i~1 5), 46813#(<= main_~i~1 6), 46814#(<= main_~i~1 7), 46815#(<= main_~i~1 8), 46816#(<= main_~i~1 9), 46817#(<= main_~i~1 10), 46818#(<= main_~i~1 11), 46819#(<= main_~i~1 12), 46820#(<= main_~i~1 13), 46821#(<= main_~i~1 14), 46822#(<= main_~i~1 15), 46823#(<= main_~i~1 16), 46824#(<= main_~i~1 17), 46825#(<= main_~i~1 18), 46826#(<= main_~i~1 19), 46827#(<= main_~i~1 20), 46828#(<= main_~i~1 21), 46829#(<= main_~i~1 22), 46830#(<= main_~i~1 23), 46831#(<= main_~i~1 24), 46832#(<= main_~i~1 25), 46833#(<= main_~i~1 26), 46834#(<= main_~i~1 27), 46835#(<= main_~i~1 28), 46836#(<= main_~i~1 29), 46837#(<= main_~i~1 30), 46838#(<= main_~i~1 31), 46839#(<= main_~i~1 32), 46840#(<= main_~i~1 33), 46841#(<= main_~i~1 34), 46842#(<= main_~i~1 35), 46843#(<= main_~i~1 36), 46844#(<= main_~i~1 37), 46845#(<= main_~i~1 38), 46846#(<= main_~i~1 39), 46847#(<= main_~i~1 40)]
[2018-02-02 10:43:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 5250 trivial. 0 not checked.
[2018-02-02 10:43:43,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states
[2018-02-02 10:43:43,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants.
[2018-02-02 10:43:43,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980
[2018-02-02 10:43:43,480 INFO L87 Difference]: Start difference. First operand 853 states and 1057 transitions. Second operand 45 states.
[2018-02-02 10:43:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:44,077 INFO L93 Difference]: Finished difference Result 1106 states and 1277 transitions.
[2018-02-02 10:43:44,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2018-02-02 10:43:44,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 571
[2018-02-02 10:43:44,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:44,079 INFO L225 Difference]: With dead ends: 1106
[2018-02-02 10:43:44,079 INFO L226 Difference]: Without dead ends: 1106
[2018-02-02 10:43:44,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980
[2018-02-02 10:43:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states.
[2018-02-02 10:43:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 872.
[2018-02-02 10:43:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states.
[2018-02-02 10:43:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1081 transitions.
[2018-02-02 10:43:44,087 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1081 transitions. Word has length 571
[2018-02-02 10:43:44,087 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:44,087 INFO L432 AbstractCegarLoop]: Abstraction has 872 states and 1081 transitions.
[2018-02-02 10:43:44,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states.
[2018-02-02 10:43:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1081 transitions.
[2018-02-02 10:43:44,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585
[2018-02-02 10:43:44,090 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:44,090 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 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:43:44,090 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:44,091 INFO L82 PathProgramCache]: Analyzing trace with hash 126754131, now seen corresponding path program 41 times
[2018-02-02 10:43:44,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:44,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11911 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 5504 trivial. 0 not checked.
[2018-02-02 10:43:45,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:45,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46
[2018-02-02 10:43:45,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4800 trivial. 0 not checked.
[2018-02-02 10:43:45,164 INFO L182 omatonBuilderFactory]: Interpolants [48832#(<= main_~i~1 2), 48833#(<= main_~i~1 3), 48834#(<= main_~i~1 4), 48835#(<= main_~i~1 5), 48836#(<= main_~i~1 6), 48837#(<= main_~i~1 7), 48838#(<= main_~i~1 8), 48839#(<= main_~i~1 9), 48840#(<= main_~i~1 10), 48841#(<= main_~i~1 11), 48842#(<= main_~i~1 12), 48843#(<= main_~i~1 13), 48844#(<= main_~i~1 14), 48845#(<= main_~i~1 15), 48846#(<= main_~i~1 16), 48847#(<= main_~i~1 17), 48848#(<= main_~i~1 18), 48849#(<= main_~i~1 19), 48850#(<= main_~i~1 20), 48851#(<= main_~i~1 21), 48852#(<= main_~i~1 22), 48853#(<= main_~i~1 23), 48854#(<= main_~i~1 24), 48855#(<= main_~i~1 25), 48856#(<= main_~i~1 26), 48857#(<= main_~i~1 27), 48858#(<= main_~i~1 28), 48859#(<= main_~i~1 29), 48860#(<= main_~i~1 30), 48861#(<= main_~i~1 31), 48862#(<= main_~i~1 32), 48863#(<= main_~i~1 33), 48864#(<= main_~i~1 34), 48865#(<= main_~i~1 35), 48866#(<= main_~i~1 36), 48867#(<= main_~i~1 37), 48868#(<= main_~i~1 38), 48869#(<= main_~i~1 39), 48870#(<= main_~i~1 40), 48871#(<= main_~i~1 41), 48872#(<= main_~i~1 42), 48873#(<= main_~i~1 43), 48828#true, 48829#false, 48830#(= main_~i~1 0), 48831#(<= main_~i~1 1)]
[2018-02-02 10:43:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11911 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 5504 trivial. 0 not checked.
[2018-02-02 10:43:45,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-02-02 10:43:45,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-02-02 10:43:45,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070
[2018-02-02 10:43:45,166 INFO L87 Difference]: Start difference. First operand 872 states and 1081 transitions. Second operand 46 states.
[2018-02-02 10:43:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:45,929 INFO L93 Difference]: Finished difference Result 1130 states and 1305 transitions.
[2018-02-02 10:43:45,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2018-02-02 10:43:45,929 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 584
[2018-02-02 10:43:45,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:45,933 INFO L225 Difference]: With dead ends: 1130
[2018-02-02 10:43:45,933 INFO L226 Difference]: Without dead ends: 1130
[2018-02-02 10:43:45,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070
[2018-02-02 10:43:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states.
[2018-02-02 10:43:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 891.
[2018-02-02 10:43:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states.
[2018-02-02 10:43:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1105 transitions.
[2018-02-02 10:43:45,941 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1105 transitions. Word has length 584
[2018-02-02 10:43:45,942 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:45,942 INFO L432 AbstractCegarLoop]: Abstraction has 891 states and 1105 transitions.
[2018-02-02 10:43:45,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-02-02 10:43:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1105 transitions.
[2018-02-02 10:43:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598
[2018-02-02 10:43:45,944 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:45,945 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 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:43:45,945 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:45,945 INFO L82 PathProgramCache]: Analyzing trace with hash -302392668, now seen corresponding path program 42 times
[2018-02-02 10:43:45,945 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:45,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12474 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 5764 trivial. 0 not checked.
[2018-02-02 10:43:47,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:47,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47
[2018-02-02 10:43:47,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5043 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5043 trivial. 0 not checked.
[2018-02-02 10:43:47,084 INFO L182 omatonBuilderFactory]: Interpolants [50895#true, 50896#false, 50897#(= main_~i~1 0), 50898#(<= main_~i~1 1), 50899#(<= main_~i~1 2), 50900#(<= main_~i~1 3), 50901#(<= main_~i~1 4), 50902#(<= main_~i~1 5), 50903#(<= main_~i~1 6), 50904#(<= main_~i~1 7), 50905#(<= main_~i~1 8), 50906#(<= main_~i~1 9), 50907#(<= main_~i~1 10), 50908#(<= main_~i~1 11), 50909#(<= main_~i~1 12), 50910#(<= main_~i~1 13), 50911#(<= main_~i~1 14), 50912#(<= main_~i~1 15), 50913#(<= main_~i~1 16), 50914#(<= main_~i~1 17), 50915#(<= main_~i~1 18), 50916#(<= main_~i~1 19), 50917#(<= main_~i~1 20), 50918#(<= main_~i~1 21), 50919#(<= main_~i~1 22), 50920#(<= main_~i~1 23), 50921#(<= main_~i~1 24), 50922#(<= main_~i~1 25), 50923#(<= main_~i~1 26), 50924#(<= main_~i~1 27), 50925#(<= main_~i~1 28), 50926#(<= main_~i~1 29), 50927#(<= main_~i~1 30), 50928#(<= main_~i~1 31), 50929#(<= main_~i~1 32), 50930#(<= main_~i~1 33), 50931#(<= main_~i~1 34), 50932#(<= main_~i~1 35), 50933#(<= main_~i~1 36), 50934#(<= main_~i~1 37), 50935#(<= main_~i~1 38), 50936#(<= main_~i~1 39), 50937#(<= main_~i~1 40), 50938#(<= main_~i~1 41), 50939#(<= main_~i~1 42), 50940#(<= main_~i~1 43), 50941#(<= main_~i~1 44)]
[2018-02-02 10:43:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12474 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 5764 trivial. 0 not checked.
[2018-02-02 10:43:47,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states
[2018-02-02 10:43:47,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2018-02-02 10:43:47,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162
[2018-02-02 10:43:47,085 INFO L87 Difference]: Start difference. First operand 891 states and 1105 transitions. Second operand 47 states.
[2018-02-02 10:43:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:47,757 INFO L93 Difference]: Finished difference Result 1154 states and 1333 transitions.
[2018-02-02 10:43:47,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states.
[2018-02-02 10:43:47,757 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 597
[2018-02-02 10:43:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:47,760 INFO L225 Difference]: With dead ends: 1154
[2018-02-02 10:43:47,761 INFO L226 Difference]: Without dead ends: 1154
[2018-02-02 10:43:47,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162
[2018-02-02 10:43:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states.
[2018-02-02 10:43:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 910.
[2018-02-02 10:43:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states.
[2018-02-02 10:43:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1129 transitions.
[2018-02-02 10:43:47,768 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1129 transitions. Word has length 597
[2018-02-02 10:43:47,768 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:47,768 INFO L432 AbstractCegarLoop]: Abstraction has 910 states and 1129 transitions.
[2018-02-02 10:43:47,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states.
[2018-02-02 10:43:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1129 transitions.
[2018-02-02 10:43:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611
[2018-02-02 10:43:47,771 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:47,771 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 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:43:47,771 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1115031795, now seen corresponding path program 43 times
[2018-02-02 10:43:47,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:47,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 13050 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked.
[2018-02-02 10:43:48,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:48,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48
[2018-02-02 10:43:48,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5292 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5292 trivial. 0 not checked.
[2018-02-02 10:43:48,977 INFO L182 omatonBuilderFactory]: Interpolants [53006#true, 53007#false, 53008#(= main_~i~1 0), 53009#(<= main_~i~1 1), 53010#(<= main_~i~1 2), 53011#(<= main_~i~1 3), 53012#(<= main_~i~1 4), 53013#(<= main_~i~1 5), 53014#(<= main_~i~1 6), 53015#(<= main_~i~1 7), 53016#(<= main_~i~1 8), 53017#(<= main_~i~1 9), 53018#(<= main_~i~1 10), 53019#(<= main_~i~1 11), 53020#(<= main_~i~1 12), 53021#(<= main_~i~1 13), 53022#(<= main_~i~1 14), 53023#(<= main_~i~1 15), 53024#(<= main_~i~1 16), 53025#(<= main_~i~1 17), 53026#(<= main_~i~1 18), 53027#(<= main_~i~1 19), 53028#(<= main_~i~1 20), 53029#(<= main_~i~1 21), 53030#(<= main_~i~1 22), 53031#(<= main_~i~1 23), 53032#(<= main_~i~1 24), 53033#(<= main_~i~1 25), 53034#(<= main_~i~1 26), 53035#(<= main_~i~1 27), 53036#(<= main_~i~1 28), 53037#(<= main_~i~1 29), 53038#(<= main_~i~1 30), 53039#(<= main_~i~1 31), 53040#(<= main_~i~1 32), 53041#(<= main_~i~1 33), 53042#(<= main_~i~1 34), 53043#(<= main_~i~1 35), 53044#(<= main_~i~1 36), 53045#(<= main_~i~1 37), 53046#(<= main_~i~1 38), 53047#(<= main_~i~1 39), 53048#(<= main_~i~1 40), 53049#(<= main_~i~1 41), 53050#(<= main_~i~1 42), 53051#(<= main_~i~1 43), 53052#(<= main_~i~1 44), 53053#(<= main_~i~1 45)]
[2018-02-02 10:43:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13050 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked.
[2018-02-02 10:43:48,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states
[2018-02-02 10:43:48,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2018-02-02 10:43:48,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256
[2018-02-02 10:43:48,978 INFO L87 Difference]: Start difference. First operand 910 states and 1129 transitions. Second operand 48 states.
[2018-02-02 10:43:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:49,655 INFO L93 Difference]: Finished difference Result 1178 states and 1361 transitions.
[2018-02-02 10:43:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states.
[2018-02-02 10:43:49,656 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 610
[2018-02-02 10:43:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:49,658 INFO L225 Difference]: With dead ends: 1178
[2018-02-02 10:43:49,658 INFO L226 Difference]: Without dead ends: 1178
[2018-02-02 10:43:49,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256
[2018-02-02 10:43:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states.
[2018-02-02 10:43:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 929.
[2018-02-02 10:43:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states.
[2018-02-02 10:43:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1153 transitions.
[2018-02-02 10:43:49,669 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1153 transitions. Word has length 610
[2018-02-02 10:43:49,669 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:49,669 INFO L432 AbstractCegarLoop]: Abstraction has 929 states and 1153 transitions.
[2018-02-02 10:43:49,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states.
[2018-02-02 10:43:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1153 transitions.
[2018-02-02 10:43:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624
[2018-02-02 10:43:49,672 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:49,672 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 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:43:49,672 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:49,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1524247804, now seen corresponding path program 44 times
[2018-02-02 10:43:49,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:49,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13639 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 6302 trivial. 0 not checked.
[2018-02-02 10:43:50,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:50,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49
[2018-02-02 10:43:50,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5547 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5547 trivial. 0 not checked.
[2018-02-02 10:43:50,962 INFO L182 omatonBuilderFactory]: Interpolants [55168#(<= main_~i~1 5), 55169#(<= main_~i~1 6), 55170#(<= main_~i~1 7), 55171#(<= main_~i~1 8), 55172#(<= main_~i~1 9), 55173#(<= main_~i~1 10), 55174#(<= main_~i~1 11), 55175#(<= main_~i~1 12), 55176#(<= main_~i~1 13), 55177#(<= main_~i~1 14), 55178#(<= main_~i~1 15), 55179#(<= main_~i~1 16), 55180#(<= main_~i~1 17), 55181#(<= main_~i~1 18), 55182#(<= main_~i~1 19), 55183#(<= main_~i~1 20), 55184#(<= main_~i~1 21), 55185#(<= main_~i~1 22), 55186#(<= main_~i~1 23), 55187#(<= main_~i~1 24), 55188#(<= main_~i~1 25), 55189#(<= main_~i~1 26), 55190#(<= main_~i~1 27), 55191#(<= main_~i~1 28), 55192#(<= main_~i~1 29), 55193#(<= main_~i~1 30), 55194#(<= main_~i~1 31), 55195#(<= main_~i~1 32), 55196#(<= main_~i~1 33), 55197#(<= main_~i~1 34), 55198#(<= main_~i~1 35), 55199#(<= main_~i~1 36), 55200#(<= main_~i~1 37), 55201#(<= main_~i~1 38), 55202#(<= main_~i~1 39), 55203#(<= main_~i~1 40), 55204#(<= main_~i~1 41), 55205#(<= main_~i~1 42), 55206#(<= main_~i~1 43), 55207#(<= main_~i~1 44), 55208#(<= main_~i~1 45), 55209#(<= main_~i~1 46), 55161#true, 55162#false, 55163#(= main_~i~1 0), 55164#(<= main_~i~1 1), 55165#(<= main_~i~1 2), 55166#(<= main_~i~1 3), 55167#(<= main_~i~1 4)]
[2018-02-02 10:43:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 13639 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 6302 trivial. 0 not checked.
[2018-02-02 10:43:50,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states
[2018-02-02 10:43:50,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2018-02-02 10:43:50,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352
[2018-02-02 10:43:50,963 INFO L87 Difference]: Start difference. First operand 929 states and 1153 transitions. Second operand 49 states.
[2018-02-02 10:43:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:51,657 INFO L93 Difference]: Finished difference Result 1202 states and 1389 transitions.
[2018-02-02 10:43:51,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2018-02-02 10:43:51,657 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 623
[2018-02-02 10:43:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:51,660 INFO L225 Difference]: With dead ends: 1202
[2018-02-02 10:43:51,660 INFO L226 Difference]: Without dead ends: 1202
[2018-02-02 10:43:51,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352
[2018-02-02 10:43:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states.
[2018-02-02 10:43:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 948.
[2018-02-02 10:43:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states.
[2018-02-02 10:43:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1177 transitions.
[2018-02-02 10:43:51,669 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1177 transitions. Word has length 623
[2018-02-02 10:43:51,670 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:51,670 INFO L432 AbstractCegarLoop]: Abstraction has 948 states and 1177 transitions.
[2018-02-02 10:43:51,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states.
[2018-02-02 10:43:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1177 transitions.
[2018-02-02 10:43:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637
[2018-02-02 10:43:51,673 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:51,673 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 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:43:51,673 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:51,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1470672019, now seen corresponding path program 45 times
[2018-02-02 10:43:51,674 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:51,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:43:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 14241 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 6580 trivial. 0 not checked.
[2018-02-02 10:43:53,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:53,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50
[2018-02-02 10:43:53,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5808 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5808 trivial. 0 not checked.
[2018-02-02 10:43:53,017 INFO L182 omatonBuilderFactory]: Interpolants [57360#true, 57361#false, 57362#(= main_~i~1 0), 57363#(<= main_~i~1 1), 57364#(<= main_~i~1 2), 57365#(<= main_~i~1 3), 57366#(<= main_~i~1 4), 57367#(<= main_~i~1 5), 57368#(<= main_~i~1 6), 57369#(<= main_~i~1 7), 57370#(<= main_~i~1 8), 57371#(<= main_~i~1 9), 57372#(<= main_~i~1 10), 57373#(<= main_~i~1 11), 57374#(<= main_~i~1 12), 57375#(<= main_~i~1 13), 57376#(<= main_~i~1 14), 57377#(<= main_~i~1 15), 57378#(<= main_~i~1 16), 57379#(<= main_~i~1 17), 57380#(<= main_~i~1 18), 57381#(<= main_~i~1 19), 57382#(<= main_~i~1 20), 57383#(<= main_~i~1 21), 57384#(<= main_~i~1 22), 57385#(<= main_~i~1 23), 57386#(<= main_~i~1 24), 57387#(<= main_~i~1 25), 57388#(<= main_~i~1 26), 57389#(<= main_~i~1 27), 57390#(<= main_~i~1 28), 57391#(<= main_~i~1 29), 57392#(<= main_~i~1 30), 57393#(<= main_~i~1 31), 57394#(<= main_~i~1 32), 57395#(<= main_~i~1 33), 57396#(<= main_~i~1 34), 57397#(<= main_~i~1 35), 57398#(<= main_~i~1 36), 57399#(<= main_~i~1 37), 57400#(<= main_~i~1 38), 57401#(<= main_~i~1 39), 57402#(<= main_~i~1 40), 57403#(<= main_~i~1 41), 57404#(<= main_~i~1 42), 57405#(<= main_~i~1 43), 57406#(<= main_~i~1 44), 57407#(<= main_~i~1 45), 57408#(<= main_~i~1 46), 57409#(<= main_~i~1 47)]
[2018-02-02 10:43:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 14241 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 6580 trivial. 0 not checked.
[2018-02-02 10:43:53,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states
[2018-02-02 10:43:53,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2018-02-02 10:43:53,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450
[2018-02-02 10:43:53,018 INFO L87 Difference]: Start difference. First operand 948 states and 1177 transitions. Second operand 50 states.
[2018-02-02 10:43:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:53,692 INFO L93 Difference]: Finished difference Result 1226 states and 1417 transitions.
[2018-02-02 10:43:53,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2018-02-02 10:43:53,692 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 636
[2018-02-02 10:43:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:53,694 INFO L225 Difference]: With dead ends: 1226
[2018-02-02 10:43:53,694 INFO L226 Difference]: Without dead ends: 1226
[2018-02-02 10:43:53,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450
[2018-02-02 10:43:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states.
[2018-02-02 10:43:53,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 967.
[2018-02-02 10:43:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states.
[2018-02-02 10:43:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1201 transitions.
[2018-02-02 10:43:53,701 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1201 transitions. Word has length 636
[2018-02-02 10:43:53,701 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:53,701 INFO L432 AbstractCegarLoop]: Abstraction has 967 states and 1201 transitions.
[2018-02-02 10:43:53,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states.
[2018-02-02 10:43:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1201 transitions.
[2018-02-02 10:43:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650
[2018-02-02 10:43:53,704 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:53,705 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 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:43:53,705 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:53,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1932661604, now seen corresponding path program 46 times
[2018-02-02 10:43:53,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:53,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 14856 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 6864 trivial. 0 not checked.
[2018-02-02 10:43:55,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:55,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51
[2018-02-02 10:43:55,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6075 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6075 trivial. 0 not checked.
[2018-02-02 10:43:55,079 INFO L182 omatonBuilderFactory]: Interpolants [59648#(<= main_~i~1 43), 59649#(<= main_~i~1 44), 59650#(<= main_~i~1 45), 59651#(<= main_~i~1 46), 59652#(<= main_~i~1 47), 59653#(<= main_~i~1 48), 59603#true, 59604#false, 59605#(= main_~i~1 0), 59606#(<= main_~i~1 1), 59607#(<= main_~i~1 2), 59608#(<= main_~i~1 3), 59609#(<= main_~i~1 4), 59610#(<= main_~i~1 5), 59611#(<= main_~i~1 6), 59612#(<= main_~i~1 7), 59613#(<= main_~i~1 8), 59614#(<= main_~i~1 9), 59615#(<= main_~i~1 10), 59616#(<= main_~i~1 11), 59617#(<= main_~i~1 12), 59618#(<= main_~i~1 13), 59619#(<= main_~i~1 14), 59620#(<= main_~i~1 15), 59621#(<= main_~i~1 16), 59622#(<= main_~i~1 17), 59623#(<= main_~i~1 18), 59624#(<= main_~i~1 19), 59625#(<= main_~i~1 20), 59626#(<= main_~i~1 21), 59627#(<= main_~i~1 22), 59628#(<= main_~i~1 23), 59629#(<= main_~i~1 24), 59630#(<= main_~i~1 25), 59631#(<= main_~i~1 26), 59632#(<= main_~i~1 27), 59633#(<= main_~i~1 28), 59634#(<= main_~i~1 29), 59635#(<= main_~i~1 30), 59636#(<= main_~i~1 31), 59637#(<= main_~i~1 32), 59638#(<= main_~i~1 33), 59639#(<= main_~i~1 34), 59640#(<= main_~i~1 35), 59641#(<= main_~i~1 36), 59642#(<= main_~i~1 37), 59643#(<= main_~i~1 38), 59644#(<= main_~i~1 39), 59645#(<= main_~i~1 40), 59646#(<= main_~i~1 41), 59647#(<= main_~i~1 42)]
[2018-02-02 10:43:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14856 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 6864 trivial. 0 not checked.
[2018-02-02 10:43:55,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states
[2018-02-02 10:43:55,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2018-02-02 10:43:55,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550
[2018-02-02 10:43:55,080 INFO L87 Difference]: Start difference. First operand 967 states and 1201 transitions. Second operand 51 states.
[2018-02-02 10:43:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:55,806 INFO L93 Difference]: Finished difference Result 1250 states and 1445 transitions.
[2018-02-02 10:43:55,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states.
[2018-02-02 10:43:55,807 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 649
[2018-02-02 10:43:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:55,808 INFO L225 Difference]: With dead ends: 1250
[2018-02-02 10:43:55,808 INFO L226 Difference]: Without dead ends: 1250
[2018-02-02 10:43:55,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550
[2018-02-02 10:43:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states.
[2018-02-02 10:43:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 986.
[2018-02-02 10:43:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states.
[2018-02-02 10:43:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1225 transitions.
[2018-02-02 10:43:55,814 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1225 transitions. Word has length 649
[2018-02-02 10:43:55,814 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:55,814 INFO L432 AbstractCegarLoop]: Abstraction has 986 states and 1225 transitions.
[2018-02-02 10:43:55,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states.
[2018-02-02 10:43:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1225 transitions.
[2018-02-02 10:43:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663
[2018-02-02 10:43:55,817 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:55,817 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 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:43:55,817 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash -491780045, now seen corresponding path program 47 times
[2018-02-02 10:43:55,818 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:55,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15484 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 7154 trivial. 0 not checked.
[2018-02-02 10:43:57,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:57,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52
[2018-02-02 10:43:57,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6348 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6348 trivial. 0 not checked.
[2018-02-02 10:43:57,258 INFO L182 omatonBuilderFactory]: Interpolants [61890#true, 61891#false, 61892#(= main_~i~1 0), 61893#(<= main_~i~1 1), 61894#(<= main_~i~1 2), 61895#(<= main_~i~1 3), 61896#(<= main_~i~1 4), 61897#(<= main_~i~1 5), 61898#(<= main_~i~1 6), 61899#(<= main_~i~1 7), 61900#(<= main_~i~1 8), 61901#(<= main_~i~1 9), 61902#(<= main_~i~1 10), 61903#(<= main_~i~1 11), 61904#(<= main_~i~1 12), 61905#(<= main_~i~1 13), 61906#(<= main_~i~1 14), 61907#(<= main_~i~1 15), 61908#(<= main_~i~1 16), 61909#(<= main_~i~1 17), 61910#(<= main_~i~1 18), 61911#(<= main_~i~1 19), 61912#(<= main_~i~1 20), 61913#(<= main_~i~1 21), 61914#(<= main_~i~1 22), 61915#(<= main_~i~1 23), 61916#(<= main_~i~1 24), 61917#(<= main_~i~1 25), 61918#(<= main_~i~1 26), 61919#(<= main_~i~1 27), 61920#(<= main_~i~1 28), 61921#(<= main_~i~1 29), 61922#(<= main_~i~1 30), 61923#(<= main_~i~1 31), 61924#(<= main_~i~1 32), 61925#(<= main_~i~1 33), 61926#(<= main_~i~1 34), 61927#(<= main_~i~1 35), 61928#(<= main_~i~1 36), 61929#(<= main_~i~1 37), 61930#(<= main_~i~1 38), 61931#(<= main_~i~1 39), 61932#(<= main_~i~1 40), 61933#(<= main_~i~1 41), 61934#(<= main_~i~1 42), 61935#(<= main_~i~1 43), 61936#(<= main_~i~1 44), 61937#(<= main_~i~1 45), 61938#(<= main_~i~1 46), 61939#(<= main_~i~1 47), 61940#(<= main_~i~1 48), 61941#(<= main_~i~1 49)]
[2018-02-02 10:43:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15484 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 7154 trivial. 0 not checked.
[2018-02-02 10:43:57,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states
[2018-02-02 10:43:57,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2018-02-02 10:43:57,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652
[2018-02-02 10:43:57,259 INFO L87 Difference]: Start difference. First operand 986 states and 1225 transitions. Second operand 52 states.
[2018-02-02 10:43:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:43:58,154 INFO L93 Difference]: Finished difference Result 1274 states and 1473 transitions.
[2018-02-02 10:43:58,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2018-02-02 10:43:58,154 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 662
[2018-02-02 10:43:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:43:58,156 INFO L225 Difference]: With dead ends: 1274
[2018-02-02 10:43:58,156 INFO L226 Difference]: Without dead ends: 1274
[2018-02-02 10:43:58,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652
[2018-02-02 10:43:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states.
[2018-02-02 10:43:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1005.
[2018-02-02 10:43:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states.
[2018-02-02 10:43:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1249 transitions.
[2018-02-02 10:43:58,162 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1249 transitions. Word has length 662
[2018-02-02 10:43:58,163 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:43:58,163 INFO L432 AbstractCegarLoop]: Abstraction has 1005 states and 1249 transitions.
[2018-02-02 10:43:58,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states.
[2018-02-02 10:43:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1249 transitions.
[2018-02-02 10:43:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676
[2018-02-02 10:43:58,166 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:43:58,166 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 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:43:58,166 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 10:43:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1289001924, now seen corresponding path program 48 times
[2018-02-02 10:43:58,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:43:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:43:58,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:43:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 16125 backedges. 0 proven. 8675 refuted. 0 times theorem prover too weak. 7450 trivial. 0 not checked.
[2018-02-02 10:43:59,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:43:59,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53
[2018-02-02 10:43:59,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:43:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6627 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6627 trivial. 0 not checked.
[2018-02-02 10:43:59,680 INFO L182 omatonBuilderFactory]: Interpolants [64256#(<= main_~i~1 33), 64257#(<= main_~i~1 34), 64258#(<= main_~i~1 35), 64259#(<= main_~i~1 36), 64260#(<= main_~i~1 37), 64261#(<= main_~i~1 38), 64262#(<= main_~i~1 39), 64263#(<= main_~i~1 40), 64264#(<= main_~i~1 41), 64265#(<= main_~i~1 42), 64266#(<= main_~i~1 43), 64267#(<= main_~i~1 44), 64268#(<= main_~i~1 45), 64269#(<= main_~i~1 46), 64270#(<= main_~i~1 47), 64271#(<= main_~i~1 48), 64272#(<= main_~i~1 49), 64273#(<= main_~i~1 50), 64221#true, 64222#false, 64223#(= main_~i~1 0), 64224#(<= main_~i~1 1), 64225#(<= main_~i~1 2), 64226#(<= main_~i~1 3), 64227#(<= main_~i~1 4), 64228#(<= main_~i~1 5), 64229#(<= main_~i~1 6), 64230#(<= main_~i~1 7), 64231#(<= main_~i~1 8), 64232#(<= main_~i~1 9), 64233#(<= main_~i~1 10), 64234#(<= main_~i~1 11), 64235#(<= main_~i~1 12), 64236#(<= main_~i~1 13), 64237#(<= main_~i~1 14), 64238#(<= main_~i~1 15), 64239#(<= main_~i~1 16), 64240#(<= main_~i~1 17), 64241#(<= main_~i~1 18), 64242#(<= main_~i~1 19), 64243#(<= main_~i~1 20), 64244#(<= main_~i~1 21), 64245#(<= main_~i~1 22), 64246#(<= main_~i~1 23), 64247#(<= main_~i~1 24), 64248#(<= main_~i~1 25), 64249#(<= main_~i~1 26), 64250#(<= main_~i~1 27), 64251#(<= main_~i~1 28), 64252#(<= main_~i~1 29), 64253#(<= main_~i~1 30), 64254#(<= main_~i~1 31), 64255#(<= main_~i~1 32)]
[2018-02-02 10:43:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16125 backedges. 0 proven. 8675 refuted. 0 times theorem prover too weak. 7450 trivial. 0 not checked.
[2018-02-02 10:43:59,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states
[2018-02-02 10:43:59,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants.
[2018-02-02 10:43:59,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756
[2018-02-02 10:43:59,681 INFO L87 Difference]: Start difference. First operand 1005 states and 1249 transitions. Second operand 53 states.
Received shutdown request...
[2018-02-02 10:43:59,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:43:59,805 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-02-02 10:43:59,810 WARN L185 ceAbstractionStarter]: Timeout
[2018-02-02 10:43:59,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:43:59 BoogieIcfgContainer
[2018-02-02 10:43:59,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 10:43:59,810 INFO L168 Benchmark]: Toolchain (without parser) took 48752.60 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 360.6 MB in the beginning and 2.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 174.5 MB. Max. memory is 5.3 GB.
[2018-02-02 10:43:59,811 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 10:43:59,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.52 ms. Allocated memory is still 402.7 MB. Free memory was 360.6 MB in the beginning and 352.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB.
[2018-02-02 10:43:59,812 INFO L168 Benchmark]: Boogie Preprocessor took 21.06 ms. Allocated memory is still 402.7 MB. Free memory was 352.5 MB in the beginning and 351.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-02 10:43:59,812 INFO L168 Benchmark]: RCFGBuilder took 263.82 ms. Allocated memory is still 402.7 MB. Free memory was 351.2 MB in the beginning and 332.6 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB.
[2018-02-02 10:43:59,812 INFO L168 Benchmark]: TraceAbstraction took 48324.63 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 332.6 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 146.5 MB. Max. memory is 5.3 GB.
[2018-02-02 10:43:59,813 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.20 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 139.52 ms. Allocated memory is still 402.7 MB. Free memory was 360.6 MB in the beginning and 352.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 21.06 ms. Allocated memory is still 402.7 MB. Free memory was 352.5 MB in the beginning and 351.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 263.82 ms. Allocated memory is still 402.7 MB. Free memory was 351.2 MB in the beginning and 332.6 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 48324.63 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 332.6 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 146.5 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (1005states) and interpolant automaton (currently 23 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (327 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction)
Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (1005states) and interpolant automaton (currently 23 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (327 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (1005states) and interpolant automaton (currently 23 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (327 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (1005states) and interpolant automaton (currently 23 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (327 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (1005states) and interpolant automaton (currently 23 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (327 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (1005states) and interpolant automaton (currently 23 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (327 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (1005states) and interpolant automaton (currently 23 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (327 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 20). Cancelled while BasicCegarLoop was constructing difference of abstraction (1005states) and interpolant automaton (currently 23 states, 53 states before enhancement), while ReachableStatesComputation was computing reachable states (327 states constructedinput type IntersectNwa).
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 49 locations, 8 error locations. TIMEOUT Result, 48.2s OverallTime, 62 OverallIterations, 51 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3413 SDtfs, 20363 SDslu, 30574 SDs, 0 SdLazy, 32175 SolverSat, 3078 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1506 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 1382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1005occurred in iteration=61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 127598/275936 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 61 MinimizatonAttempts, 7384 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 18145 NumberOfCodeBlocks, 18145 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 18083 ConstructedInterpolants, 0 QuantifiedInterpolants, 16419625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 8 PerfectInterpolantSequences, 127598/275936 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/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-43-59-820.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-43-59-820.csv
Completed graceful shutdown