java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.3.ufo.UNBOUNDED.pals.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-112bae1
[2019-09-08 07:28:08,597 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-09-08 07:28:08,599 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-09-08 07:28:08,611 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-09-08 07:28:08,611 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-09-08 07:28:08,612 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-09-08 07:28:08,613 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-09-08 07:28:08,615 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-09-08 07:28:08,617 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-09-08 07:28:08,617 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-09-08 07:28:08,618 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-09-08 07:28:08,619 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-09-08 07:28:08,620 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-09-08 07:28:08,621 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-09-08 07:28:08,622 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-09-08 07:28:08,623 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-09-08 07:28:08,623 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-09-08 07:28:08,624 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-09-08 07:28:08,626 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-09-08 07:28:08,628 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-09-08 07:28:08,629 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-09-08 07:28:08,630 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-09-08 07:28:08,631 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-09-08 07:28:08,632 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-09-08 07:28:08,634 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-09-08 07:28:08,634 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-09-08 07:28:08,635 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-09-08 07:28:08,636 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-09-08 07:28:08,636 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-09-08 07:28:08,637 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-09-08 07:28:08,637 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-09-08 07:28:08,638 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-09-08 07:28:08,638 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-09-08 07:28:08,639 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-09-08 07:28:08,640 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-09-08 07:28:08,640 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-09-08 07:28:08,641 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-09-08 07:28:08,641 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-09-08 07:28:08,642 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-09-08 07:28:08,642 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-09-08 07:28:08,643 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-09-08 07:28:08,644 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2019-09-08 07:28:08,672 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-09-08 07:28:08,673 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-09-08 07:28:08,674 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-09-08 07:28:08,674 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-09-08 07:28:08,675 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-09-08 07:28:08,675 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-09-08 07:28:08,675 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-09-08 07:28:08,675 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-09-08 07:28:08,676 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-09-08 07:28:08,676 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-09-08 07:28:08,676 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-09-08 07:28:08,676 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-09-08 07:28:08,676 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-09-08 07:28:08,677 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-09-08 07:28:08,677 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-09-08 07:28:08,677 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-09-08 07:28:08,677 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-09-08 07:28:08,677 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-09-08 07:28:08,678 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-09-08 07:28:08,678 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-09-08 07:28:08,678 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-09-08 07:28:08,678 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-09-08 07:28:08,678 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-09-08 07:28:08,679 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-09-08 07:28:08,679 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-09-08 07:28:08,679 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-09-08 07:28:08,679 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-09-08 07:28:08,679 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-09-08 07:28:08,679 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-09-08 07:28:08,714 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-09-08 07:28:08,729 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-09-08 07:28:08,734 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-09-08 07:28:08,735 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-09-08 07:28:08,736 INFO  L275        PluginConnector]: CDTParser initialized
[2019-09-08 07:28:08,736 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.3.ufo.UNBOUNDED.pals.c
[2019-09-08 07:28:08,807 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f533478/06b85f4a2a394bd8a27c8eff920b2511/FLAG6b0017dda
[2019-09-08 07:28:09,370 INFO  L306              CDTParser]: Found 1 translation units.
[2019-09-08 07:28:09,371 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.3.ufo.UNBOUNDED.pals.c
[2019-09-08 07:28:09,401 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f533478/06b85f4a2a394bd8a27c8eff920b2511/FLAG6b0017dda
[2019-09-08 07:28:09,628 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f533478/06b85f4a2a394bd8a27c8eff920b2511
[2019-09-08 07:28:09,639 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-09-08 07:28:09,640 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-09-08 07:28:09,641 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-09-08 07:28:09,641 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-09-08 07:28:09,644 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-09-08 07:28:09,645 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:28:09" (1/1) ...
[2019-09-08 07:28:09,648 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b77fff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:09, skipping insertion in model container
[2019-09-08 07:28:09,648 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:28:09" (1/1) ...
[2019-09-08 07:28:09,654 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-09-08 07:28:09,736 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-09-08 07:28:10,330 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 07:28:10,353 INFO  L188         MainTranslator]: Completed pre-run
[2019-09-08 07:28:10,535 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 07:28:10,564 INFO  L192         MainTranslator]: Completed translation
[2019-09-08 07:28:10,565 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:10 WrapperNode
[2019-09-08 07:28:10,565 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-09-08 07:28:10,566 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-09-08 07:28:10,566 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-09-08 07:28:10,566 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-09-08 07:28:10,580 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:10" (1/1) ...
[2019-09-08 07:28:10,581 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:10" (1/1) ...
[2019-09-08 07:28:10,613 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:10" (1/1) ...
[2019-09-08 07:28:10,613 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:10" (1/1) ...
[2019-09-08 07:28:10,685 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:10" (1/1) ...
[2019-09-08 07:28:10,726 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:10" (1/1) ...
[2019-09-08 07:28:10,734 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:10" (1/1) ...
[2019-09-08 07:28:10,745 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-09-08 07:28:10,746 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-09-08 07:28:10,746 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-09-08 07:28:10,746 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-09-08 07:28:10,747 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:10" (1/1) ...
No working directory specified, using /storage/repos/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
[2019-09-08 07:28:10,814 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-09-08 07:28:10,815 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-09-08 07:28:10,815 INFO  L138     BoogieDeclarations]: Found implementation of procedure node1
[2019-09-08 07:28:10,815 INFO  L138     BoogieDeclarations]: Found implementation of procedure node2
[2019-09-08 07:28:10,816 INFO  L138     BoogieDeclarations]: Found implementation of procedure node3
[2019-09-08 07:28:10,816 INFO  L138     BoogieDeclarations]: Found implementation of procedure node4
[2019-09-08 07:28:10,816 INFO  L138     BoogieDeclarations]: Found implementation of procedure node5
[2019-09-08 07:28:10,816 INFO  L138     BoogieDeclarations]: Found implementation of procedure init
[2019-09-08 07:28:10,817 INFO  L138     BoogieDeclarations]: Found implementation of procedure check
[2019-09-08 07:28:10,817 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-09-08 07:28:10,818 INFO  L138     BoogieDeclarations]: Found implementation of procedure assert
[2019-09-08 07:28:10,818 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-09-08 07:28:10,818 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2019-09-08 07:28:10,819 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar
[2019-09-08 07:28:10,820 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2019-09-08 07:28:10,820 INFO  L130     BoogieDeclarations]: Found specification of procedure assert
[2019-09-08 07:28:10,822 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-09-08 07:28:10,822 INFO  L130     BoogieDeclarations]: Found specification of procedure read
[2019-09-08 07:28:10,822 INFO  L130     BoogieDeclarations]: Found specification of procedure write
[2019-09-08 07:28:10,822 INFO  L130     BoogieDeclarations]: Found specification of procedure node1
[2019-09-08 07:28:10,822 INFO  L130     BoogieDeclarations]: Found specification of procedure node2
[2019-09-08 07:28:10,823 INFO  L130     BoogieDeclarations]: Found specification of procedure node3
[2019-09-08 07:28:10,823 INFO  L130     BoogieDeclarations]: Found specification of procedure node4
[2019-09-08 07:28:10,823 INFO  L130     BoogieDeclarations]: Found specification of procedure node5
[2019-09-08 07:28:10,823 INFO  L130     BoogieDeclarations]: Found specification of procedure init
[2019-09-08 07:28:10,823 INFO  L130     BoogieDeclarations]: Found specification of procedure check
[2019-09-08 07:28:10,824 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-09-08 07:28:10,824 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-09-08 07:28:10,824 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-09-08 07:28:13,131 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-09-08 07:28:13,132 INFO  L283             CfgBuilder]: Removed 1 assume(true) statements.
[2019-09-08 07:28:13,133 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:28:13 BoogieIcfgContainer
[2019-09-08 07:28:13,133 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-09-08 07:28:13,135 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-09-08 07:28:13,135 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-09-08 07:28:13,138 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-09-08 07:28:13,138 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:28:09" (1/3) ...
[2019-09-08 07:28:13,139 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1baa066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:28:13, skipping insertion in model container
[2019-09-08 07:28:13,139 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:10" (2/3) ...
[2019-09-08 07:28:13,140 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1baa066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:28:13, skipping insertion in model container
[2019-09-08 07:28:13,140 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:28:13" (3/3) ...
[2019-09-08 07:28:13,142 INFO  L109   eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.3.ufo.UNBOUNDED.pals.c
[2019-09-08 07:28:13,151 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-09-08 07:28:13,160 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-09-08 07:28:13,176 INFO  L252      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-09-08 07:28:13,210 INFO  L128   ementStrategyFactory]: Using default assertion order modulation
[2019-09-08 07:28:13,211 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2019-09-08 07:28:13,211 INFO  L378      AbstractCegarLoop]: Hoare is true
[2019-09-08 07:28:13,211 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-09-08 07:28:13,211 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-09-08 07:28:13,211 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-09-08 07:28:13,211 INFO  L382      AbstractCegarLoop]: Difference is false
[2019-09-08 07:28:13,211 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-09-08 07:28:13,212 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-09-08 07:28:13,249 INFO  L276                IsEmpty]: Start isEmpty. Operand 741 states.
[2019-09-08 07:28:13,288 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2019-09-08 07:28:13,288 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:13,289 INFO  L399         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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:13,291 INFO  L418      AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:13,296 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:13,297 INFO  L82        PathProgramCache]: Analyzing trace with hash 1909906807, now seen corresponding path program 1 times
[2019-09-08 07:28:13,298 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:13,299 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:13,352 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:13,352 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:13,352 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:13,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:13,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:28:13,963 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:13,963 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 07:28:13,969 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 07:28:13,983 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 07:28:13,984 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 07:28:13,986 INFO  L87              Difference]: Start difference. First operand 741 states. Second operand 5 states.
[2019-09-08 07:28:14,311 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:14,311 INFO  L93              Difference]: Finished difference Result 929 states and 1653 transitions.
[2019-09-08 07:28:14,312 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 07:28:14,313 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 176
[2019-09-08 07:28:14,314 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:14,338 INFO  L225             Difference]: With dead ends: 929
[2019-09-08 07:28:14,338 INFO  L226             Difference]: Without dead ends: 736
[2019-09-08 07:28:14,343 INFO  L628         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
[2019-09-08 07:28:14,401 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 736 states.
[2019-09-08 07:28:14,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736.
[2019-09-08 07:28:14,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 736 states.
[2019-09-08 07:28:14,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1275 transitions.
[2019-09-08 07:28:14,508 INFO  L78                 Accepts]: Start accepts. Automaton has 736 states and 1275 transitions. Word has length 176
[2019-09-08 07:28:14,509 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:28:14,509 INFO  L475      AbstractCegarLoop]: Abstraction has 736 states and 1275 transitions.
[2019-09-08 07:28:14,509 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 07:28:14,509 INFO  L276                IsEmpty]: Start isEmpty. Operand 736 states and 1275 transitions.
[2019-09-08 07:28:14,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 236
[2019-09-08 07:28:14,515 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:14,515 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:14,516 INFO  L418      AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:14,516 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:14,516 INFO  L82        PathProgramCache]: Analyzing trace with hash -268525100, now seen corresponding path program 1 times
[2019-09-08 07:28:14,516 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:14,516 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:14,518 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:14,518 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:14,519 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:14,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:15,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:28:15,142 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:15,142 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-09-08 07:28:15,146 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-09-08 07:28:15,146 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-09-08 07:28:15,147 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2019-09-08 07:28:15,147 INFO  L87              Difference]: Start difference. First operand 736 states and 1275 transitions. Second operand 13 states.
[2019-09-08 07:28:27,755 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:27,756 INFO  L93              Difference]: Finished difference Result 3006 states and 5054 transitions.
[2019-09-08 07:28:27,756 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2019-09-08 07:28:27,756 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 235
[2019-09-08 07:28:27,758 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:27,781 INFO  L225             Difference]: With dead ends: 3006
[2019-09-08 07:28:27,782 INFO  L226             Difference]: Without dead ends: 2822
[2019-09-08 07:28:27,790 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=631, Invalid=2125, Unknown=0, NotChecked=0, Total=2756
[2019-09-08 07:28:27,794 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2822 states.
[2019-09-08 07:28:27,899 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2030.
[2019-09-08 07:28:27,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2030 states.
[2019-09-08 07:28:27,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 3422 transitions.
[2019-09-08 07:28:27,911 INFO  L78                 Accepts]: Start accepts. Automaton has 2030 states and 3422 transitions. Word has length 235
[2019-09-08 07:28:27,911 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:28:27,912 INFO  L475      AbstractCegarLoop]: Abstraction has 2030 states and 3422 transitions.
[2019-09-08 07:28:27,912 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-09-08 07:28:27,912 INFO  L276                IsEmpty]: Start isEmpty. Operand 2030 states and 3422 transitions.
[2019-09-08 07:28:27,918 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 237
[2019-09-08 07:28:27,919 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:27,919 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:27,919 INFO  L418      AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:27,920 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:27,920 INFO  L82        PathProgramCache]: Analyzing trace with hash -699503355, now seen corresponding path program 1 times
[2019-09-08 07:28:27,920 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:27,920 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:27,922 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:27,922 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:27,922 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:28,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:28,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:28:28,212 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:28,213 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:28:28,214 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:28:28,215 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:28:28,222 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:28:28,223 INFO  L87              Difference]: Start difference. First operand 2030 states and 3422 transitions. Second operand 6 states.
[2019-09-08 07:28:31,823 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:31,823 INFO  L93              Difference]: Finished difference Result 5014 states and 8363 transitions.
[2019-09-08 07:28:31,824 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2019-09-08 07:28:31,824 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 236
[2019-09-08 07:28:31,825 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:31,853 INFO  L225             Difference]: With dead ends: 5014
[2019-09-08 07:28:31,854 INFO  L226             Difference]: Without dead ends: 3536
[2019-09-08 07:28:31,860 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2019-09-08 07:28:31,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3536 states.
[2019-09-08 07:28:32,001 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3345.
[2019-09-08 07:28:32,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3345 states.
[2019-09-08 07:28:32,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 5590 transitions.
[2019-09-08 07:28:32,016 INFO  L78                 Accepts]: Start accepts. Automaton has 3345 states and 5590 transitions. Word has length 236
[2019-09-08 07:28:32,016 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:28:32,016 INFO  L475      AbstractCegarLoop]: Abstraction has 3345 states and 5590 transitions.
[2019-09-08 07:28:32,017 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:28:32,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 3345 states and 5590 transitions.
[2019-09-08 07:28:32,023 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 238
[2019-09-08 07:28:32,023 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:32,023 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:32,024 INFO  L418      AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:32,024 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:32,024 INFO  L82        PathProgramCache]: Analyzing trace with hash -1226612309, now seen corresponding path program 1 times
[2019-09-08 07:28:32,024 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:32,024 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:32,026 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:32,026 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:32,026 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:32,165 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:32,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:28:32,355 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:32,355 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:28:32,355 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:28:32,356 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:28:32,356 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:28:32,356 INFO  L87              Difference]: Start difference. First operand 3345 states and 5590 transitions. Second operand 6 states.
[2019-09-08 07:28:36,467 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:36,467 INFO  L93              Difference]: Finished difference Result 9374 states and 15534 transitions.
[2019-09-08 07:28:36,469 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2019-09-08 07:28:36,469 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 237
[2019-09-08 07:28:36,470 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:36,501 INFO  L225             Difference]: With dead ends: 9374
[2019-09-08 07:28:36,502 INFO  L226             Difference]: Without dead ends: 6581
[2019-09-08 07:28:36,509 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2019-09-08 07:28:36,517 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6581 states.
[2019-09-08 07:28:36,711 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 5617.
[2019-09-08 07:28:36,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5617 states.
[2019-09-08 07:28:36,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5617 states to 5617 states and 9313 transitions.
[2019-09-08 07:28:36,738 INFO  L78                 Accepts]: Start accepts. Automaton has 5617 states and 9313 transitions. Word has length 237
[2019-09-08 07:28:36,739 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:28:36,739 INFO  L475      AbstractCegarLoop]: Abstraction has 5617 states and 9313 transitions.
[2019-09-08 07:28:36,739 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:28:36,739 INFO  L276                IsEmpty]: Start isEmpty. Operand 5617 states and 9313 transitions.
[2019-09-08 07:28:36,747 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 239
[2019-09-08 07:28:36,747 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:36,747 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:36,748 INFO  L418      AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:36,748 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:36,748 INFO  L82        PathProgramCache]: Analyzing trace with hash -438805636, now seen corresponding path program 1 times
[2019-09-08 07:28:36,748 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:36,748 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:36,750 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:36,750 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:36,750 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:36,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:37,069 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:28:37,070 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:37,070 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:28:37,071 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:28:37,071 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:28:37,072 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:28:37,073 INFO  L87              Difference]: Start difference. First operand 5617 states and 9313 transitions. Second operand 6 states.
[2019-09-08 07:28:40,677 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:40,677 INFO  L93              Difference]: Finished difference Result 21935 states and 36146 transitions.
[2019-09-08 07:28:40,678 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 07:28:40,678 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 238
[2019-09-08 07:28:40,679 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:40,786 INFO  L225             Difference]: With dead ends: 21935
[2019-09-08 07:28:40,787 INFO  L226             Difference]: Without dead ends: 16870
[2019-09-08 07:28:40,810 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2019-09-08 07:28:40,829 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16870 states.
[2019-09-08 07:28:41,305 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16870 to 13926.
[2019-09-08 07:28:41,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13926 states.
[2019-09-08 07:28:41,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13926 states to 13926 states and 22887 transitions.
[2019-09-08 07:28:41,338 INFO  L78                 Accepts]: Start accepts. Automaton has 13926 states and 22887 transitions. Word has length 238
[2019-09-08 07:28:41,339 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:28:41,339 INFO  L475      AbstractCegarLoop]: Abstraction has 13926 states and 22887 transitions.
[2019-09-08 07:28:41,339 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:28:41,339 INFO  L276                IsEmpty]: Start isEmpty. Operand 13926 states and 22887 transitions.
[2019-09-08 07:28:41,349 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 240
[2019-09-08 07:28:41,349 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:41,349 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:41,350 INFO  L418      AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:41,350 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:41,350 INFO  L82        PathProgramCache]: Analyzing trace with hash -1838287486, now seen corresponding path program 1 times
[2019-09-08 07:28:41,350 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:41,350 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:41,352 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:41,352 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:41,352 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:41,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:41,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:28:41,583 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:41,583 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:28:41,584 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:28:41,584 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:28:41,584 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:28:41,585 INFO  L87              Difference]: Start difference. First operand 13926 states and 22887 transitions. Second operand 6 states.
[2019-09-08 07:28:46,660 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:46,661 INFO  L93              Difference]: Finished difference Result 80238 states and 131647 transitions.
[2019-09-08 07:28:46,661 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 07:28:46,661 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 239
[2019-09-08 07:28:46,662 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:46,926 INFO  L225             Difference]: With dead ends: 80238
[2019-09-08 07:28:46,926 INFO  L226             Difference]: Without dead ends: 66864
[2019-09-08 07:28:46,989 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2019-09-08 07:28:47,066 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66864 states.
[2019-09-08 07:28:49,731 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66864 to 66712.
[2019-09-08 07:28:49,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 66712 states.
[2019-09-08 07:28:51,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 66712 states to 66712 states and 109154 transitions.
[2019-09-08 07:28:51,239 INFO  L78                 Accepts]: Start accepts. Automaton has 66712 states and 109154 transitions. Word has length 239
[2019-09-08 07:28:51,239 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:28:51,240 INFO  L475      AbstractCegarLoop]: Abstraction has 66712 states and 109154 transitions.
[2019-09-08 07:28:51,240 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:28:51,240 INFO  L276                IsEmpty]: Start isEmpty. Operand 66712 states and 109154 transitions.
[2019-09-08 07:28:51,250 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 241
[2019-09-08 07:28:51,251 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:28:51,251 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:28:51,251 INFO  L418      AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:28:51,251 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:28:51,252 INFO  L82        PathProgramCache]: Analyzing trace with hash 1970730483, now seen corresponding path program 1 times
[2019-09-08 07:28:51,252 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:28:51,252 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:28:51,253 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:51,253 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:28:51,253 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:28:51,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:28:51,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:28:51,491 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:28:51,491 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 07:28:51,492 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 07:28:51,492 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 07:28:51,492 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-09-08 07:28:51,493 INFO  L87              Difference]: Start difference. First operand 66712 states and 109154 transitions. Second operand 6 states.
[2019-09-08 07:28:58,363 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:28:58,363 INFO  L93              Difference]: Finished difference Result 302620 states and 494792 transitions.
[2019-09-08 07:28:58,364 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2019-09-08 07:28:58,364 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 240
[2019-09-08 07:28:58,364 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:28:59,065 INFO  L225             Difference]: With dead ends: 302620
[2019-09-08 07:28:59,066 INFO  L226             Difference]: Without dead ends: 236460
[2019-09-08 07:28:59,255 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2019-09-08 07:28:59,458 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 236460 states.
[2019-09-08 07:29:05,804 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 236460 to 169720.
[2019-09-08 07:29:05,805 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 169720 states.
[2019-09-08 07:29:06,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 169720 states to 169720 states and 276953 transitions.
[2019-09-08 07:29:06,111 INFO  L78                 Accepts]: Start accepts. Automaton has 169720 states and 276953 transitions. Word has length 240
[2019-09-08 07:29:06,111 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:29:06,111 INFO  L475      AbstractCegarLoop]: Abstraction has 169720 states and 276953 transitions.
[2019-09-08 07:29:06,111 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 07:29:06,112 INFO  L276                IsEmpty]: Start isEmpty. Operand 169720 states and 276953 transitions.
[2019-09-08 07:29:06,124 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2019-09-08 07:29:06,125 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:29:06,125 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:29:06,125 INFO  L418      AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:29:06,125 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:29:06,126 INFO  L82        PathProgramCache]: Analyzing trace with hash -346690232, now seen corresponding path program 1 times
[2019-09-08 07:29:06,126 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:29:06,126 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:29:06,127 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:29:06,127 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:29:06,127 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:29:06,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:29:06,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:29:06,478 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:29:06,478 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-09-08 07:29:06,479 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-09-08 07:29:06,479 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-09-08 07:29:06,479 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2019-09-08 07:29:06,480 INFO  L87              Difference]: Start difference. First operand 169720 states and 276953 transitions. Second operand 13 states.
[2019-09-08 07:29:08,690 WARN  L188               SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 27 DAG size of output: 22
[2019-09-08 07:29:26,492 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:29:26,492 INFO  L93              Difference]: Finished difference Result 290738 states and 475117 transitions.
[2019-09-08 07:29:26,492 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. 
[2019-09-08 07:29:26,492 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 242
[2019-09-08 07:29:26,493 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:29:26,985 INFO  L225             Difference]: With dead ends: 290738
[2019-09-08 07:29:26,986 INFO  L226             Difference]: Without dead ends: 256896
[2019-09-08 07:29:27,048 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256
[2019-09-08 07:29:27,217 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 256896 states.
[2019-09-08 07:29:32,732 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 256896 to 233854.
[2019-09-08 07:29:32,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 233854 states.
[2019-09-08 07:29:33,137 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 233854 states to 233854 states and 382326 transitions.
[2019-09-08 07:29:33,141 INFO  L78                 Accepts]: Start accepts. Automaton has 233854 states and 382326 transitions. Word has length 242
[2019-09-08 07:29:33,141 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:29:33,142 INFO  L475      AbstractCegarLoop]: Abstraction has 233854 states and 382326 transitions.
[2019-09-08 07:29:33,142 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-09-08 07:29:33,142 INFO  L276                IsEmpty]: Start isEmpty. Operand 233854 states and 382326 transitions.
[2019-09-08 07:29:33,152 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2019-09-08 07:29:33,152 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:29:33,153 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:29:33,153 INFO  L418      AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:29:33,153 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:29:33,153 INFO  L82        PathProgramCache]: Analyzing trace with hash -1376652368, now seen corresponding path program 1 times
[2019-09-08 07:29:33,154 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:29:33,154 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:29:33,155 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:29:33,155 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:29:33,155 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:29:33,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:29:33,488 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:29:33,488 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:29:33,489 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-09-08 07:29:33,489 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-09-08 07:29:33,489 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-09-08 07:29:33,490 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2019-09-08 07:29:33,490 INFO  L87              Difference]: Start difference. First operand 233854 states and 382326 transitions. Second operand 13 states.
[2019-09-08 07:29:55,351 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:29:55,352 INFO  L93              Difference]: Finished difference Result 374165 states and 613906 transitions.
[2019-09-08 07:29:55,352 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. 
[2019-09-08 07:29:55,352 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 242
[2019-09-08 07:29:55,353 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:29:55,992 INFO  L225             Difference]: With dead ends: 374165
[2019-09-08 07:29:55,992 INFO  L226             Difference]: Without dead ends: 307446
[2019-09-08 07:29:56,086 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256
[2019-09-08 07:29:56,292 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 307446 states.
[2019-09-08 07:30:02,681 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 307446 to 265306.
[2019-09-08 07:30:02,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 265306 states.
[2019-09-08 07:30:03,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265306 states to 265306 states and 434221 transitions.
[2019-09-08 07:30:03,224 INFO  L78                 Accepts]: Start accepts. Automaton has 265306 states and 434221 transitions. Word has length 242
[2019-09-08 07:30:03,224 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:30:03,225 INFO  L475      AbstractCegarLoop]: Abstraction has 265306 states and 434221 transitions.
[2019-09-08 07:30:03,225 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-09-08 07:30:03,225 INFO  L276                IsEmpty]: Start isEmpty. Operand 265306 states and 434221 transitions.
[2019-09-08 07:30:03,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2019-09-08 07:30:03,235 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:30:03,236 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:30:03,236 INFO  L418      AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:30:03,236 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:30:03,236 INFO  L82        PathProgramCache]: Analyzing trace with hash -694496930, now seen corresponding path program 1 times
[2019-09-08 07:30:03,237 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:30:03,237 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:30:03,241 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:30:03,241 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:30:03,241 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:30:03,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:30:03,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:30:03,544 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:30:03,544 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-09-08 07:30:03,546 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-09-08 07:30:03,546 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-09-08 07:30:03,546 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2019-09-08 07:30:03,547 INFO  L87              Difference]: Start difference. First operand 265306 states and 434221 transitions. Second operand 13 states.
[2019-09-08 07:30:29,922 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:30:29,923 INFO  L93              Difference]: Finished difference Result 427123 states and 700435 transitions.
[2019-09-08 07:30:29,926 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. 
[2019-09-08 07:30:29,926 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 242
[2019-09-08 07:30:29,927 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:30:31,098 INFO  L225             Difference]: With dead ends: 427123
[2019-09-08 07:30:31,098 INFO  L226             Difference]: Without dead ends: 332291
[2019-09-08 07:30:31,184 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1095, Invalid=4757, Unknown=0, NotChecked=0, Total=5852
[2019-09-08 07:30:31,360 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 332291 states.
[2019-09-08 07:30:45,079 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 332291 to 287769.
[2019-09-08 07:30:45,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 287769 states.
[2019-09-08 07:30:45,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 287769 states to 287769 states and 471387 transitions.
[2019-09-08 07:30:45,615 INFO  L78                 Accepts]: Start accepts. Automaton has 287769 states and 471387 transitions. Word has length 242
[2019-09-08 07:30:45,615 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:30:45,616 INFO  L475      AbstractCegarLoop]: Abstraction has 287769 states and 471387 transitions.
[2019-09-08 07:30:45,616 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-09-08 07:30:45,616 INFO  L276                IsEmpty]: Start isEmpty. Operand 287769 states and 471387 transitions.
[2019-09-08 07:30:45,624 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2019-09-08 07:30:45,624 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:30:45,624 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:30:45,625 INFO  L418      AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:30:45,625 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:30:45,625 INFO  L82        PathProgramCache]: Analyzing trace with hash 2014276523, now seen corresponding path program 1 times
[2019-09-08 07:30:45,625 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:30:45,625 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:30:45,626 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:30:45,627 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:30:45,627 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:30:45,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:30:45,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:30:45,774 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:30:45,775 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-08 07:30:45,775 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-08 07:30:45,775 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-08 07:30:45,775 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 07:30:45,776 INFO  L87              Difference]: Start difference. First operand 287769 states and 471387 transitions. Second operand 4 states.
[2019-09-08 07:31:04,205 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:31:04,205 INFO  L93              Difference]: Finished difference Result 1045546 states and 1722304 transitions.
[2019-09-08 07:31:04,205 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-08 07:31:04,205 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 242
[2019-09-08 07:31:04,206 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:31:06,165 INFO  L225             Difference]: With dead ends: 1045546
[2019-09-08 07:31:06,165 INFO  L226             Difference]: Without dead ends: 758329
[2019-09-08 07:31:07,148 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-09-08 07:31:07,573 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 758329 states.
[2019-09-08 07:31:42,158 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 758329 to 754041.
[2019-09-08 07:31:42,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 754041 states.
[2019-09-08 07:31:45,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 754041 states to 754041 states and 1230443 transitions.
[2019-09-08 07:31:45,353 INFO  L78                 Accepts]: Start accepts. Automaton has 754041 states and 1230443 transitions. Word has length 242
[2019-09-08 07:31:45,353 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:31:45,353 INFO  L475      AbstractCegarLoop]: Abstraction has 754041 states and 1230443 transitions.
[2019-09-08 07:31:45,354 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-08 07:31:45,354 INFO  L276                IsEmpty]: Start isEmpty. Operand 754041 states and 1230443 transitions.
[2019-09-08 07:31:45,360 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 244
[2019-09-08 07:31:45,361 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:31:45,361 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:31:45,361 INFO  L418      AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:31:45,361 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:31:45,362 INFO  L82        PathProgramCache]: Analyzing trace with hash -1607107123, now seen corresponding path program 1 times
[2019-09-08 07:31:45,362 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:31:45,362 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:31:45,363 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:31:45,363 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:31:45,363 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:31:45,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:31:45,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:31:45,592 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:31:45,592 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2019-09-08 07:31:45,593 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-09-08 07:31:45,593 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-09-08 07:31:45,593 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-09-08 07:31:45,594 INFO  L87              Difference]: Start difference. First operand 754041 states and 1230443 transitions. Second operand 7 states.
[2019-09-08 07:32:20,114 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 07:32:20,114 INFO  L93              Difference]: Finished difference Result 1553605 states and 2542071 transitions.
[2019-09-08 07:32:20,115 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 07:32:20,115 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 243
[2019-09-08 07:32:20,116 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 07:32:22,863 INFO  L225             Difference]: With dead ends: 1553605
[2019-09-08 07:32:22,863 INFO  L226             Difference]: Without dead ends: 1031643
[2019-09-08 07:32:35,013 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2019-09-08 07:32:35,658 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1031643 states.
[2019-09-08 07:33:28,247 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031643 to 1031083.
[2019-09-08 07:33:28,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1031083 states.
[2019-09-08 07:33:44,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1031083 states to 1031083 states and 1686167 transitions.
[2019-09-08 07:33:44,990 INFO  L78                 Accepts]: Start accepts. Automaton has 1031083 states and 1686167 transitions. Word has length 243
[2019-09-08 07:33:44,991 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 07:33:44,991 INFO  L475      AbstractCegarLoop]: Abstraction has 1031083 states and 1686167 transitions.
[2019-09-08 07:33:44,991 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-09-08 07:33:44,992 INFO  L276                IsEmpty]: Start isEmpty. Operand 1031083 states and 1686167 transitions.
[2019-09-08 07:33:45,000 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 244
[2019-09-08 07:33:45,000 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 07:33:45,001 INFO  L399         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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-08 07:33:45,001 INFO  L418      AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 07:33:45,001 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 07:33:45,001 INFO  L82        PathProgramCache]: Analyzing trace with hash -1183460401, now seen corresponding path program 1 times
[2019-09-08 07:33:45,002 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 07:33:45,002 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 07:33:45,003 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:33:45,003 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 07:33:45,003 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 07:33:45,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 07:33:45,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-08 07:33:45,334 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 07:33:45,338 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2019-09-08 07:33:45,338 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 14 states
[2019-09-08 07:33:45,339 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2019-09-08 07:33:45,339 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182
[2019-09-08 07:33:45,340 INFO  L87              Difference]: Start difference. First operand 1031083 states and 1686167 transitions. Second operand 14 states.