java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:21:44,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:21:44,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:21:44,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:21:44,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:21:44,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:21:44,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:21:44,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:21:44,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:21:44,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:21:44,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:21:44,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:21:44,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:21:44,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:21:44,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:21:44,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:21:44,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:21:44,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:21:44,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:21:44,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:21:44,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:21:44,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:21:44,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:21:44,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:21:44,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:21:44,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:21:44,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:21:44,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:21:44,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:21:44,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:21:44,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:21:44,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:21:44,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:21:44,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:21:44,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:21:44,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:21:44,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:21:44,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:21:44,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:21:44,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:21:44,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:21:44,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 08:21:44,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:21:44,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:21:44,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:21:44,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:21:44,724 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:21:44,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:21:44,724 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:21:44,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:21:44,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:21:44,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:21:44,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:21:44,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:21:44,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:21:44,726 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:21:44,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:21:44,726 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:21:44,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:21:44,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:21:44,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:21:44,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:21:44,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:21:44,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:21:44,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:21:44,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:21:44,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:21:44,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:21:44,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:21:44,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:21:44,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:21:44,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:21:44,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:21:44,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:21:44,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:21:44,775 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:21:44,776 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c [2019-09-08 08:21:44,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220e9e87d/0125054da31f40569431cbb65b3a8738/FLAGe4686a6f8 [2019-09-08 08:21:45,429 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:21:45,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c [2019-09-08 08:21:45,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220e9e87d/0125054da31f40569431cbb65b3a8738/FLAGe4686a6f8 [2019-09-08 08:21:45,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220e9e87d/0125054da31f40569431cbb65b3a8738 [2019-09-08 08:21:45,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:21:45,673 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:21:45,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:21:45,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:21:45,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:21:45,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:21:45" (1/1) ... [2019-09-08 08:21:45,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d1615c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:45, skipping insertion in model container [2019-09-08 08:21:45,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:21:45" (1/1) ... [2019-09-08 08:21:45,691 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:21:45,767 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:21:46,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:21:46,439 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:21:46,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:21:46,593 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:21:46,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:46 WrapperNode [2019-09-08 08:21:46,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:21:46,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:21:46,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:21:46,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:21:46,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:46" (1/1) ... [2019-09-08 08:21:46,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:46" (1/1) ... [2019-09-08 08:21:46,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:46" (1/1) ... [2019-09-08 08:21:46,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:46" (1/1) ... [2019-09-08 08:21:46,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:46" (1/1) ... [2019-09-08 08:21:46,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:46" (1/1) ... [2019-09-08 08:21:46,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:46" (1/1) ... [2019-09-08 08:21:46,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:21:46,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:21:46,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:21:46,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:21:46,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:21:46,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:21:46,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:21:46,842 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:21:46,842 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:21:46,842 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:21:46,842 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:21:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 08:21:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:21:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:21:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:21:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:21:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:21:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:21:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:21:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:21:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:21:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:21:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:21:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:21:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:21:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:21:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:21:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 08:21:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:21:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:21:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:21:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:21:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:21:49,411 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:21:49,411 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:21:49,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:21:49 BoogieIcfgContainer [2019-09-08 08:21:49,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:21:49,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:21:49,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:21:49,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:21:49,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:21:45" (1/3) ... [2019-09-08 08:21:49,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a278f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:21:49, skipping insertion in model container [2019-09-08 08:21:49,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:46" (2/3) ... [2019-09-08 08:21:49,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a278f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:21:49, skipping insertion in model container [2019-09-08 08:21:49,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:21:49" (3/3) ... [2019-09-08 08:21:49,422 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c [2019-09-08 08:21:49,432 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:21:49,442 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:21:49,459 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:21:49,499 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:21:49,500 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:21:49,500 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:21:49,501 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:21:49,501 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:21:49,501 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:21:49,501 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:21:49,501 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:21:49,501 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:21:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states. [2019-09-08 08:21:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 08:21:49,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:49,566 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] [2019-09-08 08:21:49,568 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:49,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1475452421, now seen corresponding path program 1 times [2019-09-08 08:21:49,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:49,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:49,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:21:50,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:50,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:21:50,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:21:50,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:21:50,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:21:50,363 INFO L87 Difference]: Start difference. First operand 747 states. Second operand 5 states. [2019-09-08 08:21:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:50,719 INFO L93 Difference]: Finished difference Result 961 states and 1699 transitions. [2019-09-08 08:21:50,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:21:50,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-09-08 08:21:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:50,802 INFO L225 Difference]: With dead ends: 961 [2019-09-08 08:21:50,802 INFO L226 Difference]: Without dead ends: 742 [2019-09-08 08:21:50,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:21:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-08 08:21:50,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2019-09-08 08:21:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-09-08 08:21:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1296 transitions. [2019-09-08 08:21:50,920 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1296 transitions. Word has length 181 [2019-09-08 08:21:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:50,921 INFO L475 AbstractCegarLoop]: Abstraction has 742 states and 1296 transitions. [2019-09-08 08:21:50,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:21:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1296 transitions. [2019-09-08 08:21:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 08:21:50,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:50,930 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] [2019-09-08 08:21:50,930 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:50,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:50,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1386697677, now seen corresponding path program 1 times [2019-09-08 08:21:50,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:50,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:50,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:50,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:50,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:21:51,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:51,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:21:51,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:21:51,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:21:51,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:21:51,216 INFO L87 Difference]: Start difference. First operand 742 states and 1296 transitions. Second operand 5 states. [2019-09-08 08:21:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:54,058 INFO L93 Difference]: Finished difference Result 1150 states and 1967 transitions. [2019-09-08 08:21:54,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:21:54,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-08 08:21:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:54,068 INFO L225 Difference]: With dead ends: 1150 [2019-09-08 08:21:54,068 INFO L226 Difference]: Without dead ends: 945 [2019-09-08 08:21:54,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:21:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-08 08:21:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 933. [2019-09-08 08:21:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-09-08 08:21:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1606 transitions. [2019-09-08 08:21:54,132 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1606 transitions. Word has length 225 [2019-09-08 08:21:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:54,135 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1606 transitions. [2019-09-08 08:21:54,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:21:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1606 transitions. [2019-09-08 08:21:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 08:21:54,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:54,145 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] [2019-09-08 08:21:54,146 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:54,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:54,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1222733989, now seen corresponding path program 1 times [2019-09-08 08:21:54,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:54,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:54,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:54,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:54,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:21:54,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:54,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:21:54,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:21:54,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:21:54,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:21:54,503 INFO L87 Difference]: Start difference. First operand 933 states and 1606 transitions. Second operand 5 states. [2019-09-08 08:21:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:57,303 INFO L93 Difference]: Finished difference Result 1711 states and 2874 transitions. [2019-09-08 08:21:57,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:21:57,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2019-09-08 08:21:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:57,319 INFO L225 Difference]: With dead ends: 1711 [2019-09-08 08:21:57,320 INFO L226 Difference]: Without dead ends: 1315 [2019-09-08 08:21:57,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:21:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2019-09-08 08:21:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1307. [2019-09-08 08:21:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2019-09-08 08:21:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 2214 transitions. [2019-09-08 08:21:57,421 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 2214 transitions. Word has length 229 [2019-09-08 08:21:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:57,422 INFO L475 AbstractCegarLoop]: Abstraction has 1307 states and 2214 transitions. [2019-09-08 08:21:57,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:21:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2214 transitions. [2019-09-08 08:21:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 08:21:57,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:57,429 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] [2019-09-08 08:21:57,430 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:57,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:57,430 INFO L82 PathProgramCache]: Analyzing trace with hash -336596621, now seen corresponding path program 1 times [2019-09-08 08:21:57,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:57,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:57,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:57,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:57,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:21:57,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:57,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:21:57,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:21:57,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:21:57,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:21:57,757 INFO L87 Difference]: Start difference. First operand 1307 states and 2214 transitions. Second operand 5 states. [2019-09-08 08:22:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:00,807 INFO L93 Difference]: Finished difference Result 2819 states and 4668 transitions. [2019-09-08 08:22:00,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:22:00,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-09-08 08:22:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:00,843 INFO L225 Difference]: With dead ends: 2819 [2019-09-08 08:22:00,844 INFO L226 Difference]: Without dead ends: 2049 [2019-09-08 08:22:00,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:22:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2019-09-08 08:22:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2035. [2019-09-08 08:22:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-09-08 08:22:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 3390 transitions. [2019-09-08 08:22:00,993 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 3390 transitions. Word has length 233 [2019-09-08 08:22:00,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:00,994 INFO L475 AbstractCegarLoop]: Abstraction has 2035 states and 3390 transitions. [2019-09-08 08:22:00,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:22:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3390 transitions. [2019-09-08 08:22:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 08:22:01,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:01,006 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 08:22:01,006 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1906468507, now seen corresponding path program 1 times [2019-09-08 08:22:01,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:01,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:01,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:01,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:01,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:22:01,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:01,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:22:01,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:22:01,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:22:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:22:01,347 INFO L87 Difference]: Start difference. First operand 2035 states and 3390 transitions. Second operand 5 states. [2019-09-08 08:22:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:04,035 INFO L93 Difference]: Finished difference Result 4975 states and 8136 transitions. [2019-09-08 08:22:04,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:22:04,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 08:22:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:04,096 INFO L225 Difference]: With dead ends: 4975 [2019-09-08 08:22:04,096 INFO L226 Difference]: Without dead ends: 3477 [2019-09-08 08:22:04,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:22:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2019-09-08 08:22:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3451. [2019-09-08 08:22:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3451 states. [2019-09-08 08:22:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 5662 transitions. [2019-09-08 08:22:04,302 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 5662 transitions. Word has length 237 [2019-09-08 08:22:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:04,303 INFO L475 AbstractCegarLoop]: Abstraction has 3451 states and 5662 transitions. [2019-09-08 08:22:04,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:22:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 5662 transitions. [2019-09-08 08:22:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 08:22:04,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:04,311 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 08:22:04,312 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash 350717107, now seen corresponding path program 1 times [2019-09-08 08:22:04,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:04,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:04,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:04,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:04,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:22:04,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:04,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:22:04,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:22:04,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:22:04,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:22:04,507 INFO L87 Difference]: Start difference. First operand 3451 states and 5662 transitions. Second operand 5 states. [2019-09-08 08:22:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:07,250 INFO L93 Difference]: Finished difference Result 9167 states and 14832 transitions. [2019-09-08 08:22:07,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:22:07,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 241 [2019-09-08 08:22:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:07,285 INFO L225 Difference]: With dead ends: 9167 [2019-09-08 08:22:07,286 INFO L226 Difference]: Without dead ends: 6253 [2019-09-08 08:22:07,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:22:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6253 states. [2019-09-08 08:22:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6253 to 6203. [2019-09-08 08:22:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6203 states. [2019-09-08 08:22:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 10046 transitions. [2019-09-08 08:22:07,540 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 10046 transitions. Word has length 241 [2019-09-08 08:22:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:07,545 INFO L475 AbstractCegarLoop]: Abstraction has 6203 states and 10046 transitions. [2019-09-08 08:22:07,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:22:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 10046 transitions. [2019-09-08 08:22:07,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 08:22:07,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:07,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:22:07,557 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:07,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:07,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1025695397, now seen corresponding path program 1 times [2019-09-08 08:22:07,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:07,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:07,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:07,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:22:08,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:08,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:22:08,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:22:08,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:22:08,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:22:08,067 INFO L87 Difference]: Start difference. First operand 6203 states and 10046 transitions. Second operand 13 states. [2019-09-08 08:22:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:23,092 INFO L93 Difference]: Finished difference Result 46956 states and 76589 transitions. [2019-09-08 08:22:23,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 08:22:23,093 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 245 [2019-09-08 08:22:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:23,356 INFO L225 Difference]: With dead ends: 46956 [2019-09-08 08:22:23,357 INFO L226 Difference]: Without dead ends: 41290 [2019-09-08 08:22:23,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 08:22:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41290 states. [2019-09-08 08:22:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41290 to 37674. [2019-09-08 08:22:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37674 states. [2019-09-08 08:22:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37674 states to 37674 states and 61368 transitions. [2019-09-08 08:22:24,984 INFO L78 Accepts]: Start accepts. Automaton has 37674 states and 61368 transitions. Word has length 245 [2019-09-08 08:22:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:24,985 INFO L475 AbstractCegarLoop]: Abstraction has 37674 states and 61368 transitions. [2019-09-08 08:22:24,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:22:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 37674 states and 61368 transitions. [2019-09-08 08:22:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 08:22:25,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:25,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:22:25,012 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:25,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1549290629, now seen corresponding path program 1 times [2019-09-08 08:22:25,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:25,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:25,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:25,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:25,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:22:25,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:25,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:22:25,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:22:25,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:22:25,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:22:25,366 INFO L87 Difference]: Start difference. First operand 37674 states and 61368 transitions. Second operand 6 states. [2019-09-08 08:22:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:31,482 INFO L93 Difference]: Finished difference Result 96012 states and 156575 transitions. [2019-09-08 08:22:31,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:22:31,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2019-09-08 08:22:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:31,727 INFO L225 Difference]: With dead ends: 96012 [2019-09-08 08:22:31,728 INFO L226 Difference]: Without dead ends: 58875 [2019-09-08 08:22:31,854 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 08:22:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58875 states. [2019-09-08 08:22:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58875 to 55703. [2019-09-08 08:22:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55703 states. [2019-09-08 08:22:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55703 states to 55703 states and 90823 transitions. [2019-09-08 08:22:33,585 INFO L78 Accepts]: Start accepts. Automaton has 55703 states and 90823 transitions. Word has length 246 [2019-09-08 08:22:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:33,586 INFO L475 AbstractCegarLoop]: Abstraction has 55703 states and 90823 transitions. [2019-09-08 08:22:33,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:22:33,586 INFO L276 IsEmpty]: Start isEmpty. Operand 55703 states and 90823 transitions. [2019-09-08 08:22:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 08:22:33,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:33,612 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:22:33,612 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:33,613 INFO L82 PathProgramCache]: Analyzing trace with hash -414166637, now seen corresponding path program 1 times [2019-09-08 08:22:33,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:33,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:33,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:33,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:22:33,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:33,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:22:33,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:22:33,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:22:33,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:22:33,878 INFO L87 Difference]: Start difference. First operand 55703 states and 90823 transitions. Second operand 6 states. [2019-09-08 08:22:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:38,241 INFO L93 Difference]: Finished difference Result 79559 states and 130256 transitions. [2019-09-08 08:22:38,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:22:38,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 247 [2019-09-08 08:22:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:38,555 INFO L225 Difference]: With dead ends: 79559 [2019-09-08 08:22:38,555 INFO L226 Difference]: Without dead ends: 58552 [2019-09-08 08:22:38,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:22:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58552 states. [2019-09-08 08:22:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58552 to 55801. [2019-09-08 08:22:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55801 states. [2019-09-08 08:22:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55801 states to 55801 states and 90787 transitions. [2019-09-08 08:22:40,303 INFO L78 Accepts]: Start accepts. Automaton has 55801 states and 90787 transitions. Word has length 247 [2019-09-08 08:22:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:40,303 INFO L475 AbstractCegarLoop]: Abstraction has 55801 states and 90787 transitions. [2019-09-08 08:22:40,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:22:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 55801 states and 90787 transitions. [2019-09-08 08:22:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 08:22:40,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:40,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:22:40,319 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:40,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:40,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1123406781, now seen corresponding path program 1 times [2019-09-08 08:22:40,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:40,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:40,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:40,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:40,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:22:40,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:40,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:22:40,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:22:40,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:22:40,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:22:40,703 INFO L87 Difference]: Start difference. First operand 55801 states and 90787 transitions. Second operand 13 states. [2019-09-08 08:22:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:59,119 INFO L93 Difference]: Finished difference Result 123985 states and 202032 transitions. [2019-09-08 08:22:59,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 08:22:59,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 247 [2019-09-08 08:22:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:59,564 INFO L225 Difference]: With dead ends: 123985 [2019-09-08 08:22:59,564 INFO L226 Difference]: Without dead ends: 113722 [2019-09-08 08:22:59,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1055, Invalid=4495, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 08:22:59,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113722 states. [2019-09-08 08:23:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113722 to 109992. [2019-09-08 08:23:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109992 states. [2019-09-08 08:23:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109992 states to 109992 states and 179302 transitions. [2019-09-08 08:23:06,261 INFO L78 Accepts]: Start accepts. Automaton has 109992 states and 179302 transitions. Word has length 247 [2019-09-08 08:23:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:23:06,262 INFO L475 AbstractCegarLoop]: Abstraction has 109992 states and 179302 transitions. [2019-09-08 08:23:06,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:23:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 109992 states and 179302 transitions. [2019-09-08 08:23:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 08:23:06,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:23:06,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:23:06,287 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:23:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:23:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash -743652973, now seen corresponding path program 1 times [2019-09-08 08:23:06,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:23:06,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:23:06,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:06,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:23:06,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:23:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:23:06,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:23:06,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:23:06,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:23:06,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:23:06,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:23:06,746 INFO L87 Difference]: Start difference. First operand 109992 states and 179302 transitions. Second operand 13 states. [2019-09-08 08:23:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:23:25,125 INFO L93 Difference]: Finished difference Result 159607 states and 260139 transitions. [2019-09-08 08:23:25,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 08:23:25,126 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 247 [2019-09-08 08:23:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:23:25,519 INFO L225 Difference]: With dead ends: 159607 [2019-09-08 08:23:25,519 INFO L226 Difference]: Without dead ends: 133905 [2019-09-08 08:23:25,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 08:23:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133905 states. [2019-09-08 08:23:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133905 to 123085. [2019-09-08 08:23:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123085 states. [2019-09-08 08:23:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123085 states to 123085 states and 200630 transitions. [2019-09-08 08:23:28,357 INFO L78 Accepts]: Start accepts. Automaton has 123085 states and 200630 transitions. Word has length 247 [2019-09-08 08:23:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:23:28,358 INFO L475 AbstractCegarLoop]: Abstraction has 123085 states and 200630 transitions. [2019-09-08 08:23:28,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:23:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 123085 states and 200630 transitions. [2019-09-08 08:23:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 08:23:28,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:23:28,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:23:28,376 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:23:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:23:28,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2025471165, now seen corresponding path program 1 times [2019-09-08 08:23:28,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:23:28,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:23:28,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:28,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:23:28,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:23:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:23:28,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:23:28,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:23:28,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:23:28,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:23:28,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:23:28,751 INFO L87 Difference]: Start difference. First operand 123085 states and 200630 transitions. Second operand 13 states. [2019-09-08 08:23:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:23:49,848 INFO L93 Difference]: Finished difference Result 203167 states and 331607 transitions. [2019-09-08 08:23:49,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 08:23:49,848 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 247 [2019-09-08 08:23:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:23:50,376 INFO L225 Difference]: With dead ends: 203167 [2019-09-08 08:23:50,376 INFO L226 Difference]: Without dead ends: 162177 [2019-09-08 08:23:50,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1911 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 08:23:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162177 states. [2019-09-08 08:23:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162177 to 144457. [2019-09-08 08:23:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144457 states. [2019-09-08 08:23:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144457 states to 144457 states and 235772 transitions. [2019-09-08 08:23:53,837 INFO L78 Accepts]: Start accepts. Automaton has 144457 states and 235772 transitions. Word has length 247 [2019-09-08 08:23:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:23:53,838 INFO L475 AbstractCegarLoop]: Abstraction has 144457 states and 235772 transitions. [2019-09-08 08:23:53,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:23:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 144457 states and 235772 transitions. [2019-09-08 08:23:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 08:23:53,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:23:53,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:23:53,852 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:23:53,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:23:53,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1188181075, now seen corresponding path program 1 times [2019-09-08 08:23:53,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:23:53,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:23:53,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:53,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:23:53,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:23:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:23:54,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:23:54,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:23:54,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:23:54,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:23:54,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:23:54,320 INFO L87 Difference]: Start difference. First operand 144457 states and 235772 transitions. Second operand 13 states. [2019-09-08 08:24:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:24:15,044 INFO L93 Difference]: Finished difference Result 292312 states and 478026 transitions. [2019-09-08 08:24:15,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 08:24:15,045 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 247 [2019-09-08 08:24:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:24:15,797 INFO L225 Difference]: With dead ends: 292312 [2019-09-08 08:24:15,798 INFO L226 Difference]: Without dead ends: 224017 [2019-09-08 08:24:15,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1027, Invalid=4375, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 08:24:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224017 states. [2019-09-08 08:24:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224017 to 202649. [2019-09-08 08:24:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202649 states. [2019-09-08 08:24:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202649 states to 202649 states and 331810 transitions. [2019-09-08 08:24:24,022 INFO L78 Accepts]: Start accepts. Automaton has 202649 states and 331810 transitions. Word has length 247 [2019-09-08 08:24:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:24:24,023 INFO L475 AbstractCegarLoop]: Abstraction has 202649 states and 331810 transitions. [2019-09-08 08:24:24,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:24:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 202649 states and 331810 transitions. [2019-09-08 08:24:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 08:24:24,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:24:24,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:24:24,038 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:24:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:24:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash -282206126, now seen corresponding path program 1 times [2019-09-08 08:24:24,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:24:24,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:24:24,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:24,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:24:24,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:24:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:24:24,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:24:24,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:24:24,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:24:24,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:24:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:24:24,305 INFO L87 Difference]: Start difference. First operand 202649 states and 331810 transitions. Second operand 6 states. [2019-09-08 08:24:32,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:24:32,914 INFO L93 Difference]: Finished difference Result 469254 states and 767811 transitions. [2019-09-08 08:24:32,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 08:24:32,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 247 [2019-09-08 08:24:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:24:33,675 INFO L225 Difference]: With dead ends: 469254 [2019-09-08 08:24:33,675 INFO L226 Difference]: Without dead ends: 267142 [2019-09-08 08:24:33,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-08 08:24:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267142 states. [2019-09-08 08:24:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267142 to 265371. [2019-09-08 08:24:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265371 states. [2019-09-08 08:24:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265371 states to 265371 states and 434031 transitions. [2019-09-08 08:24:45,107 INFO L78 Accepts]: Start accepts. Automaton has 265371 states and 434031 transitions. Word has length 247 [2019-09-08 08:24:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:24:45,108 INFO L475 AbstractCegarLoop]: Abstraction has 265371 states and 434031 transitions. [2019-09-08 08:24:45,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:24:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 265371 states and 434031 transitions. [2019-09-08 08:24:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 08:24:45,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:24:45,123 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:24:45,124 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:24:45,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:24:45,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1275715620, now seen corresponding path program 1 times [2019-09-08 08:24:45,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:24:45,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:24:45,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:45,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:24:45,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:24:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:24:45,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:24:45,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:24:45,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:24:45,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:24:45,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:24:45,346 INFO L87 Difference]: Start difference. First operand 265371 states and 434031 transitions. Second operand 6 states. [2019-09-08 08:25:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:25:03,208 INFO L93 Difference]: Finished difference Result 790408 states and 1293974 transitions. [2019-09-08 08:25:03,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:25:03,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-08 08:25:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:25:04,688 INFO L225 Difference]: With dead ends: 790408 [2019-09-08 08:25:04,688 INFO L226 Difference]: Without dead ends: 525574 [2019-09-08 08:25:05,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:25:05,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525574 states. [2019-09-08 08:25:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525574 to 523080. [2019-09-08 08:25:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523080 states. [2019-09-08 08:25:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523080 states to 523080 states and 854069 transitions. [2019-09-08 08:25:24,912 INFO L78 Accepts]: Start accepts. Automaton has 523080 states and 854069 transitions. Word has length 248 [2019-09-08 08:25:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:25:24,913 INFO L475 AbstractCegarLoop]: Abstraction has 523080 states and 854069 transitions. [2019-09-08 08:25:24,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:25:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 523080 states and 854069 transitions. [2019-09-08 08:25:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 08:25:24,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:25:24,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:25:24,932 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:25:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:25:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1722151748, now seen corresponding path program 1 times [2019-09-08 08:25:24,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:25:24,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:25:24,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:25:24,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:25:24,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:25:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:25:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:25:32,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:25:32,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 08:25:32,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 08:25:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 08:25:32,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:25:32,451 INFO L87 Difference]: Start difference. First operand 523080 states and 854069 transitions. Second operand 7 states. [2019-09-08 08:25:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:25:48,347 INFO L93 Difference]: Finished difference Result 964267 states and 1577228 transitions. [2019-09-08 08:25:48,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 08:25:48,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 249 [2019-09-08 08:25:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:25:50,421 INFO L225 Difference]: With dead ends: 964267 [2019-09-08 08:25:50,421 INFO L226 Difference]: Without dead ends: 677992 [2019-09-08 08:25:50,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:25:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677992 states. [2019-09-08 08:26:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677992 to 677208. [2019-09-08 08:26:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677208 states. [2019-09-08 08:26:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677208 states to 677208 states and 1106463 transitions. [2019-09-08 08:26:27,083 INFO L78 Accepts]: Start accepts. Automaton has 677208 states and 1106463 transitions. Word has length 249 [2019-09-08 08:26:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:26:27,084 INFO L475 AbstractCegarLoop]: Abstraction has 677208 states and 1106463 transitions. [2019-09-08 08:26:27,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 08:26:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 677208 states and 1106463 transitions. [2019-09-08 08:26:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 08:26:27,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:26:27,101 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:26:27,101 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:26:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:26:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash -155012485, now seen corresponding path program 1 times [2019-09-08 08:26:27,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:26:27,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:26:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:26:27,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:26:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:26:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:26:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:26:27,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:26:27,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:26:27,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:26:27,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:26:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:26:27,488 INFO L87 Difference]: Start difference. First operand 677208 states and 1106463 transitions. Second operand 6 states. [2019-09-08 08:27:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:27:00,137 INFO L93 Difference]: Finished difference Result 1168025 states and 1946204 transitions. [2019-09-08 08:27:00,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:27:00,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-08 08:27:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:27:02,554 INFO L225 Difference]: With dead ends: 1168025 [2019-09-08 08:27:02,554 INFO L226 Difference]: Without dead ends: 727622 [2019-09-08 08:27:04,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:27:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727622 states. [2019-09-08 08:27:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727622 to 683808. [2019-09-08 08:27:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683808 states. [2019-09-08 08:27:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683808 states to 683808 states and 1116663 transitions. [2019-09-08 08:27:50,299 INFO L78 Accepts]: Start accepts. Automaton has 683808 states and 1116663 transitions. Word has length 249 [2019-09-08 08:27:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:27:50,300 INFO L475 AbstractCegarLoop]: Abstraction has 683808 states and 1116663 transitions. [2019-09-08 08:27:50,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:27:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 683808 states and 1116663 transitions. [2019-09-08 08:27:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 08:27:50,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:27:50,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:27:50,312 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:27:50,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:27:50,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1565641349, now seen corresponding path program 1 times [2019-09-08 08:27:50,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:27:50,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:27:50,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:50,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:27:50,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:27:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:27:50,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:27:50,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:27:50,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:27:50,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:27:50,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:27:50,642 INFO L87 Difference]: Start difference. First operand 683808 states and 1116663 transitions. Second operand 6 states. [2019-09-08 08:28:35,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:28:35,367 INFO L93 Difference]: Finished difference Result 1231989 states and 2047228 transitions. [2019-09-08 08:28:35,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:28:35,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-08 08:28:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:28:38,159 INFO L225 Difference]: With dead ends: 1231989 [2019-09-08 08:28:38,159 INFO L226 Difference]: Without dead ends: 733406 [2019-09-08 08:28:38,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:28:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733406 states. [2019-09-08 08:29:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733406 to 689132. [2019-09-08 08:29:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689132 states. [2019-09-08 08:29:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689132 states to 689132 states and 1124891 transitions. [2019-09-08 08:29:22,783 INFO L78 Accepts]: Start accepts. Automaton has 689132 states and 1124891 transitions. Word has length 249 [2019-09-08 08:29:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:29:22,784 INFO L475 AbstractCegarLoop]: Abstraction has 689132 states and 1124891 transitions. [2019-09-08 08:29:22,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:29:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 689132 states and 1124891 transitions. [2019-09-08 08:29:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 08:29:22,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:29:22,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:29:22,788 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:29:22,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:29:22,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1818624965, now seen corresponding path program 1 times [2019-09-08 08:29:22,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:29:22,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:29:22,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:29:22,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:29:22,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:29:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:29:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:29:23,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:29:23,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:29:23,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:29:23,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:29:23,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:29:23,192 INFO L87 Difference]: Start difference. First operand 689132 states and 1124891 transitions. Second operand 6 states. [2019-09-08 08:29:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:29:55,589 INFO L93 Difference]: Finished difference Result 1261613 states and 2094111 transitions. [2019-09-08 08:29:55,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:29:55,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-08 08:29:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:29:58,605 INFO L225 Difference]: With dead ends: 1261613 [2019-09-08 08:29:58,606 INFO L226 Difference]: Without dead ends: 752746 [2019-09-08 08:29:59,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:29:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752746 states. [2019-09-08 08:30:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752746 to 700704. [2019-09-08 08:30:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700704 states. [2019-09-08 08:30:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700704 states to 700704 states and 1143827 transitions. [2019-09-08 08:30:41,678 INFO L78 Accepts]: Start accepts. Automaton has 700704 states and 1143827 transitions. Word has length 249 [2019-09-08 08:30:41,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:30:41,678 INFO L475 AbstractCegarLoop]: Abstraction has 700704 states and 1143827 transitions. [2019-09-08 08:30:41,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:30:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 700704 states and 1143827 transitions. [2019-09-08 08:30:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 08:30:41,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:30:41,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:30:41,682 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:30:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:30:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2061423799, now seen corresponding path program 1 times [2019-09-08 08:30:41,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:30:41,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:30:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:30:41,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:30:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:30:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:30:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:30:41,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:30:41,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:30:41,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:30:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:30:41,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:30:41,881 INFO L87 Difference]: Start difference. First operand 700704 states and 1143827 transitions. Second operand 6 states. [2019-09-08 08:31:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:31:29,294 INFO L93 Difference]: Finished difference Result 2090725 states and 3417805 transitions. [2019-09-08 08:31:29,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:31:29,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-08 08:31:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:31:47,077 INFO L225 Difference]: With dead ends: 2090725 [2019-09-08 08:31:47,077 INFO L226 Difference]: Without dead ends: 1390558 [2019-09-08 08:31:47,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:31:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390558 states.