java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:53:40,023 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:53:40,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:53:40,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:53:40,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:53:40,035 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:53:40,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:53:40,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:53:40,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:53:40,039 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:53:40,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:53:40,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:53:40,041 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:53:40,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:53:40,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:53:40,044 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:53:40,046 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:53:40,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:53:40,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:53:40,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:53:40,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:53:40,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:53:40,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:53:40,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:53:40,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:53:40,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:53:40,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:53:40,054 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:53:40,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:53:40,055 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:53:40,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:53:40,055 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 02:53:40,064 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:53:40,065 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:53:40,066 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:53:40,066 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:53:40,066 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:53:40,066 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:53:40,066 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:53:40,066 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:53:40,067 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:53:40,067 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:53:40,067 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:53:40,067 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:53:40,067 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:53:40,067 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:53:40,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:53:40,067 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:53:40,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:53:40,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:53:40,068 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:53:40,068 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:53:40,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:53:40,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:53:40,068 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:53:40,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:53:40,106 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:53:40,109 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:53:40,110 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:53:40,110 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:53:40,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-02-04 02:53:40,216 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:53:40,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:53:40,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:53:40,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:53:40,224 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:53:40,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:53:40" (1/1) ... [2018-02-04 02:53:40,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714e1530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:53:40, skipping insertion in model container [2018-02-04 02:53:40,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:53:40" (1/1) ... [2018-02-04 02:53:40,241 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:53:40,252 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:53:40,341 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:53:40,354 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:53:40,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:53:40 WrapperNode [2018-02-04 02:53:40,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:53:40,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:53:40,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:53:40,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:53:40,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:53:40" (1/1) ... [2018-02-04 02:53:40,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:53:40" (1/1) ... [2018-02-04 02:53:40,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:53:40" (1/1) ... [2018-02-04 02:53:40,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:53:40" (1/1) ... [2018-02-04 02:53:40,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:53:40" (1/1) ... [2018-02-04 02:53:40,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:53:40" (1/1) ... [2018-02-04 02:53:40,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:53:40" (1/1) ... [2018-02-04 02:53:40,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:53:40,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:53:40,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:53:40,386 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:53:40,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:53:40" (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-04 02:53:40,426 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:53:40,427 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:53:40,427 INFO L136 BoogieDeclarations]: Found implementation of procedure bar [2018-02-04 02:53:40,427 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 02:53:40,427 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:53:40,427 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:53:40,427 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:53:40,427 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:53:40,427 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:53:40,427 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:53:40,427 INFO L128 BoogieDeclarations]: Found specification of procedure bar [2018-02-04 02:53:40,427 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 02:53:40,428 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:53:40,428 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:53:40,428 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:53:40,610 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:53:40,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:53:40 BoogieIcfgContainer [2018-02-04 02:53:40,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:53:40,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:53:40,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:53:40,614 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:53:40,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:53:40" (1/3) ... [2018-02-04 02:53:40,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc5a7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:53:40, skipping insertion in model container [2018-02-04 02:53:40,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:53:40" (2/3) ... [2018-02-04 02:53:40,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc5a7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:53:40, skipping insertion in model container [2018-02-04 02:53:40,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:53:40" (3/3) ... [2018-02-04 02:53:40,616 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-02-04 02:53:40,621 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:53:40,625 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-04 02:53:40,647 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:53:40,647 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:53:40,647 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:53:40,647 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:53:40,647 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:53:40,647 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:53:40,647 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:53:40,647 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:53:40,648 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:53:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-02-04 02:53:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 02:53:40,666 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:40,666 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:40,667 INFO L371 AbstractCegarLoop]: === Iteration 1 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-02-04 02:53:40,703 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:40,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:40,758 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-04 02:53:40,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:53:40,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:53:40,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:40,761 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-04 02:53:40,762 INFO L182 omatonBuilderFactory]: Interpolants [71#true, 72#false] [2018-02-04 02:53:40,762 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-04 02:53:40,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 02:53:40,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 02:53:40,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:53:40,773 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-02-04 02:53:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:40,787 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 02:53:40,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 02:53:40,788 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-04 02:53:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:40,795 INFO L225 Difference]: With dead ends: 68 [2018-02-04 02:53:40,795 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 02:53:40,796 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-04 02:53:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 02:53:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 02:53:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 02:53:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 02:53:40,824 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-02-04 02:53:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:40,824 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 02:53:40,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 02:53:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 02:53:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:53:40,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:40,825 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:40,826 INFO L371 AbstractCegarLoop]: === Iteration 2 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:40,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-02-04 02:53:40,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:40,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:40,937 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-04 02:53:40,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:53:40,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:53:40,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:40,938 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-04 02:53:40,938 INFO L182 omatonBuilderFactory]: Interpolants [208#(= main_~i~2 0), 206#true, 207#false] [2018-02-04 02:53:40,938 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-04 02:53:40,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:53:40,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:53:40,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:53:40,940 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-02-04 02:53:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:40,989 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-02-04 02:53:40,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:53:40,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 02:53:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:40,992 INFO L225 Difference]: With dead ends: 71 [2018-02-04 02:53:40,992 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 02:53:40,993 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-04 02:53:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 02:53:41,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-02-04 02:53:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 02:53:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 02:53:41,002 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-02-04 02:53:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:41,002 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 02:53:41,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:53:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 02:53:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 02:53:41,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:41,003 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:41,003 INFO L371 AbstractCegarLoop]: === Iteration 3 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:41,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-02-04 02:53:41,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:41,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:41,077 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-04 02:53:41,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:53:41,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:53:41,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:41,078 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-04 02:53:41,078 INFO L182 omatonBuilderFactory]: Interpolants [344#true, 345#false, 346#(= 0 main_~i~2), 347#(= 0 |foo_#in~size|), 348#(= foo_~size 0), 349#(and (= foo_~size 0) (= foo_~i~1 0))] [2018-02-04 02:53:41,078 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-04 02:53:41,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:53:41,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:53:41,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:53:41,079 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-02-04 02:53:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:41,175 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-04 02:53:41,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:53:41,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 02:53:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:41,177 INFO L225 Difference]: With dead ends: 85 [2018-02-04 02:53:41,177 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 02:53:41,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:53:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 02:53:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-02-04 02:53:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 02:53:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-04 02:53:41,185 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-02-04 02:53:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:41,186 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-04 02:53:41,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:53:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-04 02:53:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 02:53:41,187 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:41,187 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:41,187 INFO L371 AbstractCegarLoop]: === Iteration 4 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:41,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-02-04 02:53:41,188 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:41,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:41,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:53:41,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:53:41,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:41,232 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-04 02:53:41,232 INFO L182 omatonBuilderFactory]: Interpolants [518#true, 519#false, 520#(= 1 (select |#valid| |foo_~#a~0.base|)), 521#(= 1 (select |#valid| |bar_#in~b.base|)), 522#(= 1 (select |#valid| bar_~b.base))] [2018-02-04 02:53:41,233 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-04 02:53:41,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:53:41,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:53:41,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:53:41,233 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-02-04 02:53:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:41,298 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-04 02:53:41,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:53:41,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 02:53:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:41,301 INFO L225 Difference]: With dead ends: 77 [2018-02-04 02:53:41,301 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 02:53:41,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:53:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 02:53:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 02:53:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 02:53:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 02:53:41,307 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-02-04 02:53:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:41,307 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 02:53:41,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:53:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 02:53:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 02:53:41,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:41,308 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:41,308 INFO L371 AbstractCegarLoop]: === Iteration 5 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:41,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-02-04 02:53:41,309 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:41,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:41,364 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-04 02:53:41,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:53:41,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:53:41,365 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:41,365 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-04 02:53:41,365 INFO L182 omatonBuilderFactory]: Interpolants [679#true, 680#false, 681#(= 0 main_~i~2), 682#(= 0 |foo_#in~size|), 683#(= 0 foo_~size), 684#(= 0 |bar_#in~size|), 685#(and (= bar_~size 0) (= bar_~i~0 0))] [2018-02-04 02:53:41,365 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-04 02:53:41,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:53:41,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:53:41,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:53:41,366 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-02-04 02:53:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:41,447 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-02-04 02:53:41,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:53:41,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 02:53:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:41,448 INFO L225 Difference]: With dead ends: 89 [2018-02-04 02:53:41,448 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 02:53:41,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:53:41,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 02:53:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-02-04 02:53:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 02:53:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-02-04 02:53:41,453 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-02-04 02:53:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:41,454 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-02-04 02:53:41,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:53:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-02-04 02:53:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:53:41,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:41,455 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:41,455 INFO L371 AbstractCegarLoop]: === Iteration 6 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:41,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-02-04 02:53:41,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:41,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:41,501 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-04 02:53:41,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:53:41,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:53:41,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:41,502 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-04 02:53:41,502 INFO L182 omatonBuilderFactory]: Interpolants [864#(= 0 bar_~res~0), 865#(= 0 |bar_#res|), 866#(= |foo_#t~ret5| 0), 862#true, 863#false] [2018-02-04 02:53:41,502 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-04 02:53:41,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:53:41,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:53:41,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:53:41,503 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-02-04 02:53:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:41,516 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-04 02:53:41,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:53:41,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-04 02:53:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:41,517 INFO L225 Difference]: With dead ends: 91 [2018-02-04 02:53:41,517 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 02:53:41,518 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-04 02:53:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 02:53:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-02-04 02:53:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 02:53:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-02-04 02:53:41,522 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-02-04 02:53:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:41,522 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-02-04 02:53:41,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:53:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-02-04 02:53:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:53:41,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:41,523 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:41,523 INFO L371 AbstractCegarLoop]: === Iteration 7 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-02-04 02:53:41,524 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:41,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:41,605 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-04 02:53:41,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:53:41,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:53:41,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:41,606 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-04 02:53:41,607 INFO L182 omatonBuilderFactory]: Interpolants [1048#true, 1049#false, 1050#(= 1 (select |#valid| |main_~#b~0.base|)), 1051#(= |#valid| |old(#valid)|), 1052#(and (= (select |old(#valid)| |foo_~#a~0.base|) 0) (= |#valid| (store |old(#valid)| |foo_~#a~0.base| (select |#valid| |foo_~#a~0.base|))))] [2018-02-04 02:53:41,607 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-04 02:53:41,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:53:41,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:53:41,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:53:41,608 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 5 states. [2018-02-04 02:53:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:41,694 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-02-04 02:53:41,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:53:41,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-04 02:53:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:41,696 INFO L225 Difference]: With dead ends: 86 [2018-02-04 02:53:41,696 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 02:53:41,696 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:53:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 02:53:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 02:53:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 02:53:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-02-04 02:53:41,701 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 31 [2018-02-04 02:53:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:41,701 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-02-04 02:53:41,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:53:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-02-04 02:53:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:53:41,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:41,702 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:41,703 INFO L371 AbstractCegarLoop]: === Iteration 8 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:41,703 INFO L82 PathProgramCache]: Analyzing trace with hash 216183674, now seen corresponding path program 1 times [2018-02-04 02:53:41,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:41,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:41,814 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-04 02:53:41,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:53:41,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:53:41,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:41,815 INFO L182 omatonBuilderFactory]: Interpolants [1232#(and (= 0 (select |old(#valid)| |foo_~#a~0.base|)) (= |#length| (store |old(#length)| |foo_~#a~0.base| (select |#length| |foo_~#a~0.base|)))), 1233#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 1234#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (= main_~i~2 0)), 1227#true, 1228#false, 1229#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (= (select |#valid| |main_~#b~0.base|) 1)), 1230#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (= (select |#valid| |main_~#b~0.base|) 1) (= main_~i~2 0)), 1231#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|))] [2018-02-04 02:53:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:41,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:53:41,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:53:41,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:53:41,816 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 8 states. [2018-02-04 02:53:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:42,004 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-02-04 02:53:42,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:53:42,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 02:53:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:42,005 INFO L225 Difference]: With dead ends: 101 [2018-02-04 02:53:42,006 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 02:53:42,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:53:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 02:53:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-02-04 02:53:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 02:53:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-02-04 02:53:42,010 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 31 [2018-02-04 02:53:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:42,011 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-02-04 02:53:42,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:53:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-02-04 02:53:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 02:53:42,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:42,012 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:42,012 INFO L371 AbstractCegarLoop]: === Iteration 9 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash -231887552, now seen corresponding path program 1 times [2018-02-04 02:53:42,013 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:42,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:42,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:53:42,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:53:42,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:42,078 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-04 02:53:42,079 INFO L182 omatonBuilderFactory]: Interpolants [1440#(= 1 (select |#valid| |foo_#in~b.base|)), 1441#(= (select |#valid| foo_~b.base) 1), 1437#true, 1438#false, 1439#(= (select |#valid| |main_~#b~0.base|) 1)] [2018-02-04 02:53:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:42,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:53:42,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:53:42,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:53:42,080 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 5 states. [2018-02-04 02:53:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:42,125 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-02-04 02:53:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:53:42,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-04 02:53:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:42,128 INFO L225 Difference]: With dead ends: 96 [2018-02-04 02:53:42,128 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 02:53:42,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-04 02:53:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 02:53:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-04 02:53:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 02:53:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-04 02:53:42,134 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 42 [2018-02-04 02:53:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:42,135 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-04 02:53:42,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:53:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-04 02:53:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 02:53:42,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:42,136 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:42,136 INFO L371 AbstractCegarLoop]: === Iteration 10 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:42,137 INFO L82 PathProgramCache]: Analyzing trace with hash -231887551, now seen corresponding path program 1 times [2018-02-04 02:53:42,137 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:42,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:42,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:42,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:53:42,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:42,323 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-04 02:53:42,323 INFO L182 omatonBuilderFactory]: Interpolants [1637#true, 1638#false, 1639#(= 0 |main_~#b~0.offset|), 1640#(and (= 0 |main_~#b~0.offset|) (= main_~i~2 0)), 1641#(and (<= 4 (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|) (= main_~i~2 0)), 1642#(and (<= 4 (select |#length| |main_~#b~0.base|)) (<= main_~i~2 1) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|)), 1643#(and (= 0 |foo_#in~b.offset|) (<= 4 (select |#length| |foo_#in~b.base|)) (<= |foo_#in~size| 1) (= (select |#valid| |foo_#in~b.base|) 1)), 1644#(and (<= foo_~size 1) (<= 4 (select |#length| foo_~b.base)) (= (select |#valid| foo_~b.base) 1) (= foo_~b.offset 0)), 1645#(and (<= foo_~size 1) (<= 4 (select |#length| foo_~b.base)) (= foo_~b.offset 0)), 1646#(and (or (and (<= 4 (select |#length| foo_~b.base)) (= foo_~i~1 0)) (< 0 foo_~i~1)) (or (<= foo_~size 1) (<= foo_~i~1 0)) (= foo_~b.offset 0)), 1647#(and (<= 4 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= foo_~i~1 0))] [2018-02-04 02:53:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:42,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:53:42,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:53:42,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:53:42,324 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 11 states. [2018-02-04 02:53:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:42,598 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2018-02-04 02:53:42,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:53:42,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-04 02:53:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:42,600 INFO L225 Difference]: With dead ends: 129 [2018-02-04 02:53:42,600 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 02:53:42,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:53:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 02:53:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2018-02-04 02:53:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 02:53:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2018-02-04 02:53:42,606 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 42 [2018-02-04 02:53:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:42,606 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2018-02-04 02:53:42,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:53:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-02-04 02:53:42,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 02:53:42,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:42,608 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:42,608 INFO L371 AbstractCegarLoop]: === Iteration 11 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:42,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1401420489, now seen corresponding path program 1 times [2018-02-04 02:53:42,609 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:42,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:53:42,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:53:42,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:53:42,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:42,701 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-04 02:53:42,701 INFO L182 omatonBuilderFactory]: Interpolants [1906#true, 1907#false, 1908#(= 0 |main_~#b~0.offset|), 1909#(and (= 0 |foo_#in~b.offset|) (<= |foo_#in~size| |foo_#in~n|)), 1910#(and (= foo_~b.offset 0) (<= foo_~size foo_~n)), 1911#(and (<= (* 4 foo_~size) (select |#length| |foo_~#a~0.base|)) (= foo_~b.offset 0) (= |foo_~#a~0.offset| 0)), 1912#(and (<= (+ (* 4 foo_~i~1) 4) (select |#length| |foo_~#a~0.base|)) (= foo_~b.offset 0) (= |foo_~#a~0.offset| 0)), 1913#(and (<= 0 foo_~i~1) (<= (+ (* 4 foo_~i~1) 4) (select |#length| |foo_~#a~0.base|)) (= |foo_~#a~0.offset| 0))] [2018-02-04 02:53:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:53:42,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:53:42,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:53:42,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:53:42,702 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 8 states. [2018-02-04 02:53:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:42,782 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2018-02-04 02:53:42,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:53:42,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-02-04 02:53:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:42,784 INFO L225 Difference]: With dead ends: 114 [2018-02-04 02:53:42,784 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 02:53:42,785 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:53:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 02:53:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 02:53:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 02:53:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-02-04 02:53:42,787 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 43 [2018-02-04 02:53:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:42,787 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-02-04 02:53:42,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:53:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-02-04 02:53:42,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 02:53:42,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:42,788 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:42,788 INFO L371 AbstractCegarLoop]: === Iteration 12 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:42,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1644784265, now seen corresponding path program 1 times [2018-02-04 02:53:42,789 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:42,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:42,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:42,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:53:42,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:42,835 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-04 02:53:42,835 INFO L182 omatonBuilderFactory]: Interpolants [2152#true, 2153#false, 2154#(= main_~i~2 0), 2155#(<= 1 main_~i~2), 2156#(<= 1 |foo_#in~size|), 2157#(<= 1 foo_~size), 2158#(and (<= 1 foo_~size) (= foo_~i~1 0))] [2018-02-04 02:53:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:42,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:53:42,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:53:42,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:53:42,836 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 7 states. [2018-02-04 02:53:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:42,901 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-02-04 02:53:42,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:53:42,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-02-04 02:53:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:42,902 INFO L225 Difference]: With dead ends: 127 [2018-02-04 02:53:42,902 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 02:53:42,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:53:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 02:53:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2018-02-04 02:53:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 02:53:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-02-04 02:53:42,906 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 46 [2018-02-04 02:53:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:42,907 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-02-04 02:53:42,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:53:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-02-04 02:53:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 02:53:42,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:42,907 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:42,909 INFO L371 AbstractCegarLoop]: === Iteration 13 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1096362099, now seen corresponding path program 1 times [2018-02-04 02:53:42,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:42,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:53:43,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:53:43,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:53:43,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:43,003 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-04 02:53:43,004 INFO L182 omatonBuilderFactory]: Interpolants [2416#(and (= bar_~i~0 0) (<= (* 4 bar_~size) (select |#length| bar_~b.base)) (= bar_~b.offset 0)), 2417#(and (= bar_~i~0 0) (<= (+ (* 4 bar_~i~0) 4) (select |#length| bar_~b.base)) (= bar_~b.offset 0)), 2410#true, 2411#false, 2412#(<= |foo_#in~size| |foo_#in~n|), 2413#(<= foo_~size foo_~n), 2414#(and (<= (* 4 foo_~size) (select |#length| |foo_~#a~0.base|)) (= 0 |foo_~#a~0.offset|)), 2415#(and (= 0 |bar_#in~b.offset|) (<= (* 4 |bar_#in~size|) (select |#length| |bar_#in~b.base|)))] [2018-02-04 02:53:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:53:43,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:53:43,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:53:43,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:53:43,005 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 8 states. [2018-02-04 02:53:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:43,144 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-02-04 02:53:43,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:53:43,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-02-04 02:53:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:43,146 INFO L225 Difference]: With dead ends: 121 [2018-02-04 02:53:43,146 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 02:53:43,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:53:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 02:53:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-04 02:53:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 02:53:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2018-02-04 02:53:43,150 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 52 [2018-02-04 02:53:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:43,150 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-02-04 02:53:43,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:53:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2018-02-04 02:53:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 02:53:43,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:43,152 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:43,153 INFO L371 AbstractCegarLoop]: === Iteration 14 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1224161946, now seen corresponding path program 1 times [2018-02-04 02:53:43,153 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:43,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:53:43,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:43,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:53:43,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:43,258 INFO L182 omatonBuilderFactory]: Interpolants [2672#(<= |foo_#in~size| 1), 2673#(<= foo_~size 1), 2674#(and (<= foo_~size 1) (= 0 |foo_~#a~0.offset|)), 2675#(and (= 0 |bar_#in~b.offset|) (<= |bar_#in~size| 1)), 2676#(and (<= bar_~size 1) (= bar_~b.offset 0)), 2677#(and (<= (* 4 bar_~size) (+ bar_~b.offset (* 4 bar_~i~0) 4)) (= bar_~b.offset 0)), 2678#(and (<= (* 4 bar_~size) (+ bar_~b.offset (* 4 bar_~i~0))) (= bar_~b.offset 0)), 2668#true, 2669#false, 2670#(= main_~i~2 0), 2671#(<= main_~i~2 1)] [2018-02-04 02:53:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:53:43,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:53:43,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:53:43,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:53:43,259 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 11 states. [2018-02-04 02:53:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:43,405 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-02-04 02:53:43,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:53:43,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-02-04 02:53:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:43,406 INFO L225 Difference]: With dead ends: 138 [2018-02-04 02:53:43,406 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 02:53:43,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:53:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 02:53:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2018-02-04 02:53:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 02:53:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-02-04 02:53:43,410 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 57 [2018-02-04 02:53:43,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:43,410 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-02-04 02:53:43,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:53:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-02-04 02:53:43,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 02:53:43,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:43,411 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-04 02:53:43,411 INFO L371 AbstractCegarLoop]: === Iteration 15 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash -227989441, now seen corresponding path program 1 times [2018-02-04 02:53:43,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:43,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:53:43,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:43,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:53:43,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:43,497 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-04 02:53:43,498 INFO L182 omatonBuilderFactory]: Interpolants [2962#true, 2963#false, 2964#(= 0 |main_~#b~0.offset|), 2965#(or (= |foo_#in~b.offset| foo_~b.offset) (= foo_~b.offset 0)), 2966#(and (or (= |foo_#in~b.offset| foo_~b.offset) (= foo_~b.offset 0)) (or (not (= foo_~b.offset 0)) (<= (+ foo_~i~1 1) foo_~size))), 2967#(or (not (= |foo_#in~b.offset| 0)) (<= 1 foo_~size)), 2968#(and (<= |bar_#in~size| bar_~size) (= bar_~i~0 0)), 2969#(<= |bar_#in~size| 0), 2970#(not (= |foo_#in~b.offset| 0))] [2018-02-04 02:53:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:53:43,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:53:43,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:53:43,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:53:43,498 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 9 states. [2018-02-04 02:53:43,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:43,590 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-04 02:53:43,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:53:43,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-02-04 02:53:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:43,592 INFO L225 Difference]: With dead ends: 146 [2018-02-04 02:53:43,592 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 02:53:43,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:53:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 02:53:43,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2018-02-04 02:53:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 02:53:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-02-04 02:53:43,595 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 62 [2018-02-04 02:53:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:43,596 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-02-04 02:53:43,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:53:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-02-04 02:53:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:53:43,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:43,596 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:43,596 INFO L371 AbstractCegarLoop]: === Iteration 16 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:43,597 INFO L82 PathProgramCache]: Analyzing trace with hash 897277161, now seen corresponding path program 1 times [2018-02-04 02:53:43,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:43,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 02:53:43,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:43,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:53:43,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:43,810 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-04 02:53:43,810 INFO L182 omatonBuilderFactory]: Interpolants [3264#(and (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (<= main_~i~2 1)), 3249#true, 3250#false, 3251#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0)), 3252#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (= main_~i~2 0)), 3253#(= |old(#length)| |#length|), 3254#(= |#length| (store |old(#length)| |foo_~#a~0.base| (select |#length| |foo_~#a~0.base|))), 3255#(and (or (= 0 (select |#valid| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 3256#(and (or (= 400 (select |#length| |main_~#b~0.base|)) (= 0 (select |#valid| |main_~#b~0.base|))) (= |main_~#b~0.offset| 0) (= main_~i~2 0)), 3257#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (= (select |#valid| |main_~#b~0.base|) 1) (= main_~i~2 0)), 3258#(and (= 400 (select |#length| |main_~#b~0.base|)) (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= |main_~#b~0.offset| 0) (<= main_~i~2 1) (= (select |#valid| |main_~#b~0.base|) 1)), 3259#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 3260#(and (= |#valid| |old(#valid)|) (= foo_~b.base |foo_#in~b.base|) (= (select |old(#length)| foo_~b.base) (select |#length| foo_~b.base))), 3261#(and (= 0 (select |old(#valid)| |foo_~#a~0.base|)) (or (= (select |old(#length)| foo_~b.base) (select |#length| foo_~b.base)) (= |foo_~#a~0.base| foo_~b.base)) (= foo_~b.base |foo_#in~b.base|)), 3262#(and (= 0 (select |old(#valid)| |foo_~#a~0.base|)) (or (= |foo_~#a~0.base| |foo_#in~b.base|) (= (select |#length| |foo_#in~b.base|) (select |old(#length)| |foo_#in~b.base|)))), 3263#(or (= 0 (select |old(#valid)| |foo_#in~b.base|)) (= (select |#length| |foo_#in~b.base|) (select |old(#length)| |foo_#in~b.base|)))] [2018-02-04 02:53:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 02:53:43,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:53:43,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:53:43,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:53:43,811 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 16 states. [2018-02-04 02:53:44,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:44,084 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-02-04 02:53:44,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:53:44,084 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-02-04 02:53:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:44,085 INFO L225 Difference]: With dead ends: 141 [2018-02-04 02:53:44,085 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 02:53:44,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:53:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 02:53:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-02-04 02:53:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 02:53:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2018-02-04 02:53:44,090 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 67 [2018-02-04 02:53:44,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:44,090 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2018-02-04 02:53:44,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:53:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2018-02-04 02:53:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 02:53:44,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:44,093 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-02-04 02:53:44,093 INFO L371 AbstractCegarLoop]: === Iteration 17 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:44,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1765271438, now seen corresponding path program 1 times [2018-02-04 02:53:44,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:44,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 02:53:44,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:44,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:53:44,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:44,215 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-04 02:53:44,215 INFO L182 omatonBuilderFactory]: Interpolants [3552#(and (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= 0 |main_~#b~0.offset|)), 3553#(= foo_~b.base |foo_#in~b.base|), 3554#(and (<= 8 (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|)), 3555#(and (= 0 |foo_#in~b.offset|) (= (select |#valid| |foo_#in~b.base|) 1) (<= 8 (select |#length| |foo_#in~b.base|))), 3556#(and (<= 8 (select |#length| foo_~b.base)) (= (select |#valid| foo_~b.base) 1) (= foo_~b.offset 0)), 3557#(and (<= 8 (select |#length| foo_~b.base)) (= foo_~b.offset 0)), 3558#(and (<= 8 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= foo_~i~1 0)), 3548#true, 3549#false, 3550#(= 0 |main_~#b~0.offset|), 3551#(and (<= 0 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= 0 |main_~#b~0.offset|))] [2018-02-04 02:53:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 02:53:44,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:53:44,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:53:44,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:53:44,215 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 11 states. [2018-02-04 02:53:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:44,395 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-02-04 02:53:44,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:53:44,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-02-04 02:53:44,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:44,395 INFO L225 Difference]: With dead ends: 134 [2018-02-04 02:53:44,395 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 02:53:44,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:53:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 02:53:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-02-04 02:53:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-04 02:53:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-02-04 02:53:44,398 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 78 [2018-02-04 02:53:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:44,398 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-02-04 02:53:44,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:53:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-02-04 02:53:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 02:53:44,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:44,398 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:44,399 INFO L371 AbstractCegarLoop]: === Iteration 18 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1591994525, now seen corresponding path program 1 times [2018-02-04 02:53:44,399 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:44,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 02:53:44,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:44,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 02:53:44,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:44,427 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-04 02:53:44,427 INFO L182 omatonBuilderFactory]: Interpolants [3840#(= main_~i~2 0), 3841#(<= main_~i~2 1), 3842#(<= main_~i~2 2), 3838#true, 3839#false] [2018-02-04 02:53:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 02:53:44,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:53:44,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:53:44,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:53:44,428 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 5 states. [2018-02-04 02:53:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:44,452 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2018-02-04 02:53:44,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:53:44,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-02-04 02:53:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:44,453 INFO L225 Difference]: With dead ends: 136 [2018-02-04 02:53:44,453 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 02:53:44,453 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-04 02:53:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 02:53:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2018-02-04 02:53:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 02:53:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-02-04 02:53:44,457 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 80 [2018-02-04 02:53:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:44,457 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-02-04 02:53:44,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:53:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-02-04 02:53:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 02:53:44,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:44,458 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1] [2018-02-04 02:53:44,458 INFO L371 AbstractCegarLoop]: === Iteration 19 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1581116616, now seen corresponding path program 2 times [2018-02-04 02:53:44,459 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:44,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 02:53:44,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:44,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:53:44,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:44,629 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-04 02:53:44,629 INFO L182 omatonBuilderFactory]: Interpolants [4109#true, 4110#false, 4111#(= 0 |main_~#b~0.offset|), 4112#(and (= 0 |main_~#b~0.offset|) (= main_~i~2 0)), 4113#(= foo_~b.base |foo_#in~b.base|), 4114#(and (<= (+ (* 4 main_~i~2) 4) (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|)), 4115#(and (<= (* 4 main_~i~2) (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|)), 4116#(and (= 0 |foo_#in~b.offset|) (<= (* 4 |foo_#in~size|) (select |#length| |foo_#in~b.base|)) (= (select |#valid| |foo_#in~b.base|) 1)), 4117#(and (= (select |#valid| foo_~b.base) 1) (= foo_~b.offset 0) (<= (* 4 foo_~size) (select |#length| foo_~b.base))), 4118#(and (= foo_~b.offset 0) (<= (* 4 foo_~size) (select |#length| foo_~b.base))), 4119#(and (<= 0 (+ (* 4 foo_~i~1) foo_~b.offset)) (= foo_~b.offset 0) (<= (* 4 foo_~size) (select |#length| foo_~b.base))), 4120#(and (<= 4 (+ (* 4 foo_~i~1) foo_~b.offset)) (= foo_~b.offset 0) (<= (* 4 foo_~size) (select |#length| foo_~b.base))), 4121#(and (<= 4 (+ (* 4 foo_~i~1) foo_~b.offset)) (= foo_~b.offset 0) (<= (+ (* 4 foo_~i~1) 4) (select |#length| foo_~b.base)))] [2018-02-04 02:53:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 02:53:44,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:53:44,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:53:44,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:53:44,630 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 13 states. [2018-02-04 02:53:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:44,836 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-02-04 02:53:44,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:53:44,836 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2018-02-04 02:53:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:44,837 INFO L225 Difference]: With dead ends: 136 [2018-02-04 02:53:44,837 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 02:53:44,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:53:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 02:53:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-02-04 02:53:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 02:53:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-02-04 02:53:44,840 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 84 [2018-02-04 02:53:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:44,840 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-02-04 02:53:44,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:53:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-02-04 02:53:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 02:53:44,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:44,840 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-04 02:53:44,841 INFO L371 AbstractCegarLoop]: === Iteration 20 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1044060343, now seen corresponding path program 1 times [2018-02-04 02:53:44,841 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:44,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 02:53:44,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:44,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:53:44,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:44,970 INFO L182 omatonBuilderFactory]: Interpolants [4400#true, 4401#false, 4402#(<= |foo_#in~size| |foo_#in~n|), 4403#(<= foo_~size foo_~n), 4404#(and (<= (* 4 foo_~size) (select |#length| |foo_~#a~0.base|)) (= 0 |foo_~#a~0.offset|)), 4405#(and (= 0 |bar_#in~b.offset|) (<= (* 4 |bar_#in~size|) (select |#length| |bar_#in~b.base|))), 4406#(and (<= (* 4 bar_~size) (select |#length| bar_~b.base)) (= bar_~b.offset 0)), 4407#(and (<= 0 (+ bar_~b.offset (* 4 bar_~i~0))) (<= (* 4 bar_~size) (select |#length| bar_~b.base)) (= bar_~b.offset 0)), 4408#(and (<= (* 4 bar_~size) (select |#length| bar_~b.base)) (<= 4 (+ bar_~b.offset (* 4 bar_~i~0))) (= bar_~b.offset 0)), 4409#(and (<= 4 (+ bar_~b.offset (* 4 bar_~i~0))) (<= (+ (* 4 bar_~i~0) 4) (select |#length| bar_~b.base)) (= bar_~b.offset 0))] [2018-02-04 02:53:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 02:53:44,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:53:44,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:53:44,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:53:44,971 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 10 states. [2018-02-04 02:53:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:45,063 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-02-04 02:53:45,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:53:45,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-02-04 02:53:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:45,064 INFO L225 Difference]: With dead ends: 129 [2018-02-04 02:53:45,064 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 02:53:45,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:53:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 02:53:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-02-04 02:53:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 02:53:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-02-04 02:53:45,067 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 93 [2018-02-04 02:53:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:45,067 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-02-04 02:53:45,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:53:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-02-04 02:53:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 02:53:45,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:45,068 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:45,068 INFO L371 AbstractCegarLoop]: === Iteration 21 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:45,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1115175640, now seen corresponding path program 2 times [2018-02-04 02:53:45,068 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:45,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 43 proven. 39 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-04 02:53:45,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:45,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:53:45,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:45,198 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-04 02:53:45,198 INFO L182 omatonBuilderFactory]: Interpolants [4675#true, 4676#false, 4677#(<= foo_~size |foo_#in~size|), 4678#(and (<= foo_~size |foo_#in~size|) (= 0 |foo_~#a~0.offset|)), 4679#(and (or (not (= bar_~b.offset 0)) (<= bar_~size |bar_#in~size|)) (or (= bar_~b.offset |bar_#in~b.offset|) (= bar_~b.offset 0))), 4680#(and (or (= bar_~b.offset |bar_#in~b.offset|) (= bar_~b.offset 0)) (or (not (= bar_~b.offset 0)) (<= (+ bar_~i~0 1) |bar_#in~size|))), 4681#(or (not (= 0 |bar_#in~b.offset|)) (<= 1 |bar_#in~size|)), 4682#(<= 1 |foo_#in~size|), 4683#(<= 1 main_~i~2), 4684#(<= 2 main_~i~2), 4685#(<= |foo_#in~size| foo_~size), 4686#(and (<= |foo_#in~size| foo_~size) (= foo_~i~1 0)), 4687#(<= (+ foo_~i~1 |foo_#in~size|) (+ foo_~size 1)), 4688#(<= |foo_#in~size| 1)] [2018-02-04 02:53:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 43 proven. 39 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-04 02:53:45,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:53:45,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:53:45,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:53:45,199 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 14 states. [2018-02-04 02:53:45,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:45,428 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-02-04 02:53:45,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:53:45,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-02-04 02:53:45,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:45,429 INFO L225 Difference]: With dead ends: 164 [2018-02-04 02:53:45,429 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 02:53:45,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:53:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 02:53:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2018-02-04 02:53:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 02:53:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-02-04 02:53:45,433 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 103 [2018-02-04 02:53:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:45,434 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-02-04 02:53:45,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:53:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-02-04 02:53:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 02:53:45,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:45,435 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:45,435 INFO L371 AbstractCegarLoop]: === Iteration 22 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash -260385982, now seen corresponding path program 3 times [2018-02-04 02:53:45,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:45,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 70 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 02:53:45,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:45,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:53:45,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:53:45,573 INFO L182 omatonBuilderFactory]: Interpolants [5024#(or (not (= |foo_#in~b.offset| 0)) (<= 2 foo_~size)), 5025#(and (<= |bar_#in~size| bar_~size) (= bar_~i~0 0)), 5026#(<= (+ |bar_#in~size| bar_~i~0) (+ bar_~size 1)), 5027#(<= |bar_#in~size| 1), 5028#(not (= |foo_#in~b.offset| 0)), 5017#true, 5018#false, 5019#(= 0 |main_~#b~0.offset|), 5020#(or (= |foo_#in~b.offset| foo_~b.offset) (= foo_~b.offset 0)), 5021#(and (or (= |foo_#in~b.offset| foo_~b.offset) (= foo_~b.offset 0)) (or (not (= foo_~b.offset 0)) (<= 0 (+ (* 4 foo_~i~1) foo_~b.offset)))), 5022#(and (or (= |foo_#in~b.offset| foo_~b.offset) (= foo_~b.offset 0)) (or (<= 4 (+ (* 4 foo_~i~1) foo_~b.offset)) (not (= foo_~b.offset 0)))), 5023#(and (or (= |foo_#in~b.offset| foo_~b.offset) (= foo_~b.offset 0)) (or (not (= foo_~b.offset 0)) (<= 8 (+ (* 4 foo_~size) foo_~b.offset))))] [2018-02-04 02:53:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 70 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 02:53:45,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:53:45,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:53:45,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:53:45,573 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 12 states. [2018-02-04 02:53:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:45,696 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-02-04 02:53:45,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:53:45,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-02-04 02:53:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:45,697 INFO L225 Difference]: With dead ends: 166 [2018-02-04 02:53:45,697 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 02:53:45,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:53:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 02:53:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-02-04 02:53:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 02:53:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2018-02-04 02:53:45,699 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 109 [2018-02-04 02:53:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:45,700 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2018-02-04 02:53:45,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:53:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2018-02-04 02:53:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 02:53:45,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:45,700 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:45,700 INFO L371 AbstractCegarLoop]: === Iteration 23 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:45,700 INFO L82 PathProgramCache]: Analyzing trace with hash -562399357, now seen corresponding path program 4 times [2018-02-04 02:53:45,701 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:45,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 25 proven. 53 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-04 02:53:46,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:46,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:53:46,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:46,124 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-04 02:53:46,124 INFO L182 omatonBuilderFactory]: Interpolants [5344#(= |#length| (store |old(#length)| |foo_~#a~0.base| (select |#length| |foo_~#a~0.base|))), 5345#(and (or (= 0 (select |#valid| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 5346#(and (or (= 400 (select |#length| |main_~#b~0.base|)) (= 0 (select |#valid| |main_~#b~0.base|))) (= |main_~#b~0.offset| 0)), 5347#(and (= foo_~b.base |foo_#in~b.base|) (= (select |old(#length)| foo_~b.base) (select |#length| foo_~b.base))), 5348#(and (or (= (select |old(#length)| foo_~b.base) (select |#length| foo_~b.base)) (= |foo_~#a~0.base| foo_~b.base)) (= foo_~b.base |foo_#in~b.base|)), 5349#(or (= |foo_~#a~0.base| |foo_#in~b.base|) (= (select |#length| |foo_#in~b.base|) (select |old(#length)| |foo_#in~b.base|))), 5350#(or (= 0 (select |#valid| |foo_#in~b.base|)) (= (select |#length| |foo_#in~b.base|) (select |old(#length)| |foo_#in~b.base|))), 5351#(and (or (= |main_~#b~0.offset| 0) (not (= (select |#length| |main_~#b~0.base|) 400))) (or (= 0 (select |#valid| |main_~#b~0.base|)) (= (select |#length| |main_~#b~0.base|) 400))), 5352#(and (<= 0 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (= (select |#valid| |main_~#b~0.base|) 1)), 5353#(and (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (= (select |#valid| |main_~#b~0.base|) 1)), 5354#(and (<= (* 4 main_~i~2) 396) (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (= (select |#valid| |main_~#b~0.base|) 1)), 5355#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 5356#(and (= |#valid| |old(#valid)|) (= foo_~b.base |foo_#in~b.base|) (= (select |old(#length)| foo_~b.base) (select |#length| foo_~b.base))), 5357#(and (= 0 (select |old(#valid)| |foo_~#a~0.base|)) (or (= (select |old(#length)| foo_~b.base) (select |#length| foo_~b.base)) (= |foo_~#a~0.base| foo_~b.base)) (= foo_~b.base |foo_#in~b.base|)), 5358#(and (= 0 (select |old(#valid)| |foo_~#a~0.base|)) (or (= |foo_~#a~0.base| |foo_#in~b.base|) (<= (select |old(#length)| |foo_#in~b.base|) (select |#length| |foo_#in~b.base|)))), 5359#(or (<= (select |old(#length)| |foo_#in~b.base|) (select |#length| |foo_#in~b.base|)) (= 0 (select |old(#valid)| |foo_#in~b.base|))), 5360#(and (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (<= (+ (* 4 main_~i~2) 4) (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0)), 5340#true, 5341#false, 5342#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0)), 5343#(= |old(#length)| |#length|)] [2018-02-04 02:53:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 25 proven. 53 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-04 02:53:46,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:53:46,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:53:46,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:53:46,125 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand 21 states. [2018-02-04 02:53:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:46,387 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2018-02-04 02:53:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:53:46,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-02-04 02:53:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:46,388 INFO L225 Difference]: With dead ends: 136 [2018-02-04 02:53:46,388 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 02:53:46,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:53:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 02:53:46,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-04 02:53:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 02:53:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-02-04 02:53:46,391 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 114 [2018-02-04 02:53:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:46,392 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-02-04 02:53:46,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:53:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-02-04 02:53:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 02:53:46,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:46,393 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:46,393 INFO L371 AbstractCegarLoop]: === Iteration 24 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:46,393 INFO L82 PathProgramCache]: Analyzing trace with hash -277595443, now seen corresponding path program 1 times [2018-02-04 02:53:46,394 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:46,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-04 02:53:46,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:46,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:53:46,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:46,480 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-04 02:53:46,480 INFO L182 omatonBuilderFactory]: Interpolants [5648#(<= main_~i~2 1), 5649#(<= main_~i~2 2), 5650#(<= main_~i~2 3), 5645#true, 5646#false, 5647#(= main_~i~2 0)] [2018-02-04 02:53:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-04 02:53:46,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:53:46,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:53:46,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:53:46,481 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 6 states. [2018-02-04 02:53:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:46,512 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-02-04 02:53:46,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:53:46,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-02-04 02:53:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:46,513 INFO L225 Difference]: With dead ends: 148 [2018-02-04 02:53:46,514 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 02:53:46,514 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-04 02:53:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 02:53:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-02-04 02:53:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 02:53:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-02-04 02:53:46,517 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 122 [2018-02-04 02:53:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:46,517 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-02-04 02:53:46,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:53:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-02-04 02:53:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 02:53:46,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:46,519 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:46,519 INFO L371 AbstractCegarLoop]: === Iteration 25 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:46,519 INFO L82 PathProgramCache]: Analyzing trace with hash 313375475, now seen corresponding path program 2 times [2018-02-04 02:53:46,520 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:46,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-02-04 02:53:46,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:46,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:53:46,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-04 02:53:46,602 INFO L182 omatonBuilderFactory]: Interpolants [5942#true, 5943#false, 5944#(= main_~i~2 0), 5945#(<= main_~i~2 1), 5946#(<= main_~i~2 2), 5947#(<= main_~i~2 3), 5948#(<= main_~i~2 4)] [2018-02-04 02:53:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-02-04 02:53:46,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:53:46,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:53:46,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:53:46,604 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 7 states. [2018-02-04 02:53:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:46,643 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-02-04 02:53:46,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:53:46,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2018-02-04 02:53:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:46,644 INFO L225 Difference]: With dead ends: 155 [2018-02-04 02:53:46,644 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 02:53:46,645 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-04 02:53:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 02:53:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2018-02-04 02:53:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 02:53:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-02-04 02:53:46,648 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 169 [2018-02-04 02:53:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:46,648 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-02-04 02:53:46,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:53:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-02-04 02:53:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-02-04 02:53:46,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:46,650 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:46,650 INFO L371 AbstractCegarLoop]: === Iteration 26 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2136490509, now seen corresponding path program 3 times [2018-02-04 02:53:46,651 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:46,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2018-02-04 02:53:46,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:46,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:53:46,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-02-04 02:53:46,775 INFO L182 omatonBuilderFactory]: Interpolants [6256#(= main_~i~2 0), 6257#(<= main_~i~2 1), 6258#(<= main_~i~2 2), 6259#(<= main_~i~2 3), 6260#(<= main_~i~2 4), 6261#(<= main_~i~2 5), 6254#true, 6255#false] [2018-02-04 02:53:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2018-02-04 02:53:46,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:53:46,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:53:46,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:53:46,776 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 8 states. [2018-02-04 02:53:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:46,823 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-02-04 02:53:46,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:53:46,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 216 [2018-02-04 02:53:46,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:46,824 INFO L225 Difference]: With dead ends: 162 [2018-02-04 02:53:46,824 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 02:53:46,825 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-04 02:53:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 02:53:46,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2018-02-04 02:53:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 02:53:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-02-04 02:53:46,829 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 216 [2018-02-04 02:53:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:46,829 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-02-04 02:53:46,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:53:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-02-04 02:53:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-02-04 02:53:46,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:46,831 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:46,831 INFO L371 AbstractCegarLoop]: === Iteration 27 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:46,831 INFO L82 PathProgramCache]: Analyzing trace with hash -882947149, now seen corresponding path program 4 times [2018-02-04 02:53:46,832 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:46,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2018-02-04 02:53:47,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:47,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:53:47,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-02-04 02:53:47,020 INFO L182 omatonBuilderFactory]: Interpolants [6581#true, 6582#false, 6583#(= main_~i~2 0), 6584#(<= main_~i~2 1), 6585#(<= main_~i~2 2), 6586#(<= main_~i~2 3), 6587#(<= main_~i~2 4), 6588#(<= main_~i~2 5), 6589#(<= main_~i~2 6)] [2018-02-04 02:53:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2018-02-04 02:53:47,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:53:47,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:53:47,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:53:47,021 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 9 states. [2018-02-04 02:53:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:47,072 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-02-04 02:53:47,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:53:47,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 263 [2018-02-04 02:53:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:47,074 INFO L225 Difference]: With dead ends: 169 [2018-02-04 02:53:47,074 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 02:53:47,075 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-04 02:53:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 02:53:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2018-02-04 02:53:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 02:53:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-02-04 02:53:47,077 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 263 [2018-02-04 02:53:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:47,078 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-02-04 02:53:47,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:53:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-02-04 02:53:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-02-04 02:53:47,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:47,079 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:47,079 INFO L371 AbstractCegarLoop]: === Iteration 28 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:47,079 INFO L82 PathProgramCache]: Analyzing trace with hash 93198669, now seen corresponding path program 5 times [2018-02-04 02:53:47,080 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:47,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1279 trivial. 0 not checked. [2018-02-04 02:53:47,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:47,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:53:47,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-02-04 02:53:47,247 INFO L182 omatonBuilderFactory]: Interpolants [6928#(<= main_~i~2 3), 6929#(<= main_~i~2 4), 6930#(<= main_~i~2 5), 6931#(<= main_~i~2 6), 6932#(<= main_~i~2 7), 6923#true, 6924#false, 6925#(= main_~i~2 0), 6926#(<= main_~i~2 1), 6927#(<= main_~i~2 2)] [2018-02-04 02:53:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1279 trivial. 0 not checked. [2018-02-04 02:53:47,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:53:47,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:53:47,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:53:47,248 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 10 states. [2018-02-04 02:53:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:47,300 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2018-02-04 02:53:47,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:53:47,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 310 [2018-02-04 02:53:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:47,303 INFO L225 Difference]: With dead ends: 176 [2018-02-04 02:53:47,303 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 02:53:47,303 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-04 02:53:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 02:53:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2018-02-04 02:53:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 02:53:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 181 transitions. [2018-02-04 02:53:47,308 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 181 transitions. Word has length 310 [2018-02-04 02:53:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:47,308 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-02-04 02:53:47,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:53:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2018-02-04 02:53:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-02-04 02:53:47,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:47,311 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:47,311 INFO L371 AbstractCegarLoop]: === Iteration 29 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:47,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1457189773, now seen corresponding path program 6 times [2018-02-04 02:53:47,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:47,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-02-04 02:53:47,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:47,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:53:47,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-02-04 02:53:47,608 INFO L182 omatonBuilderFactory]: Interpolants [7280#true, 7281#false, 7282#(= main_~i~2 0), 7283#(<= main_~i~2 1), 7284#(<= main_~i~2 2), 7285#(<= main_~i~2 3), 7286#(<= main_~i~2 4), 7287#(<= main_~i~2 5), 7288#(<= main_~i~2 6), 7289#(<= main_~i~2 7), 7290#(<= main_~i~2 8)] [2018-02-04 02:53:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-02-04 02:53:47,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:53:47,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:53:47,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:53:47,609 INFO L87 Difference]: Start difference. First operand 171 states and 181 transitions. Second operand 11 states. [2018-02-04 02:53:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:47,674 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2018-02-04 02:53:47,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:53:47,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 357 [2018-02-04 02:53:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:47,675 INFO L225 Difference]: With dead ends: 183 [2018-02-04 02:53:47,675 INFO L226 Difference]: Without dead ends: 183 [2018-02-04 02:53:47,675 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-04 02:53:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-04 02:53:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2018-02-04 02:53:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-04 02:53:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 189 transitions. [2018-02-04 02:53:47,677 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 189 transitions. Word has length 357 [2018-02-04 02:53:47,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:47,678 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 189 transitions. [2018-02-04 02:53:47,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:53:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2018-02-04 02:53:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-02-04 02:53:47,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:47,679 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:47,679 INFO L371 AbstractCegarLoop]: === Iteration 30 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:47,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1787412621, now seen corresponding path program 7 times [2018-02-04 02:53:47,680 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:47,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2597 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2018-02-04 02:53:47,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:47,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:53:47,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-02-04 02:53:47,962 INFO L182 omatonBuilderFactory]: Interpolants [7652#true, 7653#false, 7654#(= main_~i~2 0), 7655#(<= main_~i~2 1), 7656#(<= main_~i~2 2), 7657#(<= main_~i~2 3), 7658#(<= main_~i~2 4), 7659#(<= main_~i~2 5), 7660#(<= main_~i~2 6), 7661#(<= main_~i~2 7), 7662#(<= main_~i~2 8), 7663#(<= main_~i~2 9)] [2018-02-04 02:53:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2597 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2018-02-04 02:53:47,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:53:47,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:53:47,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:53:47,963 INFO L87 Difference]: Start difference. First operand 178 states and 189 transitions. Second operand 12 states. [2018-02-04 02:53:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:48,026 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2018-02-04 02:53:48,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:53:48,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 404 [2018-02-04 02:53:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:48,027 INFO L225 Difference]: With dead ends: 190 [2018-02-04 02:53:48,027 INFO L226 Difference]: Without dead ends: 190 [2018-02-04 02:53:48,028 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-04 02:53:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-04 02:53:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 185. [2018-02-04 02:53:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 02:53:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-02-04 02:53:48,031 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 404 [2018-02-04 02:53:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:48,031 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-02-04 02:53:48,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:53:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-02-04 02:53:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-02-04 02:53:48,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:48,032 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 17, 17, 17, 17, 17, 17, 17, 17, 17, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:48,033 INFO L371 AbstractCegarLoop]: === Iteration 31 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash 487259443, now seen corresponding path program 8 times [2018-02-04 02:53:48,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:48,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3303 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2018-02-04 02:53:48,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:48,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:53:48,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2018-02-04 02:53:48,323 INFO L182 omatonBuilderFactory]: Interpolants [8039#true, 8040#false, 8041#(= main_~i~2 0), 8042#(<= main_~i~2 1), 8043#(<= main_~i~2 2), 8044#(<= main_~i~2 3), 8045#(<= main_~i~2 4), 8046#(<= main_~i~2 5), 8047#(<= main_~i~2 6), 8048#(<= main_~i~2 7), 8049#(<= main_~i~2 8), 8050#(<= main_~i~2 9), 8051#(<= main_~i~2 10)] [2018-02-04 02:53:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3303 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2018-02-04 02:53:48,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:53:48,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:53:48,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:53:48,325 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 13 states. [2018-02-04 02:53:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:48,420 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2018-02-04 02:53:48,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:53:48,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 451 [2018-02-04 02:53:48,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:48,422 INFO L225 Difference]: With dead ends: 197 [2018-02-04 02:53:48,423 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 02:53:48,423 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-04 02:53:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 02:53:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2018-02-04 02:53:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 02:53:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2018-02-04 02:53:48,429 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 451 [2018-02-04 02:53:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:48,430 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2018-02-04 02:53:48,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:53:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2018-02-04 02:53:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-02-04 02:53:48,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:48,433 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:48,433 INFO L371 AbstractCegarLoop]: === Iteration 32 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1279313971, now seen corresponding path program 9 times [2018-02-04 02:53:48,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:48,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4094 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-04 02:53:48,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:48,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:53:48,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2018-02-04 02:53:48,975 INFO L182 omatonBuilderFactory]: Interpolants [8448#(<= main_~i~2 5), 8449#(<= main_~i~2 6), 8450#(<= main_~i~2 7), 8451#(<= main_~i~2 8), 8452#(<= main_~i~2 9), 8453#(<= main_~i~2 10), 8454#(<= main_~i~2 11), 8441#true, 8442#false, 8443#(= main_~i~2 0), 8444#(<= main_~i~2 1), 8445#(<= main_~i~2 2), 8446#(<= main_~i~2 3), 8447#(<= main_~i~2 4)] [2018-02-04 02:53:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4094 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-04 02:53:48,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:53:48,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:53:48,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:53:48,977 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand 14 states. [2018-02-04 02:53:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:49,045 INFO L93 Difference]: Finished difference Result 204 states and 219 transitions. [2018-02-04 02:53:49,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:53:49,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 498 [2018-02-04 02:53:49,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:49,046 INFO L225 Difference]: With dead ends: 204 [2018-02-04 02:53:49,046 INFO L226 Difference]: Without dead ends: 204 [2018-02-04 02:53:49,047 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-04 02:53:49,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-04 02:53:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2018-02-04 02:53:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 02:53:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 213 transitions. [2018-02-04 02:53:49,049 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 213 transitions. Word has length 498 [2018-02-04 02:53:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:49,049 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 213 transitions. [2018-02-04 02:53:49,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:53:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 213 transitions. [2018-02-04 02:53:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-02-04 02:53:49,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:49,051 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 21, 21, 21, 21, 21, 21, 21, 21, 21, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:49,051 INFO L371 AbstractCegarLoop]: === Iteration 33 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash -618848781, now seen corresponding path program 10 times [2018-02-04 02:53:49,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:49,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 4484 trivial. 0 not checked. [2018-02-04 02:53:49,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:49,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:53:49,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-02-04 02:53:49,420 INFO L182 omatonBuilderFactory]: Interpolants [8864#(<= main_~i~2 4), 8865#(<= main_~i~2 5), 8866#(<= main_~i~2 6), 8867#(<= main_~i~2 7), 8868#(<= main_~i~2 8), 8869#(<= main_~i~2 9), 8870#(<= main_~i~2 10), 8871#(<= main_~i~2 11), 8872#(<= main_~i~2 12), 8858#true, 8859#false, 8860#(= main_~i~2 0), 8861#(<= main_~i~2 1), 8862#(<= main_~i~2 2), 8863#(<= main_~i~2 3)] [2018-02-04 02:53:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 4484 trivial. 0 not checked. [2018-02-04 02:53:49,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:53:49,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:53:49,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:53:49,422 INFO L87 Difference]: Start difference. First operand 199 states and 213 transitions. Second operand 15 states. [2018-02-04 02:53:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:49,490 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2018-02-04 02:53:49,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:53:49,490 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 545 [2018-02-04 02:53:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:49,491 INFO L225 Difference]: With dead ends: 211 [2018-02-04 02:53:49,491 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 02:53:49,492 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-04 02:53:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 02:53:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2018-02-04 02:53:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 02:53:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 221 transitions. [2018-02-04 02:53:49,495 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 221 transitions. Word has length 545 [2018-02-04 02:53:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:49,495 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 221 transitions. [2018-02-04 02:53:49,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:53:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2018-02-04 02:53:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-02-04 02:53:49,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:49,497 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 23, 23, 23, 23, 23, 23, 23, 23, 23, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:49,497 INFO L371 AbstractCegarLoop]: === Iteration 34 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1134722829, now seen corresponding path program 11 times [2018-02-04 02:53:49,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:49,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5931 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 5359 trivial. 0 not checked. [2018-02-04 02:53:50,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:50,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:53:50,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-02-04 02:53:50,151 INFO L182 omatonBuilderFactory]: Interpolants [9290#true, 9291#false, 9292#(= main_~i~2 0), 9293#(<= main_~i~2 1), 9294#(<= main_~i~2 2), 9295#(<= main_~i~2 3), 9296#(<= main_~i~2 4), 9297#(<= main_~i~2 5), 9298#(<= main_~i~2 6), 9299#(<= main_~i~2 7), 9300#(<= main_~i~2 8), 9301#(<= main_~i~2 9), 9302#(<= main_~i~2 10), 9303#(<= main_~i~2 11), 9304#(<= main_~i~2 12), 9305#(<= main_~i~2 13)] [2018-02-04 02:53:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5931 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 5359 trivial. 0 not checked. [2018-02-04 02:53:50,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:53:50,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:53:50,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:53:50,152 INFO L87 Difference]: Start difference. First operand 206 states and 221 transitions. Second operand 16 states. [2018-02-04 02:53:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:50,280 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2018-02-04 02:53:50,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:53:50,280 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 592 [2018-02-04 02:53:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:50,281 INFO L225 Difference]: With dead ends: 218 [2018-02-04 02:53:50,281 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 02:53:50,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:53:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 02:53:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2018-02-04 02:53:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 02:53:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 229 transitions. [2018-02-04 02:53:50,286 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 229 transitions. Word has length 592 [2018-02-04 02:53:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:50,286 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 229 transitions. [2018-02-04 02:53:50,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:53:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 229 transitions. [2018-02-04 02:53:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-02-04 02:53:50,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:50,290 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 25, 25, 25, 25, 25, 25, 25, 25, 25, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:50,290 INFO L371 AbstractCegarLoop]: === Iteration 35 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:50,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1704497485, now seen corresponding path program 12 times [2018-02-04 02:53:50,291 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:50,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6977 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 6312 trivial. 0 not checked. [2018-02-04 02:53:50,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:50,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:53:50,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-02-04 02:53:50,852 INFO L182 omatonBuilderFactory]: Interpolants [9737#true, 9738#false, 9739#(= main_~i~2 0), 9740#(<= main_~i~2 1), 9741#(<= main_~i~2 2), 9742#(<= main_~i~2 3), 9743#(<= main_~i~2 4), 9744#(<= main_~i~2 5), 9745#(<= main_~i~2 6), 9746#(<= main_~i~2 7), 9747#(<= main_~i~2 8), 9748#(<= main_~i~2 9), 9749#(<= main_~i~2 10), 9750#(<= main_~i~2 11), 9751#(<= main_~i~2 12), 9752#(<= main_~i~2 13), 9753#(<= main_~i~2 14)] [2018-02-04 02:53:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6977 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 6312 trivial. 0 not checked. [2018-02-04 02:53:50,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:53:50,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:53:50,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:53:50,854 INFO L87 Difference]: Start difference. First operand 213 states and 229 transitions. Second operand 17 states. [2018-02-04 02:53:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:50,980 INFO L93 Difference]: Finished difference Result 225 states and 243 transitions. [2018-02-04 02:53:50,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:53:50,981 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 639 [2018-02-04 02:53:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:50,982 INFO L225 Difference]: With dead ends: 225 [2018-02-04 02:53:50,982 INFO L226 Difference]: Without dead ends: 225 [2018-02-04 02:53:50,982 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-04 02:53:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-04 02:53:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2018-02-04 02:53:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 02:53:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 237 transitions. [2018-02-04 02:53:50,986 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 237 transitions. Word has length 639 [2018-02-04 02:53:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:50,986 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 237 transitions. [2018-02-04 02:53:50,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:53:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 237 transitions. [2018-02-04 02:53:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2018-02-04 02:53:50,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:50,989 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 27, 27, 27, 27, 27, 27, 27, 27, 27, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:50,989 INFO L371 AbstractCegarLoop]: === Iteration 36 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:50,989 INFO L82 PathProgramCache]: Analyzing trace with hash 430413389, now seen corresponding path program 13 times [2018-02-04 02:53:50,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:51,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8108 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 7343 trivial. 0 not checked. [2018-02-04 02:53:51,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:51,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:53:51,655 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2018-02-04 02:53:51,655 INFO L182 omatonBuilderFactory]: Interpolants [10208#(<= main_~i~2 7), 10209#(<= main_~i~2 8), 10210#(<= main_~i~2 9), 10211#(<= main_~i~2 10), 10212#(<= main_~i~2 11), 10213#(<= main_~i~2 12), 10214#(<= main_~i~2 13), 10215#(<= main_~i~2 14), 10216#(<= main_~i~2 15), 10199#true, 10200#false, 10201#(= main_~i~2 0), 10202#(<= main_~i~2 1), 10203#(<= main_~i~2 2), 10204#(<= main_~i~2 3), 10205#(<= main_~i~2 4), 10206#(<= main_~i~2 5), 10207#(<= main_~i~2 6)] [2018-02-04 02:53:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8108 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 7343 trivial. 0 not checked. [2018-02-04 02:53:51,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:53:51,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:53:51,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:53:51,656 INFO L87 Difference]: Start difference. First operand 220 states and 237 transitions. Second operand 18 states. [2018-02-04 02:53:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:51,787 INFO L93 Difference]: Finished difference Result 232 states and 251 transitions. [2018-02-04 02:53:51,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:53:51,787 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 686 [2018-02-04 02:53:51,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:51,789 INFO L225 Difference]: With dead ends: 232 [2018-02-04 02:53:51,789 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 02:53:51,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:53:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 02:53:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 227. [2018-02-04 02:53:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-04 02:53:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 245 transitions. [2018-02-04 02:53:51,794 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 245 transitions. Word has length 686 [2018-02-04 02:53:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:51,795 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 245 transitions. [2018-02-04 02:53:51,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:53:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 245 transitions. [2018-02-04 02:53:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2018-02-04 02:53:51,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:51,800 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 29, 29, 29, 29, 29, 29, 29, 29, 29, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:51,800 INFO L371 AbstractCegarLoop]: === Iteration 37 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:51,801 INFO L82 PathProgramCache]: Analyzing trace with hash -722079885, now seen corresponding path program 14 times [2018-02-04 02:53:51,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:51,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9324 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 8452 trivial. 0 not checked. [2018-02-04 02:53:52,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:52,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:53:52,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked. [2018-02-04 02:53:52,525 INFO L182 omatonBuilderFactory]: Interpolants [10688#(<= main_~i~2 10), 10689#(<= main_~i~2 11), 10690#(<= main_~i~2 12), 10691#(<= main_~i~2 13), 10692#(<= main_~i~2 14), 10693#(<= main_~i~2 15), 10694#(<= main_~i~2 16), 10676#true, 10677#false, 10678#(= main_~i~2 0), 10679#(<= main_~i~2 1), 10680#(<= main_~i~2 2), 10681#(<= main_~i~2 3), 10682#(<= main_~i~2 4), 10683#(<= main_~i~2 5), 10684#(<= main_~i~2 6), 10685#(<= main_~i~2 7), 10686#(<= main_~i~2 8), 10687#(<= main_~i~2 9)] [2018-02-04 02:53:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9324 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 8452 trivial. 0 not checked. [2018-02-04 02:53:52,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:53:52,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:53:52,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:53:52,526 INFO L87 Difference]: Start difference. First operand 227 states and 245 transitions. Second operand 19 states. [2018-02-04 02:53:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:52,633 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2018-02-04 02:53:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:53:52,633 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 733 [2018-02-04 02:53:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:52,635 INFO L225 Difference]: With dead ends: 239 [2018-02-04 02:53:52,635 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 02:53:52,635 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-04 02:53:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 02:53:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 234. [2018-02-04 02:53:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 02:53:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 253 transitions. [2018-02-04 02:53:52,640 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 253 transitions. Word has length 733 [2018-02-04 02:53:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:52,640 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 253 transitions. [2018-02-04 02:53:52,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:53:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 253 transitions. [2018-02-04 02:53:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-02-04 02:53:52,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:52,646 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 31, 31, 31, 31, 31, 31, 31, 31, 31, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:52,646 INFO L371 AbstractCegarLoop]: === Iteration 38 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:52,646 INFO L82 PathProgramCache]: Analyzing trace with hash 306347405, now seen corresponding path program 15 times [2018-02-04 02:53:52,647 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:52,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10625 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 9639 trivial. 0 not checked. [2018-02-04 02:53:53,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:53,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:53:53,611 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4200 trivial. 0 not checked. [2018-02-04 02:53:53,612 INFO L182 omatonBuilderFactory]: Interpolants [11168#true, 11169#false, 11170#(= main_~i~2 0), 11171#(<= main_~i~2 1), 11172#(<= main_~i~2 2), 11173#(<= main_~i~2 3), 11174#(<= main_~i~2 4), 11175#(<= main_~i~2 5), 11176#(<= main_~i~2 6), 11177#(<= main_~i~2 7), 11178#(<= main_~i~2 8), 11179#(<= main_~i~2 9), 11180#(<= main_~i~2 10), 11181#(<= main_~i~2 11), 11182#(<= main_~i~2 12), 11183#(<= main_~i~2 13), 11184#(<= main_~i~2 14), 11185#(<= main_~i~2 15), 11186#(<= main_~i~2 16), 11187#(<= main_~i~2 17)] [2018-02-04 02:53:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10625 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 9639 trivial. 0 not checked. [2018-02-04 02:53:53,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:53:53,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:53:53,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:53:53,613 INFO L87 Difference]: Start difference. First operand 234 states and 253 transitions. Second operand 20 states. [2018-02-04 02:53:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:53,724 INFO L93 Difference]: Finished difference Result 246 states and 267 transitions. [2018-02-04 02:53:53,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:53:53,725 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 780 [2018-02-04 02:53:53,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:53,726 INFO L225 Difference]: With dead ends: 246 [2018-02-04 02:53:53,726 INFO L226 Difference]: Without dead ends: 246 [2018-02-04 02:53:53,726 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-04 02:53:53,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-04 02:53:53,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 241. [2018-02-04 02:53:53,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-04 02:53:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 261 transitions. [2018-02-04 02:53:53,730 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 261 transitions. Word has length 780 [2018-02-04 02:53:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:53,730 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 261 transitions. [2018-02-04 02:53:53,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:53:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 261 transitions. [2018-02-04 02:53:53,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2018-02-04 02:53:53,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:53,734 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 33, 33, 33, 33, 33, 33, 33, 33, 33, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:53,734 INFO L371 AbstractCegarLoop]: === Iteration 39 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:53,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2016108493, now seen corresponding path program 16 times [2018-02-04 02:53:53,735 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:53,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12011 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 10904 trivial. 0 not checked. [2018-02-04 02:53:54,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:54,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:53:54,578 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:54,578 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-04 02:53:54,578 INFO L182 omatonBuilderFactory]: Interpolants [11680#(<= main_~i~2 3), 11681#(<= main_~i~2 4), 11682#(<= main_~i~2 5), 11683#(<= main_~i~2 6), 11684#(<= main_~i~2 7), 11685#(<= main_~i~2 8), 11686#(<= main_~i~2 9), 11687#(<= main_~i~2 10), 11688#(<= main_~i~2 11), 11689#(<= main_~i~2 12), 11690#(<= main_~i~2 13), 11691#(<= main_~i~2 14), 11692#(<= main_~i~2 15), 11693#(<= main_~i~2 16), 11694#(<= main_~i~2 17), 11695#(<= main_~i~2 18), 11675#true, 11676#false, 11677#(= main_~i~2 0), 11678#(<= main_~i~2 1), 11679#(<= main_~i~2 2)] [2018-02-04 02:53:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12011 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 10904 trivial. 0 not checked. [2018-02-04 02:53:54,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:53:54,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:53:54,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:53:54,579 INFO L87 Difference]: Start difference. First operand 241 states and 261 transitions. Second operand 21 states. [2018-02-04 02:53:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:54,733 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2018-02-04 02:53:54,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:53:54,733 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 827 [2018-02-04 02:53:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:54,735 INFO L225 Difference]: With dead ends: 253 [2018-02-04 02:53:54,735 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 02:53:54,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:53:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 02:53:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2018-02-04 02:53:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 02:53:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 269 transitions. [2018-02-04 02:53:54,739 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 269 transitions. Word has length 827 [2018-02-04 02:53:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:54,740 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 269 transitions. [2018-02-04 02:53:54,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:53:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 269 transitions. [2018-02-04 02:53:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-02-04 02:53:54,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:54,747 INFO L351 BasicCegarLoop]: trace histogram [54, 54, 35, 35, 35, 35, 35, 35, 35, 35, 35, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:54,747 INFO L371 AbstractCegarLoop]: === Iteration 40 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash 652686541, now seen corresponding path program 17 times [2018-02-04 02:53:54,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:54,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13482 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 12247 trivial. 0 not checked. [2018-02-04 02:53:55,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:55,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:53:55,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5440 trivial. 0 not checked. [2018-02-04 02:53:55,788 INFO L182 omatonBuilderFactory]: Interpolants [12197#true, 12198#false, 12199#(= main_~i~2 0), 12200#(<= main_~i~2 1), 12201#(<= main_~i~2 2), 12202#(<= main_~i~2 3), 12203#(<= main_~i~2 4), 12204#(<= main_~i~2 5), 12205#(<= main_~i~2 6), 12206#(<= main_~i~2 7), 12207#(<= main_~i~2 8), 12208#(<= main_~i~2 9), 12209#(<= main_~i~2 10), 12210#(<= main_~i~2 11), 12211#(<= main_~i~2 12), 12212#(<= main_~i~2 13), 12213#(<= main_~i~2 14), 12214#(<= main_~i~2 15), 12215#(<= main_~i~2 16), 12216#(<= main_~i~2 17), 12217#(<= main_~i~2 18), 12218#(<= main_~i~2 19)] [2018-02-04 02:53:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 13482 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 12247 trivial. 0 not checked. [2018-02-04 02:53:55,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:53:55,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:53:55,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:53:55,789 INFO L87 Difference]: Start difference. First operand 248 states and 269 transitions. Second operand 22 states. [2018-02-04 02:53:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:55,920 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2018-02-04 02:53:55,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:53:55,921 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 874 [2018-02-04 02:53:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:55,922 INFO L225 Difference]: With dead ends: 260 [2018-02-04 02:53:55,922 INFO L226 Difference]: Without dead ends: 260 [2018-02-04 02:53:55,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:53:55,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-04 02:53:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 255. [2018-02-04 02:53:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-04 02:53:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 277 transitions. [2018-02-04 02:53:55,926 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 277 transitions. Word has length 874 [2018-02-04 02:53:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:55,926 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 277 transitions. [2018-02-04 02:53:55,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:53:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 277 transitions. [2018-02-04 02:53:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2018-02-04 02:53:55,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:55,934 INFO L351 BasicCegarLoop]: trace histogram [57, 57, 37, 37, 37, 37, 37, 37, 37, 37, 37, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:55,934 INFO L371 AbstractCegarLoop]: === Iteration 41 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash -217087757, now seen corresponding path program 18 times [2018-02-04 02:53:55,935 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:56,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15038 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 13668 trivial. 0 not checked. [2018-02-04 02:53:57,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:57,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:53:57,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6120 trivial. 0 not checked. [2018-02-04 02:53:57,239 INFO L182 omatonBuilderFactory]: Interpolants [12736#(= main_~i~2 0), 12737#(<= main_~i~2 1), 12738#(<= main_~i~2 2), 12739#(<= main_~i~2 3), 12740#(<= main_~i~2 4), 12741#(<= main_~i~2 5), 12742#(<= main_~i~2 6), 12743#(<= main_~i~2 7), 12744#(<= main_~i~2 8), 12745#(<= main_~i~2 9), 12746#(<= main_~i~2 10), 12747#(<= main_~i~2 11), 12748#(<= main_~i~2 12), 12749#(<= main_~i~2 13), 12750#(<= main_~i~2 14), 12751#(<= main_~i~2 15), 12752#(<= main_~i~2 16), 12753#(<= main_~i~2 17), 12754#(<= main_~i~2 18), 12755#(<= main_~i~2 19), 12756#(<= main_~i~2 20), 12734#true, 12735#false] [2018-02-04 02:53:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15038 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 13668 trivial. 0 not checked. [2018-02-04 02:53:57,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:53:57,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:53:57,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:53:57,240 INFO L87 Difference]: Start difference. First operand 255 states and 277 transitions. Second operand 23 states. [2018-02-04 02:53:57,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:57,368 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2018-02-04 02:53:57,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:53:57,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 921 [2018-02-04 02:53:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:57,369 INFO L225 Difference]: With dead ends: 267 [2018-02-04 02:53:57,369 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 02:53:57,370 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:53:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 02:53:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2018-02-04 02:53:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-02-04 02:53:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 285 transitions. [2018-02-04 02:53:57,374 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 285 transitions. Word has length 921 [2018-02-04 02:53:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:57,374 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 285 transitions. [2018-02-04 02:53:57,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:53:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 285 transitions. [2018-02-04 02:53:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2018-02-04 02:53:57,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:57,382 INFO L351 BasicCegarLoop]: trace histogram [60, 60, 39, 39, 39, 39, 39, 39, 39, 39, 39, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:57,382 INFO L371 AbstractCegarLoop]: === Iteration 42 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1375093747, now seen corresponding path program 19 times [2018-02-04 02:53:57,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:57,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16679 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 15167 trivial. 0 not checked. [2018-02-04 02:53:58,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:58,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:53:58,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6840 trivial. 0 not checked. [2018-02-04 02:53:58,602 INFO L182 omatonBuilderFactory]: Interpolants [13286#true, 13287#false, 13288#(= main_~i~2 0), 13289#(<= main_~i~2 1), 13290#(<= main_~i~2 2), 13291#(<= main_~i~2 3), 13292#(<= main_~i~2 4), 13293#(<= main_~i~2 5), 13294#(<= main_~i~2 6), 13295#(<= main_~i~2 7), 13296#(<= main_~i~2 8), 13297#(<= main_~i~2 9), 13298#(<= main_~i~2 10), 13299#(<= main_~i~2 11), 13300#(<= main_~i~2 12), 13301#(<= main_~i~2 13), 13302#(<= main_~i~2 14), 13303#(<= main_~i~2 15), 13304#(<= main_~i~2 16), 13305#(<= main_~i~2 17), 13306#(<= main_~i~2 18), 13307#(<= main_~i~2 19), 13308#(<= main_~i~2 20), 13309#(<= main_~i~2 21)] [2018-02-04 02:53:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16679 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 15167 trivial. 0 not checked. [2018-02-04 02:53:58,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:53:58,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:53:58,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:53:58,603 INFO L87 Difference]: Start difference. First operand 262 states and 285 transitions. Second operand 24 states. [2018-02-04 02:53:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:58,742 INFO L93 Difference]: Finished difference Result 274 states and 299 transitions. [2018-02-04 02:53:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:53:58,742 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 968 [2018-02-04 02:53:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:58,744 INFO L225 Difference]: With dead ends: 274 [2018-02-04 02:53:58,744 INFO L226 Difference]: Without dead ends: 274 [2018-02-04 02:53:58,744 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-04 02:53:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-04 02:53:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 269. [2018-02-04 02:53:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-04 02:53:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 293 transitions. [2018-02-04 02:53:58,749 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 293 transitions. Word has length 968 [2018-02-04 02:53:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:58,750 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 293 transitions. [2018-02-04 02:53:58,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:53:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 293 transitions. [2018-02-04 02:53:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2018-02-04 02:53:58,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:58,758 INFO L351 BasicCegarLoop]: trace histogram [63, 63, 41, 41, 41, 41, 41, 41, 41, 41, 41, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:58,759 INFO L371 AbstractCegarLoop]: === Iteration 43 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:53:58,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1504874931, now seen corresponding path program 20 times [2018-02-04 02:53:58,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:58,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18405 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2018-02-04 02:54:00,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:00,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:54:00,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7600 trivial. 0 not checked. [2018-02-04 02:54:00,195 INFO L182 omatonBuilderFactory]: Interpolants [13853#true, 13854#false, 13855#(= main_~i~2 0), 13856#(<= main_~i~2 1), 13857#(<= main_~i~2 2), 13858#(<= main_~i~2 3), 13859#(<= main_~i~2 4), 13860#(<= main_~i~2 5), 13861#(<= main_~i~2 6), 13862#(<= main_~i~2 7), 13863#(<= main_~i~2 8), 13864#(<= main_~i~2 9), 13865#(<= main_~i~2 10), 13866#(<= main_~i~2 11), 13867#(<= main_~i~2 12), 13868#(<= main_~i~2 13), 13869#(<= main_~i~2 14), 13870#(<= main_~i~2 15), 13871#(<= main_~i~2 16), 13872#(<= main_~i~2 17), 13873#(<= main_~i~2 18), 13874#(<= main_~i~2 19), 13875#(<= main_~i~2 20), 13876#(<= main_~i~2 21), 13877#(<= main_~i~2 22)] [2018-02-04 02:54:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18405 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2018-02-04 02:54:00,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:54:00,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:54:00,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:54:00,196 INFO L87 Difference]: Start difference. First operand 269 states and 293 transitions. Second operand 25 states. [2018-02-04 02:54:00,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:00,378 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2018-02-04 02:54:00,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:54:00,379 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1015 [2018-02-04 02:54:00,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:00,380 INFO L225 Difference]: With dead ends: 281 [2018-02-04 02:54:00,380 INFO L226 Difference]: Without dead ends: 281 [2018-02-04 02:54:00,380 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-04 02:54:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-02-04 02:54:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 276. [2018-02-04 02:54:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-04 02:54:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 301 transitions. [2018-02-04 02:54:00,389 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 301 transitions. Word has length 1015 [2018-02-04 02:54:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:00,390 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 301 transitions. [2018-02-04 02:54:00,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:54:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 301 transitions. [2018-02-04 02:54:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2018-02-04 02:54:00,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:00,396 INFO L351 BasicCegarLoop]: trace histogram [66, 66, 43, 43, 43, 43, 43, 43, 43, 43, 43, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:00,396 INFO L371 AbstractCegarLoop]: === Iteration 44 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:00,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1692527795, now seen corresponding path program 21 times [2018-02-04 02:54:00,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:00,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 20216 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 18399 trivial. 0 not checked. [2018-02-04 02:54:01,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:01,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:54:01,973 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8400 trivial. 0 not checked. [2018-02-04 02:54:01,974 INFO L182 omatonBuilderFactory]: Interpolants [14435#true, 14436#false, 14437#(= main_~i~2 0), 14438#(<= main_~i~2 1), 14439#(<= main_~i~2 2), 14440#(<= main_~i~2 3), 14441#(<= main_~i~2 4), 14442#(<= main_~i~2 5), 14443#(<= main_~i~2 6), 14444#(<= main_~i~2 7), 14445#(<= main_~i~2 8), 14446#(<= main_~i~2 9), 14447#(<= main_~i~2 10), 14448#(<= main_~i~2 11), 14449#(<= main_~i~2 12), 14450#(<= main_~i~2 13), 14451#(<= main_~i~2 14), 14452#(<= main_~i~2 15), 14453#(<= main_~i~2 16), 14454#(<= main_~i~2 17), 14455#(<= main_~i~2 18), 14456#(<= main_~i~2 19), 14457#(<= main_~i~2 20), 14458#(<= main_~i~2 21), 14459#(<= main_~i~2 22), 14460#(<= main_~i~2 23)] [2018-02-04 02:54:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 20216 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 18399 trivial. 0 not checked. [2018-02-04 02:54:01,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:54:01,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:54:01,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:54:01,975 INFO L87 Difference]: Start difference. First operand 276 states and 301 transitions. Second operand 26 states. [2018-02-04 02:54:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:02,140 INFO L93 Difference]: Finished difference Result 288 states and 315 transitions. [2018-02-04 02:54:02,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 02:54:02,141 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1062 [2018-02-04 02:54:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:02,142 INFO L225 Difference]: With dead ends: 288 [2018-02-04 02:54:02,142 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 02:54:02,142 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-04 02:54:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 02:54:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 283. [2018-02-04 02:54:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 02:54:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 309 transitions. [2018-02-04 02:54:02,145 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 309 transitions. Word has length 1062 [2018-02-04 02:54:02,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:02,146 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 309 transitions. [2018-02-04 02:54:02,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:54:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 309 transitions. [2018-02-04 02:54:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1110 [2018-02-04 02:54:02,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:02,152 INFO L351 BasicCegarLoop]: trace histogram [69, 69, 45, 45, 45, 45, 45, 45, 45, 45, 45, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:02,152 INFO L371 AbstractCegarLoop]: === Iteration 45 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:02,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1043737997, now seen corresponding path program 22 times [2018-02-04 02:54:02,153 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:02,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 22112 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 20132 trivial. 0 not checked. [2018-02-04 02:54:04,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:04,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 02:54:04,103 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9240 trivial. 0 not checked. [2018-02-04 02:54:04,104 INFO L182 omatonBuilderFactory]: Interpolants [15040#(<= main_~i~2 6), 15041#(<= main_~i~2 7), 15042#(<= main_~i~2 8), 15043#(<= main_~i~2 9), 15044#(<= main_~i~2 10), 15045#(<= main_~i~2 11), 15046#(<= main_~i~2 12), 15047#(<= main_~i~2 13), 15048#(<= main_~i~2 14), 15049#(<= main_~i~2 15), 15050#(<= main_~i~2 16), 15051#(<= main_~i~2 17), 15052#(<= main_~i~2 18), 15053#(<= main_~i~2 19), 15054#(<= main_~i~2 20), 15055#(<= main_~i~2 21), 15056#(<= main_~i~2 22), 15057#(<= main_~i~2 23), 15058#(<= main_~i~2 24), 15032#true, 15033#false, 15034#(= main_~i~2 0), 15035#(<= main_~i~2 1), 15036#(<= main_~i~2 2), 15037#(<= main_~i~2 3), 15038#(<= main_~i~2 4), 15039#(<= main_~i~2 5)] [2018-02-04 02:54:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22112 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 20132 trivial. 0 not checked. [2018-02-04 02:54:04,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:54:04,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:54:04,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:54:04,105 INFO L87 Difference]: Start difference. First operand 283 states and 309 transitions. Second operand 27 states. [2018-02-04 02:54:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:04,234 INFO L93 Difference]: Finished difference Result 295 states and 323 transitions. [2018-02-04 02:54:04,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 02:54:04,234 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1109 [2018-02-04 02:54:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:04,236 INFO L225 Difference]: With dead ends: 295 [2018-02-04 02:54:04,236 INFO L226 Difference]: Without dead ends: 295 [2018-02-04 02:54:04,236 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-04 02:54:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-04 02:54:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 290. [2018-02-04 02:54:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-04 02:54:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 317 transitions. [2018-02-04 02:54:04,244 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 317 transitions. Word has length 1109 [2018-02-04 02:54:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:04,245 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 317 transitions. [2018-02-04 02:54:04,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:54:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 317 transitions. [2018-02-04 02:54:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1157 [2018-02-04 02:54:04,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:04,255 INFO L351 BasicCegarLoop]: trace histogram [72, 72, 47, 47, 47, 47, 47, 47, 47, 47, 47, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:04,255 INFO L371 AbstractCegarLoop]: === Iteration 46 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1097319795, now seen corresponding path program 23 times [2018-02-04 02:54:04,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:04,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24093 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 21943 trivial. 0 not checked. [2018-02-04 02:54:06,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:06,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 02:54:06,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10120 trivial. 0 not checked. [2018-02-04 02:54:06,250 INFO L182 omatonBuilderFactory]: Interpolants [15644#true, 15645#false, 15646#(= main_~i~2 0), 15647#(<= main_~i~2 1), 15648#(<= main_~i~2 2), 15649#(<= main_~i~2 3), 15650#(<= main_~i~2 4), 15651#(<= main_~i~2 5), 15652#(<= main_~i~2 6), 15653#(<= main_~i~2 7), 15654#(<= main_~i~2 8), 15655#(<= main_~i~2 9), 15656#(<= main_~i~2 10), 15657#(<= main_~i~2 11), 15658#(<= main_~i~2 12), 15659#(<= main_~i~2 13), 15660#(<= main_~i~2 14), 15661#(<= main_~i~2 15), 15662#(<= main_~i~2 16), 15663#(<= main_~i~2 17), 15664#(<= main_~i~2 18), 15665#(<= main_~i~2 19), 15666#(<= main_~i~2 20), 15667#(<= main_~i~2 21), 15668#(<= main_~i~2 22), 15669#(<= main_~i~2 23), 15670#(<= main_~i~2 24), 15671#(<= main_~i~2 25)] [2018-02-04 02:54:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 24093 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 21943 trivial. 0 not checked. [2018-02-04 02:54:06,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:54:06,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:54:06,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:54:06,251 INFO L87 Difference]: Start difference. First operand 290 states and 317 transitions. Second operand 28 states. [2018-02-04 02:54:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:06,454 INFO L93 Difference]: Finished difference Result 302 states and 331 transitions. [2018-02-04 02:54:06,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:54:06,454 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1156 [2018-02-04 02:54:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:06,456 INFO L225 Difference]: With dead ends: 302 [2018-02-04 02:54:06,456 INFO L226 Difference]: Without dead ends: 302 [2018-02-04 02:54:06,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:54:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-02-04 02:54:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2018-02-04 02:54:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-04 02:54:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 325 transitions. [2018-02-04 02:54:06,460 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 325 transitions. Word has length 1156 [2018-02-04 02:54:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:06,460 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 325 transitions. [2018-02-04 02:54:06,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:54:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 325 transitions. [2018-02-04 02:54:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2018-02-04 02:54:06,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:06,467 INFO L351 BasicCegarLoop]: trace histogram [75, 75, 49, 49, 49, 49, 49, 49, 49, 49, 49, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:06,467 INFO L371 AbstractCegarLoop]: === Iteration 47 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:06,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1268694221, now seen corresponding path program 24 times [2018-02-04 02:54:06,468 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:06,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 26159 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 23832 trivial. 0 not checked. [2018-02-04 02:54:08,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:08,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 02:54:08,534 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11040 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11040 trivial. 0 not checked. [2018-02-04 02:54:08,535 INFO L182 omatonBuilderFactory]: Interpolants [16271#true, 16272#false, 16273#(= main_~i~2 0), 16274#(<= main_~i~2 1), 16275#(<= main_~i~2 2), 16276#(<= main_~i~2 3), 16277#(<= main_~i~2 4), 16278#(<= main_~i~2 5), 16279#(<= main_~i~2 6), 16280#(<= main_~i~2 7), 16281#(<= main_~i~2 8), 16282#(<= main_~i~2 9), 16283#(<= main_~i~2 10), 16284#(<= main_~i~2 11), 16285#(<= main_~i~2 12), 16286#(<= main_~i~2 13), 16287#(<= main_~i~2 14), 16288#(<= main_~i~2 15), 16289#(<= main_~i~2 16), 16290#(<= main_~i~2 17), 16291#(<= main_~i~2 18), 16292#(<= main_~i~2 19), 16293#(<= main_~i~2 20), 16294#(<= main_~i~2 21), 16295#(<= main_~i~2 22), 16296#(<= main_~i~2 23), 16297#(<= main_~i~2 24), 16298#(<= main_~i~2 25), 16299#(<= main_~i~2 26)] [2018-02-04 02:54:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 26159 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 23832 trivial. 0 not checked. [2018-02-04 02:54:08,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 02:54:08,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 02:54:08,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:54:08,536 INFO L87 Difference]: Start difference. First operand 297 states and 325 transitions. Second operand 29 states. [2018-02-04 02:54:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:08,720 INFO L93 Difference]: Finished difference Result 309 states and 339 transitions. [2018-02-04 02:54:08,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 02:54:08,721 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1203 [2018-02-04 02:54:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:08,722 INFO L225 Difference]: With dead ends: 309 [2018-02-04 02:54:08,722 INFO L226 Difference]: Without dead ends: 309 [2018-02-04 02:54:08,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:54:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-04 02:54:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2018-02-04 02:54:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-02-04 02:54:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 333 transitions. [2018-02-04 02:54:08,727 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 333 transitions. Word has length 1203 [2018-02-04 02:54:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:08,728 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 333 transitions. [2018-02-04 02:54:08,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 02:54:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 333 transitions. [2018-02-04 02:54:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1251 [2018-02-04 02:54:08,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:08,735 INFO L351 BasicCegarLoop]: trace histogram [78, 78, 51, 51, 51, 51, 51, 51, 51, 51, 51, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:08,735 INFO L371 AbstractCegarLoop]: === Iteration 48 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash 99365325, now seen corresponding path program 25 times [2018-02-04 02:54:08,736 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:08,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 28310 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 25799 trivial. 0 not checked. [2018-02-04 02:54:10,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:10,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 02:54:10,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12000 trivial. 0 not checked. [2018-02-04 02:54:10,992 INFO L182 omatonBuilderFactory]: Interpolants [16913#true, 16914#false, 16915#(= main_~i~2 0), 16916#(<= main_~i~2 1), 16917#(<= main_~i~2 2), 16918#(<= main_~i~2 3), 16919#(<= main_~i~2 4), 16920#(<= main_~i~2 5), 16921#(<= main_~i~2 6), 16922#(<= main_~i~2 7), 16923#(<= main_~i~2 8), 16924#(<= main_~i~2 9), 16925#(<= main_~i~2 10), 16926#(<= main_~i~2 11), 16927#(<= main_~i~2 12), 16928#(<= main_~i~2 13), 16929#(<= main_~i~2 14), 16930#(<= main_~i~2 15), 16931#(<= main_~i~2 16), 16932#(<= main_~i~2 17), 16933#(<= main_~i~2 18), 16934#(<= main_~i~2 19), 16935#(<= main_~i~2 20), 16936#(<= main_~i~2 21), 16937#(<= main_~i~2 22), 16938#(<= main_~i~2 23), 16939#(<= main_~i~2 24), 16940#(<= main_~i~2 25), 16941#(<= main_~i~2 26), 16942#(<= main_~i~2 27)] [2018-02-04 02:54:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 28310 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 25799 trivial. 0 not checked. [2018-02-04 02:54:10,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 02:54:10,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 02:54:10,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:54:10,993 INFO L87 Difference]: Start difference. First operand 304 states and 333 transitions. Second operand 30 states. [2018-02-04 02:54:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:11,200 INFO L93 Difference]: Finished difference Result 316 states and 347 transitions. [2018-02-04 02:54:11,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 02:54:11,200 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1250 [2018-02-04 02:54:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:11,201 INFO L225 Difference]: With dead ends: 316 [2018-02-04 02:54:11,202 INFO L226 Difference]: Without dead ends: 316 [2018-02-04 02:54:11,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:54:11,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-04 02:54:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 311. [2018-02-04 02:54:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-02-04 02:54:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 341 transitions. [2018-02-04 02:54:11,207 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 341 transitions. Word has length 1250 [2018-02-04 02:54:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:11,208 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 341 transitions. [2018-02-04 02:54:11,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 02:54:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 341 transitions. [2018-02-04 02:54:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2018-02-04 02:54:11,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:11,217 INFO L351 BasicCegarLoop]: trace histogram [81, 81, 53, 53, 53, 53, 53, 53, 53, 53, 53, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:11,217 INFO L371 AbstractCegarLoop]: === Iteration 49 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:11,217 INFO L82 PathProgramCache]: Analyzing trace with hash -41622541, now seen corresponding path program 26 times [2018-02-04 02:54:11,218 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:11,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 30546 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 27844 trivial. 0 not checked. [2018-02-04 02:54:13,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:13,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 02:54:13,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 13000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13000 trivial. 0 not checked. [2018-02-04 02:54:13,749 INFO L182 omatonBuilderFactory]: Interpolants [17600#(<= main_~i~2 28), 17570#true, 17571#false, 17572#(= main_~i~2 0), 17573#(<= main_~i~2 1), 17574#(<= main_~i~2 2), 17575#(<= main_~i~2 3), 17576#(<= main_~i~2 4), 17577#(<= main_~i~2 5), 17578#(<= main_~i~2 6), 17579#(<= main_~i~2 7), 17580#(<= main_~i~2 8), 17581#(<= main_~i~2 9), 17582#(<= main_~i~2 10), 17583#(<= main_~i~2 11), 17584#(<= main_~i~2 12), 17585#(<= main_~i~2 13), 17586#(<= main_~i~2 14), 17587#(<= main_~i~2 15), 17588#(<= main_~i~2 16), 17589#(<= main_~i~2 17), 17590#(<= main_~i~2 18), 17591#(<= main_~i~2 19), 17592#(<= main_~i~2 20), 17593#(<= main_~i~2 21), 17594#(<= main_~i~2 22), 17595#(<= main_~i~2 23), 17596#(<= main_~i~2 24), 17597#(<= main_~i~2 25), 17598#(<= main_~i~2 26), 17599#(<= main_~i~2 27)] [2018-02-04 02:54:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 30546 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 27844 trivial. 0 not checked. [2018-02-04 02:54:13,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 02:54:13,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 02:54:13,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:54:13,750 INFO L87 Difference]: Start difference. First operand 311 states and 341 transitions. Second operand 31 states. [2018-02-04 02:54:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:13,960 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2018-02-04 02:54:13,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:54:13,960 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1297 [2018-02-04 02:54:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:13,962 INFO L225 Difference]: With dead ends: 323 [2018-02-04 02:54:13,963 INFO L226 Difference]: Without dead ends: 323 [2018-02-04 02:54:13,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:54:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-04 02:54:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 318. [2018-02-04 02:54:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-02-04 02:54:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 349 transitions. [2018-02-04 02:54:13,968 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 349 transitions. Word has length 1297 [2018-02-04 02:54:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:13,969 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 349 transitions. [2018-02-04 02:54:13,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 02:54:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 349 transitions. [2018-02-04 02:54:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1345 [2018-02-04 02:54:13,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:13,981 INFO L351 BasicCegarLoop]: trace histogram [84, 84, 55, 55, 55, 55, 55, 55, 55, 55, 55, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:13,981 INFO L371 AbstractCegarLoop]: === Iteration 50 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:13,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1148323571, now seen corresponding path program 27 times [2018-02-04 02:54:13,982 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:14,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 32867 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 29967 trivial. 0 not checked. [2018-02-04 02:54:16,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:16,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 02:54:16,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 14040 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14040 trivial. 0 not checked. [2018-02-04 02:54:16,749 INFO L182 omatonBuilderFactory]: Interpolants [18242#true, 18243#false, 18244#(= main_~i~2 0), 18245#(<= main_~i~2 1), 18246#(<= main_~i~2 2), 18247#(<= main_~i~2 3), 18248#(<= main_~i~2 4), 18249#(<= main_~i~2 5), 18250#(<= main_~i~2 6), 18251#(<= main_~i~2 7), 18252#(<= main_~i~2 8), 18253#(<= main_~i~2 9), 18254#(<= main_~i~2 10), 18255#(<= main_~i~2 11), 18256#(<= main_~i~2 12), 18257#(<= main_~i~2 13), 18258#(<= main_~i~2 14), 18259#(<= main_~i~2 15), 18260#(<= main_~i~2 16), 18261#(<= main_~i~2 17), 18262#(<= main_~i~2 18), 18263#(<= main_~i~2 19), 18264#(<= main_~i~2 20), 18265#(<= main_~i~2 21), 18266#(<= main_~i~2 22), 18267#(<= main_~i~2 23), 18268#(<= main_~i~2 24), 18269#(<= main_~i~2 25), 18270#(<= main_~i~2 26), 18271#(<= main_~i~2 27), 18272#(<= main_~i~2 28), 18273#(<= main_~i~2 29)] [2018-02-04 02:54:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32867 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 29967 trivial. 0 not checked. [2018-02-04 02:54:16,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 02:54:16,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 02:54:16,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:54:16,751 INFO L87 Difference]: Start difference. First operand 318 states and 349 transitions. Second operand 32 states. [2018-02-04 02:54:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:16,976 INFO L93 Difference]: Finished difference Result 330 states and 363 transitions. [2018-02-04 02:54:16,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:54:16,976 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1344 [2018-02-04 02:54:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:16,978 INFO L225 Difference]: With dead ends: 330 [2018-02-04 02:54:16,978 INFO L226 Difference]: Without dead ends: 330 [2018-02-04 02:54:16,978 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-04 02:54:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-04 02:54:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 325. [2018-02-04 02:54:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-04 02:54:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 357 transitions. [2018-02-04 02:54:16,981 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 357 transitions. Word has length 1344 [2018-02-04 02:54:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:16,982 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 357 transitions. [2018-02-04 02:54:16,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 02:54:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 357 transitions. [2018-02-04 02:54:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1392 [2018-02-04 02:54:16,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:16,990 INFO L351 BasicCegarLoop]: trace histogram [87, 87, 57, 57, 57, 57, 57, 57, 57, 57, 57, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:16,990 INFO L371 AbstractCegarLoop]: === Iteration 51 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1816179891, now seen corresponding path program 28 times [2018-02-04 02:54:16,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:17,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 35273 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 32168 trivial. 0 not checked. [2018-02-04 02:54:19,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:19,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 02:54:19,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15120 trivial. 0 not checked. [2018-02-04 02:54:19,904 INFO L182 omatonBuilderFactory]: Interpolants [18944#(<= main_~i~2 13), 18945#(<= main_~i~2 14), 18946#(<= main_~i~2 15), 18947#(<= main_~i~2 16), 18948#(<= main_~i~2 17), 18949#(<= main_~i~2 18), 18950#(<= main_~i~2 19), 18951#(<= main_~i~2 20), 18952#(<= main_~i~2 21), 18953#(<= main_~i~2 22), 18954#(<= main_~i~2 23), 18955#(<= main_~i~2 24), 18956#(<= main_~i~2 25), 18957#(<= main_~i~2 26), 18958#(<= main_~i~2 27), 18959#(<= main_~i~2 28), 18960#(<= main_~i~2 29), 18961#(<= main_~i~2 30), 18929#true, 18930#false, 18931#(= main_~i~2 0), 18932#(<= main_~i~2 1), 18933#(<= main_~i~2 2), 18934#(<= main_~i~2 3), 18935#(<= main_~i~2 4), 18936#(<= main_~i~2 5), 18937#(<= main_~i~2 6), 18938#(<= main_~i~2 7), 18939#(<= main_~i~2 8), 18940#(<= main_~i~2 9), 18941#(<= main_~i~2 10), 18942#(<= main_~i~2 11), 18943#(<= main_~i~2 12)] [2018-02-04 02:54:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 35273 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 32168 trivial. 0 not checked. [2018-02-04 02:54:19,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 02:54:19,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 02:54:19,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:54:19,905 INFO L87 Difference]: Start difference. First operand 325 states and 357 transitions. Second operand 33 states. [2018-02-04 02:54:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:20,112 INFO L93 Difference]: Finished difference Result 337 states and 371 transitions. [2018-02-04 02:54:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 02:54:20,112 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1391 [2018-02-04 02:54:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:20,114 INFO L225 Difference]: With dead ends: 337 [2018-02-04 02:54:20,114 INFO L226 Difference]: Without dead ends: 337 [2018-02-04 02:54:20,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:54:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-04 02:54:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 332. [2018-02-04 02:54:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-02-04 02:54:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 365 transitions. [2018-02-04 02:54:20,117 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 365 transitions. Word has length 1391 [2018-02-04 02:54:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:20,118 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 365 transitions. [2018-02-04 02:54:20,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 02:54:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 365 transitions. [2018-02-04 02:54:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1439 [2018-02-04 02:54:20,127 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:20,127 INFO L351 BasicCegarLoop]: trace histogram [90, 90, 59, 59, 59, 59, 59, 59, 59, 59, 59, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:20,127 INFO L371 AbstractCegarLoop]: === Iteration 52 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash -957247411, now seen corresponding path program 29 times [2018-02-04 02:54:20,128 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:20,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 37764 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 34447 trivial. 0 not checked. [2018-02-04 02:54:23,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:23,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 02:54:23,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16240 trivial. 0 not checked. [2018-02-04 02:54:23,349 INFO L182 omatonBuilderFactory]: Interpolants [19648#(<= main_~i~2 15), 19649#(<= main_~i~2 16), 19650#(<= main_~i~2 17), 19651#(<= main_~i~2 18), 19652#(<= main_~i~2 19), 19653#(<= main_~i~2 20), 19654#(<= main_~i~2 21), 19655#(<= main_~i~2 22), 19656#(<= main_~i~2 23), 19657#(<= main_~i~2 24), 19658#(<= main_~i~2 25), 19659#(<= main_~i~2 26), 19660#(<= main_~i~2 27), 19661#(<= main_~i~2 28), 19662#(<= main_~i~2 29), 19663#(<= main_~i~2 30), 19664#(<= main_~i~2 31), 19631#true, 19632#false, 19633#(= main_~i~2 0), 19634#(<= main_~i~2 1), 19635#(<= main_~i~2 2), 19636#(<= main_~i~2 3), 19637#(<= main_~i~2 4), 19638#(<= main_~i~2 5), 19639#(<= main_~i~2 6), 19640#(<= main_~i~2 7), 19641#(<= main_~i~2 8), 19642#(<= main_~i~2 9), 19643#(<= main_~i~2 10), 19644#(<= main_~i~2 11), 19645#(<= main_~i~2 12), 19646#(<= main_~i~2 13), 19647#(<= main_~i~2 14)] [2018-02-04 02:54:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 37764 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 34447 trivial. 0 not checked. [2018-02-04 02:54:23,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 02:54:23,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 02:54:23,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:54:23,351 INFO L87 Difference]: Start difference. First operand 332 states and 365 transitions. Second operand 34 states. [2018-02-04 02:54:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:23,519 INFO L93 Difference]: Finished difference Result 344 states and 379 transitions. [2018-02-04 02:54:23,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 02:54:23,520 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1438 [2018-02-04 02:54:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:23,521 INFO L225 Difference]: With dead ends: 344 [2018-02-04 02:54:23,521 INFO L226 Difference]: Without dead ends: 344 [2018-02-04 02:54:23,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:54:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-02-04 02:54:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 339. [2018-02-04 02:54:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-04 02:54:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 373 transitions. [2018-02-04 02:54:23,525 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 373 transitions. Word has length 1438 [2018-02-04 02:54:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:23,526 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 373 transitions. [2018-02-04 02:54:23,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 02:54:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 373 transitions. [2018-02-04 02:54:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1486 [2018-02-04 02:54:23,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:23,535 INFO L351 BasicCegarLoop]: trace histogram [93, 93, 61, 61, 61, 61, 61, 61, 61, 61, 61, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:23,535 INFO L371 AbstractCegarLoop]: === Iteration 53 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1834961549, now seen corresponding path program 30 times [2018-02-04 02:54:23,536 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:23,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 40340 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 36804 trivial. 0 not checked. [2018-02-04 02:54:27,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:27,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 02:54:27,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 17400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17400 trivial. 0 not checked. [2018-02-04 02:54:27,127 INFO L182 omatonBuilderFactory]: Interpolants [20352#(<= main_~i~2 2), 20353#(<= main_~i~2 3), 20354#(<= main_~i~2 4), 20355#(<= main_~i~2 5), 20356#(<= main_~i~2 6), 20357#(<= main_~i~2 7), 20358#(<= main_~i~2 8), 20359#(<= main_~i~2 9), 20360#(<= main_~i~2 10), 20361#(<= main_~i~2 11), 20362#(<= main_~i~2 12), 20363#(<= main_~i~2 13), 20364#(<= main_~i~2 14), 20365#(<= main_~i~2 15), 20366#(<= main_~i~2 16), 20367#(<= main_~i~2 17), 20368#(<= main_~i~2 18), 20369#(<= main_~i~2 19), 20370#(<= main_~i~2 20), 20371#(<= main_~i~2 21), 20372#(<= main_~i~2 22), 20373#(<= main_~i~2 23), 20374#(<= main_~i~2 24), 20375#(<= main_~i~2 25), 20376#(<= main_~i~2 26), 20377#(<= main_~i~2 27), 20378#(<= main_~i~2 28), 20379#(<= main_~i~2 29), 20380#(<= main_~i~2 30), 20381#(<= main_~i~2 31), 20382#(<= main_~i~2 32), 20348#true, 20349#false, 20350#(= main_~i~2 0), 20351#(<= main_~i~2 1)] [2018-02-04 02:54:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 40340 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 36804 trivial. 0 not checked. [2018-02-04 02:54:27,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 02:54:27,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 02:54:27,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:54:27,128 INFO L87 Difference]: Start difference. First operand 339 states and 373 transitions. Second operand 35 states. [2018-02-04 02:54:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:27,361 INFO L93 Difference]: Finished difference Result 351 states and 387 transitions. [2018-02-04 02:54:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:54:27,362 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1485 [2018-02-04 02:54:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:27,363 INFO L225 Difference]: With dead ends: 351 [2018-02-04 02:54:27,363 INFO L226 Difference]: Without dead ends: 351 [2018-02-04 02:54:27,363 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-04 02:54:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-04 02:54:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 346. [2018-02-04 02:54:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-04 02:54:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 381 transitions. [2018-02-04 02:54:27,368 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 381 transitions. Word has length 1485 [2018-02-04 02:54:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:27,369 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 381 transitions. [2018-02-04 02:54:27,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 02:54:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 381 transitions. [2018-02-04 02:54:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1533 [2018-02-04 02:54:27,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:27,379 INFO L351 BasicCegarLoop]: trace histogram [96, 96, 63, 63, 63, 63, 63, 63, 63, 63, 63, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:27,379 INFO L371 AbstractCegarLoop]: === Iteration 54 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:27,379 INFO L82 PathProgramCache]: Analyzing trace with hash -326436979, now seen corresponding path program 31 times [2018-02-04 02:54:27,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:27,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 43001 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 39239 trivial. 0 not checked. [2018-02-04 02:54:31,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:31,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 02:54:31,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18600 trivial. 0 not checked. [2018-02-04 02:54:31,202 INFO L182 omatonBuilderFactory]: Interpolants [21080#true, 21081#false, 21082#(= main_~i~2 0), 21083#(<= main_~i~2 1), 21084#(<= main_~i~2 2), 21085#(<= main_~i~2 3), 21086#(<= main_~i~2 4), 21087#(<= main_~i~2 5), 21088#(<= main_~i~2 6), 21089#(<= main_~i~2 7), 21090#(<= main_~i~2 8), 21091#(<= main_~i~2 9), 21092#(<= main_~i~2 10), 21093#(<= main_~i~2 11), 21094#(<= main_~i~2 12), 21095#(<= main_~i~2 13), 21096#(<= main_~i~2 14), 21097#(<= main_~i~2 15), 21098#(<= main_~i~2 16), 21099#(<= main_~i~2 17), 21100#(<= main_~i~2 18), 21101#(<= main_~i~2 19), 21102#(<= main_~i~2 20), 21103#(<= main_~i~2 21), 21104#(<= main_~i~2 22), 21105#(<= main_~i~2 23), 21106#(<= main_~i~2 24), 21107#(<= main_~i~2 25), 21108#(<= main_~i~2 26), 21109#(<= main_~i~2 27), 21110#(<= main_~i~2 28), 21111#(<= main_~i~2 29), 21112#(<= main_~i~2 30), 21113#(<= main_~i~2 31), 21114#(<= main_~i~2 32), 21115#(<= main_~i~2 33)] [2018-02-04 02:54:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 43001 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 39239 trivial. 0 not checked. [2018-02-04 02:54:31,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 02:54:31,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 02:54:31,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:54:31,203 INFO L87 Difference]: Start difference. First operand 346 states and 381 transitions. Second operand 36 states. [2018-02-04 02:54:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:31,467 INFO L93 Difference]: Finished difference Result 358 states and 395 transitions. [2018-02-04 02:54:31,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 02:54:31,467 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1532 [2018-02-04 02:54:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:31,468 INFO L225 Difference]: With dead ends: 358 [2018-02-04 02:54:31,468 INFO L226 Difference]: Without dead ends: 358 [2018-02-04 02:54:31,469 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-04 02:54:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-04 02:54:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2018-02-04 02:54:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-04 02:54:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 389 transitions. [2018-02-04 02:54:31,472 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 389 transitions. Word has length 1532 [2018-02-04 02:54:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:31,473 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 389 transitions. [2018-02-04 02:54:31,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 02:54:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 389 transitions. [2018-02-04 02:54:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1580 [2018-02-04 02:54:31,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:31,484 INFO L351 BasicCegarLoop]: trace histogram [99, 99, 65, 65, 65, 65, 65, 65, 65, 65, 65, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:31,484 INFO L371 AbstractCegarLoop]: === Iteration 55 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:31,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2052004301, now seen corresponding path program 32 times [2018-02-04 02:54:31,484 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:31,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 45747 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 41752 trivial. 0 not checked. [2018-02-04 02:54:35,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:35,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 02:54:35,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 19840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19840 trivial. 0 not checked. [2018-02-04 02:54:35,615 INFO L182 omatonBuilderFactory]: Interpolants [21827#true, 21828#false, 21829#(= main_~i~2 0), 21830#(<= main_~i~2 1), 21831#(<= main_~i~2 2), 21832#(<= main_~i~2 3), 21833#(<= main_~i~2 4), 21834#(<= main_~i~2 5), 21835#(<= main_~i~2 6), 21836#(<= main_~i~2 7), 21837#(<= main_~i~2 8), 21838#(<= main_~i~2 9), 21839#(<= main_~i~2 10), 21840#(<= main_~i~2 11), 21841#(<= main_~i~2 12), 21842#(<= main_~i~2 13), 21843#(<= main_~i~2 14), 21844#(<= main_~i~2 15), 21845#(<= main_~i~2 16), 21846#(<= main_~i~2 17), 21847#(<= main_~i~2 18), 21848#(<= main_~i~2 19), 21849#(<= main_~i~2 20), 21850#(<= main_~i~2 21), 21851#(<= main_~i~2 22), 21852#(<= main_~i~2 23), 21853#(<= main_~i~2 24), 21854#(<= main_~i~2 25), 21855#(<= main_~i~2 26), 21856#(<= main_~i~2 27), 21857#(<= main_~i~2 28), 21858#(<= main_~i~2 29), 21859#(<= main_~i~2 30), 21860#(<= main_~i~2 31), 21861#(<= main_~i~2 32), 21862#(<= main_~i~2 33), 21863#(<= main_~i~2 34)] [2018-02-04 02:54:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 45747 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 41752 trivial. 0 not checked. [2018-02-04 02:54:35,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 02:54:35,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 02:54:35,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:54:35,616 INFO L87 Difference]: Start difference. First operand 353 states and 389 transitions. Second operand 37 states. [2018-02-04 02:54:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:35,897 INFO L93 Difference]: Finished difference Result 365 states and 403 transitions. [2018-02-04 02:54:35,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 02:54:35,898 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1579 [2018-02-04 02:54:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:35,899 INFO L225 Difference]: With dead ends: 365 [2018-02-04 02:54:35,900 INFO L226 Difference]: Without dead ends: 365 [2018-02-04 02:54:35,900 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-04 02:54:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-04 02:54:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 360. [2018-02-04 02:54:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-02-04 02:54:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 397 transitions. [2018-02-04 02:54:35,903 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 397 transitions. Word has length 1579 [2018-02-04 02:54:35,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:35,903 INFO L432 AbstractCegarLoop]: Abstraction has 360 states and 397 transitions. [2018-02-04 02:54:35,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 02:54:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 397 transitions. [2018-02-04 02:54:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1627 [2018-02-04 02:54:35,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:35,915 INFO L351 BasicCegarLoop]: trace histogram [102, 102, 67, 67, 67, 67, 67, 67, 67, 67, 67, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:35,915 INFO L371 AbstractCegarLoop]: === Iteration 56 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:35,915 INFO L82 PathProgramCache]: Analyzing trace with hash 231616205, now seen corresponding path program 33 times [2018-02-04 02:54:35,916 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:36,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 48578 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 44343 trivial. 0 not checked. [2018-02-04 02:54:40,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:40,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 02:54:40,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 21120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21120 trivial. 0 not checked. [2018-02-04 02:54:40,381 INFO L182 omatonBuilderFactory]: Interpolants [22592#(<= main_~i~2 1), 22593#(<= main_~i~2 2), 22594#(<= main_~i~2 3), 22595#(<= main_~i~2 4), 22596#(<= main_~i~2 5), 22597#(<= main_~i~2 6), 22598#(<= main_~i~2 7), 22599#(<= main_~i~2 8), 22600#(<= main_~i~2 9), 22601#(<= main_~i~2 10), 22602#(<= main_~i~2 11), 22603#(<= main_~i~2 12), 22604#(<= main_~i~2 13), 22605#(<= main_~i~2 14), 22606#(<= main_~i~2 15), 22607#(<= main_~i~2 16), 22608#(<= main_~i~2 17), 22609#(<= main_~i~2 18), 22610#(<= main_~i~2 19), 22611#(<= main_~i~2 20), 22612#(<= main_~i~2 21), 22613#(<= main_~i~2 22), 22614#(<= main_~i~2 23), 22615#(<= main_~i~2 24), 22616#(<= main_~i~2 25), 22617#(<= main_~i~2 26), 22618#(<= main_~i~2 27), 22619#(<= main_~i~2 28), 22620#(<= main_~i~2 29), 22621#(<= main_~i~2 30), 22622#(<= main_~i~2 31), 22623#(<= main_~i~2 32), 22624#(<= main_~i~2 33), 22625#(<= main_~i~2 34), 22626#(<= main_~i~2 35), 22589#true, 22590#false, 22591#(= main_~i~2 0)] [2018-02-04 02:54:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 48578 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 44343 trivial. 0 not checked. [2018-02-04 02:54:40,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 02:54:40,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 02:54:40,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:54:40,382 INFO L87 Difference]: Start difference. First operand 360 states and 397 transitions. Second operand 38 states. [2018-02-04 02:54:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:40,659 INFO L93 Difference]: Finished difference Result 372 states and 411 transitions. [2018-02-04 02:54:40,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:54:40,660 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1626 [2018-02-04 02:54:40,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:40,661 INFO L225 Difference]: With dead ends: 372 [2018-02-04 02:54:40,661 INFO L226 Difference]: Without dead ends: 372 [2018-02-04 02:54:40,661 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-04 02:54:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-02-04 02:54:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2018-02-04 02:54:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-02-04 02:54:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 405 transitions. [2018-02-04 02:54:40,666 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 405 transitions. Word has length 1626 [2018-02-04 02:54:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:40,666 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 405 transitions. [2018-02-04 02:54:40,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 02:54:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 405 transitions. [2018-02-04 02:54:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1674 [2018-02-04 02:54:40,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:40,679 INFO L351 BasicCegarLoop]: trace histogram [105, 105, 69, 69, 69, 69, 69, 69, 69, 69, 69, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:40,679 INFO L371 AbstractCegarLoop]: === Iteration 57 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1652734221, now seen corresponding path program 34 times [2018-02-04 02:54:40,680 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:40,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 51494 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 47012 trivial. 0 not checked. [2018-02-04 02:54:45,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:45,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 02:54:45,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 22440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22440 trivial. 0 not checked. [2018-02-04 02:54:45,435 INFO L182 omatonBuilderFactory]: Interpolants [23366#true, 23367#false, 23368#(= main_~i~2 0), 23369#(<= main_~i~2 1), 23370#(<= main_~i~2 2), 23371#(<= main_~i~2 3), 23372#(<= main_~i~2 4), 23373#(<= main_~i~2 5), 23374#(<= main_~i~2 6), 23375#(<= main_~i~2 7), 23376#(<= main_~i~2 8), 23377#(<= main_~i~2 9), 23378#(<= main_~i~2 10), 23379#(<= main_~i~2 11), 23380#(<= main_~i~2 12), 23381#(<= main_~i~2 13), 23382#(<= main_~i~2 14), 23383#(<= main_~i~2 15), 23384#(<= main_~i~2 16), 23385#(<= main_~i~2 17), 23386#(<= main_~i~2 18), 23387#(<= main_~i~2 19), 23388#(<= main_~i~2 20), 23389#(<= main_~i~2 21), 23390#(<= main_~i~2 22), 23391#(<= main_~i~2 23), 23392#(<= main_~i~2 24), 23393#(<= main_~i~2 25), 23394#(<= main_~i~2 26), 23395#(<= main_~i~2 27), 23396#(<= main_~i~2 28), 23397#(<= main_~i~2 29), 23398#(<= main_~i~2 30), 23399#(<= main_~i~2 31), 23400#(<= main_~i~2 32), 23401#(<= main_~i~2 33), 23402#(<= main_~i~2 34), 23403#(<= main_~i~2 35), 23404#(<= main_~i~2 36)] [2018-02-04 02:54:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 51494 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 47012 trivial. 0 not checked. [2018-02-04 02:54:45,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 02:54:45,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 02:54:45,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:54:45,436 INFO L87 Difference]: Start difference. First operand 367 states and 405 transitions. Second operand 39 states. [2018-02-04 02:54:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:45,736 INFO L93 Difference]: Finished difference Result 379 states and 419 transitions. [2018-02-04 02:54:45,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 02:54:45,736 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1673 [2018-02-04 02:54:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:45,738 INFO L225 Difference]: With dead ends: 379 [2018-02-04 02:54:45,738 INFO L226 Difference]: Without dead ends: 379 [2018-02-04 02:54:45,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:54:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-04 02:54:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 374. [2018-02-04 02:54:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-04 02:54:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 413 transitions. [2018-02-04 02:54:45,742 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 413 transitions. Word has length 1673 [2018-02-04 02:54:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:45,742 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 413 transitions. [2018-02-04 02:54:45,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 02:54:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 413 transitions. [2018-02-04 02:54:45,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1721 [2018-02-04 02:54:45,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:45,754 INFO L351 BasicCegarLoop]: trace histogram [108, 108, 71, 71, 71, 71, 71, 71, 71, 71, 71, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:45,754 INFO L371 AbstractCegarLoop]: === Iteration 58 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:45,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1764701709, now seen corresponding path program 35 times [2018-02-04 02:54:45,755 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:45,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 54495 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 49759 trivial. 0 not checked. [2018-02-04 02:54:50,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:50,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 02:54:50,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 23800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23800 trivial. 0 not checked. [2018-02-04 02:54:50,900 INFO L182 omatonBuilderFactory]: Interpolants [24192#(<= main_~i~2 32), 24193#(<= main_~i~2 33), 24194#(<= main_~i~2 34), 24195#(<= main_~i~2 35), 24196#(<= main_~i~2 36), 24197#(<= main_~i~2 37), 24158#true, 24159#false, 24160#(= main_~i~2 0), 24161#(<= main_~i~2 1), 24162#(<= main_~i~2 2), 24163#(<= main_~i~2 3), 24164#(<= main_~i~2 4), 24165#(<= main_~i~2 5), 24166#(<= main_~i~2 6), 24167#(<= main_~i~2 7), 24168#(<= main_~i~2 8), 24169#(<= main_~i~2 9), 24170#(<= main_~i~2 10), 24171#(<= main_~i~2 11), 24172#(<= main_~i~2 12), 24173#(<= main_~i~2 13), 24174#(<= main_~i~2 14), 24175#(<= main_~i~2 15), 24176#(<= main_~i~2 16), 24177#(<= main_~i~2 17), 24178#(<= main_~i~2 18), 24179#(<= main_~i~2 19), 24180#(<= main_~i~2 20), 24181#(<= main_~i~2 21), 24182#(<= main_~i~2 22), 24183#(<= main_~i~2 23), 24184#(<= main_~i~2 24), 24185#(<= main_~i~2 25), 24186#(<= main_~i~2 26), 24187#(<= main_~i~2 27), 24188#(<= main_~i~2 28), 24189#(<= main_~i~2 29), 24190#(<= main_~i~2 30), 24191#(<= main_~i~2 31)] [2018-02-04 02:54:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 54495 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 49759 trivial. 0 not checked. [2018-02-04 02:54:50,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 02:54:50,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 02:54:50,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:54:50,901 INFO L87 Difference]: Start difference. First operand 374 states and 413 transitions. Second operand 40 states. [2018-02-04 02:54:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:51,151 INFO L93 Difference]: Finished difference Result 386 states and 427 transitions. [2018-02-04 02:54:51,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 02:54:51,151 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1720 [2018-02-04 02:54:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:51,153 INFO L225 Difference]: With dead ends: 386 [2018-02-04 02:54:51,153 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 02:54:51,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:54:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 02:54:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 381. [2018-02-04 02:54:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-04 02:54:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 421 transitions. [2018-02-04 02:54:51,156 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 421 transitions. Word has length 1720 [2018-02-04 02:54:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:51,157 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 421 transitions. [2018-02-04 02:54:51,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 02:54:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 421 transitions. [2018-02-04 02:54:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1768 [2018-02-04 02:54:51,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:51,169 INFO L351 BasicCegarLoop]: trace histogram [111, 111, 73, 73, 73, 73, 73, 73, 73, 73, 73, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:51,169 INFO L371 AbstractCegarLoop]: === Iteration 59 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:51,169 INFO L82 PathProgramCache]: Analyzing trace with hash 890361779, now seen corresponding path program 36 times [2018-02-04 02:54:51,169 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:51,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 57581 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 52584 trivial. 0 not checked. [2018-02-04 02:54:56,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:56,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 02:54:56,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25200 trivial. 0 not checked. [2018-02-04 02:54:56,769 INFO L182 omatonBuilderFactory]: Interpolants [24965#true, 24966#false, 24967#(= main_~i~2 0), 24968#(<= main_~i~2 1), 24969#(<= main_~i~2 2), 24970#(<= main_~i~2 3), 24971#(<= main_~i~2 4), 24972#(<= main_~i~2 5), 24973#(<= main_~i~2 6), 24974#(<= main_~i~2 7), 24975#(<= main_~i~2 8), 24976#(<= main_~i~2 9), 24977#(<= main_~i~2 10), 24978#(<= main_~i~2 11), 24979#(<= main_~i~2 12), 24980#(<= main_~i~2 13), 24981#(<= main_~i~2 14), 24982#(<= main_~i~2 15), 24983#(<= main_~i~2 16), 24984#(<= main_~i~2 17), 24985#(<= main_~i~2 18), 24986#(<= main_~i~2 19), 24987#(<= main_~i~2 20), 24988#(<= main_~i~2 21), 24989#(<= main_~i~2 22), 24990#(<= main_~i~2 23), 24991#(<= main_~i~2 24), 24992#(<= main_~i~2 25), 24993#(<= main_~i~2 26), 24994#(<= main_~i~2 27), 24995#(<= main_~i~2 28), 24996#(<= main_~i~2 29), 24997#(<= main_~i~2 30), 24998#(<= main_~i~2 31), 24999#(<= main_~i~2 32), 25000#(<= main_~i~2 33), 25001#(<= main_~i~2 34), 25002#(<= main_~i~2 35), 25003#(<= main_~i~2 36), 25004#(<= main_~i~2 37), 25005#(<= main_~i~2 38)] [2018-02-04 02:54:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 57581 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 52584 trivial. 0 not checked. [2018-02-04 02:54:56,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 02:54:56,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 02:54:56,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 02:54:56,770 INFO L87 Difference]: Start difference. First operand 381 states and 421 transitions. Second operand 41 states. [2018-02-04 02:54:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:57,084 INFO L93 Difference]: Finished difference Result 393 states and 435 transitions. [2018-02-04 02:54:57,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:54:57,084 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1767 [2018-02-04 02:54:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:57,086 INFO L225 Difference]: With dead ends: 393 [2018-02-04 02:54:57,086 INFO L226 Difference]: Without dead ends: 393 [2018-02-04 02:54:57,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 02:54:57,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-02-04 02:54:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2018-02-04 02:54:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-04 02:54:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 429 transitions. [2018-02-04 02:54:57,090 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 429 transitions. Word has length 1767 [2018-02-04 02:54:57,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:57,090 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 429 transitions. [2018-02-04 02:54:57,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 02:54:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 429 transitions. [2018-02-04 02:54:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1815 [2018-02-04 02:54:57,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:57,104 INFO L351 BasicCegarLoop]: trace histogram [114, 114, 75, 75, 75, 75, 75, 75, 75, 75, 75, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:57,104 INFO L371 AbstractCegarLoop]: === Iteration 60 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:54:57,104 INFO L82 PathProgramCache]: Analyzing trace with hash -635302579, now seen corresponding path program 37 times [2018-02-04 02:54:57,105 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:57,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:55:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 60752 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 55487 trivial. 0 not checked. [2018-02-04 02:55:03,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:55:03,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 02:55:03,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:55:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 26640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26640 trivial. 0 not checked. [2018-02-04 02:55:03,129 INFO L182 omatonBuilderFactory]: Interpolants [25792#(<= main_~i~2 3), 25793#(<= main_~i~2 4), 25794#(<= main_~i~2 5), 25795#(<= main_~i~2 6), 25796#(<= main_~i~2 7), 25797#(<= main_~i~2 8), 25798#(<= main_~i~2 9), 25799#(<= main_~i~2 10), 25800#(<= main_~i~2 11), 25801#(<= main_~i~2 12), 25802#(<= main_~i~2 13), 25803#(<= main_~i~2 14), 25804#(<= main_~i~2 15), 25805#(<= main_~i~2 16), 25806#(<= main_~i~2 17), 25807#(<= main_~i~2 18), 25808#(<= main_~i~2 19), 25809#(<= main_~i~2 20), 25810#(<= main_~i~2 21), 25811#(<= main_~i~2 22), 25812#(<= main_~i~2 23), 25813#(<= main_~i~2 24), 25814#(<= main_~i~2 25), 25815#(<= main_~i~2 26), 25816#(<= main_~i~2 27), 25817#(<= main_~i~2 28), 25818#(<= main_~i~2 29), 25819#(<= main_~i~2 30), 25820#(<= main_~i~2 31), 25821#(<= main_~i~2 32), 25822#(<= main_~i~2 33), 25823#(<= main_~i~2 34), 25824#(<= main_~i~2 35), 25825#(<= main_~i~2 36), 25826#(<= main_~i~2 37), 25827#(<= main_~i~2 38), 25828#(<= main_~i~2 39), 25787#true, 25788#false, 25789#(= main_~i~2 0), 25790#(<= main_~i~2 1), 25791#(<= main_~i~2 2)] [2018-02-04 02:55:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 60752 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 55487 trivial. 0 not checked. [2018-02-04 02:55:03,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 02:55:03,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 02:55:03,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:55:03,130 INFO L87 Difference]: Start difference. First operand 388 states and 429 transitions. Second operand 42 states. [2018-02-04 02:55:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:55:03,498 INFO L93 Difference]: Finished difference Result 400 states and 443 transitions. [2018-02-04 02:55:03,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 02:55:03,498 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1814 [2018-02-04 02:55:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:55:03,499 INFO L225 Difference]: With dead ends: 400 [2018-02-04 02:55:03,500 INFO L226 Difference]: Without dead ends: 400 [2018-02-04 02:55:03,500 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:55:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-02-04 02:55:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 395. [2018-02-04 02:55:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-04 02:55:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 437 transitions. [2018-02-04 02:55:03,503 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 437 transitions. Word has length 1814 [2018-02-04 02:55:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:55:03,504 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 437 transitions. [2018-02-04 02:55:03,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 02:55:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 437 transitions. [2018-02-04 02:55:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1862 [2018-02-04 02:55:03,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:55:03,517 INFO L351 BasicCegarLoop]: trace histogram [117, 117, 77, 77, 77, 77, 77, 77, 77, 77, 77, 41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:55:03,517 INFO L371 AbstractCegarLoop]: === Iteration 61 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:55:03,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1786419315, now seen corresponding path program 38 times [2018-02-04 02:55:03,518 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:55:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:55:03,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:55:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 64008 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 58468 trivial. 0 not checked. [2018-02-04 02:55:09,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:55:09,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 02:55:09,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:55:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 28120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28120 trivial. 0 not checked. [2018-02-04 02:55:09,923 INFO L182 omatonBuilderFactory]: Interpolants [26624#true, 26625#false, 26626#(= main_~i~2 0), 26627#(<= main_~i~2 1), 26628#(<= main_~i~2 2), 26629#(<= main_~i~2 3), 26630#(<= main_~i~2 4), 26631#(<= main_~i~2 5), 26632#(<= main_~i~2 6), 26633#(<= main_~i~2 7), 26634#(<= main_~i~2 8), 26635#(<= main_~i~2 9), 26636#(<= main_~i~2 10), 26637#(<= main_~i~2 11), 26638#(<= main_~i~2 12), 26639#(<= main_~i~2 13), 26640#(<= main_~i~2 14), 26641#(<= main_~i~2 15), 26642#(<= main_~i~2 16), 26643#(<= main_~i~2 17), 26644#(<= main_~i~2 18), 26645#(<= main_~i~2 19), 26646#(<= main_~i~2 20), 26647#(<= main_~i~2 21), 26648#(<= main_~i~2 22), 26649#(<= main_~i~2 23), 26650#(<= main_~i~2 24), 26651#(<= main_~i~2 25), 26652#(<= main_~i~2 26), 26653#(<= main_~i~2 27), 26654#(<= main_~i~2 28), 26655#(<= main_~i~2 29), 26656#(<= main_~i~2 30), 26657#(<= main_~i~2 31), 26658#(<= main_~i~2 32), 26659#(<= main_~i~2 33), 26660#(<= main_~i~2 34), 26661#(<= main_~i~2 35), 26662#(<= main_~i~2 36), 26663#(<= main_~i~2 37), 26664#(<= main_~i~2 38), 26665#(<= main_~i~2 39), 26666#(<= main_~i~2 40)] [2018-02-04 02:55:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 64008 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 58468 trivial. 0 not checked. [2018-02-04 02:55:09,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 02:55:09,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 02:55:09,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 02:55:09,925 INFO L87 Difference]: Start difference. First operand 395 states and 437 transitions. Second operand 43 states. [2018-02-04 02:55:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:55:10,261 INFO L93 Difference]: Finished difference Result 407 states and 451 transitions. [2018-02-04 02:55:10,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 02:55:10,261 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1861 [2018-02-04 02:55:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:55:10,263 INFO L225 Difference]: With dead ends: 407 [2018-02-04 02:55:10,263 INFO L226 Difference]: Without dead ends: 407 [2018-02-04 02:55:10,263 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-04 02:55:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-02-04 02:55:10,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 402. [2018-02-04 02:55:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-02-04 02:55:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 445 transitions. [2018-02-04 02:55:10,268 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 445 transitions. Word has length 1861 [2018-02-04 02:55:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:55:10,268 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 445 transitions. [2018-02-04 02:55:10,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 02:55:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 445 transitions. [2018-02-04 02:55:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1909 [2018-02-04 02:55:10,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:55:10,282 INFO L351 BasicCegarLoop]: trace histogram [120, 120, 79, 79, 79, 79, 79, 79, 79, 79, 79, 42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:55:10,283 INFO L371 AbstractCegarLoop]: === Iteration 62 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:55:10,283 INFO L82 PathProgramCache]: Analyzing trace with hash 421180557, now seen corresponding path program 39 times [2018-02-04 02:55:10,283 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:55:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:55:10,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:55:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 67349 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 61527 trivial. 0 not checked. [2018-02-04 02:55:16,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:55:16,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 02:55:16,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:55:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 29640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29640 trivial. 0 not checked. [2018-02-04 02:55:16,944 INFO L182 omatonBuilderFactory]: Interpolants [27476#true, 27477#false, 27478#(= main_~i~2 0), 27479#(<= main_~i~2 1), 27480#(<= main_~i~2 2), 27481#(<= main_~i~2 3), 27482#(<= main_~i~2 4), 27483#(<= main_~i~2 5), 27484#(<= main_~i~2 6), 27485#(<= main_~i~2 7), 27486#(<= main_~i~2 8), 27487#(<= main_~i~2 9), 27488#(<= main_~i~2 10), 27489#(<= main_~i~2 11), 27490#(<= main_~i~2 12), 27491#(<= main_~i~2 13), 27492#(<= main_~i~2 14), 27493#(<= main_~i~2 15), 27494#(<= main_~i~2 16), 27495#(<= main_~i~2 17), 27496#(<= main_~i~2 18), 27497#(<= main_~i~2 19), 27498#(<= main_~i~2 20), 27499#(<= main_~i~2 21), 27500#(<= main_~i~2 22), 27501#(<= main_~i~2 23), 27502#(<= main_~i~2 24), 27503#(<= main_~i~2 25), 27504#(<= main_~i~2 26), 27505#(<= main_~i~2 27), 27506#(<= main_~i~2 28), 27507#(<= main_~i~2 29), 27508#(<= main_~i~2 30), 27509#(<= main_~i~2 31), 27510#(<= main_~i~2 32), 27511#(<= main_~i~2 33), 27512#(<= main_~i~2 34), 27513#(<= main_~i~2 35), 27514#(<= main_~i~2 36), 27515#(<= main_~i~2 37), 27516#(<= main_~i~2 38), 27517#(<= main_~i~2 39), 27518#(<= main_~i~2 40), 27519#(<= main_~i~2 41)] [2018-02-04 02:55:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 67349 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 61527 trivial. 0 not checked. [2018-02-04 02:55:16,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 02:55:16,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 02:55:16,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 02:55:16,945 INFO L87 Difference]: Start difference. First operand 402 states and 445 transitions. Second operand 44 states. [2018-02-04 02:55:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:55:17,330 INFO L93 Difference]: Finished difference Result 414 states and 459 transitions. [2018-02-04 02:55:17,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 02:55:17,330 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1908 [2018-02-04 02:55:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:55:17,331 INFO L225 Difference]: With dead ends: 414 [2018-02-04 02:55:17,331 INFO L226 Difference]: Without dead ends: 414 [2018-02-04 02:55:17,332 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-04 02:55:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-02-04 02:55:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 409. [2018-02-04 02:55:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-02-04 02:55:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 453 transitions. [2018-02-04 02:55:17,335 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 453 transitions. Word has length 1908 [2018-02-04 02:55:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:55:17,336 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 453 transitions. [2018-02-04 02:55:17,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 02:55:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 453 transitions. [2018-02-04 02:55:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1956 [2018-02-04 02:55:17,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:55:17,351 INFO L351 BasicCegarLoop]: trace histogram [123, 123, 81, 81, 81, 81, 81, 81, 81, 81, 81, 43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:55:17,351 INFO L371 AbstractCegarLoop]: === Iteration 63 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:55:17,351 INFO L82 PathProgramCache]: Analyzing trace with hash -557610701, now seen corresponding path program 40 times [2018-02-04 02:55:17,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:55:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:55:17,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:55:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 70775 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 64664 trivial. 0 not checked. [2018-02-04 02:55:24,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:55:24,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 02:55:24,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:55:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 31200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31200 trivial. 0 not checked. [2018-02-04 02:55:24,618 INFO L182 omatonBuilderFactory]: Interpolants [28352#(<= main_~i~2 7), 28353#(<= main_~i~2 8), 28354#(<= main_~i~2 9), 28355#(<= main_~i~2 10), 28356#(<= main_~i~2 11), 28357#(<= main_~i~2 12), 28358#(<= main_~i~2 13), 28359#(<= main_~i~2 14), 28360#(<= main_~i~2 15), 28361#(<= main_~i~2 16), 28362#(<= main_~i~2 17), 28363#(<= main_~i~2 18), 28364#(<= main_~i~2 19), 28365#(<= main_~i~2 20), 28366#(<= main_~i~2 21), 28367#(<= main_~i~2 22), 28368#(<= main_~i~2 23), 28369#(<= main_~i~2 24), 28370#(<= main_~i~2 25), 28371#(<= main_~i~2 26), 28372#(<= main_~i~2 27), 28373#(<= main_~i~2 28), 28374#(<= main_~i~2 29), 28375#(<= main_~i~2 30), 28376#(<= main_~i~2 31), 28377#(<= main_~i~2 32), 28378#(<= main_~i~2 33), 28379#(<= main_~i~2 34), 28380#(<= main_~i~2 35), 28381#(<= main_~i~2 36), 28382#(<= main_~i~2 37), 28383#(<= main_~i~2 38), 28384#(<= main_~i~2 39), 28385#(<= main_~i~2 40), 28386#(<= main_~i~2 41), 28387#(<= main_~i~2 42), 28343#true, 28344#false, 28345#(= main_~i~2 0), 28346#(<= main_~i~2 1), 28347#(<= main_~i~2 2), 28348#(<= main_~i~2 3), 28349#(<= main_~i~2 4), 28350#(<= main_~i~2 5), 28351#(<= main_~i~2 6)] [2018-02-04 02:55:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 70775 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 64664 trivial. 0 not checked. [2018-02-04 02:55:24,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 02:55:24,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 02:55:24,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 02:55:24,619 INFO L87 Difference]: Start difference. First operand 409 states and 453 transitions. Second operand 45 states. [2018-02-04 02:55:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:55:24,920 INFO L93 Difference]: Finished difference Result 421 states and 467 transitions. [2018-02-04 02:55:24,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 02:55:24,920 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 1955 [2018-02-04 02:55:24,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:55:24,921 INFO L225 Difference]: With dead ends: 421 [2018-02-04 02:55:24,922 INFO L226 Difference]: Without dead ends: 421 [2018-02-04 02:55:24,922 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-04 02:55:24,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-02-04 02:55:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 416. [2018-02-04 02:55:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-02-04 02:55:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 461 transitions. [2018-02-04 02:55:24,925 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 461 transitions. Word has length 1955 [2018-02-04 02:55:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:55:24,926 INFO L432 AbstractCegarLoop]: Abstraction has 416 states and 461 transitions. [2018-02-04 02:55:24,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 02:55:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 461 transitions. [2018-02-04 02:55:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2003 [2018-02-04 02:55:24,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:55:24,941 INFO L351 BasicCegarLoop]: trace histogram [126, 126, 83, 83, 83, 83, 83, 83, 83, 83, 83, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:55:24,941 INFO L371 AbstractCegarLoop]: === Iteration 64 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:55:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash -74634291, now seen corresponding path program 41 times [2018-02-04 02:55:24,942 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:55:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:55:25,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:55:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 74286 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 67879 trivial. 0 not checked. [2018-02-04 02:55:32,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:55:32,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 02:55:32,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:55:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 32800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32800 trivial. 0 not checked. [2018-02-04 02:55:32,688 INFO L182 omatonBuilderFactory]: Interpolants [29248#(<= main_~i~2 21), 29249#(<= main_~i~2 22), 29250#(<= main_~i~2 23), 29251#(<= main_~i~2 24), 29252#(<= main_~i~2 25), 29253#(<= main_~i~2 26), 29254#(<= main_~i~2 27), 29255#(<= main_~i~2 28), 29256#(<= main_~i~2 29), 29257#(<= main_~i~2 30), 29258#(<= main_~i~2 31), 29259#(<= main_~i~2 32), 29260#(<= main_~i~2 33), 29261#(<= main_~i~2 34), 29262#(<= main_~i~2 35), 29263#(<= main_~i~2 36), 29264#(<= main_~i~2 37), 29265#(<= main_~i~2 38), 29266#(<= main_~i~2 39), 29267#(<= main_~i~2 40), 29268#(<= main_~i~2 41), 29269#(<= main_~i~2 42), 29270#(<= main_~i~2 43), 29225#true, 29226#false, 29227#(= main_~i~2 0), 29228#(<= main_~i~2 1), 29229#(<= main_~i~2 2), 29230#(<= main_~i~2 3), 29231#(<= main_~i~2 4), 29232#(<= main_~i~2 5), 29233#(<= main_~i~2 6), 29234#(<= main_~i~2 7), 29235#(<= main_~i~2 8), 29236#(<= main_~i~2 9), 29237#(<= main_~i~2 10), 29238#(<= main_~i~2 11), 29239#(<= main_~i~2 12), 29240#(<= main_~i~2 13), 29241#(<= main_~i~2 14), 29242#(<= main_~i~2 15), 29243#(<= main_~i~2 16), 29244#(<= main_~i~2 17), 29245#(<= main_~i~2 18), 29246#(<= main_~i~2 19), 29247#(<= main_~i~2 20)] [2018-02-04 02:55:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 74286 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 67879 trivial. 0 not checked. [2018-02-04 02:55:32,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 02:55:32,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 02:55:32,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 02:55:32,690 INFO L87 Difference]: Start difference. First operand 416 states and 461 transitions. Second operand 46 states. [2018-02-04 02:55:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:55:32,958 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2018-02-04 02:55:32,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 02:55:32,959 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2002 [2018-02-04 02:55:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:55:32,962 INFO L225 Difference]: With dead ends: 428 [2018-02-04 02:55:32,962 INFO L226 Difference]: Without dead ends: 428 [2018-02-04 02:55:32,962 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-04 02:55:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-02-04 02:55:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 423. [2018-02-04 02:55:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-04 02:55:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 469 transitions. [2018-02-04 02:55:32,970 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 469 transitions. Word has length 2002 [2018-02-04 02:55:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:55:32,973 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 469 transitions. [2018-02-04 02:55:32,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 02:55:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 469 transitions. [2018-02-04 02:55:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2050 [2018-02-04 02:55:32,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:55:32,999 INFO L351 BasicCegarLoop]: trace histogram [129, 129, 85, 85, 85, 85, 85, 85, 85, 85, 85, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:55:32,999 INFO L371 AbstractCegarLoop]: === Iteration 65 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:55:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1979230707, now seen corresponding path program 42 times [2018-02-04 02:55:33,001 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:55:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:55:33,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:55:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 77882 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 71172 trivial. 0 not checked. [2018-02-04 02:55:41,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:55:41,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 02:55:41,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:55:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 34440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34440 trivial. 0 not checked. [2018-02-04 02:55:41,497 INFO L182 omatonBuilderFactory]: Interpolants [30144#(<= main_~i~2 20), 30145#(<= main_~i~2 21), 30146#(<= main_~i~2 22), 30147#(<= main_~i~2 23), 30148#(<= main_~i~2 24), 30149#(<= main_~i~2 25), 30150#(<= main_~i~2 26), 30151#(<= main_~i~2 27), 30152#(<= main_~i~2 28), 30153#(<= main_~i~2 29), 30154#(<= main_~i~2 30), 30155#(<= main_~i~2 31), 30156#(<= main_~i~2 32), 30157#(<= main_~i~2 33), 30158#(<= main_~i~2 34), 30159#(<= main_~i~2 35), 30160#(<= main_~i~2 36), 30161#(<= main_~i~2 37), 30162#(<= main_~i~2 38), 30163#(<= main_~i~2 39), 30164#(<= main_~i~2 40), 30165#(<= main_~i~2 41), 30166#(<= main_~i~2 42), 30167#(<= main_~i~2 43), 30168#(<= main_~i~2 44), 30122#true, 30123#false, 30124#(= main_~i~2 0), 30125#(<= main_~i~2 1), 30126#(<= main_~i~2 2), 30127#(<= main_~i~2 3), 30128#(<= main_~i~2 4), 30129#(<= main_~i~2 5), 30130#(<= main_~i~2 6), 30131#(<= main_~i~2 7), 30132#(<= main_~i~2 8), 30133#(<= main_~i~2 9), 30134#(<= main_~i~2 10), 30135#(<= main_~i~2 11), 30136#(<= main_~i~2 12), 30137#(<= main_~i~2 13), 30138#(<= main_~i~2 14), 30139#(<= main_~i~2 15), 30140#(<= main_~i~2 16), 30141#(<= main_~i~2 17), 30142#(<= main_~i~2 18), 30143#(<= main_~i~2 19)] [2018-02-04 02:55:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 77882 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 71172 trivial. 0 not checked. [2018-02-04 02:55:41,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 02:55:41,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 02:55:41,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 02:55:41,499 INFO L87 Difference]: Start difference. First operand 423 states and 469 transitions. Second operand 47 states. [2018-02-04 02:55:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:55:41,767 INFO L93 Difference]: Finished difference Result 435 states and 483 transitions. [2018-02-04 02:55:41,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 02:55:41,767 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2049 [2018-02-04 02:55:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:55:41,770 INFO L225 Difference]: With dead ends: 435 [2018-02-04 02:55:41,770 INFO L226 Difference]: Without dead ends: 435 [2018-02-04 02:55:41,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 02:55:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-04 02:55:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 430. [2018-02-04 02:55:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-02-04 02:55:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 477 transitions. [2018-02-04 02:55:41,774 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 477 transitions. Word has length 2049 [2018-02-04 02:55:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:55:41,775 INFO L432 AbstractCegarLoop]: Abstraction has 430 states and 477 transitions. [2018-02-04 02:55:41,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 02:55:41,775 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 477 transitions. [2018-02-04 02:55:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2097 [2018-02-04 02:55:41,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:55:41,792 INFO L351 BasicCegarLoop]: trace histogram [132, 132, 87, 87, 87, 87, 87, 87, 87, 87, 87, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:55:41,792 INFO L371 AbstractCegarLoop]: === Iteration 66 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:55:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1276284147, now seen corresponding path program 43 times [2018-02-04 02:55:41,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:55:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:55:41,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:55:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 81563 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 74543 trivial. 0 not checked. [2018-02-04 02:55:50,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:55:50,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 02:55:50,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:55:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36120 trivial. 0 not checked. [2018-02-04 02:55:50,714 INFO L182 omatonBuilderFactory]: Interpolants [31040#(<= main_~i~2 4), 31041#(<= main_~i~2 5), 31042#(<= main_~i~2 6), 31043#(<= main_~i~2 7), 31044#(<= main_~i~2 8), 31045#(<= main_~i~2 9), 31046#(<= main_~i~2 10), 31047#(<= main_~i~2 11), 31048#(<= main_~i~2 12), 31049#(<= main_~i~2 13), 31050#(<= main_~i~2 14), 31051#(<= main_~i~2 15), 31052#(<= main_~i~2 16), 31053#(<= main_~i~2 17), 31054#(<= main_~i~2 18), 31055#(<= main_~i~2 19), 31056#(<= main_~i~2 20), 31057#(<= main_~i~2 21), 31058#(<= main_~i~2 22), 31059#(<= main_~i~2 23), 31060#(<= main_~i~2 24), 31061#(<= main_~i~2 25), 31062#(<= main_~i~2 26), 31063#(<= main_~i~2 27), 31064#(<= main_~i~2 28), 31065#(<= main_~i~2 29), 31066#(<= main_~i~2 30), 31067#(<= main_~i~2 31), 31068#(<= main_~i~2 32), 31069#(<= main_~i~2 33), 31070#(<= main_~i~2 34), 31071#(<= main_~i~2 35), 31072#(<= main_~i~2 36), 31073#(<= main_~i~2 37), 31074#(<= main_~i~2 38), 31075#(<= main_~i~2 39), 31076#(<= main_~i~2 40), 31077#(<= main_~i~2 41), 31078#(<= main_~i~2 42), 31079#(<= main_~i~2 43), 31080#(<= main_~i~2 44), 31081#(<= main_~i~2 45), 31034#true, 31035#false, 31036#(= main_~i~2 0), 31037#(<= main_~i~2 1), 31038#(<= main_~i~2 2), 31039#(<= main_~i~2 3)] [2018-02-04 02:55:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 81563 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 74543 trivial. 0 not checked. [2018-02-04 02:55:50,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 02:55:50,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 02:55:50,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 02:55:50,716 INFO L87 Difference]: Start difference. First operand 430 states and 477 transitions. Second operand 48 states. [2018-02-04 02:55:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:55:51,151 INFO L93 Difference]: Finished difference Result 442 states and 491 transitions. [2018-02-04 02:55:51,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 02:55:51,151 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 2096 [2018-02-04 02:55:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:55:51,153 INFO L225 Difference]: With dead ends: 442 [2018-02-04 02:55:51,153 INFO L226 Difference]: Without dead ends: 442 [2018-02-04 02:55:51,154 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-04 02:55:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-04 02:55:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 437. [2018-02-04 02:55:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-02-04 02:55:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 485 transitions. [2018-02-04 02:55:51,158 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 485 transitions. Word has length 2096 [2018-02-04 02:55:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:55:51,158 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 485 transitions. [2018-02-04 02:55:51,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 02:55:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 485 transitions. [2018-02-04 02:55:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2144 [2018-02-04 02:55:51,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:55:51,176 INFO L351 BasicCegarLoop]: trace histogram [135, 135, 89, 89, 89, 89, 89, 89, 89, 89, 89, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:55:51,176 INFO L371 AbstractCegarLoop]: === Iteration 67 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:55:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash 388364979, now seen corresponding path program 44 times [2018-02-04 02:55:51,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:55:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:55:51,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 85329 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 77992 trivial. 0 not checked. [2018-02-04 02:56:00,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:00,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 02:56:00,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 37840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37840 trivial. 0 not checked. [2018-02-04 02:56:00,588 INFO L182 omatonBuilderFactory]: Interpolants [32000#(<= main_~i~2 37), 32001#(<= main_~i~2 38), 32002#(<= main_~i~2 39), 32003#(<= main_~i~2 40), 32004#(<= main_~i~2 41), 32005#(<= main_~i~2 42), 32006#(<= main_~i~2 43), 32007#(<= main_~i~2 44), 32008#(<= main_~i~2 45), 32009#(<= main_~i~2 46), 31961#true, 31962#false, 31963#(= main_~i~2 0), 31964#(<= main_~i~2 1), 31965#(<= main_~i~2 2), 31966#(<= main_~i~2 3), 31967#(<= main_~i~2 4), 31968#(<= main_~i~2 5), 31969#(<= main_~i~2 6), 31970#(<= main_~i~2 7), 31971#(<= main_~i~2 8), 31972#(<= main_~i~2 9), 31973#(<= main_~i~2 10), 31974#(<= main_~i~2 11), 31975#(<= main_~i~2 12), 31976#(<= main_~i~2 13), 31977#(<= main_~i~2 14), 31978#(<= main_~i~2 15), 31979#(<= main_~i~2 16), 31980#(<= main_~i~2 17), 31981#(<= main_~i~2 18), 31982#(<= main_~i~2 19), 31983#(<= main_~i~2 20), 31984#(<= main_~i~2 21), 31985#(<= main_~i~2 22), 31986#(<= main_~i~2 23), 31987#(<= main_~i~2 24), 31988#(<= main_~i~2 25), 31989#(<= main_~i~2 26), 31990#(<= main_~i~2 27), 31991#(<= main_~i~2 28), 31992#(<= main_~i~2 29), 31993#(<= main_~i~2 30), 31994#(<= main_~i~2 31), 31995#(<= main_~i~2 32), 31996#(<= main_~i~2 33), 31997#(<= main_~i~2 34), 31998#(<= main_~i~2 35), 31999#(<= main_~i~2 36)] [2018-02-04 02:56:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 85329 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 77992 trivial. 0 not checked. [2018-02-04 02:56:00,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 02:56:00,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 02:56:00,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 02:56:00,589 INFO L87 Difference]: Start difference. First operand 437 states and 485 transitions. Second operand 49 states. [2018-02-04 02:56:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:00,932 INFO L93 Difference]: Finished difference Result 449 states and 499 transitions. [2018-02-04 02:56:00,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 02:56:00,932 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2143 [2018-02-04 02:56:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:00,934 INFO L225 Difference]: With dead ends: 449 [2018-02-04 02:56:00,934 INFO L226 Difference]: Without dead ends: 449 [2018-02-04 02:56:00,934 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-04 02:56:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-04 02:56:00,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 444. [2018-02-04 02:56:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-02-04 02:56:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 493 transitions. [2018-02-04 02:56:00,939 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 493 transitions. Word has length 2143 [2018-02-04 02:56:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:00,939 INFO L432 AbstractCegarLoop]: Abstraction has 444 states and 493 transitions. [2018-02-04 02:56:00,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 02:56:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 493 transitions. [2018-02-04 02:56:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2191 [2018-02-04 02:56:00,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:00,958 INFO L351 BasicCegarLoop]: trace histogram [138, 138, 91, 91, 91, 91, 91, 91, 91, 91, 91, 48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:00,958 INFO L371 AbstractCegarLoop]: === Iteration 68 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:56:00,958 INFO L82 PathProgramCache]: Analyzing trace with hash 296716877, now seen corresponding path program 45 times [2018-02-04 02:56:00,959 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:01,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 89180 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 81519 trivial. 0 not checked. [2018-02-04 02:56:11,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:11,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 02:56:11,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 39600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39600 trivial. 0 not checked. [2018-02-04 02:56:11,078 INFO L182 omatonBuilderFactory]: Interpolants [32903#true, 32904#false, 32905#(= main_~i~2 0), 32906#(<= main_~i~2 1), 32907#(<= main_~i~2 2), 32908#(<= main_~i~2 3), 32909#(<= main_~i~2 4), 32910#(<= main_~i~2 5), 32911#(<= main_~i~2 6), 32912#(<= main_~i~2 7), 32913#(<= main_~i~2 8), 32914#(<= main_~i~2 9), 32915#(<= main_~i~2 10), 32916#(<= main_~i~2 11), 32917#(<= main_~i~2 12), 32918#(<= main_~i~2 13), 32919#(<= main_~i~2 14), 32920#(<= main_~i~2 15), 32921#(<= main_~i~2 16), 32922#(<= main_~i~2 17), 32923#(<= main_~i~2 18), 32924#(<= main_~i~2 19), 32925#(<= main_~i~2 20), 32926#(<= main_~i~2 21), 32927#(<= main_~i~2 22), 32928#(<= main_~i~2 23), 32929#(<= main_~i~2 24), 32930#(<= main_~i~2 25), 32931#(<= main_~i~2 26), 32932#(<= main_~i~2 27), 32933#(<= main_~i~2 28), 32934#(<= main_~i~2 29), 32935#(<= main_~i~2 30), 32936#(<= main_~i~2 31), 32937#(<= main_~i~2 32), 32938#(<= main_~i~2 33), 32939#(<= main_~i~2 34), 32940#(<= main_~i~2 35), 32941#(<= main_~i~2 36), 32942#(<= main_~i~2 37), 32943#(<= main_~i~2 38), 32944#(<= main_~i~2 39), 32945#(<= main_~i~2 40), 32946#(<= main_~i~2 41), 32947#(<= main_~i~2 42), 32948#(<= main_~i~2 43), 32949#(<= main_~i~2 44), 32950#(<= main_~i~2 45), 32951#(<= main_~i~2 46), 32952#(<= main_~i~2 47)] [2018-02-04 02:56:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 89180 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 81519 trivial. 0 not checked. [2018-02-04 02:56:11,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 02:56:11,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 02:56:11,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 02:56:11,080 INFO L87 Difference]: Start difference. First operand 444 states and 493 transitions. Second operand 50 states. [2018-02-04 02:56:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:11,544 INFO L93 Difference]: Finished difference Result 456 states and 507 transitions. [2018-02-04 02:56:11,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 02:56:11,544 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2190 [2018-02-04 02:56:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:11,546 INFO L225 Difference]: With dead ends: 456 [2018-02-04 02:56:11,546 INFO L226 Difference]: Without dead ends: 456 [2018-02-04 02:56:11,547 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-04 02:56:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-02-04 02:56:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 451. [2018-02-04 02:56:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-02-04 02:56:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 501 transitions. [2018-02-04 02:56:11,551 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 501 transitions. Word has length 2190 [2018-02-04 02:56:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:11,552 INFO L432 AbstractCegarLoop]: Abstraction has 451 states and 501 transitions. [2018-02-04 02:56:11,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 02:56:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 501 transitions. [2018-02-04 02:56:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2238 [2018-02-04 02:56:11,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:11,570 INFO L351 BasicCegarLoop]: trace histogram [141, 141, 93, 93, 93, 93, 93, 93, 93, 93, 93, 49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:11,570 INFO L371 AbstractCegarLoop]: === Iteration 69 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:56:11,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1817672563, now seen corresponding path program 46 times [2018-02-04 02:56:11,571 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:11,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 93116 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 85124 trivial. 0 not checked. [2018-02-04 02:56:22,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:22,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 02:56:22,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 41400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41400 trivial. 0 not checked. [2018-02-04 02:56:22,234 INFO L182 omatonBuilderFactory]: Interpolants [33860#true, 33861#false, 33862#(= main_~i~2 0), 33863#(<= main_~i~2 1), 33864#(<= main_~i~2 2), 33865#(<= main_~i~2 3), 33866#(<= main_~i~2 4), 33867#(<= main_~i~2 5), 33868#(<= main_~i~2 6), 33869#(<= main_~i~2 7), 33870#(<= main_~i~2 8), 33871#(<= main_~i~2 9), 33872#(<= main_~i~2 10), 33873#(<= main_~i~2 11), 33874#(<= main_~i~2 12), 33875#(<= main_~i~2 13), 33876#(<= main_~i~2 14), 33877#(<= main_~i~2 15), 33878#(<= main_~i~2 16), 33879#(<= main_~i~2 17), 33880#(<= main_~i~2 18), 33881#(<= main_~i~2 19), 33882#(<= main_~i~2 20), 33883#(<= main_~i~2 21), 33884#(<= main_~i~2 22), 33885#(<= main_~i~2 23), 33886#(<= main_~i~2 24), 33887#(<= main_~i~2 25), 33888#(<= main_~i~2 26), 33889#(<= main_~i~2 27), 33890#(<= main_~i~2 28), 33891#(<= main_~i~2 29), 33892#(<= main_~i~2 30), 33893#(<= main_~i~2 31), 33894#(<= main_~i~2 32), 33895#(<= main_~i~2 33), 33896#(<= main_~i~2 34), 33897#(<= main_~i~2 35), 33898#(<= main_~i~2 36), 33899#(<= main_~i~2 37), 33900#(<= main_~i~2 38), 33901#(<= main_~i~2 39), 33902#(<= main_~i~2 40), 33903#(<= main_~i~2 41), 33904#(<= main_~i~2 42), 33905#(<= main_~i~2 43), 33906#(<= main_~i~2 44), 33907#(<= main_~i~2 45), 33908#(<= main_~i~2 46), 33909#(<= main_~i~2 47), 33910#(<= main_~i~2 48)] [2018-02-04 02:56:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 93116 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 85124 trivial. 0 not checked. [2018-02-04 02:56:22,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 02:56:22,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 02:56:22,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 02:56:22,237 INFO L87 Difference]: Start difference. First operand 451 states and 501 transitions. Second operand 51 states. [2018-02-04 02:56:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:22,715 INFO L93 Difference]: Finished difference Result 463 states and 515 transitions. [2018-02-04 02:56:22,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 02:56:22,744 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 2237 [2018-02-04 02:56:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:22,746 INFO L225 Difference]: With dead ends: 463 [2018-02-04 02:56:22,746 INFO L226 Difference]: Without dead ends: 463 [2018-02-04 02:56:22,746 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-04 02:56:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-04 02:56:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 458. [2018-02-04 02:56:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-04 02:56:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 509 transitions. [2018-02-04 02:56:22,750 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 509 transitions. Word has length 2237 [2018-02-04 02:56:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:22,750 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 509 transitions. [2018-02-04 02:56:22,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 02:56:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 509 transitions. [2018-02-04 02:56:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2285 [2018-02-04 02:56:22,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:22,769 INFO L351 BasicCegarLoop]: trace histogram [144, 144, 95, 95, 95, 95, 95, 95, 95, 95, 95, 50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:22,770 INFO L371 AbstractCegarLoop]: === Iteration 70 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:56:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1052282483, now seen corresponding path program 47 times [2018-02-04 02:56:22,770 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:22,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 97137 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 88807 trivial. 0 not checked. [2018-02-04 02:56:34,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:34,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 02:56:34,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 43240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43240 trivial. 0 not checked. [2018-02-04 02:56:34,050 INFO L182 omatonBuilderFactory]: Interpolants [34832#true, 34833#false, 34834#(= main_~i~2 0), 34835#(<= main_~i~2 1), 34836#(<= main_~i~2 2), 34837#(<= main_~i~2 3), 34838#(<= main_~i~2 4), 34839#(<= main_~i~2 5), 34840#(<= main_~i~2 6), 34841#(<= main_~i~2 7), 34842#(<= main_~i~2 8), 34843#(<= main_~i~2 9), 34844#(<= main_~i~2 10), 34845#(<= main_~i~2 11), 34846#(<= main_~i~2 12), 34847#(<= main_~i~2 13), 34848#(<= main_~i~2 14), 34849#(<= main_~i~2 15), 34850#(<= main_~i~2 16), 34851#(<= main_~i~2 17), 34852#(<= main_~i~2 18), 34853#(<= main_~i~2 19), 34854#(<= main_~i~2 20), 34855#(<= main_~i~2 21), 34856#(<= main_~i~2 22), 34857#(<= main_~i~2 23), 34858#(<= main_~i~2 24), 34859#(<= main_~i~2 25), 34860#(<= main_~i~2 26), 34861#(<= main_~i~2 27), 34862#(<= main_~i~2 28), 34863#(<= main_~i~2 29), 34864#(<= main_~i~2 30), 34865#(<= main_~i~2 31), 34866#(<= main_~i~2 32), 34867#(<= main_~i~2 33), 34868#(<= main_~i~2 34), 34869#(<= main_~i~2 35), 34870#(<= main_~i~2 36), 34871#(<= main_~i~2 37), 34872#(<= main_~i~2 38), 34873#(<= main_~i~2 39), 34874#(<= main_~i~2 40), 34875#(<= main_~i~2 41), 34876#(<= main_~i~2 42), 34877#(<= main_~i~2 43), 34878#(<= main_~i~2 44), 34879#(<= main_~i~2 45), 34880#(<= main_~i~2 46), 34881#(<= main_~i~2 47), 34882#(<= main_~i~2 48), 34883#(<= main_~i~2 49)] [2018-02-04 02:56:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 97137 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 88807 trivial. 0 not checked. [2018-02-04 02:56:34,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 02:56:34,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 02:56:34,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 02:56:34,051 INFO L87 Difference]: Start difference. First operand 458 states and 509 transitions. Second operand 52 states. [2018-02-04 02:56:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:34,583 INFO L93 Difference]: Finished difference Result 470 states and 523 transitions. [2018-02-04 02:56:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 02:56:34,584 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2284 [2018-02-04 02:56:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:34,586 INFO L225 Difference]: With dead ends: 470 [2018-02-04 02:56:34,586 INFO L226 Difference]: Without dead ends: 470 [2018-02-04 02:56:34,586 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-04 02:56:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-04 02:56:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 465. [2018-02-04 02:56:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-02-04 02:56:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 517 transitions. [2018-02-04 02:56:34,590 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 517 transitions. Word has length 2284 [2018-02-04 02:56:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:34,591 INFO L432 AbstractCegarLoop]: Abstraction has 465 states and 517 transitions. [2018-02-04 02:56:34,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 02:56:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 517 transitions. [2018-02-04 02:56:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2332 [2018-02-04 02:56:34,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:34,617 INFO L351 BasicCegarLoop]: trace histogram [147, 147, 97, 97, 97, 97, 97, 97, 97, 97, 97, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:34,617 INFO L371 AbstractCegarLoop]: === Iteration 71 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 02:56:34,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1567019981, now seen corresponding path program 48 times [2018-02-04 02:56:34,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:34,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 02:56:42,465 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 02:56:42,468 INFO L168 Benchmark]: Toolchain (without parser) took 182250.79 ms. Allocated memory was 404.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 362.2 MB in the beginning and 325.3 MB in the end (delta: 36.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. [2018-02-04 02:56:42,468 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:56:42,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.83 ms. Allocated memory is still 404.2 MB. Free memory was 362.2 MB in the beginning and 354.2 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 02:56:42,469 INFO L168 Benchmark]: Boogie Preprocessor took 24.85 ms. Allocated memory is still 404.2 MB. Free memory was 354.2 MB in the beginning and 351.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:56:42,469 INFO L168 Benchmark]: RCFGBuilder took 225.55 ms. Allocated memory is still 404.2 MB. Free memory was 351.6 MB in the beginning and 330.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 5.3 GB. [2018-02-04 02:56:42,469 INFO L168 Benchmark]: TraceAbstraction took 181855.65 ms. Allocated memory was 404.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 330.1 MB in the beginning and 325.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. [2018-02-04 02:56:42,470 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 141.83 ms. Allocated memory is still 404.2 MB. Free memory was 362.2 MB in the beginning and 354.2 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.85 ms. Allocated memory is still 404.2 MB. Free memory was 354.2 MB in the beginning and 351.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 225.55 ms. Allocated memory is still 404.2 MB. Free memory was 351.6 MB in the beginning and 330.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 181855.65 ms. Allocated memory was 404.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 330.1 MB in the beginning and 325.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-56-42-476.csv Completed graceful shutdown