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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c


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


This is Ultimate 0.1.24-112bae1
[2019-09-08 08:20:17,373 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-09-08 08:20:17,375 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-09-08 08:20:17,387 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-09-08 08:20:17,387 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-09-08 08:20:17,388 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-09-08 08:20:17,390 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-09-08 08:20:17,391 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-09-08 08:20:17,393 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-09-08 08:20:17,394 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-09-08 08:20:17,395 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-09-08 08:20:17,396 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-09-08 08:20:17,396 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-09-08 08:20:17,397 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-09-08 08:20:17,398 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-09-08 08:20:17,399 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-09-08 08:20:17,400 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-09-08 08:20:17,401 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-09-08 08:20:17,402 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-09-08 08:20:17,404 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-09-08 08:20:17,406 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-09-08 08:20:17,407 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-09-08 08:20:17,408 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-09-08 08:20:17,408 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-09-08 08:20:17,410 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-09-08 08:20:17,411 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-09-08 08:20:17,411 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-09-08 08:20:17,412 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-09-08 08:20:17,412 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-09-08 08:20:17,413 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-09-08 08:20:17,413 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-09-08 08:20:17,414 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-09-08 08:20:17,415 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-09-08 08:20:17,415 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-09-08 08:20:17,416 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-09-08 08:20:17,417 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-09-08 08:20:17,417 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-09-08 08:20:17,418 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-09-08 08:20:17,418 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-09-08 08:20:17,419 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-09-08 08:20:17,419 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-09-08 08:20:17,420 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 08:20:17,434 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-09-08 08:20:17,434 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-09-08 08:20:17,436 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-09-08 08:20:17,436 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-09-08 08:20:17,436 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-09-08 08:20:17,436 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-09-08 08:20:17,437 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-09-08 08:20:17,437 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-09-08 08:20:17,437 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-09-08 08:20:17,437 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-09-08 08:20:17,437 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-09-08 08:20:17,438 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-09-08 08:20:17,438 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-09-08 08:20:17,438 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-09-08 08:20:17,438 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-09-08 08:20:17,438 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-09-08 08:20:17,439 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-09-08 08:20:17,439 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-09-08 08:20:17,439 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-09-08 08:20:17,439 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-09-08 08:20:17,439 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-09-08 08:20:17,440 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-09-08 08:20:17,440 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-09-08 08:20:17,440 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-09-08 08:20:17,440 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-09-08 08:20:17,440 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-09-08 08:20:17,440 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-09-08 08:20:17,441 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-09-08 08:20:17,441 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-09-08 08:20:17,470 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-09-08 08:20:17,482 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-09-08 08:20:17,487 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-09-08 08:20:17,489 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-09-08 08:20:17,489 INFO  L275        PluginConnector]: CDTParser initialized
[2019-09-08 08:20:17,490 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c
[2019-09-08 08:20:17,541 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db90cc8c5/3fc23e80b204401fbf129b7e856cbbe9/FLAG48093e26a
[2019-09-08 08:20:18,092 INFO  L306              CDTParser]: Found 1 translation units.
[2019-09-08 08:20:18,093 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c
[2019-09-08 08:20:18,120 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db90cc8c5/3fc23e80b204401fbf129b7e856cbbe9/FLAG48093e26a
[2019-09-08 08:20:18,369 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db90cc8c5/3fc23e80b204401fbf129b7e856cbbe9
[2019-09-08 08:20:18,382 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-09-08 08:20:18,383 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-09-08 08:20:18,386 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-09-08 08:20:18,386 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-09-08 08:20:18,390 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-09-08 08:20:18,391 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:20:18" (1/1) ...
[2019-09-08 08:20:18,394 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1b76c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:18, skipping insertion in model container
[2019-09-08 08:20:18,394 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:20:18" (1/1) ...
[2019-09-08 08:20:18,402 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-09-08 08:20:18,476 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-09-08 08:20:19,041 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 08:20:19,066 INFO  L188         MainTranslator]: Completed pre-run
[2019-09-08 08:20:19,165 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-08 08:20:19,187 INFO  L192         MainTranslator]: Completed translation
[2019-09-08 08:20:19,187 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:19 WrapperNode
[2019-09-08 08:20:19,188 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-09-08 08:20:19,188 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-09-08 08:20:19,189 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-09-08 08:20:19,189 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-09-08 08:20:19,201 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:19" (1/1) ...
[2019-09-08 08:20:19,201 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:19" (1/1) ...
[2019-09-08 08:20:19,219 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:19" (1/1) ...
[2019-09-08 08:20:19,219 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:19" (1/1) ...
[2019-09-08 08:20:19,249 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:19" (1/1) ...
[2019-09-08 08:20:19,282 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:19" (1/1) ...
[2019-09-08 08:20:19,287 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:19" (1/1) ...
[2019-09-08 08:20:19,297 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-09-08 08:20:19,297 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-09-08 08:20:19,298 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-09-08 08:20:19,298 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-09-08 08:20:19,299 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:19" (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 08:20:19,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-09-08 08:20:19,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-09-08 08:20:19,406 INFO  L138     BoogieDeclarations]: Found implementation of procedure node1
[2019-09-08 08:20:19,406 INFO  L138     BoogieDeclarations]: Found implementation of procedure node2
[2019-09-08 08:20:19,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure node3
[2019-09-08 08:20:19,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure node4
[2019-09-08 08:20:19,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure init
[2019-09-08 08:20:19,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure check
[2019-09-08 08:20:19,408 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-09-08 08:20:19,408 INFO  L138     BoogieDeclarations]: Found implementation of procedure assert
[2019-09-08 08:20:19,409 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-09-08 08:20:19,409 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2019-09-08 08:20:19,409 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar
[2019-09-08 08:20:19,410 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2019-09-08 08:20:19,411 INFO  L130     BoogieDeclarations]: Found specification of procedure assert
[2019-09-08 08:20:19,411 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-09-08 08:20:19,413 INFO  L130     BoogieDeclarations]: Found specification of procedure read
[2019-09-08 08:20:19,413 INFO  L130     BoogieDeclarations]: Found specification of procedure write
[2019-09-08 08:20:19,413 INFO  L130     BoogieDeclarations]: Found specification of procedure node1
[2019-09-08 08:20:19,413 INFO  L130     BoogieDeclarations]: Found specification of procedure node2
[2019-09-08 08:20:19,413 INFO  L130     BoogieDeclarations]: Found specification of procedure node3
[2019-09-08 08:20:19,414 INFO  L130     BoogieDeclarations]: Found specification of procedure node4
[2019-09-08 08:20:19,414 INFO  L130     BoogieDeclarations]: Found specification of procedure init
[2019-09-08 08:20:19,414 INFO  L130     BoogieDeclarations]: Found specification of procedure check
[2019-09-08 08:20:19,414 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-09-08 08:20:19,414 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-09-08 08:20:19,414 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-09-08 08:20:20,795 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-09-08 08:20:20,796 INFO  L283             CfgBuilder]: Removed 1 assume(true) statements.
[2019-09-08 08:20:20,798 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:20:20 BoogieIcfgContainer
[2019-09-08 08:20:20,798 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-09-08 08:20:20,799 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-09-08 08:20:20,800 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-09-08 08:20:20,803 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-09-08 08:20:20,804 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:20:18" (1/3) ...
[2019-09-08 08:20:20,805 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3827a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:20:20, skipping insertion in model container
[2019-09-08 08:20:20,805 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:20:19" (2/3) ...
[2019-09-08 08:20:20,806 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3827a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:20:20, skipping insertion in model container
[2019-09-08 08:20:20,806 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:20:20" (3/3) ...
[2019-09-08 08:20:20,809 INFO  L109   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c
[2019-09-08 08:20:20,821 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-09-08 08:20:20,831 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-09-08 08:20:20,849 INFO  L252      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-09-08 08:20:20,887 INFO  L128   ementStrategyFactory]: Using default assertion order modulation
[2019-09-08 08:20:20,888 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2019-09-08 08:20:20,888 INFO  L378      AbstractCegarLoop]: Hoare is true
[2019-09-08 08:20:20,888 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-09-08 08:20:20,889 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-09-08 08:20:20,889 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-09-08 08:20:20,889 INFO  L382      AbstractCegarLoop]: Difference is false
[2019-09-08 08:20:20,889 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-09-08 08:20:20,889 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-09-08 08:20:20,932 INFO  L276                IsEmpty]: Start isEmpty. Operand 359 states.
[2019-09-08 08:20:20,957 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2019-09-08 08:20:20,958 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:20,959 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]
[2019-09-08 08:20:20,961 INFO  L418      AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:20,967 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:20,967 INFO  L82        PathProgramCache]: Analyzing trace with hash 1968290658, now seen corresponding path program 1 times
[2019-09-08 08:20:20,969 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:20,970 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:21,026 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:21,026 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:21,026 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:21,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:21,631 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 08:20:21,634 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:21,635 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 08:20:21,640 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 08:20:21,655 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 08:20:21,656 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 08:20:21,658 INFO  L87              Difference]: Start difference. First operand 359 states. Second operand 5 states.
[2019-09-08 08:20:21,849 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:21,849 INFO  L93              Difference]: Finished difference Result 515 states and 873 transitions.
[2019-09-08 08:20:21,853 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-08 08:20:21,855 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 102
[2019-09-08 08:20:21,856 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:20:21,876 INFO  L225             Difference]: With dead ends: 515
[2019-09-08 08:20:21,877 INFO  L226             Difference]: Without dead ends: 354
[2019-09-08 08:20:21,882 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 08:20:21,900 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 354 states.
[2019-09-08 08:20:21,951 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354.
[2019-09-08 08:20:21,953 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 354 states.
[2019-09-08 08:20:21,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 567 transitions.
[2019-09-08 08:20:21,962 INFO  L78                 Accepts]: Start accepts. Automaton has 354 states and 567 transitions. Word has length 102
[2019-09-08 08:20:21,963 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:20:21,963 INFO  L475      AbstractCegarLoop]: Abstraction has 354 states and 567 transitions.
[2019-09-08 08:20:21,963 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 08:20:21,963 INFO  L276                IsEmpty]: Start isEmpty. Operand 354 states and 567 transitions.
[2019-09-08 08:20:21,971 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2019-09-08 08:20:21,971 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:21,972 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]
[2019-09-08 08:20:21,972 INFO  L418      AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:21,973 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:21,973 INFO  L82        PathProgramCache]: Analyzing trace with hash 1586639344, now seen corresponding path program 1 times
[2019-09-08 08:20:21,974 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:21,974 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:21,977 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:21,977 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:21,977 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:22,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:22,532 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 08:20:22,533 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:22,533 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2019-09-08 08:20:22,535 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-09-08 08:20:22,535 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-09-08 08:20:22,536 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2019-09-08 08:20:22,536 INFO  L87              Difference]: Start difference. First operand 354 states and 567 transitions. Second operand 11 states.
[2019-09-08 08:20:28,989 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:28,990 INFO  L93              Difference]: Finished difference Result 1663 states and 2706 transitions.
[2019-09-08 08:20:28,990 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2019-09-08 08:20:28,991 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 147
[2019-09-08 08:20:28,992 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:20:29,007 INFO  L225             Difference]: With dead ends: 1663
[2019-09-08 08:20:29,007 INFO  L226             Difference]: Without dead ends: 1511
[2019-09-08 08:20:29,012 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806
[2019-09-08 08:20:29,015 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1511 states.
[2019-09-08 08:20:29,148 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1284.
[2019-09-08 08:20:29,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1284 states.
[2019-09-08 08:20:29,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2076 transitions.
[2019-09-08 08:20:29,157 INFO  L78                 Accepts]: Start accepts. Automaton has 1284 states and 2076 transitions. Word has length 147
[2019-09-08 08:20:29,158 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:20:29,158 INFO  L475      AbstractCegarLoop]: Abstraction has 1284 states and 2076 transitions.
[2019-09-08 08:20:29,159 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-09-08 08:20:29,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 1284 states and 2076 transitions.
[2019-09-08 08:20:29,164 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2019-09-08 08:20:29,165 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:29,165 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]
[2019-09-08 08:20:29,166 INFO  L418      AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:29,166 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:29,167 INFO  L82        PathProgramCache]: Analyzing trace with hash 615152904, now seen corresponding path program 1 times
[2019-09-08 08:20:29,167 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:29,167 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:29,170 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:29,170 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:29,171 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:29,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:29,424 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 08:20:29,424 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:29,425 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 08:20:29,431 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 08:20:29,432 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 08:20:29,432 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 08:20:29,433 INFO  L87              Difference]: Start difference. First operand 1284 states and 2076 transitions. Second operand 6 states.
[2019-09-08 08:20:32,118 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:32,118 INFO  L93              Difference]: Finished difference Result 4322 states and 6992 transitions.
[2019-09-08 08:20:32,119 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 08:20:32,119 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 148
[2019-09-08 08:20:32,120 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:20:32,137 INFO  L225             Difference]: With dead ends: 4322
[2019-09-08 08:20:32,138 INFO  L226             Difference]: Without dead ends: 3240
[2019-09-08 08:20:32,143 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 08:20:32,147 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3240 states.
[2019-09-08 08:20:32,317 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 3225.
[2019-09-08 08:20:32,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3225 states.
[2019-09-08 08:20:32,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 5194 transitions.
[2019-09-08 08:20:32,334 INFO  L78                 Accepts]: Start accepts. Automaton has 3225 states and 5194 transitions. Word has length 148
[2019-09-08 08:20:32,335 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:20:32,335 INFO  L475      AbstractCegarLoop]: Abstraction has 3225 states and 5194 transitions.
[2019-09-08 08:20:32,335 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 08:20:32,335 INFO  L276                IsEmpty]: Start isEmpty. Operand 3225 states and 5194 transitions.
[2019-09-08 08:20:32,339 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2019-09-08 08:20:32,339 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:32,339 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]
[2019-09-08 08:20:32,339 INFO  L418      AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:32,340 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:32,340 INFO  L82        PathProgramCache]: Analyzing trace with hash 512159399, now seen corresponding path program 1 times
[2019-09-08 08:20:32,340 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:32,340 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:32,341 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:32,342 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:32,342 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:32,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:32,518 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 08:20:32,518 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:32,519 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 08:20:32,519 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 08:20:32,520 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 08:20:32,520 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 08:20:32,520 INFO  L87              Difference]: Start difference. First operand 3225 states and 5194 transitions. Second operand 6 states.
[2019-09-08 08:20:35,035 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:35,036 INFO  L93              Difference]: Finished difference Result 11918 states and 19164 transitions.
[2019-09-08 08:20:35,036 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 08:20:35,037 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 149
[2019-09-08 08:20:35,037 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:20:35,099 INFO  L225             Difference]: With dead ends: 11918
[2019-09-08 08:20:35,099 INFO  L226             Difference]: Without dead ends: 8895
[2019-09-08 08:20:35,113 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 08:20:35,128 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8895 states.
[2019-09-08 08:20:35,510 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8895 to 8865.
[2019-09-08 08:20:35,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8865 states.
[2019-09-08 08:20:35,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8865 states to 8865 states and 14198 transitions.
[2019-09-08 08:20:35,549 INFO  L78                 Accepts]: Start accepts. Automaton has 8865 states and 14198 transitions. Word has length 149
[2019-09-08 08:20:35,549 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:20:35,549 INFO  L475      AbstractCegarLoop]: Abstraction has 8865 states and 14198 transitions.
[2019-09-08 08:20:35,550 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 08:20:35,550 INFO  L276                IsEmpty]: Start isEmpty. Operand 8865 states and 14198 transitions.
[2019-09-08 08:20:35,554 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2019-09-08 08:20:35,554 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:35,555 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]
[2019-09-08 08:20:35,555 INFO  L418      AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:35,555 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:35,555 INFO  L82        PathProgramCache]: Analyzing trace with hash 1562643103, now seen corresponding path program 1 times
[2019-09-08 08:20:35,556 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:35,556 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:35,557 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:35,557 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:35,557 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:35,613 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:35,709 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 08:20:35,709 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:35,710 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 08:20:35,710 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 08:20:35,710 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 08:20:35,711 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-09-08 08:20:35,711 INFO  L87              Difference]: Start difference. First operand 8865 states and 14198 transitions. Second operand 6 states.
[2019-09-08 08:20:38,806 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:38,806 INFO  L93              Difference]: Finished difference Result 38703 states and 61878 transitions.
[2019-09-08 08:20:38,807 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 08:20:38,807 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 150
[2019-09-08 08:20:38,808 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:20:38,976 INFO  L225             Difference]: With dead ends: 38703
[2019-09-08 08:20:38,976 INFO  L226             Difference]: Without dead ends: 30040
[2019-09-08 08:20:39,008 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 08:20:39,047 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30040 states.
[2019-09-08 08:20:40,699 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30040 to 29952.
[2019-09-08 08:20:40,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29952 states.
[2019-09-08 08:20:40,802 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29952 states to 29952 states and 47748 transitions.
[2019-09-08 08:20:40,803 INFO  L78                 Accepts]: Start accepts. Automaton has 29952 states and 47748 transitions. Word has length 150
[2019-09-08 08:20:40,804 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:20:40,804 INFO  L475      AbstractCegarLoop]: Abstraction has 29952 states and 47748 transitions.
[2019-09-08 08:20:40,804 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 08:20:40,804 INFO  L276                IsEmpty]: Start isEmpty. Operand 29952 states and 47748 transitions.
[2019-09-08 08:20:40,812 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2019-09-08 08:20:40,812 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:40,812 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]
[2019-09-08 08:20:40,813 INFO  L418      AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:40,813 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:40,813 INFO  L82        PathProgramCache]: Analyzing trace with hash -283785378, now seen corresponding path program 1 times
[2019-09-08 08:20:40,813 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:40,814 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:40,815 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:40,815 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:40,815 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:40,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:40,996 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 08:20:40,997 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:40,997 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 08:20:40,997 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 08:20:40,998 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 08:20:40,998 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-09-08 08:20:40,998 INFO  L87              Difference]: Start difference. First operand 29952 states and 47748 transitions. Second operand 6 states.
[2019-09-08 08:20:45,104 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:45,106 INFO  L93              Difference]: Finished difference Result 158501 states and 253547 transitions.
[2019-09-08 08:20:45,106 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-09-08 08:20:45,107 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 151
[2019-09-08 08:20:45,107 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:20:45,749 INFO  L225             Difference]: With dead ends: 158501
[2019-09-08 08:20:45,750 INFO  L226             Difference]: Without dead ends: 128751
[2019-09-08 08:20:45,873 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 08:20:46,020 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 128751 states.
[2019-09-08 08:20:50,511 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 128751 to 102318.
[2019-09-08 08:20:50,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 102318 states.
[2019-09-08 08:20:51,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102318 states to 102318 states and 163574 transitions.
[2019-09-08 08:20:51,159 INFO  L78                 Accepts]: Start accepts. Automaton has 102318 states and 163574 transitions. Word has length 151
[2019-09-08 08:20:51,159 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:20:51,159 INFO  L475      AbstractCegarLoop]: Abstraction has 102318 states and 163574 transitions.
[2019-09-08 08:20:51,159 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 08:20:51,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 102318 states and 163574 transitions.
[2019-09-08 08:20:51,165 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2019-09-08 08:20:51,166 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:20:51,166 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]
[2019-09-08 08:20:51,169 INFO  L418      AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:20:51,169 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:20:51,169 INFO  L82        PathProgramCache]: Analyzing trace with hash -1215829162, now seen corresponding path program 1 times
[2019-09-08 08:20:51,169 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:20:51,169 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:20:51,172 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:51,172 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:20:51,172 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:20:51,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:20:51,411 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 08:20:51,412 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:20:51,412 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-09-08 08:20:51,413 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-08 08:20:51,413 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-08 08:20:51,413 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2019-09-08 08:20:51,414 INFO  L87              Difference]: Start difference. First operand 102318 states and 163574 transitions. Second operand 6 states.
[2019-09-08 08:20:59,931 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:20:59,931 INFO  L93              Difference]: Finished difference Result 318541 states and 509594 transitions.
[2019-09-08 08:20:59,932 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2019-09-08 08:20:59,932 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 153
[2019-09-08 08:20:59,932 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:21:01,023 INFO  L225             Difference]: With dead ends: 318541
[2019-09-08 08:21:01,023 INFO  L226             Difference]: Without dead ends: 216425
[2019-09-08 08:21:01,234 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2019-09-08 08:21:01,457 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 216425 states.
[2019-09-08 08:21:08,103 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 216425 to 214902.
[2019-09-08 08:21:08,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 214902 states.
[2019-09-08 08:21:08,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 214902 states to 214902 states and 339989 transitions.
[2019-09-08 08:21:08,734 INFO  L78                 Accepts]: Start accepts. Automaton has 214902 states and 339989 transitions. Word has length 153
[2019-09-08 08:21:08,734 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:21:08,735 INFO  L475      AbstractCegarLoop]: Abstraction has 214902 states and 339989 transitions.
[2019-09-08 08:21:08,735 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-08 08:21:08,735 INFO  L276                IsEmpty]: Start isEmpty. Operand 214902 states and 339989 transitions.
[2019-09-08 08:21:08,741 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2019-09-08 08:21:08,741 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:21:08,741 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]
[2019-09-08 08:21:08,741 INFO  L418      AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:21:08,742 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:21:08,742 INFO  L82        PathProgramCache]: Analyzing trace with hash 1541103031, now seen corresponding path program 1 times
[2019-09-08 08:21:08,742 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:21:08,742 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:21:08,744 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:21:08,744 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:21:08,744 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:21:08,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:21:08,987 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 08:21:08,988 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:21:08,988 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 08:21:08,988 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 08:21:08,988 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 08:21:08,989 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 08:21:08,989 INFO  L87              Difference]: Start difference. First operand 214902 states and 339989 transitions. Second operand 5 states.
[2019-09-08 08:21:19,252 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:21:19,252 INFO  L93              Difference]: Finished difference Result 640559 states and 1024610 transitions.
[2019-09-08 08:21:19,253 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-09-08 08:21:19,253 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 156
[2019-09-08 08:21:19,253 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:21:20,738 INFO  L225             Difference]: With dead ends: 640559
[2019-09-08 08:21:20,738 INFO  L226             Difference]: Without dead ends: 425673
[2019-09-08 08:21:21,172 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2019-09-08 08:21:21,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 425673 states.
[2019-09-08 08:21:40,933 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 425673 to 425671.
[2019-09-08 08:21:40,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 425671 states.
[2019-09-08 08:21:42,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 425671 states to 425671 states and 667759 transitions.
[2019-09-08 08:21:42,193 INFO  L78                 Accepts]: Start accepts. Automaton has 425671 states and 667759 transitions. Word has length 156
[2019-09-08 08:21:42,194 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:21:42,194 INFO  L475      AbstractCegarLoop]: Abstraction has 425671 states and 667759 transitions.
[2019-09-08 08:21:42,194 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 08:21:42,194 INFO  L276                IsEmpty]: Start isEmpty. Operand 425671 states and 667759 transitions.
[2019-09-08 08:21:42,200 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2019-09-08 08:21:42,201 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:21:42,201 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]
[2019-09-08 08:21:42,201 INFO  L418      AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:21:42,201 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:21:42,202 INFO  L82        PathProgramCache]: Analyzing trace with hash 2124094970, now seen corresponding path program 1 times
[2019-09-08 08:21:42,202 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:21:42,202 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:21:42,203 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:21:42,204 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:21:42,204 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:21:42,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:21:42,363 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 08:21:42,363 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:21:42,363 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 08:21:42,364 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 08:21:42,364 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 08:21:42,364 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 08:21:42,365 INFO  L87              Difference]: Start difference. First operand 425671 states and 667759 transitions. Second operand 5 states.
[2019-09-08 08:22:01,507 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:22:01,507 INFO  L93              Difference]: Finished difference Result 1045487 states and 1650379 transitions.
[2019-09-08 08:22:01,507 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-08 08:22:01,508 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 157
[2019-09-08 08:22:01,508 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:22:03,748 INFO  L225             Difference]: With dead ends: 1045487
[2019-09-08 08:22:03,748 INFO  L226             Difference]: Without dead ends: 620205
[2019-09-08 08:22:05,952 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2019-09-08 08:22:06,418 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 620205 states.
[2019-09-08 08:22:38,326 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 620205 to 605671.
[2019-09-08 08:22:38,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 605671 states.
[2019-09-08 08:22:41,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 605671 states to 605671 states and 948865 transitions.
[2019-09-08 08:22:41,737 INFO  L78                 Accepts]: Start accepts. Automaton has 605671 states and 948865 transitions. Word has length 157
[2019-09-08 08:22:41,737 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:22:41,738 INFO  L475      AbstractCegarLoop]: Abstraction has 605671 states and 948865 transitions.
[2019-09-08 08:22:41,738 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 08:22:41,738 INFO  L276                IsEmpty]: Start isEmpty. Operand 605671 states and 948865 transitions.
[2019-09-08 08:22:41,747 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2019-09-08 08:22:41,747 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:22:41,748 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]
[2019-09-08 08:22:41,748 INFO  L418      AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:22:41,748 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:22:41,749 INFO  L82        PathProgramCache]: Analyzing trace with hash 1365521961, now seen corresponding path program 1 times
[2019-09-08 08:22:41,749 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:22:41,749 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:22:41,750 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:22:41,750 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:22:41,751 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:22:41,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:22:41,827 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 08:22:41,828 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:22:41,828 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-08 08:22:41,828 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-08 08:22:41,829 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-08 08:22:41,829 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-08 08:22:41,829 INFO  L87              Difference]: Start difference. First operand 605671 states and 948865 transitions. Second operand 3 states.
[2019-09-08 08:23:01,785 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:23:01,786 INFO  L93              Difference]: Finished difference Result 1211678 states and 1898261 transitions.
[2019-09-08 08:23:01,786 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-08 08:23:01,786 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 158
[2019-09-08 08:23:01,787 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:23:03,728 INFO  L225             Difference]: With dead ends: 1211678
[2019-09-08 08:23:03,729 INFO  L226             Difference]: Without dead ends: 606036
[2019-09-08 08:23:04,499 INFO  L628         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
[2019-09-08 08:23:05,030 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 606036 states.
[2019-09-08 08:23:38,430 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 606036 to 605684.
[2019-09-08 08:23:38,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 605684 states.
[2019-09-08 08:23:41,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 605684 states to 605684 states and 948883 transitions.
[2019-09-08 08:23:41,139 INFO  L78                 Accepts]: Start accepts. Automaton has 605684 states and 948883 transitions. Word has length 158
[2019-09-08 08:23:41,140 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:23:41,140 INFO  L475      AbstractCegarLoop]: Abstraction has 605684 states and 948883 transitions.
[2019-09-08 08:23:41,140 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-08 08:23:41,140 INFO  L276                IsEmpty]: Start isEmpty. Operand 605684 states and 948883 transitions.
[2019-09-08 08:23:41,147 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2019-09-08 08:23:41,148 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:23:41,148 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]
[2019-09-08 08:23:41,148 INFO  L418      AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:23:41,149 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:23:41,149 INFO  L82        PathProgramCache]: Analyzing trace with hash 2071576018, now seen corresponding path program 1 times
[2019-09-08 08:23:41,149 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:23:41,149 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:23:41,151 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:23:41,152 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:23:41,152 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:23:41,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:23:41,394 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 08:23:41,395 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:23:41,395 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 08:23:41,395 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 08:23:41,396 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 08:23:41,396 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 08:23:41,396 INFO  L87              Difference]: Start difference. First operand 605684 states and 948883 transitions. Second operand 5 states.
[2019-09-08 08:24:26,477 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-08 08:24:26,477 INFO  L93              Difference]: Finished difference Result 1803195 states and 2864203 transitions.
[2019-09-08 08:24:26,478 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-09-08 08:24:26,478 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 158
[2019-09-08 08:24:26,478 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-08 08:24:30,427 INFO  L225             Difference]: With dead ends: 1803195
[2019-09-08 08:24:30,427 INFO  L226             Difference]: Without dead ends: 1197552
[2019-09-08 08:24:32,377 INFO  L628         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2019-09-08 08:24:33,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1197552 states.
[2019-09-08 08:25:38,444 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197552 to 1197550.
[2019-09-08 08:25:38,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1197550 states.
[2019-09-08 08:25:56,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1197550 states to 1197550 states and 1859794 transitions.
[2019-09-08 08:25:56,412 INFO  L78                 Accepts]: Start accepts. Automaton has 1197550 states and 1859794 transitions. Word has length 158
[2019-09-08 08:25:56,413 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-08 08:25:56,413 INFO  L475      AbstractCegarLoop]: Abstraction has 1197550 states and 1859794 transitions.
[2019-09-08 08:25:56,413 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-09-08 08:25:56,413 INFO  L276                IsEmpty]: Start isEmpty. Operand 1197550 states and 1859794 transitions.
[2019-09-08 08:25:56,423 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2019-09-08 08:25:56,423 INFO  L391         BasicCegarLoop]: Found error trace
[2019-09-08 08:25:56,423 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]
[2019-09-08 08:25:56,424 INFO  L418      AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-08 08:25:56,424 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-08 08:25:56,424 INFO  L82        PathProgramCache]: Analyzing trace with hash -1105761247, now seen corresponding path program 1 times
[2019-09-08 08:25:56,424 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-08 08:25:56,424 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-08 08:25:56,425 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:25:56,426 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-08 08:25:56,426 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-08 08:25:56,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-08 08:25:56,657 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 08:25:56,657 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-08 08:25:56,657 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-09-08 08:25:56,658 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-09-08 08:25:56,658 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-09-08 08:25:56,659 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-09-08 08:25:56,659 INFO  L87              Difference]: Start difference. First operand 1197550 states and 1859794 transitions. Second operand 5 states.