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-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:51:10,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:51:10,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:51:10,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:51:10,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:51:10,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:51:10,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:51:10,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:51:10,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:51:10,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:51:10,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:51:10,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:51:10,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:51:10,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:51:10,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:51:10,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:51:10,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:51:10,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:51:10,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:51:10,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:51:10,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:51:10,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:51:10,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:51:10,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:51:10,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:51:10,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:51:10,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:51:10,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:51:10,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:51:10,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:51:10,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:51:10,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:51:10,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:51:10,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:51:10,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:51:10,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:51:10,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:51:10,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:51:10,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:51:10,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:51:10,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:51:10,668 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 09:51:10,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:51:10,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:51:10,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:51:10,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:51:10,685 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:51:10,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:51:10,685 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:51:10,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:51:10,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:51:10,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:51:10,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:51:10,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:51:10,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:51:10,687 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:51:10,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:51:10,687 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:51:10,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:51:10,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:51:10,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:51:10,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:51:10,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:51:10,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:51:10,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:51:10,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:51:10,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:51:10,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:51:10,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:51:10,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:51:10,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:51:10,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:51:10,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:51:10,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:51:10,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:51:10,735 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:51:10,736 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:51:10,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb73b01ce/bb64ebce75fa4bc88423d22fc7f929dc/FLAG769340b83 [2019-09-08 09:51:11,370 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:51:11,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:51:11,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb73b01ce/bb64ebce75fa4bc88423d22fc7f929dc/FLAG769340b83 [2019-09-08 09:51:11,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb73b01ce/bb64ebce75fa4bc88423d22fc7f929dc [2019-09-08 09:51:11,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:51:11,591 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:51:11,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:51:11,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:51:11,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:51:11,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:51:11" (1/1) ... [2019-09-08 09:51:11,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34957a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:11, skipping insertion in model container [2019-09-08 09:51:11,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:51:11" (1/1) ... [2019-09-08 09:51:11,608 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:51:11,699 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:51:12,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:51:12,726 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:51:13,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:51:13,075 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:51:13,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:13 WrapperNode [2019-09-08 09:51:13,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:51:13,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:51:13,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:51:13,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:51:13,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:13" (1/1) ... [2019-09-08 09:51:13,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:13" (1/1) ... [2019-09-08 09:51:13,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:13" (1/1) ... [2019-09-08 09:51:13,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:13" (1/1) ... [2019-09-08 09:51:13,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:13" (1/1) ... [2019-09-08 09:51:13,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:13" (1/1) ... [2019-09-08 09:51:13,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:13" (1/1) ... [2019-09-08 09:51:13,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:51:13,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:51:13,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:51:13,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:51:13,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:13" (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 09:51:13,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:51:13,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:51:13,329 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:51:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:51:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:51:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:51:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:51:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:51:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:51:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:51:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:51:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:51:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:51:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:51:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:51:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:51:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:51:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:51:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:51:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:51:15,523 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:51:15,524 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:51:15,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:51:15 BoogieIcfgContainer [2019-09-08 09:51:15,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:51:15,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:51:15,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:51:15,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:51:15,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:51:11" (1/3) ... [2019-09-08 09:51:15,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf5dca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:51:15, skipping insertion in model container [2019-09-08 09:51:15,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:13" (2/3) ... [2019-09-08 09:51:15,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf5dca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:51:15, skipping insertion in model container [2019-09-08 09:51:15,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:51:15" (3/3) ... [2019-09-08 09:51:15,542 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:51:15,552 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:51:15,579 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 09:51:15,597 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 09:51:15,644 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:51:15,645 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:51:15,645 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:51:15,645 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:51:15,645 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:51:15,645 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:51:15,646 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:51:15,646 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:51:15,646 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:51:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states. [2019-09-08 09:51:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 09:51:15,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:15,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:15,733 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:15,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:15,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1097612231, now seen corresponding path program 1 times [2019-09-08 09:51:15,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:15,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:15,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:15,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:15,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:17,040 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 09:51:17,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:17,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:17,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:17,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:17,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:17,066 INFO L87 Difference]: Start difference. First operand 632 states. Second operand 4 states. [2019-09-08 09:51:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:17,496 INFO L93 Difference]: Finished difference Result 1852 states and 3321 transitions. [2019-09-08 09:51:17,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:51:17,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-08 09:51:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:17,528 INFO L225 Difference]: With dead ends: 1852 [2019-09-08 09:51:17,528 INFO L226 Difference]: Without dead ends: 1227 [2019-09-08 09:51:17,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:51:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-09-08 09:51:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1192. [2019-09-08 09:51:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-09-08 09:51:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1850 transitions. [2019-09-08 09:51:17,720 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1850 transitions. Word has length 239 [2019-09-08 09:51:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:17,722 INFO L475 AbstractCegarLoop]: Abstraction has 1192 states and 1850 transitions. [2019-09-08 09:51:17,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1850 transitions. [2019-09-08 09:51:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 09:51:17,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:17,734 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 09:51:17,734 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:17,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:17,735 INFO L82 PathProgramCache]: Analyzing trace with hash -772194149, now seen corresponding path program 1 times [2019-09-08 09:51:17,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:17,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:17,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:18,106 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 09:51:18,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:18,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:18,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:18,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:18,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:18,112 INFO L87 Difference]: Start difference. First operand 1192 states and 1850 transitions. Second operand 3 states. [2019-09-08 09:51:18,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:18,296 INFO L93 Difference]: Finished difference Result 3402 states and 5252 transitions. [2019-09-08 09:51:18,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:18,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 09:51:18,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:18,313 INFO L225 Difference]: With dead ends: 3402 [2019-09-08 09:51:18,313 INFO L226 Difference]: Without dead ends: 2339 [2019-09-08 09:51:18,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2019-09-08 09:51:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2306. [2019-09-08 09:51:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2019-09-08 09:51:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3566 transitions. [2019-09-08 09:51:18,431 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3566 transitions. Word has length 241 [2019-09-08 09:51:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:18,432 INFO L475 AbstractCegarLoop]: Abstraction has 2306 states and 3566 transitions. [2019-09-08 09:51:18,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3566 transitions. [2019-09-08 09:51:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 09:51:18,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:18,440 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 09:51:18,441 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:18,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:18,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1792703498, now seen corresponding path program 1 times [2019-09-08 09:51:18,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:18,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:18,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:18,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:18,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:51:18,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:18,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:18,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:18,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:18,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:18,557 INFO L87 Difference]: Start difference. First operand 2306 states and 3566 transitions. Second operand 3 states. [2019-09-08 09:51:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:18,794 INFO L93 Difference]: Finished difference Result 6843 states and 10574 transitions. [2019-09-08 09:51:18,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:18,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 09:51:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:18,818 INFO L225 Difference]: With dead ends: 6843 [2019-09-08 09:51:18,818 INFO L226 Difference]: Without dead ends: 4579 [2019-09-08 09:51:18,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2019-09-08 09:51:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 2325. [2019-09-08 09:51:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2325 states. [2019-09-08 09:51:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 3594 transitions. [2019-09-08 09:51:18,957 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 3594 transitions. Word has length 241 [2019-09-08 09:51:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:18,957 INFO L475 AbstractCegarLoop]: Abstraction has 2325 states and 3594 transitions. [2019-09-08 09:51:18,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 3594 transitions. [2019-09-08 09:51:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 09:51:18,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:18,965 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:18,965 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:18,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:18,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1658210589, now seen corresponding path program 1 times [2019-09-08 09:51:18,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:18,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:18,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:18,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:18,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:19,074 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 09:51:19,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:19,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:19,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:19,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:19,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:19,076 INFO L87 Difference]: Start difference. First operand 2325 states and 3594 transitions. Second operand 3 states. [2019-09-08 09:51:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:19,413 INFO L93 Difference]: Finished difference Result 6862 states and 10595 transitions. [2019-09-08 09:51:19,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:19,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-08 09:51:19,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:19,443 INFO L225 Difference]: With dead ends: 6862 [2019-09-08 09:51:19,443 INFO L226 Difference]: Without dead ends: 4597 [2019-09-08 09:51:19,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4597 states. [2019-09-08 09:51:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4597 to 2343. [2019-09-08 09:51:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2343 states. [2019-09-08 09:51:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3615 transitions. [2019-09-08 09:51:19,605 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3615 transitions. Word has length 242 [2019-09-08 09:51:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:19,606 INFO L475 AbstractCegarLoop]: Abstraction has 2343 states and 3615 transitions. [2019-09-08 09:51:19,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3615 transitions. [2019-09-08 09:51:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 09:51:19,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:19,613 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:19,614 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:19,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:19,614 INFO L82 PathProgramCache]: Analyzing trace with hash -834590880, now seen corresponding path program 1 times [2019-09-08 09:51:19,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:19,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:19,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:19,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:19,818 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 09:51:19,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:19,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:19,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:19,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:19,820 INFO L87 Difference]: Start difference. First operand 2343 states and 3615 transitions. Second operand 3 states. [2019-09-08 09:51:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:20,183 INFO L93 Difference]: Finished difference Result 6605 states and 10132 transitions. [2019-09-08 09:51:20,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:20,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2019-09-08 09:51:20,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:20,213 INFO L225 Difference]: With dead ends: 6605 [2019-09-08 09:51:20,214 INFO L226 Difference]: Without dead ends: 4507 [2019-09-08 09:51:20,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-09-08 09:51:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4476. [2019-09-08 09:51:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4476 states. [2019-09-08 09:51:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 6859 transitions. [2019-09-08 09:51:20,545 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 6859 transitions. Word has length 243 [2019-09-08 09:51:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:20,546 INFO L475 AbstractCegarLoop]: Abstraction has 4476 states and 6859 transitions. [2019-09-08 09:51:20,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 6859 transitions. [2019-09-08 09:51:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 09:51:20,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:20,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:20,560 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:20,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:20,560 INFO L82 PathProgramCache]: Analyzing trace with hash -326836125, now seen corresponding path program 1 times [2019-09-08 09:51:20,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:20,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:20,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:20,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:20,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:20,944 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 09:51:20,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:20,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:20,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:20,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:20,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:20,949 INFO L87 Difference]: Start difference. First operand 4476 states and 6859 transitions. Second operand 4 states. [2019-09-08 09:51:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:21,560 INFO L93 Difference]: Finished difference Result 12049 states and 18285 transitions. [2019-09-08 09:51:21,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:21,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-09-08 09:51:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:21,609 INFO L225 Difference]: With dead ends: 12049 [2019-09-08 09:51:21,609 INFO L226 Difference]: Without dead ends: 8113 [2019-09-08 09:51:21,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:51:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8113 states. [2019-09-08 09:51:21,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8113 to 4711. [2019-09-08 09:51:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4711 states. [2019-09-08 09:51:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4711 states to 4711 states and 7247 transitions. [2019-09-08 09:51:22,053 INFO L78 Accepts]: Start accepts. Automaton has 4711 states and 7247 transitions. Word has length 243 [2019-09-08 09:51:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:22,054 INFO L475 AbstractCegarLoop]: Abstraction has 4711 states and 7247 transitions. [2019-09-08 09:51:22,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4711 states and 7247 transitions. [2019-09-08 09:51:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 09:51:22,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:22,065 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 09:51:22,065 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:22,066 INFO L82 PathProgramCache]: Analyzing trace with hash -311970492, now seen corresponding path program 1 times [2019-09-08 09:51:22,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:22,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:22,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:22,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:22,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:22,266 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 09:51:22,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:22,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:22,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:22,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:22,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:22,269 INFO L87 Difference]: Start difference. First operand 4711 states and 7247 transitions. Second operand 3 states. [2019-09-08 09:51:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:22,900 INFO L93 Difference]: Finished difference Result 12563 states and 19022 transitions. [2019-09-08 09:51:22,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:22,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-08 09:51:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:22,942 INFO L225 Difference]: With dead ends: 12563 [2019-09-08 09:51:22,943 INFO L226 Difference]: Without dead ends: 8655 [2019-09-08 09:51:22,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8655 states. [2019-09-08 09:51:23,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8655 to 4815. [2019-09-08 09:51:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4815 states. [2019-09-08 09:51:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 7390 transitions. [2019-09-08 09:51:23,706 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 7390 transitions. Word has length 245 [2019-09-08 09:51:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:23,707 INFO L475 AbstractCegarLoop]: Abstraction has 4815 states and 7390 transitions. [2019-09-08 09:51:23,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 7390 transitions. [2019-09-08 09:51:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 09:51:23,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:23,720 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 09:51:23,720 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:23,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1859282707, now seen corresponding path program 1 times [2019-09-08 09:51:23,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:23,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:23,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:23,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:23,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:23,837 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 09:51:23,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:23,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:23,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:23,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:23,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:23,839 INFO L87 Difference]: Start difference. First operand 4815 states and 7390 transitions. Second operand 3 states. [2019-09-08 09:51:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:24,476 INFO L93 Difference]: Finished difference Result 12695 states and 19188 transitions. [2019-09-08 09:51:24,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:24,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-08 09:51:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:24,496 INFO L225 Difference]: With dead ends: 12695 [2019-09-08 09:51:24,497 INFO L226 Difference]: Without dead ends: 8780 [2019-09-08 09:51:24,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8780 states. [2019-09-08 09:51:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8780 to 4940. [2019-09-08 09:51:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2019-09-08 09:51:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 7536 transitions. [2019-09-08 09:51:24,893 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 7536 transitions. Word has length 246 [2019-09-08 09:51:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:24,893 INFO L475 AbstractCegarLoop]: Abstraction has 4940 states and 7536 transitions. [2019-09-08 09:51:24,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 7536 transitions. [2019-09-08 09:51:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 09:51:24,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:24,910 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 09:51:24,911 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2034335695, now seen corresponding path program 1 times [2019-09-08 09:51:24,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:24,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:24,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:24,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:24,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:25,238 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 09:51:25,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:25,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:25,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:25,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:25,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:25,240 INFO L87 Difference]: Start difference. First operand 4940 states and 7536 transitions. Second operand 4 states. [2019-09-08 09:51:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:25,600 INFO L93 Difference]: Finished difference Result 8427 states and 12746 transitions. [2019-09-08 09:51:25,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:25,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-09-08 09:51:25,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:25,613 INFO L225 Difference]: With dead ends: 8427 [2019-09-08 09:51:25,613 INFO L226 Difference]: Without dead ends: 4350 [2019-09-08 09:51:25,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:51:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2019-09-08 09:51:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4330. [2019-09-08 09:51:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4330 states. [2019-09-08 09:51:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6627 transitions. [2019-09-08 09:51:26,032 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6627 transitions. Word has length 247 [2019-09-08 09:51:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:26,033 INFO L475 AbstractCegarLoop]: Abstraction has 4330 states and 6627 transitions. [2019-09-08 09:51:26,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6627 transitions. [2019-09-08 09:51:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 09:51:26,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:26,046 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 09:51:26,046 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:26,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash 749195596, now seen corresponding path program 1 times [2019-09-08 09:51:26,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:26,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:26,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:26,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:26,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:26,250 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 09:51:26,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:26,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:26,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:26,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:26,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:26,252 INFO L87 Difference]: Start difference. First operand 4330 states and 6627 transitions. Second operand 3 states. [2019-09-08 09:51:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:27,369 INFO L93 Difference]: Finished difference Result 9576 states and 14515 transitions. [2019-09-08 09:51:27,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:27,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-09-08 09:51:27,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:27,386 INFO L225 Difference]: With dead ends: 9576 [2019-09-08 09:51:27,386 INFO L226 Difference]: Without dead ends: 6947 [2019-09-08 09:51:27,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6947 states. [2019-09-08 09:51:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6947 to 6882. [2019-09-08 09:51:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6882 states. [2019-09-08 09:51:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6882 states to 6882 states and 10417 transitions. [2019-09-08 09:51:27,817 INFO L78 Accepts]: Start accepts. Automaton has 6882 states and 10417 transitions. Word has length 247 [2019-09-08 09:51:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:27,818 INFO L475 AbstractCegarLoop]: Abstraction has 6882 states and 10417 transitions. [2019-09-08 09:51:27,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 6882 states and 10417 transitions. [2019-09-08 09:51:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 09:51:27,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:27,834 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 09:51:27,835 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:27,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2094441447, now seen corresponding path program 1 times [2019-09-08 09:51:27,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:27,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:27,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:27,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:27,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:28,352 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 09:51:28,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:28,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:28,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:28,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:28,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:28,354 INFO L87 Difference]: Start difference. First operand 6882 states and 10417 transitions. Second operand 4 states. [2019-09-08 09:51:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:29,403 INFO L93 Difference]: Finished difference Result 20071 states and 30341 transitions. [2019-09-08 09:51:29,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:29,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-09-08 09:51:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:29,437 INFO L225 Difference]: With dead ends: 20071 [2019-09-08 09:51:29,438 INFO L226 Difference]: Without dead ends: 13261 [2019-09-08 09:51:29,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:51:29,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13261 states. [2019-09-08 09:51:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13261 to 13235. [2019-09-08 09:51:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13235 states. [2019-09-08 09:51:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13235 states to 13235 states and 19875 transitions. [2019-09-08 09:51:30,780 INFO L78 Accepts]: Start accepts. Automaton has 13235 states and 19875 transitions. Word has length 247 [2019-09-08 09:51:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:30,780 INFO L475 AbstractCegarLoop]: Abstraction has 13235 states and 19875 transitions. [2019-09-08 09:51:30,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 13235 states and 19875 transitions. [2019-09-08 09:51:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 09:51:30,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:30,806 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 09:51:30,806 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:30,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2013512940, now seen corresponding path program 1 times [2019-09-08 09:51:30,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:30,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:30,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:30,988 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 09:51:30,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:30,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:30,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:30,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:30,990 INFO L87 Difference]: Start difference. First operand 13235 states and 19875 transitions. Second operand 3 states. [2019-09-08 09:51:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:32,095 INFO L93 Difference]: Finished difference Result 37464 states and 55851 transitions. [2019-09-08 09:51:32,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:32,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-09-08 09:51:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:32,167 INFO L225 Difference]: With dead ends: 37464 [2019-09-08 09:51:32,167 INFO L226 Difference]: Without dead ends: 25478 [2019-09-08 09:51:32,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25478 states. [2019-09-08 09:51:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25478 to 25454. [2019-09-08 09:51:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25454 states. [2019-09-08 09:51:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25454 states to 25454 states and 37844 transitions. [2019-09-08 09:51:33,574 INFO L78 Accepts]: Start accepts. Automaton has 25454 states and 37844 transitions. Word has length 249 [2019-09-08 09:51:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:33,575 INFO L475 AbstractCegarLoop]: Abstraction has 25454 states and 37844 transitions. [2019-09-08 09:51:33,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 25454 states and 37844 transitions. [2019-09-08 09:51:33,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 09:51:33,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:33,620 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, 1, 1] [2019-09-08 09:51:33,621 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:33,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:33,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1237846159, now seen corresponding path program 1 times [2019-09-08 09:51:33,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:33,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:33,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:33,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:33,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:33,825 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 09:51:33,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:33,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:33,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:33,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:33,827 INFO L87 Difference]: Start difference. First operand 25454 states and 37844 transitions. Second operand 3 states. [2019-09-08 09:51:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:36,586 INFO L93 Difference]: Finished difference Result 73772 states and 109282 transitions. [2019-09-08 09:51:36,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:36,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-09-08 09:51:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:36,696 INFO L225 Difference]: With dead ends: 73772 [2019-09-08 09:51:36,697 INFO L226 Difference]: Without dead ends: 49665 [2019-09-08 09:51:36,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49665 states. [2019-09-08 09:51:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49665 to 49643. [2019-09-08 09:51:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49643 states. [2019-09-08 09:51:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49643 states to 49643 states and 73231 transitions. [2019-09-08 09:51:39,026 INFO L78 Accepts]: Start accepts. Automaton has 49643 states and 73231 transitions. Word has length 251 [2019-09-08 09:51:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:39,026 INFO L475 AbstractCegarLoop]: Abstraction has 49643 states and 73231 transitions. [2019-09-08 09:51:39,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 49643 states and 73231 transitions. [2019-09-08 09:51:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 09:51:39,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:39,127 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, 1, 1] [2019-09-08 09:51:39,128 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash -708861388, now seen corresponding path program 1 times [2019-09-08 09:51:39,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:39,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:39,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:39,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:51:39,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:39,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:39,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:39,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:39,526 INFO L87 Difference]: Start difference. First operand 49643 states and 73231 transitions. Second operand 4 states. [2019-09-08 09:51:43,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:43,847 INFO L93 Difference]: Finished difference Result 128553 states and 188594 transitions. [2019-09-08 09:51:43,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:43,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-09-08 09:51:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:43,971 INFO L225 Difference]: With dead ends: 128553 [2019-09-08 09:51:43,972 INFO L226 Difference]: Without dead ends: 82202 [2019-09-08 09:51:44,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:51:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82202 states. [2019-09-08 09:51:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82202 to 48558. [2019-09-08 09:51:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48558 states. [2019-09-08 09:51:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48558 states to 48558 states and 71663 transitions. [2019-09-08 09:51:46,613 INFO L78 Accepts]: Start accepts. Automaton has 48558 states and 71663 transitions. Word has length 251 [2019-09-08 09:51:46,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:46,613 INFO L475 AbstractCegarLoop]: Abstraction has 48558 states and 71663 transitions. [2019-09-08 09:51:46,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 48558 states and 71663 transitions. [2019-09-08 09:51:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 09:51:46,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:46,656 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, 1, 1, 1, 1, 1] [2019-09-08 09:51:46,657 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:46,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:46,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1536435996, now seen corresponding path program 1 times [2019-09-08 09:51:46,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:46,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:46,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:46,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:46,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:46,765 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 09:51:46,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:46,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:46,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:46,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:46,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:46,767 INFO L87 Difference]: Start difference. First operand 48558 states and 71663 transitions. Second operand 3 states. [2019-09-08 09:51:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:52,318 INFO L93 Difference]: Finished difference Result 126387 states and 185454 transitions. [2019-09-08 09:51:52,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:52,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-08 09:51:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:52,428 INFO L225 Difference]: With dead ends: 126387 [2019-09-08 09:51:52,429 INFO L226 Difference]: Without dead ends: 83996 [2019-09-08 09:51:52,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83996 states. [2019-09-08 09:51:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83996 to 49039. [2019-09-08 09:51:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49039 states. [2019-09-08 09:51:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49039 states to 49039 states and 72261 transitions. [2019-09-08 09:51:55,085 INFO L78 Accepts]: Start accepts. Automaton has 49039 states and 72261 transitions. Word has length 254 [2019-09-08 09:51:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:55,085 INFO L475 AbstractCegarLoop]: Abstraction has 49039 states and 72261 transitions. [2019-09-08 09:51:55,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 49039 states and 72261 transitions. [2019-09-08 09:51:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 09:51:55,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:55,127 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, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:55,127 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:55,128 INFO L82 PathProgramCache]: Analyzing trace with hash -140603661, now seen corresponding path program 1 times [2019-09-08 09:51:55,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:55,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:55,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:55,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:55,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:55,540 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 09:51:55,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:55,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:55,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:55,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:55,542 INFO L87 Difference]: Start difference. First operand 49039 states and 72261 transitions. Second operand 4 states. [2019-09-08 09:52:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:01,680 INFO L93 Difference]: Finished difference Result 139655 states and 205534 transitions. [2019-09-08 09:52:01,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:52:01,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-09-08 09:52:01,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:01,792 INFO L225 Difference]: With dead ends: 139655 [2019-09-08 09:52:01,792 INFO L226 Difference]: Without dead ends: 90834 [2019-09-08 09:52:01,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:52:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90834 states. [2019-09-08 09:52:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90834 to 90817. [2019-09-08 09:52:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90817 states. [2019-09-08 09:52:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90817 states to 90817 states and 132750 transitions. [2019-09-08 09:52:06,778 INFO L78 Accepts]: Start accepts. Automaton has 90817 states and 132750 transitions. Word has length 255 [2019-09-08 09:52:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:06,779 INFO L475 AbstractCegarLoop]: Abstraction has 90817 states and 132750 transitions. [2019-09-08 09:52:06,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 90817 states and 132750 transitions. [2019-09-08 09:52:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 09:52:06,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:06,836 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:06,836 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash -731068887, now seen corresponding path program 1 times [2019-09-08 09:52:06,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:06,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:06,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:06,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:06,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:07,025 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 09:52:07,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:07,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:07,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:07,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:07,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:07,027 INFO L87 Difference]: Start difference. First operand 90817 states and 132750 transitions. Second operand 3 states. [2019-09-08 09:52:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:17,685 INFO L93 Difference]: Finished difference Result 262655 states and 382417 transitions. [2019-09-08 09:52:17,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:17,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-08 09:52:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:17,867 INFO L225 Difference]: With dead ends: 262655 [2019-09-08 09:52:17,867 INFO L226 Difference]: Without dead ends: 177313 [2019-09-08 09:52:17,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177313 states. [2019-09-08 09:52:29,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177313 to 176994. [2019-09-08 09:52:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176994 states. [2019-09-08 09:52:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176994 states to 176994 states and 256504 transitions. [2019-09-08 09:52:30,201 INFO L78 Accepts]: Start accepts. Automaton has 176994 states and 256504 transitions. Word has length 256 [2019-09-08 09:52:30,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:30,202 INFO L475 AbstractCegarLoop]: Abstraction has 176994 states and 256504 transitions. [2019-09-08 09:52:30,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 176994 states and 256504 transitions. [2019-09-08 09:52:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 09:52:30,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:30,326 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:30,326 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash -471280969, now seen corresponding path program 1 times [2019-09-08 09:52:30,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:30,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:30,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:30,596 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 09:52:30,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:30,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:52:30,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:52:30,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:52:30,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:52:30,598 INFO L87 Difference]: Start difference. First operand 176994 states and 256504 transitions. Second operand 4 states. [2019-09-08 09:52:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:39,968 INFO L93 Difference]: Finished difference Result 317932 states and 458892 transitions. [2019-09-08 09:52:39,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:52:39,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2019-09-08 09:52:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:40,163 INFO L225 Difference]: With dead ends: 317932 [2019-09-08 09:52:40,163 INFO L226 Difference]: Without dead ends: 157427 [2019-09-08 09:52:40,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:52:40,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157427 states. [2019-09-08 09:52:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157427 to 156209. [2019-09-08 09:52:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156209 states. [2019-09-08 09:52:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156209 states to 156209 states and 226245 transitions. [2019-09-08 09:52:52,775 INFO L78 Accepts]: Start accepts. Automaton has 156209 states and 226245 transitions. Word has length 257 [2019-09-08 09:52:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:52,776 INFO L475 AbstractCegarLoop]: Abstraction has 156209 states and 226245 transitions. [2019-09-08 09:52:52,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 156209 states and 226245 transitions. [2019-09-08 09:52:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 09:52:52,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:52,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:52,872 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:52,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1639922080, now seen corresponding path program 1 times [2019-09-08 09:52:52,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:52,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:52,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:52,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:52,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:53,061 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 09:52:53,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:53,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:53,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:53,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:53,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:53,065 INFO L87 Difference]: Start difference. First operand 156209 states and 226245 transitions. Second operand 3 states. [2019-09-08 09:53:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:11,654 INFO L93 Difference]: Finished difference Result 451104 states and 650970 transitions. [2019-09-08 09:53:11,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:53:11,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-09-08 09:53:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:12,005 INFO L225 Difference]: With dead ends: 451104 [2019-09-08 09:53:12,005 INFO L226 Difference]: Without dead ends: 305748 [2019-09-08 09:53:12,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:53:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305748 states. [2019-09-08 09:53:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305748 to 305735. [2019-09-08 09:53:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305735 states. [2019-09-08 09:53:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305735 states to 305735 states and 439198 transitions. [2019-09-08 09:53:36,185 INFO L78 Accepts]: Start accepts. Automaton has 305735 states and 439198 transitions. Word has length 259 [2019-09-08 09:53:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:36,186 INFO L475 AbstractCegarLoop]: Abstraction has 305735 states and 439198 transitions. [2019-09-08 09:53:36,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:53:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 305735 states and 439198 transitions. [2019-09-08 09:53:36,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 09:53:36,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:36,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:53:36,400 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:36,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:36,400 INFO L82 PathProgramCache]: Analyzing trace with hash -348122397, now seen corresponding path program 1 times [2019-09-08 09:53:36,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:36,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:36,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:36,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:36,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:36,659 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 09:53:36,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:36,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:53:36,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:53:36,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:53:36,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:53:36,661 INFO L87 Difference]: Start difference. First operand 305735 states and 439198 transitions. Second operand 4 states. [2019-09-08 09:54:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:09,135 INFO L93 Difference]: Finished difference Result 729890 states and 1043540 transitions. [2019-09-08 09:54:09,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:09,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2019-09-08 09:54:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:09,671 INFO L225 Difference]: With dead ends: 729890 [2019-09-08 09:54:09,671 INFO L226 Difference]: Without dead ends: 458910 [2019-09-08 09:54:09,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:54:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458910 states. [2019-09-08 09:54:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458910 to 293085. [2019-09-08 09:54:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293085 states. [2019-09-08 09:54:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293085 states to 293085 states and 420992 transitions. [2019-09-08 09:54:36,841 INFO L78 Accepts]: Start accepts. Automaton has 293085 states and 420992 transitions. Word has length 259 [2019-09-08 09:54:36,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:36,842 INFO L475 AbstractCegarLoop]: Abstraction has 293085 states and 420992 transitions. [2019-09-08 09:54:36,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 293085 states and 420992 transitions. [2019-09-08 09:54:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 09:54:37,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:37,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:37,073 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:37,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:37,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1767806559, now seen corresponding path program 1 times [2019-09-08 09:54:37,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:37,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:37,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:37,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:37,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:37,177 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 09:54:37,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:37,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:37,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:37,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:37,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:37,179 INFO L87 Difference]: Start difference. First operand 293085 states and 420992 transitions. Second operand 3 states. [2019-09-08 09:55:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:12,883 INFO L93 Difference]: Finished difference Result 735559 states and 1050051 transitions. [2019-09-08 09:55:12,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:12,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-08 09:55:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:13,553 INFO L225 Difference]: With dead ends: 735559 [2019-09-08 09:55:13,553 INFO L226 Difference]: Without dead ends: 486472 [2019-09-08 09:55:13,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486472 states. [2019-09-08 09:55:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486472 to 292545. [2019-09-08 09:55:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292545 states. [2019-09-08 09:55:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292545 states to 292545 states and 419394 transitions. [2019-09-08 09:55:42,051 INFO L78 Accepts]: Start accepts. Automaton has 292545 states and 419394 transitions. Word has length 262 [2019-09-08 09:55:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:42,052 INFO L475 AbstractCegarLoop]: Abstraction has 292545 states and 419394 transitions. [2019-09-08 09:55:42,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 292545 states and 419394 transitions. [2019-09-08 09:55:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 09:55:42,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:42,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:42,305 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:42,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1103029111, now seen corresponding path program 1 times [2019-09-08 09:55:42,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:42,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:42,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:42,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:42,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:42,570 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 09:55:42,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:42,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:42,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:42,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:42,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:42,571 INFO L87 Difference]: Start difference. First operand 292545 states and 419394 transitions. Second operand 4 states. [2019-09-08 09:56:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:05,539 INFO L93 Difference]: Finished difference Result 520066 states and 742553 transitions. [2019-09-08 09:56:05,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:56:05,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2019-09-08 09:56:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:05,877 INFO L225 Difference]: With dead ends: 520066 [2019-09-08 09:56:05,877 INFO L226 Difference]: Without dead ends: 268900 [2019-09-08 09:56:06,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268900 states. [2019-09-08 09:56:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268900 to 265622. [2019-09-08 09:56:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265622 states. [2019-09-08 09:56:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265622 states to 265622 states and 380566 transitions. [2019-09-08 09:56:30,187 INFO L78 Accepts]: Start accepts. Automaton has 265622 states and 380566 transitions. Word has length 263 [2019-09-08 09:56:30,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:30,188 INFO L475 AbstractCegarLoop]: Abstraction has 265622 states and 380566 transitions. [2019-09-08 09:56:30,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:56:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand 265622 states and 380566 transitions. [2019-09-08 09:56:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 09:56:30,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:30,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:30,367 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1317852449, now seen corresponding path program 1 times [2019-09-08 09:56:30,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:30,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:30,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:30,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:30,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:56:30,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:30,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:56:30,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:56:30,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:56:30,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:56:30,793 INFO L87 Difference]: Start difference. First operand 265622 states and 380566 transitions. Second operand 4 states. [2019-09-08 09:57:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:06,909 INFO L93 Difference]: Finished difference Result 781237 states and 1116481 transitions. [2019-09-08 09:57:06,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:57:06,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2019-09-08 09:57:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:07,483 INFO L225 Difference]: With dead ends: 781237 [2019-09-08 09:57:07,483 INFO L226 Difference]: Without dead ends: 516198 [2019-09-08 09:57:07,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:57:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516198 states. [2019-09-08 09:57:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516198 to 514325. [2019-09-08 09:57:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514325 states. [2019-09-08 09:57:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514325 states to 514325 states and 729290 transitions. [2019-09-08 09:57:53,162 INFO L78 Accepts]: Start accepts. Automaton has 514325 states and 729290 transitions. Word has length 263 [2019-09-08 09:57:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:53,162 INFO L475 AbstractCegarLoop]: Abstraction has 514325 states and 729290 transitions. [2019-09-08 09:57:53,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:57:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 514325 states and 729290 transitions. [2019-09-08 09:57:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 09:57:53,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:53,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:53,530 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:53,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:53,531 INFO L82 PathProgramCache]: Analyzing trace with hash 971711623, now seen corresponding path program 1 times [2019-09-08 09:57:53,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:53,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:53,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:53,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:53,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:53,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:53,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:57:53,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:57:53,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:57:53,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:53,660 INFO L87 Difference]: Start difference. First operand 514325 states and 729290 transitions. Second operand 3 states. [2019-09-08 09:59:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:18,965 INFO L93 Difference]: Finished difference Result 1500969 states and 2124098 transitions. [2019-09-08 09:59:19,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:19,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-08 09:59:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:20,711 INFO L225 Difference]: With dead ends: 1500969 [2019-09-08 09:59:20,712 INFO L226 Difference]: Without dead ends: 989445 [2019-09-08 09:59:21,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:21,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989445 states. [2019-09-08 10:00:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989445 to 508551. [2019-09-08 10:00:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508551 states. [2019-09-08 10:00:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508551 states to 508551 states and 720381 transitions. [2019-09-08 10:00:14,723 INFO L78 Accepts]: Start accepts. Automaton has 508551 states and 720381 transitions. Word has length 265 [2019-09-08 10:00:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:00:14,723 INFO L475 AbstractCegarLoop]: Abstraction has 508551 states and 720381 transitions. [2019-09-08 10:00:14,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:00:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 508551 states and 720381 transitions. [2019-09-08 10:00:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 10:00:15,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:00:15,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:00:15,117 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:00:15,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:00:15,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1231494676, now seen corresponding path program 1 times [2019-09-08 10:00:15,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:00:15,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:00:15,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:15,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:00:15,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:00:15,313 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 10:00:15,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:00:15,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:00:15,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:00:15,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:00:15,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:00:15,314 INFO L87 Difference]: Start difference. First operand 508551 states and 720381 transitions. Second operand 3 states. [2019-09-08 10:01:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:01:38,475 INFO L93 Difference]: Finished difference Result 1494844 states and 2110716 transitions. [2019-09-08 10:01:38,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:01:38,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-08 10:01:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:01:39,904 INFO L225 Difference]: With dead ends: 1494844 [2019-09-08 10:01:39,905 INFO L226 Difference]: Without dead ends: 998204 [2019-09-08 10:01:40,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:01:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998204 states.