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_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:30:17,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:30:17,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:30:17,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:30:17,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:30:17,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:30:17,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:30:17,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:30:17,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:30:17,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:30:17,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:30:17,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:30:17,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:30:17,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:30:17,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:30:17,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:30:17,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:30:17,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:30:17,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:30:17,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:30:17,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:30:17,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:30:17,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:30:17,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:30:17,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:30:17,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:30:17,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:30:17,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:30:17,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:30:17,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:30:17,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:30:17,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:30:17,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:30:17,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:30:17,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:30:17,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:30:17,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:30:17,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:30:17,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:30:17,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:30:17,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:30:17,594 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:17,623 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:30:17,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:30:17,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:30:17,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:30:17,631 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:30:17,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:30:17,632 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:30:17,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:30:17,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:30:17,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:30:17,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:30:17,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:30:17,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:30:17,633 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:30:17,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:30:17,633 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:30:17,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:30:17,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:30:17,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:30:17,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:30:17,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:30:17,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:30:17,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:30:17,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:30:17,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:30:17,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:30:17,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:30:17,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:30:17,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:30:17,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:30:17,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:30:17,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:30:17,688 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:30:17,689 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:30:17,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 07:30:17,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d18a77f6e/a02b4dd9fa924c1a932f9a491f3f8be2/FLAG711670b6b [2019-09-08 07:30:18,332 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:30:18,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 07:30:18,357 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d18a77f6e/a02b4dd9fa924c1a932f9a491f3f8be2/FLAG711670b6b [2019-09-08 07:30:18,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d18a77f6e/a02b4dd9fa924c1a932f9a491f3f8be2 [2019-09-08 07:30:18,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:30:18,569 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:30:18,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:30:18,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:30:18,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:30:18,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:30:18" (1/1) ... [2019-09-08 07:30:18,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69aee768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:18, skipping insertion in model container [2019-09-08 07:30:18,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:30:18" (1/1) ... [2019-09-08 07:30:18,583 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:30:18,661 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:30:19,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:30:19,283 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:30:19,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:30:19,490 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:30:19,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:19 WrapperNode [2019-09-08 07:30:19,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:30:19,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:30:19,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:30:19,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:30:19,507 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:19" (1/1) ... [2019-09-08 07:30:19,508 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:19" (1/1) ... [2019-09-08 07:30:19,534 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:19" (1/1) ... [2019-09-08 07:30:19,535 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:19" (1/1) ... [2019-09-08 07:30:19,618 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:19" (1/1) ... [2019-09-08 07:30:19,652 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:19" (1/1) ... [2019-09-08 07:30:19,660 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:19" (1/1) ... [2019-09-08 07:30:19,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:30:19,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:30:19,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:30:19,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:30:19,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30: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 07:30:19,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:30:19,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:30:19,765 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:30:19,766 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:30:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:30:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 07:30:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 07:30:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:30:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:30:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:30:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:30:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:30:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:30:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 07:30:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:30:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:30:19,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:30:19,773 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:30:19,773 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:30:19,774 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:30:19,774 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:30:19,774 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:30:19,774 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 07:30:19,774 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 07:30:19,775 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:30:19,775 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:30:19,775 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:30:19,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:30:19,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:30:22,009 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:30:22,009 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:30:22,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:30:22 BoogieIcfgContainer [2019-09-08 07:30:22,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:30:22,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:30:22,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:30:22,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:30:22,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:30:18" (1/3) ... [2019-09-08 07:30:22,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571e68df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:30:22, skipping insertion in model container [2019-09-08 07:30:22,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:30:19" (2/3) ... [2019-09-08 07:30:22,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571e68df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:30:22, skipping insertion in model container [2019-09-08 07:30:22,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:30:22" (3/3) ... [2019-09-08 07:30:22,023 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 07:30:22,033 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:30:22,044 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:30:22,061 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:30:22,110 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:30:22,111 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:30:22,111 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:30:22,111 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:30:22,111 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:30:22,111 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:30:22,111 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:30:22,111 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:30:22,112 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:30:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states. [2019-09-08 07:30:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 07:30:22,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:22,175 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:22,177 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:22,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:22,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1458522874, now seen corresponding path program 1 times [2019-09-08 07:30:22,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:22,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:22,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:22,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:22,953 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,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:22,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:30:22,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:30:22,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:30:22,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:30:22,979 INFO L87 Difference]: Start difference. First operand 731 states. Second operand 5 states. [2019-09-08 07:30:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:23,302 INFO L93 Difference]: Finished difference Result 909 states and 1623 transitions. [2019-09-08 07:30:23,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:30:23,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 07:30:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:23,328 INFO L225 Difference]: With dead ends: 909 [2019-09-08 07:30:23,328 INFO L226 Difference]: Without dead ends: 726 [2019-09-08 07:30:23,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:30:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-08 07:30:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2019-09-08 07:30:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-08 07:30:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1260 transitions. [2019-09-08 07:30:23,478 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1260 transitions. Word has length 176 [2019-09-08 07:30:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:23,479 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1260 transitions. [2019-09-08 07:30:23,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:30:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1260 transitions. [2019-09-08 07:30:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 07:30:23,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:23,489 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:23,489 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:23,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1878998709, now seen corresponding path program 1 times [2019-09-08 07:30:23,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:23,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:23,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:23,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:23,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:24,291 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:24,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:24,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:30:24,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:30:24,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:30:24,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:30:24,297 INFO L87 Difference]: Start difference. First operand 726 states and 1260 transitions. Second operand 13 states. [2019-09-08 07:30:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:37,513 INFO L93 Difference]: Finished difference Result 2876 states and 4859 transitions. [2019-09-08 07:30:37,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 07:30:37,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 235 [2019-09-08 07:30:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:37,533 INFO L225 Difference]: With dead ends: 2876 [2019-09-08 07:30:37,534 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 07:30:37,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=631, Invalid=2125, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 07:30:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 07:30:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1950. [2019-09-08 07:30:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-09-08 07:30:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 3302 transitions. [2019-09-08 07:30:37,729 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 3302 transitions. Word has length 235 [2019-09-08 07:30:37,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:37,735 INFO L475 AbstractCegarLoop]: Abstraction has 1950 states and 3302 transitions. [2019-09-08 07:30:37,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:30:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 3302 transitions. [2019-09-08 07:30:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 07:30:37,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:37,745 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:37,745 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash 943582996, now seen corresponding path program 1 times [2019-09-08 07:30:37,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:37,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:37,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:37,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:37,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:38,190 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:38,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:38,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:30:38,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:30:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:30:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:30:38,192 INFO L87 Difference]: Start difference. First operand 1950 states and 3302 transitions. Second operand 6 states. [2019-09-08 07:30:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:42,342 INFO L93 Difference]: Finished difference Result 4774 states and 8003 transitions. [2019-09-08 07:30:42,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:30:42,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2019-09-08 07:30:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:42,375 INFO L225 Difference]: With dead ends: 4774 [2019-09-08 07:30:42,375 INFO L226 Difference]: Without dead ends: 3376 [2019-09-08 07:30:42,387 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:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2019-09-08 07:30:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3195. [2019-09-08 07:30:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-09-08 07:30:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 5365 transitions. [2019-09-08 07:30:42,582 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 5365 transitions. Word has length 236 [2019-09-08 07:30:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:42,583 INFO L475 AbstractCegarLoop]: Abstraction has 3195 states and 5365 transitions. [2019-09-08 07:30:42,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:30:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 5365 transitions. [2019-09-08 07:30:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 07:30:42,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:42,596 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:42,597 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:42,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1802382302, now seen corresponding path program 1 times [2019-09-08 07:30:42,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:42,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:42,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:42,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:42,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:43,199 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:43,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:43,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:30:43,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:30:43,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:30:43,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:30:43,202 INFO L87 Difference]: Start difference. First operand 3195 states and 5365 transitions. Second operand 6 states. [2019-09-08 07:30:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:47,269 INFO L93 Difference]: Finished difference Result 8904 states and 14829 transitions. [2019-09-08 07:30:47,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:30:47,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-08 07:30:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:47,303 INFO L225 Difference]: With dead ends: 8904 [2019-09-08 07:30:47,304 INFO L226 Difference]: Without dead ends: 6261 [2019-09-08 07:30:47,311 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:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6261 states. [2019-09-08 07:30:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6261 to 5347. [2019-09-08 07:30:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5347 states. [2019-09-08 07:30:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 8908 transitions. [2019-09-08 07:30:47,531 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 8908 transitions. Word has length 237 [2019-09-08 07:30:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:47,532 INFO L475 AbstractCegarLoop]: Abstraction has 5347 states and 8908 transitions. [2019-09-08 07:30:47,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:30:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 8908 transitions. [2019-09-08 07:30:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 07:30:47,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:47,541 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:47,541 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:47,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:47,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1079645557, now seen corresponding path program 1 times [2019-09-08 07:30:47,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:47,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:47,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:47,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:47,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:47,888 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:47,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:47,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:30:47,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:30:47,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:30:47,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:30:47,891 INFO L87 Difference]: Start difference. First operand 5347 states and 8908 transitions. Second operand 6 states. [2019-09-08 07:30:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:51,770 INFO L93 Difference]: Finished difference Result 20795 states and 34436 transitions. [2019-09-08 07:30:51,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:30:51,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2019-09-08 07:30:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:51,860 INFO L225 Difference]: With dead ends: 20795 [2019-09-08 07:30:51,860 INFO L226 Difference]: Without dead ends: 16000 [2019-09-08 07:30:51,882 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:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16000 states. [2019-09-08 07:30:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16000 to 13206. [2019-09-08 07:30:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13206 states. [2019-09-08 07:30:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13206 states to 13206 states and 21807 transitions. [2019-09-08 07:30:52,407 INFO L78 Accepts]: Start accepts. Automaton has 13206 states and 21807 transitions. Word has length 238 [2019-09-08 07:30:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:52,408 INFO L475 AbstractCegarLoop]: Abstraction has 13206 states and 21807 transitions. [2019-09-08 07:30:52,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:30:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 13206 states and 21807 transitions. [2019-09-08 07:30:52,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 07:30:52,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:52,425 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:52,426 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:52,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:52,426 INFO L82 PathProgramCache]: Analyzing trace with hash -201327879, now seen corresponding path program 1 times [2019-09-08 07:30:52,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:52,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:52,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:52,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:52,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:52,853 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:52,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:52,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:30:52,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:30:52,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:30:52,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:30:52,855 INFO L87 Difference]: Start difference. First operand 13206 states and 21807 transitions. Second operand 6 states. [2019-09-08 07:30:58,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:58,459 INFO L93 Difference]: Finished difference Result 75918 states and 125167 transitions. [2019-09-08 07:30:58,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:30:58,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-09-08 07:30:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:58,698 INFO L225 Difference]: With dead ends: 75918 [2019-09-08 07:30:58,699 INFO L226 Difference]: Without dead ends: 63264 [2019-09-08 07:30:58,758 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:58,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63264 states. [2019-09-08 07:31:01,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63264 to 63112. [2019-09-08 07:31:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63112 states. [2019-09-08 07:31:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63112 states to 63112 states and 103754 transitions. [2019-09-08 07:31:01,969 INFO L78 Accepts]: Start accepts. Automaton has 63112 states and 103754 transitions. Word has length 239 [2019-09-08 07:31:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:31:01,974 INFO L475 AbstractCegarLoop]: Abstraction has 63112 states and 103754 transitions. [2019-09-08 07:31:01,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:31:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 63112 states and 103754 transitions. [2019-09-08 07:31:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:31:01,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:31:02,000 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:31:02,000 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:31:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:31:02,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1205031426, now seen corresponding path program 1 times [2019-09-08 07:31:02,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:31:02,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:31:02,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:02,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:31:02,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:31:02,289 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:02,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:31:02,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:31:02,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:31:02,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:31:02,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:31:02,292 INFO L87 Difference]: Start difference. First operand 63112 states and 103754 transitions. Second operand 6 states. [2019-09-08 07:31:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:31:10,766 INFO L93 Difference]: Finished difference Result 286300 states and 470312 transitions. [2019-09-08 07:31:10,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:31:10,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 07:31:10,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:31:11,565 INFO L225 Difference]: With dead ends: 286300 [2019-09-08 07:31:11,565 INFO L226 Difference]: Without dead ends: 223740 [2019-09-08 07:31:11,733 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:31:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223740 states. [2019-09-08 07:31:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223740 to 223338. [2019-09-08 07:31:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223338 states. [2019-09-08 07:31:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223338 states to 223338 states and 366549 transitions. [2019-09-08 07:31:21,877 INFO L78 Accepts]: Start accepts. Automaton has 223338 states and 366549 transitions. Word has length 240 [2019-09-08 07:31:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:31:21,878 INFO L475 AbstractCegarLoop]: Abstraction has 223338 states and 366549 transitions. [2019-09-08 07:31:21,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:31:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 223338 states and 366549 transitions. [2019-09-08 07:31:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:31:21,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:31:21,893 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:31:21,893 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:31:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:31:21,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1944727475, now seen corresponding path program 1 times [2019-09-08 07:31:21,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:31:21,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:31:21,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:21,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:31:21,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:31:22,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:31:22,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:31:22,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:31:22,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:31:22,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:31:22,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:31:22,356 INFO L87 Difference]: Start difference. First operand 223338 states and 366549 transitions. Second operand 13 states. [2019-09-08 07:31:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:31:45,602 INFO L93 Difference]: Finished difference Result 424784 states and 698751 transitions. [2019-09-08 07:31:45,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 07:31:45,602 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2019-09-08 07:31:45,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:31:46,537 INFO L225 Difference]: With dead ends: 424784 [2019-09-08 07:31:46,537 INFO L226 Difference]: Without dead ends: 299126 [2019-09-08 07:31:46,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2102 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1095, Invalid=4757, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 07:31:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299126 states. [2019-09-08 07:31:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299126 to 277932. [2019-09-08 07:31:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277932 states. [2019-09-08 07:31:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277932 states to 277932 states and 456906 transitions. [2019-09-08 07:31:55,410 INFO L78 Accepts]: Start accepts. Automaton has 277932 states and 456906 transitions. Word has length 240 [2019-09-08 07:31:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:31:55,411 INFO L475 AbstractCegarLoop]: Abstraction has 277932 states and 456906 transitions. [2019-09-08 07:31:55,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:31:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 277932 states and 456906 transitions. [2019-09-08 07:31:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:31:55,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:31:55,424 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:31:55,425 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:31:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:31:55,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1172011226, now seen corresponding path program 1 times [2019-09-08 07:31:55,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:31:55,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:31:55,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:55,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:31:55,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:32:00,700 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:00,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:32:00,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:32:00,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:32:00,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:32:00,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:32:00,702 INFO L87 Difference]: Start difference. First operand 277932 states and 456906 transitions. Second operand 13 states. [2019-09-08 07:32:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:32:24,061 INFO L93 Difference]: Finished difference Result 487520 states and 803045 transitions. [2019-09-08 07:32:24,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 07:32:24,062 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2019-09-08 07:32:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:32:24,986 INFO L225 Difference]: With dead ends: 487520 [2019-09-08 07:32:24,986 INFO L226 Difference]: Without dead ends: 369316 [2019-09-08 07:32:25,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1069, Invalid=4631, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 07:32:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369316 states. [2019-09-08 07:32:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369316 to 239721. [2019-09-08 07:32:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239721 states. [2019-09-08 07:32:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239721 states to 239721 states and 394190 transitions. [2019-09-08 07:32:41,349 INFO L78 Accepts]: Start accepts. Automaton has 239721 states and 394190 transitions. Word has length 240 [2019-09-08 07:32:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:32:41,350 INFO L475 AbstractCegarLoop]: Abstraction has 239721 states and 394190 transitions. [2019-09-08 07:32:41,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:32:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 239721 states and 394190 transitions. [2019-09-08 07:32:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:32:41,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:32:41,363 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:32:41,363 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:32:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:32:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash 823250115, now seen corresponding path program 1 times [2019-09-08 07:32:41,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:32:41,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:32:41,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:32:41,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:32:41,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:32:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:32:41,792 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:41,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:32:41,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:32:41,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:32:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:32:41,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:32:41,794 INFO L87 Difference]: Start difference. First operand 239721 states and 394190 transitions. Second operand 13 states. [2019-09-08 07:33:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:33:03,691 INFO L93 Difference]: Finished difference Result 357532 states and 589800 transitions. [2019-09-08 07:33:03,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 07:33:03,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2019-09-08 07:33:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:33:04,459 INFO L225 Difference]: With dead ends: 357532 [2019-09-08 07:33:04,460 INFO L226 Difference]: Without dead ends: 301431 [2019-09-08 07:33:04,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1055, Invalid=4495, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 07:33:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301431 states. [2019-09-08 07:33:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301431 to 278566. [2019-09-08 07:33:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278566 states. [2019-09-08 07:33:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278566 states to 278566 states and 458747 transitions. [2019-09-08 07:33:20,072 INFO L78 Accepts]: Start accepts. Automaton has 278566 states and 458747 transitions. Word has length 240 [2019-09-08 07:33:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:33:20,073 INFO L475 AbstractCegarLoop]: Abstraction has 278566 states and 458747 transitions. [2019-09-08 07:33:20,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:33:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 278566 states and 458747 transitions. [2019-09-08 07:33:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:33:20,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:33:20,085 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:33:20,085 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:33:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:33:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1335725012, now seen corresponding path program 1 times [2019-09-08 07:33:20,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:33:20,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:33:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:33:20,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:33:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:33:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:33:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:33:20,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:33:20,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:33:20,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:33:20,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:33:20,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:33:20,448 INFO L87 Difference]: Start difference. First operand 278566 states and 458747 transitions. Second operand 13 states. [2019-09-08 07:33:32,686 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-09-08 07:33:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:33:43,225 INFO L93 Difference]: Finished difference Result 425689 states and 702786 transitions. [2019-09-08 07:33:43,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 07:33:43,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2019-09-08 07:33:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:33:44,798 INFO L225 Difference]: With dead ends: 425689 [2019-09-08 07:33:44,798 INFO L226 Difference]: Without dead ends: 330187 [2019-09-08 07:33:44,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 07:33:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330187 states. [2019-09-08 07:33:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330187 to 302525. [2019-09-08 07:33:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302525 states. [2019-09-08 07:33:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302525 states to 302525 states and 498611 transitions. [2019-09-08 07:33:58,016 INFO L78 Accepts]: Start accepts. Automaton has 302525 states and 498611 transitions. Word has length 240 [2019-09-08 07:33:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:33:58,016 INFO L475 AbstractCegarLoop]: Abstraction has 302525 states and 498611 transitions. [2019-09-08 07:33:58,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:33:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 302525 states and 498611 transitions. [2019-09-08 07:33:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:33:58,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:33:58,026 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:33:58,026 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:33:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:33:58,026 INFO L82 PathProgramCache]: Analyzing trace with hash 850596241, now seen corresponding path program 1 times [2019-09-08 07:33:58,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:33:58,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:33:58,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:33:58,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:33:58,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:33:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:33:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:33:58,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:33:58,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:33:58,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:33:58,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:33:58,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:33:58,366 INFO L87 Difference]: Start difference. First operand 302525 states and 498611 transitions. Second operand 13 states. [2019-09-08 07:34:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:34:23,771 INFO L93 Difference]: Finished difference Result 486860 states and 805562 transitions. [2019-09-08 07:34:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 07:34:23,772 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2019-09-08 07:34:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:34:24,581 INFO L225 Difference]: With dead ends: 486860 [2019-09-08 07:34:24,581 INFO L226 Difference]: Without dead ends: 389807 [2019-09-08 07:34:24,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 07:34:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389807 states. [2019-09-08 07:34:34,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389807 to 329689. [2019-09-08 07:34:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329689 states. [2019-09-08 07:34:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329689 states to 329689 states and 544354 transitions. [2019-09-08 07:34:44,066 INFO L78 Accepts]: Start accepts. Automaton has 329689 states and 544354 transitions. Word has length 240 [2019-09-08 07:34:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:34:44,067 INFO L475 AbstractCegarLoop]: Abstraction has 329689 states and 544354 transitions. [2019-09-08 07:34:44,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:34:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 329689 states and 544354 transitions. [2019-09-08 07:34:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 07:34:44,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:34:44,074 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] [2019-09-08 07:34:44,074 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:34:44,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:34:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash -338319474, now seen corresponding path program 1 times [2019-09-08 07:34:44,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:34:44,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:34:44,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:34:44,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:34:44,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:34:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:34:44,440 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:44,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:34:44,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 07:34:44,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:34:44,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:34:44,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:34:44,442 INFO L87 Difference]: Start difference. First operand 329689 states and 544354 transitions. Second operand 14 states. [2019-09-08 07:35:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:35:31,701 INFO L93 Difference]: Finished difference Result 915580 states and 1549702 transitions. [2019-09-08 07:35:31,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 07:35:31,702 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 241 [2019-09-08 07:35:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:35:34,319 INFO L225 Difference]: With dead ends: 915580 [2019-09-08 07:35:34,320 INFO L226 Difference]: Without dead ends: 786172 [2019-09-08 07:35:34,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2600 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1420, Invalid=5720, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 07:35:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786172 states. [2019-09-08 07:36:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786172 to 711655. [2019-09-08 07:36:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711655 states. [2019-09-08 07:36:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711655 states to 711655 states and 1183148 transitions. [2019-09-08 07:36:07,769 INFO L78 Accepts]: Start accepts. Automaton has 711655 states and 1183148 transitions. Word has length 241 [2019-09-08 07:36:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:36:07,770 INFO L475 AbstractCegarLoop]: Abstraction has 711655 states and 1183148 transitions. [2019-09-08 07:36:07,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 07:36:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 711655 states and 1183148 transitions. [2019-09-08 07:36:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 07:36:07,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:36:07,783 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] [2019-09-08 07:36:07,783 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:36:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:36:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash 85327248, now seen corresponding path program 1 times [2019-09-08 07:36:07,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:36:07,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:36:07,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:36:07,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:36:07,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:36:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:36:08,054 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:36:08,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:36:08,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:36:08,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:36:08,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:36:08,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:36:08,056 INFO L87 Difference]: Start difference. First operand 711655 states and 1183148 transitions. Second operand 7 states. [2019-09-08 07:36:53,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:36:53,036 INFO L93 Difference]: Finished difference Result 1569671 states and 2615884 transitions. [2019-09-08 07:36:53,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:36:53,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 241 [2019-09-08 07:36:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:36:56,837 INFO L225 Difference]: With dead ends: 1569671 [2019-09-08 07:36:56,838 INFO L226 Difference]: Without dead ends: 988758 [2019-09-08 07:36:57,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:36:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988758 states. [2019-09-08 07:38:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988758 to 987131. [2019-09-08 07:38:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987131 states. [2019-09-08 07:38:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987131 states to 987131 states and 1643492 transitions. [2019-09-08 07:38:04,121 INFO L78 Accepts]: Start accepts. Automaton has 987131 states and 1643492 transitions. Word has length 241 [2019-09-08 07:38:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:38:04,121 INFO L475 AbstractCegarLoop]: Abstraction has 987131 states and 1643492 transitions. [2019-09-08 07:38:04,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:38:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 987131 states and 1643492 transitions. [2019-09-08 07:38:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 07:38:04,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:38:04,134 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:38:04,135 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:38:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:38:04,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1518032058, now seen corresponding path program 1 times [2019-09-08 07:38:04,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:38:04,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:38:04,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:38:04,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:38:04,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:38:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:38:04,325 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:38:04,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:38:04,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:38:04,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:38:04,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:38:04,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:38:04,327 INFO L87 Difference]: Start difference. First operand 987131 states and 1643492 transitions. Second operand 4 states. [2019-09-08 07:39:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:39:40,731 INFO L93 Difference]: Finished difference Result 3486079 states and 5826718 transitions. [2019-09-08 07:39:40,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:39:40,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-08 07:39:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:39:51,460 INFO L225 Difference]: With dead ends: 3486079 [2019-09-08 07:39:51,460 INFO L226 Difference]: Without dead ends: 2500010 [2019-09-08 07:39:52,920 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:40:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500010 states.