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.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:30:01,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:30:01,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:30:01,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:30:01,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:30:01,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:30:01,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:30:01,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:30:01,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:30:01,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:30:01,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:30:01,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:30:01,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:30:01,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:30:01,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:30:01,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:30:01,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:30:01,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:30:01,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:30:01,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:30:01,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:30:01,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:30:01,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:30:01,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:30:01,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:30:01,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:30:01,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:30:01,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:30:01,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:30:01,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:30:01,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:30:01,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:30:01,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:30:01,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:30:01,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:30:01,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:30:01,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:30:01,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:30:01,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:30:01,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:30:01,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:30:01,527 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:30:01,555 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:30:01,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:30:01,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:30:01,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:30:01,558 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:30:01,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:30:01,559 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:30:01,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:30:01,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:30:01,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:30:01,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:30:01,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:30:01,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:30:01,561 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:30:01,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:30:01,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:30:01,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:30:01,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:30:01,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:30:01,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:30:01,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:30:01,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:30:01,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:30:01,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:30:01,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:30:01,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:30:01,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:30:01,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:30:01,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:30:01,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:30:01,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:30:01,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:30:01,627 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:30:01,628 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:30:01,629 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.ufo.UNBOUNDED.pals.c [2019-09-08 07:30:01,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac53e9f1/fcda584f264742eabd5f1be04a507fea/FLAG5feb5cc54 [2019-09-08 07:30:02,360 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:30:02,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.ufo.UNBOUNDED.pals.c [2019-09-08 07:30:02,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac53e9f1/fcda584f264742eabd5f1be04a507fea/FLAG5feb5cc54 [2019-09-08 07:30:02,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac53e9f1/fcda584f264742eabd5f1be04a507fea [2019-09-08 07:30:02,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:30:02,595 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:30:02,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:30:02,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:30:02,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:30:02,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:30:02" (1/1) ... [2019-09-08 07:30:02,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562f51d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:02, skipping insertion in model container [2019-09-08 07:30:02,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:30:02" (1/1) ... [2019-09-08 07:30:02,609 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:30:02,686 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:30:03,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:30:03,313 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:30:03,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:30:03,544 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:30:03,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:03 WrapperNode [2019-09-08 07:30:03,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:30:03,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:30:03,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:30:03,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:30:03,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:03" (1/1) ... [2019-09-08 07:30:03,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:03" (1/1) ... [2019-09-08 07:30:03,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:03" (1/1) ... [2019-09-08 07:30:03,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:03" (1/1) ... [2019-09-08 07:30:03,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:03" (1/1) ... [2019-09-08 07:30:03,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:03" (1/1) ... [2019-09-08 07:30:03,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:03" (1/1) ... [2019-09-08 07:30:03,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:30:03,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:30:03,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:30:03,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:30:03,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:03" (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:30:03,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:30:03,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:30:03,819 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:30:03,820 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:30:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:30:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 07:30:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 07:30:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:30:03,822 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:30:03,822 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:30:03,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:30:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:30:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:30:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 07:30:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:30:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:30:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:30:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:30:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:30:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:30:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:30:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:30:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 07:30:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 07:30:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:30:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:30:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:30:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:30:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:30:06,553 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:30:06,553 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:30:06,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:30:06 BoogieIcfgContainer [2019-09-08 07:30:06,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:30:06,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:30:06,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:30:06,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:30:06,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:30:02" (1/3) ... [2019-09-08 07:30:06,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4058b540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:30:06, skipping insertion in model container [2019-09-08 07:30:06,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:03" (2/3) ... [2019-09-08 07:30:06,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4058b540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:30:06, skipping insertion in model container [2019-09-08 07:30:06,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:30:06" (3/3) ... [2019-09-08 07:30:06,563 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.ufo.UNBOUNDED.pals.c [2019-09-08 07:30:06,571 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:30:06,579 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:30:06,596 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:30:06,634 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:30:06,634 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:30:06,635 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:30:06,635 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:30:06,635 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:30:06,635 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:30:06,635 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:30:06,635 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:30:06,635 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:30:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-09-08 07:30:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 07:30:06,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:06,697 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:30:06,700 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:06,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1909906807, now seen corresponding path program 1 times [2019-09-08 07:30:06,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:06,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:06,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:06,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:06,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:07,353 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:07,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:07,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:30:07,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:30:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:30:07,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:30:07,380 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 5 states. [2019-09-08 07:30:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:07,784 INFO L93 Difference]: Finished difference Result 929 states and 1653 transitions. [2019-09-08 07:30:07,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:30:07,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 07:30:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:07,821 INFO L225 Difference]: With dead ends: 929 [2019-09-08 07:30:07,822 INFO L226 Difference]: Without dead ends: 736 [2019-09-08 07:30:07,831 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:30:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-09-08 07:30:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2019-09-08 07:30:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-09-08 07:30:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1275 transitions. [2019-09-08 07:30:08,020 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1275 transitions. Word has length 176 [2019-09-08 07:30:08,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:08,021 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 1275 transitions. [2019-09-08 07:30:08,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:30:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1275 transitions. [2019-09-08 07:30:08,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 07:30:08,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:08,035 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:30:08,036 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:08,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:08,037 INFO L82 PathProgramCache]: Analyzing trace with hash -268525100, now seen corresponding path program 1 times [2019-09-08 07:30:08,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:08,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:08,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:08,822 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:08,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:08,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:30:08,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:30:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:30:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:30:08,826 INFO L87 Difference]: Start difference. First operand 736 states and 1275 transitions. Second operand 13 states. [2019-09-08 07:30:21,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:21,977 INFO L93 Difference]: Finished difference Result 3006 states and 5054 transitions. [2019-09-08 07:30:21,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 07:30:21,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 235 [2019-09-08 07:30:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:22,001 INFO L225 Difference]: With dead ends: 3006 [2019-09-08 07:30:22,001 INFO L226 Difference]: Without dead ends: 2822 [2019-09-08 07:30:22,011 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:30:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2019-09-08 07:30:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2030. [2019-09-08 07:30:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2019-09-08 07:30:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 3422 transitions. [2019-09-08 07:30:22,237 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 3422 transitions. Word has length 235 [2019-09-08 07:30:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:22,246 INFO L475 AbstractCegarLoop]: Abstraction has 2030 states and 3422 transitions. [2019-09-08 07:30:22,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:30:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 3422 transitions. [2019-09-08 07:30:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 07:30:22,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:22,255 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:30:22,255 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:22,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:22,256 INFO L82 PathProgramCache]: Analyzing trace with hash -699503355, now seen corresponding path program 1 times [2019-09-08 07:30:22,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:22,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:22,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:22,647 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:22,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:22,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:30:22,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:30:22,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:30:22,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:30:22,649 INFO L87 Difference]: Start difference. First operand 2030 states and 3422 transitions. Second operand 6 states. [2019-09-08 07:30:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:26,724 INFO L93 Difference]: Finished difference Result 5014 states and 8363 transitions. [2019-09-08 07:30:26,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:30:26,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2019-09-08 07:30:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:26,768 INFO L225 Difference]: With dead ends: 5014 [2019-09-08 07:30:26,768 INFO L226 Difference]: Without dead ends: 3536 [2019-09-08 07:30:26,776 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:30:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2019-09-08 07:30:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3345. [2019-09-08 07:30:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3345 states. [2019-09-08 07:30:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 5590 transitions. [2019-09-08 07:30:27,019 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 5590 transitions. Word has length 236 [2019-09-08 07:30:27,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:27,021 INFO L475 AbstractCegarLoop]: Abstraction has 3345 states and 5590 transitions. [2019-09-08 07:30:27,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:30:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 5590 transitions. [2019-09-08 07:30:27,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 07:30:27,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:27,034 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:30:27,034 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1226612309, now seen corresponding path program 1 times [2019-09-08 07:30:27,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:27,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:27,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:27,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:27,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:27,527 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:27,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:27,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:30:27,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:30:27,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:30:27,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:30:27,530 INFO L87 Difference]: Start difference. First operand 3345 states and 5590 transitions. Second operand 6 states. [2019-09-08 07:30:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:31,659 INFO L93 Difference]: Finished difference Result 9374 states and 15534 transitions. [2019-09-08 07:30:31,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:30:31,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-08 07:30:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:31,699 INFO L225 Difference]: With dead ends: 9374 [2019-09-08 07:30:31,700 INFO L226 Difference]: Without dead ends: 6581 [2019-09-08 07:30:31,709 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:30:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-09-08 07:30:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 5617. [2019-09-08 07:30:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5617 states. [2019-09-08 07:30:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5617 states to 5617 states and 9313 transitions. [2019-09-08 07:30:32,048 INFO L78 Accepts]: Start accepts. Automaton has 5617 states and 9313 transitions. Word has length 237 [2019-09-08 07:30:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:32,049 INFO L475 AbstractCegarLoop]: Abstraction has 5617 states and 9313 transitions. [2019-09-08 07:30:32,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:30:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 5617 states and 9313 transitions. [2019-09-08 07:30:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 07:30:32,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:32,058 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:30:32,058 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:32,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:32,059 INFO L82 PathProgramCache]: Analyzing trace with hash -438805636, now seen corresponding path program 1 times [2019-09-08 07:30:32,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:32,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:32,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:32,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:32,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:32,348 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:32,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:32,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:30:32,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:30:32,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:30:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:30:32,350 INFO L87 Difference]: Start difference. First operand 5617 states and 9313 transitions. Second operand 6 states. [2019-09-08 07:30:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:36,166 INFO L93 Difference]: Finished difference Result 21935 states and 36146 transitions. [2019-09-08 07:30:36,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:30:36,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2019-09-08 07:30:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:36,269 INFO L225 Difference]: With dead ends: 21935 [2019-09-08 07:30:36,269 INFO L226 Difference]: Without dead ends: 16870 [2019-09-08 07:30:36,290 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:30:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16870 states. [2019-09-08 07:30:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16870 to 13926. [2019-09-08 07:30:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13926 states. [2019-09-08 07:30:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13926 states to 13926 states and 22887 transitions. [2019-09-08 07:30:36,823 INFO L78 Accepts]: Start accepts. Automaton has 13926 states and 22887 transitions. Word has length 238 [2019-09-08 07:30:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:36,824 INFO L475 AbstractCegarLoop]: Abstraction has 13926 states and 22887 transitions. [2019-09-08 07:30:36,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:30:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 13926 states and 22887 transitions. [2019-09-08 07:30:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 07:30:36,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:36,835 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:30:36,835 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:36,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:36,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1838287486, now seen corresponding path program 1 times [2019-09-08 07:30:36,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:36,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:36,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:36,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:37,233 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:37,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:37,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:30:37,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:30:37,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:30:37,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:30:37,236 INFO L87 Difference]: Start difference. First operand 13926 states and 22887 transitions. Second operand 6 states. [2019-09-08 07:30:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:43,293 INFO L93 Difference]: Finished difference Result 80238 states and 131647 transitions. [2019-09-08 07:30:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:30:43,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-09-08 07:30:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:43,594 INFO L225 Difference]: With dead ends: 80238 [2019-09-08 07:30:43,594 INFO L226 Difference]: Without dead ends: 66864 [2019-09-08 07:30:43,663 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:30:43,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66864 states. [2019-09-08 07:30:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66864 to 66712. [2019-09-08 07:30:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66712 states. [2019-09-08 07:30:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66712 states to 66712 states and 109154 transitions. [2019-09-08 07:30:45,647 INFO L78 Accepts]: Start accepts. Automaton has 66712 states and 109154 transitions. Word has length 239 [2019-09-08 07:30:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:45,648 INFO L475 AbstractCegarLoop]: Abstraction has 66712 states and 109154 transitions. [2019-09-08 07:30:45,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:30:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 66712 states and 109154 transitions. [2019-09-08 07:30:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:30:45,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:45,659 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:30:45,660 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:45,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1970730483, now seen corresponding path program 1 times [2019-09-08 07:30:45,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:45,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:45,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:45,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:45,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:45,937 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,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:45,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:30:45,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:30:45,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:30:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:30:45,940 INFO L87 Difference]: Start difference. First operand 66712 states and 109154 transitions. Second operand 6 states. [2019-09-08 07:30:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:54,440 INFO L93 Difference]: Finished difference Result 302620 states and 494792 transitions. [2019-09-08 07:30:54,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:30:54,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 07:30:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:55,279 INFO L225 Difference]: With dead ends: 302620 [2019-09-08 07:30:55,279 INFO L226 Difference]: Without dead ends: 236460 [2019-09-08 07:30:55,485 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:30:55,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236460 states. [2019-09-08 07:31:02,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236460 to 169720. [2019-09-08 07:31:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169720 states. [2019-09-08 07:31:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169720 states to 169720 states and 276953 transitions. [2019-09-08 07:31:03,034 INFO L78 Accepts]: Start accepts. Automaton has 169720 states and 276953 transitions. Word has length 240 [2019-09-08 07:31:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:31:03,034 INFO L475 AbstractCegarLoop]: Abstraction has 169720 states and 276953 transitions. [2019-09-08 07:31:03,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:31:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 169720 states and 276953 transitions. [2019-09-08 07:31:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 07:31:03,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:31:03,045 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:31:03,045 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:31:03,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:31:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1025117066, now seen corresponding path program 1 times [2019-09-08 07:31:03,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:31:03,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:31:03,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:03,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:31:03,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:31:03,486 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:03,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:31:03,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:31:03,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:31:03,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:31:03,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:31:03,488 INFO L87 Difference]: Start difference. First operand 169720 states and 276953 transitions. Second operand 13 states. [2019-09-08 07:31:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:31:24,779 INFO L93 Difference]: Finished difference Result 290738 states and 475117 transitions. [2019-09-08 07:31:24,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 07:31:24,779 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 242 [2019-09-08 07:31:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:31:25,465 INFO L225 Difference]: With dead ends: 290738 [2019-09-08 07:31:25,465 INFO L226 Difference]: Without dead ends: 256896 [2019-09-08 07:31:25,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 07:31:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256896 states. [2019-09-08 07:31:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256896 to 233854. [2019-09-08 07:31:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233854 states. [2019-09-08 07:31:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233854 states to 233854 states and 382326 transitions. [2019-09-08 07:31:36,279 INFO L78 Accepts]: Start accepts. Automaton has 233854 states and 382326 transitions. Word has length 242 [2019-09-08 07:31:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:31:36,280 INFO L475 AbstractCegarLoop]: Abstraction has 233854 states and 382326 transitions. [2019-09-08 07:31:36,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:31:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 233854 states and 382326 transitions. [2019-09-08 07:31:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 07:31:36,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:31:36,291 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:31:36,292 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:31:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:31:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1376652368, now seen corresponding path program 1 times [2019-09-08 07:31:36,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:31:36,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:31:36,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:36,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:31:36,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:31:36,716 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:36,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:31:36,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:31:36,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:31:36,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:31:36,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:31:36,718 INFO L87 Difference]: Start difference. First operand 233854 states and 382326 transitions. Second operand 13 states. [2019-09-08 07:31:44,021 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-08 07:32:00,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:32:00,566 INFO L93 Difference]: Finished difference Result 374165 states and 613906 transitions. [2019-09-08 07:32:00,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 07:32:00,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 242 [2019-09-08 07:32:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:32:01,575 INFO L225 Difference]: With dead ends: 374165 [2019-09-08 07:32:01,575 INFO L226 Difference]: Without dead ends: 307446 [2019-09-08 07:32:01,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 07:32:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307446 states. [2019-09-08 07:32:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307446 to 265306. [2019-09-08 07:32:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265306 states. [2019-09-08 07:32:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265306 states to 265306 states and 434221 transitions. [2019-09-08 07:32:12,018 INFO L78 Accepts]: Start accepts. Automaton has 265306 states and 434221 transitions. Word has length 242 [2019-09-08 07:32:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:32:12,019 INFO L475 AbstractCegarLoop]: Abstraction has 265306 states and 434221 transitions. [2019-09-08 07:32:12,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:32:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 265306 states and 434221 transitions. [2019-09-08 07:32:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 07:32:12,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:32:12,030 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:32:12,031 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:32:12,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:32:12,031 INFO L82 PathProgramCache]: Analyzing trace with hash -694496930, now seen corresponding path program 1 times [2019-09-08 07:32:12,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:32:12,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:32:12,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:32:12,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:32:12,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:32:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:32:12,393 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:32:12,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:32:12,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:32:12,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:32:12,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:32:12,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:32:12,397 INFO L87 Difference]: Start difference. First operand 265306 states and 434221 transitions. Second operand 13 states. [2019-09-08 07:32:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:32:38,048 INFO L93 Difference]: Finished difference Result 427123 states and 700435 transitions. [2019-09-08 07:32:38,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 07:32:38,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 242 [2019-09-08 07:32:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:32:38,958 INFO L225 Difference]: With dead ends: 427123 [2019-09-08 07:32:38,958 INFO L226 Difference]: Without dead ends: 332291 [2019-09-08 07:32:39,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2105 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1095, Invalid=4757, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 07:32:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332291 states. [2019-09-08 07:32:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332291 to 287769. [2019-09-08 07:32:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287769 states. [2019-09-08 07:32:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287769 states to 287769 states and 471387 transitions. [2019-09-08 07:32:54,352 INFO L78 Accepts]: Start accepts. Automaton has 287769 states and 471387 transitions. Word has length 242 [2019-09-08 07:32:54,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:32:54,353 INFO L475 AbstractCegarLoop]: Abstraction has 287769 states and 471387 transitions. [2019-09-08 07:32:54,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:32:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 287769 states and 471387 transitions. [2019-09-08 07:32:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 07:32:54,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:32:54,364 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:32:54,364 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:32:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:32:54,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2014276523, now seen corresponding path program 1 times [2019-09-08 07:32:54,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:32:54,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:32:54,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:32:54,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:32:54,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:32:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:32:54,523 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:32:54,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:32:54,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:32:54,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:32:54,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:32:54,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:32:54,525 INFO L87 Difference]: Start difference. First operand 287769 states and 471387 transitions. Second operand 4 states. [2019-09-08 07:33:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:33:13,890 INFO L93 Difference]: Finished difference Result 1045546 states and 1722304 transitions. [2019-09-08 07:33:13,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:33:13,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-08 07:33:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:33:16,854 INFO L225 Difference]: With dead ends: 1045546 [2019-09-08 07:33:16,854 INFO L226 Difference]: Without dead ends: 758329 [2019-09-08 07:33:17,239 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:33:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758329 states. [2019-09-08 07:34:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758329 to 754041. [2019-09-08 07:34:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754041 states. [2019-09-08 07:34:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754041 states to 754041 states and 1230443 transitions. [2019-09-08 07:34:04,172 INFO L78 Accepts]: Start accepts. Automaton has 754041 states and 1230443 transitions. Word has length 242 [2019-09-08 07:34:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:34:04,173 INFO L475 AbstractCegarLoop]: Abstraction has 754041 states and 1230443 transitions. [2019-09-08 07:34:04,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:34:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 754041 states and 1230443 transitions. [2019-09-08 07:34:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 07:34:04,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:34:04,181 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:34:04,181 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:34:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:34:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1607107123, now seen corresponding path program 1 times [2019-09-08 07:34:04,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:34:04,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:34:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:34:04,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:34:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:34:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:34:04,555 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:34:04,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:34:04,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 07:34:04,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:34:04,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:34:04,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:34:04,558 INFO L87 Difference]: Start difference. First operand 754041 states and 1230443 transitions. Second operand 14 states. [2019-09-08 07:35:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:34,768 INFO L93 Difference]: Finished difference Result 2364708 states and 3962942 transitions. [2019-09-08 07:35:34,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 07:35:34,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 243 [2019-09-08 07:35:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:43,795 INFO L225 Difference]: With dead ends: 2364708 [2019-09-08 07:35:43,795 INFO L226 Difference]: Without dead ends: 1878891 [2019-09-08 07:35:46,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1420, Invalid=5720, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 07:35:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878891 states.