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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:40:02,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:40:02,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:40:02,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:40:02,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:40:02,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:40:02,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:40:02,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:40:02,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:40:02,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:40:02,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:40:02,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:40:02,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:40:02,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:40:02,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:40:02,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:40:02,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:40:02,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:40:02,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:40:02,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:40:02,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:40:02,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:40:02,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:40:02,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:40:02,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:40:02,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:40:02,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:40:02,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:40:02,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:40:02,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:40:02,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:40:02,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:40:02,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:40:02,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:40:02,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:40:02,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:40:02,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:40:02,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:40:02,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:40:02,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:40:02,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:40:02,672 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:40:02,694 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:40:02,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:40:02,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:40:02,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:40:02,697 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:40:02,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:40:02,697 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:40:02,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:40:02,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:40:02,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:40:02,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:40:02,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:40:02,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:40:02,700 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:40:02,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:40:02,700 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:40:02,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:40:02,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:40:02,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:40:02,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:40:02,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:40:02,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:40:02,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:40:02,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:40:02,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:40:02,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:40:02,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:40:02,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:40:02,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:40:02,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:40:02,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:40:02,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:40:02,761 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:40:02,761 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:40:02,762 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:40:02,822 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8552559fe/f03c4165440e4fd1a5e93b45c77a9770/FLAG20dfb791e [2019-09-08 09:40:03,396 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:40:03,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:40:03,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8552559fe/f03c4165440e4fd1a5e93b45c77a9770/FLAG20dfb791e [2019-09-08 09:40:03,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8552559fe/f03c4165440e4fd1a5e93b45c77a9770 [2019-09-08 09:40:03,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:40:03,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:40:03,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:40:03,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:40:03,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:40:03,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:40:03" (1/1) ... [2019-09-08 09:40:03,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:03, skipping insertion in model container [2019-09-08 09:40:03,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:40:03" (1/1) ... [2019-09-08 09:40:03,709 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:40:03,782 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:40:04,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:40:04,386 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:40:04,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:40:04,912 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:40:04,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:04 WrapperNode [2019-09-08 09:40:04,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:40:04,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:40:04,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:40:04,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:40:04,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:04" (1/1) ... [2019-09-08 09:40:04,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:04" (1/1) ... [2019-09-08 09:40:04,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:04" (1/1) ... [2019-09-08 09:40:04,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:04" (1/1) ... [2019-09-08 09:40:05,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:04" (1/1) ... [2019-09-08 09:40:05,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:04" (1/1) ... [2019-09-08 09:40:05,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:04" (1/1) ... [2019-09-08 09:40:05,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:40:05,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:40:05,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:40:05,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:40:05,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:04" (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:40:05,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:40:05,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:40:05,120 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:40:05,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:40:05,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:40:05,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:40:05,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:40:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:40:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:40:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:40:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:40:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:40:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:40:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:40:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:40:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:40:05,126 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:40:05,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:40:05,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:40:06,950 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:40:06,950 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:40:06,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:40:06 BoogieIcfgContainer [2019-09-08 09:40:06,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:40:06,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:40:06,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:40:06,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:40:06,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:40:03" (1/3) ... [2019-09-08 09:40:06,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c981c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:40:06, skipping insertion in model container [2019-09-08 09:40:06,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:04" (2/3) ... [2019-09-08 09:40:06,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c981c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:40:06, skipping insertion in model container [2019-09-08 09:40:06,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:40:06" (3/3) ... [2019-09-08 09:40:06,960 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:40:06,971 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:40:06,989 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-09-08 09:40:07,005 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-09-08 09:40:07,040 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:40:07,041 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:40:07,041 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:40:07,041 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:40:07,041 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:40:07,042 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:40:07,042 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:40:07,042 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:40:07,042 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:40:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states. [2019-09-08 09:40:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 09:40:07,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:07,091 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] [2019-09-08 09:40:07,092 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:07,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:07,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1100628629, now seen corresponding path program 1 times [2019-09-08 09:40:07,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:07,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:07,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:07,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:07,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:07,807 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:40:07,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:07,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:07,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:07,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:07,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:07,832 INFO L87 Difference]: Start difference. First operand 393 states. Second operand 3 states. [2019-09-08 09:40:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:08,073 INFO L93 Difference]: Finished difference Result 715 states and 1265 transitions. [2019-09-08 09:40:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:08,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-08 09:40:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:08,096 INFO L225 Difference]: With dead ends: 715 [2019-09-08 09:40:08,096 INFO L226 Difference]: Without dead ends: 568 [2019-09-08 09:40:08,101 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:40:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-08 09:40:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2019-09-08 09:40:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-09-08 09:40:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 826 transitions. [2019-09-08 09:40:08,227 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 826 transitions. Word has length 145 [2019-09-08 09:40:08,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:08,228 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 826 transitions. [2019-09-08 09:40:08,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 826 transitions. [2019-09-08 09:40:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 09:40:08,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:08,235 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] [2019-09-08 09:40:08,236 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:08,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:08,236 INFO L82 PathProgramCache]: Analyzing trace with hash -39383595, now seen corresponding path program 1 times [2019-09-08 09:40:08,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:08,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:08,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:08,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:08,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:08,426 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:40:08,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:08,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:08,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:08,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:08,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:08,430 INFO L87 Difference]: Start difference. First operand 566 states and 826 transitions. Second operand 3 states. [2019-09-08 09:40:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:08,663 INFO L93 Difference]: Finished difference Result 1141 states and 1724 transitions. [2019-09-08 09:40:08,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:08,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-08 09:40:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:08,678 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 09:40:08,678 INFO L226 Difference]: Without dead ends: 940 [2019-09-08 09:40:08,685 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:40:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-09-08 09:40:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 938. [2019-09-08 09:40:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-09-08 09:40:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1395 transitions. [2019-09-08 09:40:08,780 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1395 transitions. Word has length 145 [2019-09-08 09:40:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:08,784 INFO L475 AbstractCegarLoop]: Abstraction has 938 states and 1395 transitions. [2019-09-08 09:40:08,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1395 transitions. [2019-09-08 09:40:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 09:40:08,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:08,797 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] [2019-09-08 09:40:08,797 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:08,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:08,798 INFO L82 PathProgramCache]: Analyzing trace with hash -39722219, now seen corresponding path program 1 times [2019-09-08 09:40:08,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:08,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:08,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:08,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:09,136 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:40:09,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:09,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:09,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:09,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:09,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:09,138 INFO L87 Difference]: Start difference. First operand 938 states and 1395 transitions. Second operand 4 states. [2019-09-08 09:40:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:09,331 INFO L93 Difference]: Finished difference Result 2740 states and 4068 transitions. [2019-09-08 09:40:09,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:09,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-08 09:40:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:09,347 INFO L225 Difference]: With dead ends: 2740 [2019-09-08 09:40:09,348 INFO L226 Difference]: Without dead ends: 1815 [2019-09-08 09:40:09,353 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:40:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-09-08 09:40:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1773. [2019-09-08 09:40:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-09-08 09:40:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2622 transitions. [2019-09-08 09:40:09,454 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2622 transitions. Word has length 145 [2019-09-08 09:40:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:09,454 INFO L475 AbstractCegarLoop]: Abstraction has 1773 states and 2622 transitions. [2019-09-08 09:40:09,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2622 transitions. [2019-09-08 09:40:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 09:40:09,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:09,459 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] [2019-09-08 09:40:09,459 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:09,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:09,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1124234717, now seen corresponding path program 1 times [2019-09-08 09:40:09,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:09,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:09,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:09,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:09,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:09,558 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:40:09,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:09,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:09,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:09,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:09,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:09,560 INFO L87 Difference]: Start difference. First operand 1773 states and 2622 transitions. Second operand 3 states. [2019-09-08 09:40:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:09,733 INFO L93 Difference]: Finished difference Result 5273 states and 7796 transitions. [2019-09-08 09:40:09,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:09,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 09:40:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:09,754 INFO L225 Difference]: With dead ends: 5273 [2019-09-08 09:40:09,754 INFO L226 Difference]: Without dead ends: 3532 [2019-09-08 09:40:09,759 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:40:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3532 states. [2019-09-08 09:40:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3532 to 1775. [2019-09-08 09:40:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-09-08 09:40:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2624 transitions. [2019-09-08 09:40:09,880 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2624 transitions. Word has length 146 [2019-09-08 09:40:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:09,881 INFO L475 AbstractCegarLoop]: Abstraction has 1775 states and 2624 transitions. [2019-09-08 09:40:09,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2624 transitions. [2019-09-08 09:40:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 09:40:09,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:09,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:09,886 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash 954016116, now seen corresponding path program 1 times [2019-09-08 09:40:09,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:09,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:09,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:09,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:10,083 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:40:10,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:10,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:10,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:10,085 INFO L87 Difference]: Start difference. First operand 1775 states and 2624 transitions. Second operand 4 states. [2019-09-08 09:40:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:10,222 INFO L93 Difference]: Finished difference Result 3536 states and 5230 transitions. [2019-09-08 09:40:10,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:10,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-08 09:40:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:10,232 INFO L225 Difference]: With dead ends: 3536 [2019-09-08 09:40:10,233 INFO L226 Difference]: Without dead ends: 1773 [2019-09-08 09:40:10,237 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:40:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-08 09:40:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2019-09-08 09:40:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-09-08 09:40:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2620 transitions. [2019-09-08 09:40:10,409 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2620 transitions. Word has length 147 [2019-09-08 09:40:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:10,410 INFO L475 AbstractCegarLoop]: Abstraction has 1773 states and 2620 transitions. [2019-09-08 09:40:10,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2620 transitions. [2019-09-08 09:40:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 09:40:10,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:10,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:10,415 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1883184417, now seen corresponding path program 1 times [2019-09-08 09:40:10,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:10,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:10,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:10,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:10,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:40:10,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:10,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:10,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:10,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:10,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:10,520 INFO L87 Difference]: Start difference. First operand 1773 states and 2620 transitions. Second operand 3 states. [2019-09-08 09:40:10,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:10,746 INFO L93 Difference]: Finished difference Result 4244 states and 6274 transitions. [2019-09-08 09:40:10,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:10,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-08 09:40:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:10,761 INFO L225 Difference]: With dead ends: 4244 [2019-09-08 09:40:10,761 INFO L226 Difference]: Without dead ends: 2649 [2019-09-08 09:40:10,766 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:40:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2019-09-08 09:40:10,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2607. [2019-09-08 09:40:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-09-08 09:40:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3802 transitions. [2019-09-08 09:40:10,918 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3802 transitions. Word has length 147 [2019-09-08 09:40:10,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:10,920 INFO L475 AbstractCegarLoop]: Abstraction has 2607 states and 3802 transitions. [2019-09-08 09:40:10,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3802 transitions. [2019-09-08 09:40:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 09:40:10,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:10,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:10,928 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:10,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:10,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1722499153, now seen corresponding path program 1 times [2019-09-08 09:40:10,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:10,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:10,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:10,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:11,108 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:40:11,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:11,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:11,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:11,110 INFO L87 Difference]: Start difference. First operand 2607 states and 3802 transitions. Second operand 3 states. [2019-09-08 09:40:11,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:11,679 INFO L93 Difference]: Finished difference Result 7297 states and 10699 transitions. [2019-09-08 09:40:11,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:11,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-08 09:40:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:11,704 INFO L225 Difference]: With dead ends: 7297 [2019-09-08 09:40:11,704 INFO L226 Difference]: Without dead ends: 5004 [2019-09-08 09:40:11,710 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:40:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5004 states. [2019-09-08 09:40:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5004 to 4962. [2019-09-08 09:40:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4962 states. [2019-09-08 09:40:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4962 states to 4962 states and 7216 transitions. [2019-09-08 09:40:11,989 INFO L78 Accepts]: Start accepts. Automaton has 4962 states and 7216 transitions. Word has length 153 [2019-09-08 09:40:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:11,990 INFO L475 AbstractCegarLoop]: Abstraction has 4962 states and 7216 transitions. [2019-09-08 09:40:11,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4962 states and 7216 transitions. [2019-09-08 09:40:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 09:40:11,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:11,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:11,999 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:11,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:11,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1165348778, now seen corresponding path program 1 times [2019-09-08 09:40:12,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:12,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:12,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:12,232 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:40:12,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:12,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:40:12,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:40:12,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:40:12,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:40:12,235 INFO L87 Difference]: Start difference. First operand 4962 states and 7216 transitions. Second operand 5 states. [2019-09-08 09:40:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:13,037 INFO L93 Difference]: Finished difference Result 11908 states and 17727 transitions. [2019-09-08 09:40:13,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:40:13,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-08 09:40:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:13,084 INFO L225 Difference]: With dead ends: 11908 [2019-09-08 09:40:13,084 INFO L226 Difference]: Without dead ends: 7232 [2019-09-08 09:40:13,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:40:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7232 states. [2019-09-08 09:40:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7232 to 7230. [2019-09-08 09:40:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2019-09-08 09:40:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 10791 transitions. [2019-09-08 09:40:13,607 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 10791 transitions. Word has length 153 [2019-09-08 09:40:13,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:13,608 INFO L475 AbstractCegarLoop]: Abstraction has 7230 states and 10791 transitions. [2019-09-08 09:40:13,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:40:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 10791 transitions. [2019-09-08 09:40:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 09:40:13,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:13,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:13,619 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash 75057812, now seen corresponding path program 1 times [2019-09-08 09:40:13,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:13,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:13,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:14,412 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:40:14,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:14,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 09:40:14,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 09:40:14,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 09:40:14,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-08 09:40:14,416 INFO L87 Difference]: Start difference. First operand 7230 states and 10791 transitions. Second operand 16 states. [2019-09-08 09:40:14,547 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2019-09-08 09:40:18,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:18,198 INFO L93 Difference]: Finished difference Result 18259 states and 28012 transitions. [2019-09-08 09:40:18,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 09:40:18,199 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 153 [2019-09-08 09:40:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:18,249 INFO L225 Difference]: With dead ends: 18259 [2019-09-08 09:40:18,250 INFO L226 Difference]: Without dead ends: 15571 [2019-09-08 09:40:18,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 09:40:18,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15571 states. [2019-09-08 09:40:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15571 to 8010. [2019-09-08 09:40:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8010 states. [2019-09-08 09:40:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8010 states to 8010 states and 11798 transitions. [2019-09-08 09:40:18,892 INFO L78 Accepts]: Start accepts. Automaton has 8010 states and 11798 transitions. Word has length 153 [2019-09-08 09:40:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:18,893 INFO L475 AbstractCegarLoop]: Abstraction has 8010 states and 11798 transitions. [2019-09-08 09:40:18,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 09:40:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states and 11798 transitions. [2019-09-08 09:40:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 09:40:18,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:18,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:18,905 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1758097192, now seen corresponding path program 1 times [2019-09-08 09:40:18,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:18,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:18,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:18,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:18,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:19,113 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:40:19,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:19,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:19,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:19,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:19,115 INFO L87 Difference]: Start difference. First operand 8010 states and 11798 transitions. Second operand 4 states. [2019-09-08 09:40:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:19,928 INFO L93 Difference]: Finished difference Result 21198 states and 31157 transitions. [2019-09-08 09:40:19,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:19,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-08 09:40:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:19,960 INFO L225 Difference]: With dead ends: 21198 [2019-09-08 09:40:19,960 INFO L226 Difference]: Without dead ends: 13203 [2019-09-08 09:40:19,976 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:40:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13203 states. [2019-09-08 09:40:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13203 to 13173. [2019-09-08 09:40:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13173 states. [2019-09-08 09:40:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13173 states to 13173 states and 19164 transitions. [2019-09-08 09:40:20,858 INFO L78 Accepts]: Start accepts. Automaton has 13173 states and 19164 transitions. Word has length 153 [2019-09-08 09:40:20,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:20,858 INFO L475 AbstractCegarLoop]: Abstraction has 13173 states and 19164 transitions. [2019-09-08 09:40:20,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 13173 states and 19164 transitions. [2019-09-08 09:40:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 09:40:20,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:20,876 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] [2019-09-08 09:40:20,876 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:20,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1857061442, now seen corresponding path program 1 times [2019-09-08 09:40:20,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:20,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:20,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:20,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:20,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:20,983 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:40:20,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:20,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:20,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:20,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:20,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:20,985 INFO L87 Difference]: Start difference. First operand 13173 states and 19164 transitions. Second operand 3 states. [2019-09-08 09:40:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:22,643 INFO L93 Difference]: Finished difference Result 35775 states and 51994 transitions. [2019-09-08 09:40:22,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:22,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 09:40:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:22,695 INFO L225 Difference]: With dead ends: 35775 [2019-09-08 09:40:22,696 INFO L226 Difference]: Without dead ends: 23025 [2019-09-08 09:40:22,723 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:40:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23025 states. [2019-09-08 09:40:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23025 to 22999. [2019-09-08 09:40:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22999 states. [2019-09-08 09:40:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22999 states to 22999 states and 33014 transitions. [2019-09-08 09:40:23,806 INFO L78 Accepts]: Start accepts. Automaton has 22999 states and 33014 transitions. Word has length 155 [2019-09-08 09:40:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:23,807 INFO L475 AbstractCegarLoop]: Abstraction has 22999 states and 33014 transitions. [2019-09-08 09:40:23,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 22999 states and 33014 transitions. [2019-09-08 09:40:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 09:40:23,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:23,829 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] [2019-09-08 09:40:23,830 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:23,830 INFO L82 PathProgramCache]: Analyzing trace with hash 407563333, now seen corresponding path program 1 times [2019-09-08 09:40:23,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:23,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:23,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:23,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:23,963 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:40:23,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:23,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:23,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:23,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:23,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:23,965 INFO L87 Difference]: Start difference. First operand 22999 states and 33014 transitions. Second operand 4 states. [2019-09-08 09:40:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:25,224 INFO L93 Difference]: Finished difference Result 38712 states and 55455 transitions. [2019-09-08 09:40:25,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:25,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-08 09:40:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:25,271 INFO L225 Difference]: With dead ends: 38712 [2019-09-08 09:40:25,271 INFO L226 Difference]: Without dead ends: 20475 [2019-09-08 09:40:25,304 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:40:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20475 states. [2019-09-08 09:40:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20475 to 20475. [2019-09-08 09:40:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20475 states. [2019-09-08 09:40:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20475 states to 20475 states and 29360 transitions. [2019-09-08 09:40:27,024 INFO L78 Accepts]: Start accepts. Automaton has 20475 states and 29360 transitions. Word has length 155 [2019-09-08 09:40:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:27,024 INFO L475 AbstractCegarLoop]: Abstraction has 20475 states and 29360 transitions. [2019-09-08 09:40:27,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 20475 states and 29360 transitions. [2019-09-08 09:40:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 09:40:27,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:27,042 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] [2019-09-08 09:40:27,043 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:27,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:27,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1059667643, now seen corresponding path program 1 times [2019-09-08 09:40:27,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:27,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:27,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:27,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:27,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:27,205 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:40:27,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:27,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:27,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:27,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:27,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:27,207 INFO L87 Difference]: Start difference. First operand 20475 states and 29360 transitions. Second operand 4 states. [2019-09-08 09:40:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:28,800 INFO L93 Difference]: Finished difference Result 59951 states and 85727 transitions. [2019-09-08 09:40:28,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:28,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 09:40:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:28,873 INFO L225 Difference]: With dead ends: 59951 [2019-09-08 09:40:28,873 INFO L226 Difference]: Without dead ends: 39519 [2019-09-08 09:40:28,907 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:40:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39519 states. [2019-09-08 09:40:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39519 to 39453. [2019-09-08 09:40:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39453 states. [2019-09-08 09:40:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39453 states to 39453 states and 55833 transitions. [2019-09-08 09:40:30,925 INFO L78 Accepts]: Start accepts. Automaton has 39453 states and 55833 transitions. Word has length 161 [2019-09-08 09:40:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:30,926 INFO L475 AbstractCegarLoop]: Abstraction has 39453 states and 55833 transitions. [2019-09-08 09:40:30,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 39453 states and 55833 transitions. [2019-09-08 09:40:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 09:40:30,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:30,953 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] [2019-09-08 09:40:30,954 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1694101877, now seen corresponding path program 1 times [2019-09-08 09:40:30,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:30,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:30,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:31,012 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:40:31,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:31,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:31,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:31,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:31,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:31,014 INFO L87 Difference]: Start difference. First operand 39453 states and 55833 transitions. Second operand 3 states. [2019-09-08 09:40:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:34,882 INFO L93 Difference]: Finished difference Result 118163 states and 167248 transitions. [2019-09-08 09:40:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:34,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-09-08 09:40:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:34,974 INFO L225 Difference]: With dead ends: 118163 [2019-09-08 09:40:34,974 INFO L226 Difference]: Without dead ends: 78817 [2019-09-08 09:40:35,018 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:40:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78817 states. [2019-09-08 09:40:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78817 to 39459. [2019-09-08 09:40:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39459 states. [2019-09-08 09:40:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39459 states to 39459 states and 55839 transitions. [2019-09-08 09:40:37,223 INFO L78 Accepts]: Start accepts. Automaton has 39459 states and 55839 transitions. Word has length 162 [2019-09-08 09:40:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:37,223 INFO L475 AbstractCegarLoop]: Abstraction has 39459 states and 55839 transitions. [2019-09-08 09:40:37,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 39459 states and 55839 transitions. [2019-09-08 09:40:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 09:40:37,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:37,240 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] [2019-09-08 09:40:37,240 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:37,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1785958291, now seen corresponding path program 1 times [2019-09-08 09:40:37,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:37,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:37,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:37,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:37,340 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:40:37,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:37,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:37,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:37,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:37,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:37,342 INFO L87 Difference]: Start difference. First operand 39459 states and 55839 transitions. Second operand 3 states. [2019-09-08 09:40:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:40,351 INFO L93 Difference]: Finished difference Result 103726 states and 145964 transitions. [2019-09-08 09:40:40,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:40,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-08 09:40:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:40,437 INFO L225 Difference]: With dead ends: 103726 [2019-09-08 09:40:40,437 INFO L226 Difference]: Without dead ends: 65146 [2019-09-08 09:40:40,488 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:40:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65146 states. [2019-09-08 09:40:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65146 to 65080. [2019-09-08 09:40:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65080 states. [2019-09-08 09:40:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65080 states to 65080 states and 90074 transitions. [2019-09-08 09:40:44,923 INFO L78 Accepts]: Start accepts. Automaton has 65080 states and 90074 transitions. Word has length 163 [2019-09-08 09:40:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:44,924 INFO L475 AbstractCegarLoop]: Abstraction has 65080 states and 90074 transitions. [2019-09-08 09:40:44,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 65080 states and 90074 transitions. [2019-09-08 09:40:44,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 09:40:44,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:44,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:44,959 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:44,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:44,960 INFO L82 PathProgramCache]: Analyzing trace with hash 383913008, now seen corresponding path program 1 times [2019-09-08 09:40:44,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:44,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:44,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:44,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:44,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:45,102 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:40:45,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:45,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:45,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:45,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:45,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:45,104 INFO L87 Difference]: Start difference. First operand 65080 states and 90074 transitions. Second operand 4 states. [2019-09-08 09:40:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:47,918 INFO L93 Difference]: Finished difference Result 122795 states and 170472 transitions. [2019-09-08 09:40:47,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:47,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-08 09:40:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:47,976 INFO L225 Difference]: With dead ends: 122795 [2019-09-08 09:40:47,976 INFO L226 Difference]: Without dead ends: 58492 [2019-09-08 09:40:48,019 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:40:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58492 states. [2019-09-08 09:40:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58492 to 58492. [2019-09-08 09:40:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58492 states. [2019-09-08 09:40:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58492 states to 58492 states and 81315 transitions. [2019-09-08 09:40:52,450 INFO L78 Accepts]: Start accepts. Automaton has 58492 states and 81315 transitions. Word has length 163 [2019-09-08 09:40:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:52,450 INFO L475 AbstractCegarLoop]: Abstraction has 58492 states and 81315 transitions. [2019-09-08 09:40:52,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 58492 states and 81315 transitions. [2019-09-08 09:40:52,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 09:40:52,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:52,483 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] [2019-09-08 09:40:52,483 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:52,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:52,484 INFO L82 PathProgramCache]: Analyzing trace with hash -326098423, now seen corresponding path program 1 times [2019-09-08 09:40:52,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:52,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:52,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:52,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:52,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:52,572 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:40:52,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:52,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:52,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:52,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:52,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:52,574 INFO L87 Difference]: Start difference. First operand 58492 states and 81315 transitions. Second operand 3 states. [2019-09-08 09:40:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:56,447 INFO L93 Difference]: Finished difference Result 107660 states and 156573 transitions. [2019-09-08 09:40:56,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:56,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 09:40:56,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:56,538 INFO L225 Difference]: With dead ends: 107660 [2019-09-08 09:40:56,539 INFO L226 Difference]: Without dead ends: 75252 [2019-09-08 09:40:56,577 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:40:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75252 states. [2019-09-08 09:41:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75252 to 67292. [2019-09-08 09:41:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67292 states. [2019-09-08 09:41:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67292 states to 67292 states and 94675 transitions. [2019-09-08 09:41:01,953 INFO L78 Accepts]: Start accepts. Automaton has 67292 states and 94675 transitions. Word has length 169 [2019-09-08 09:41:01,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:01,954 INFO L475 AbstractCegarLoop]: Abstraction has 67292 states and 94675 transitions. [2019-09-08 09:41:01,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 67292 states and 94675 transitions. [2019-09-08 09:41:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 09:41:01,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:01,979 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] [2019-09-08 09:41:01,980 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:01,980 INFO L82 PathProgramCache]: Analyzing trace with hash 864545294, now seen corresponding path program 1 times [2019-09-08 09:41:01,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:01,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:01,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:01,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:02,082 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:41:02,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:02,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:02,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:02,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:02,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:02,084 INFO L87 Difference]: Start difference. First operand 67292 states and 94675 transitions. Second operand 3 states. [2019-09-08 09:41:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:08,020 INFO L93 Difference]: Finished difference Result 170948 states and 242706 transitions. [2019-09-08 09:41:08,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:41:08,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 09:41:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:08,162 INFO L225 Difference]: With dead ends: 170948 [2019-09-08 09:41:08,162 INFO L226 Difference]: Without dead ends: 120765 [2019-09-08 09:41:08,206 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:41:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120765 states. [2019-09-08 09:41:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120765 to 119971. [2019-09-08 09:41:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119971 states. [2019-09-08 09:41:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119971 states to 119971 states and 168388 transitions. [2019-09-08 09:41:14,795 INFO L78 Accepts]: Start accepts. Automaton has 119971 states and 168388 transitions. Word has length 169 [2019-09-08 09:41:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:14,795 INFO L475 AbstractCegarLoop]: Abstraction has 119971 states and 168388 transitions. [2019-09-08 09:41:14,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 119971 states and 168388 transitions. [2019-09-08 09:41:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 09:41:14,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:14,853 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] [2019-09-08 09:41:14,853 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:14,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:14,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2142966253, now seen corresponding path program 1 times [2019-09-08 09:41:14,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:14,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:14,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:14,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:14,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:14,982 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:41:14,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:14,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:41:14,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:41:14,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:41:14,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:41:14,985 INFO L87 Difference]: Start difference. First operand 119971 states and 168388 transitions. Second operand 5 states. [2019-09-08 09:41:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:20,158 INFO L93 Difference]: Finished difference Result 166480 states and 236203 transitions. [2019-09-08 09:41:20,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:41:20,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-09-08 09:41:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:20,232 INFO L225 Difference]: With dead ends: 166480 [2019-09-08 09:41:20,233 INFO L226 Difference]: Without dead ends: 67292 [2019-09-08 09:41:20,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:41:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67292 states. [2019-09-08 09:41:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67292 to 67292. [2019-09-08 09:41:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67292 states. [2019-09-08 09:41:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67292 states to 67292 states and 93548 transitions. [2019-09-08 09:41:23,829 INFO L78 Accepts]: Start accepts. Automaton has 67292 states and 93548 transitions. Word has length 169 [2019-09-08 09:41:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:23,830 INFO L475 AbstractCegarLoop]: Abstraction has 67292 states and 93548 transitions. [2019-09-08 09:41:23,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:41:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 67292 states and 93548 transitions. [2019-09-08 09:41:23,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 09:41:23,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:23,860 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] [2019-09-08 09:41:23,860 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:23,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:23,860 INFO L82 PathProgramCache]: Analyzing trace with hash -195703767, now seen corresponding path program 1 times [2019-09-08 09:41:23,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:23,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:23,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:23,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:23,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:23,997 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:41:23,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:23,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:41:23,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:41:23,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:41:23,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:41:23,999 INFO L87 Difference]: Start difference. First operand 67292 states and 93548 transitions. Second operand 4 states. [2019-09-08 09:41:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:28,843 INFO L93 Difference]: Finished difference Result 95960 states and 137838 transitions. [2019-09-08 09:41:28,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:28,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-08 09:41:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:28,909 INFO L225 Difference]: With dead ends: 95960 [2019-09-08 09:41:28,909 INFO L226 Difference]: Without dead ends: 59904 [2019-09-08 09:41:28,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:41:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59904 states. [2019-09-08 09:41:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59904 to 59902. [2019-09-08 09:41:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59902 states. [2019-09-08 09:41:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59902 states to 59902 states and 81570 transitions. [2019-09-08 09:41:32,026 INFO L78 Accepts]: Start accepts. Automaton has 59902 states and 81570 transitions. Word has length 169 [2019-09-08 09:41:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:32,026 INFO L475 AbstractCegarLoop]: Abstraction has 59902 states and 81570 transitions. [2019-09-08 09:41:32,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:41:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 59902 states and 81570 transitions. [2019-09-08 09:41:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 09:41:32,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:32,051 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] [2019-09-08 09:41:32,051 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:32,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:32,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1638829781, now seen corresponding path program 1 times [2019-09-08 09:41:32,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:32,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:32,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:32,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:32,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:32,265 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:41:32,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:32,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:41:32,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:41:32,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:41:32,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:41:32,267 INFO L87 Difference]: Start difference. First operand 59902 states and 81570 transitions. Second operand 8 states. [2019-09-08 09:41:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:35,150 INFO L93 Difference]: Finished difference Result 85370 states and 120702 transitions. [2019-09-08 09:41:35,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:35,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 169 [2019-09-08 09:41:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:35,211 INFO L225 Difference]: With dead ends: 85370 [2019-09-08 09:41:35,211 INFO L226 Difference]: Without dead ends: 56428 [2019-09-08 09:41:35,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:41:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56428 states. [2019-09-08 09:41:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56428 to 56426. [2019-09-08 09:41:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56426 states. [2019-09-08 09:41:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56426 states to 56426 states and 75848 transitions. [2019-09-08 09:41:38,693 INFO L78 Accepts]: Start accepts. Automaton has 56426 states and 75848 transitions. Word has length 169 [2019-09-08 09:41:38,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:38,693 INFO L475 AbstractCegarLoop]: Abstraction has 56426 states and 75848 transitions. [2019-09-08 09:41:38,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:41:38,693 INFO L276 IsEmpty]: Start isEmpty. Operand 56426 states and 75848 transitions. [2019-09-08 09:41:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 09:41:38,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:38,719 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] [2019-09-08 09:41:38,719 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1581151803, now seen corresponding path program 1 times [2019-09-08 09:41:38,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:38,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:38,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:38,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:38,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:38,992 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:41:38,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:38,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 09:41:38,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:41:38,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:41:38,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:41:38,993 INFO L87 Difference]: Start difference. First operand 56426 states and 75848 transitions. Second operand 9 states. [2019-09-08 09:41:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:41,934 INFO L93 Difference]: Finished difference Result 74164 states and 103065 transitions. [2019-09-08 09:41:41,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:41,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2019-09-08 09:41:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:41,981 INFO L225 Difference]: With dead ends: 74164 [2019-09-08 09:41:41,981 INFO L226 Difference]: Without dead ends: 49650 [2019-09-08 09:41:42,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:41:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49650 states. [2019-09-08 09:41:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49650 to 49648. [2019-09-08 09:41:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49648 states. [2019-09-08 09:41:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49648 states to 49648 states and 65111 transitions. [2019-09-08 09:41:44,640 INFO L78 Accepts]: Start accepts. Automaton has 49648 states and 65111 transitions. Word has length 169 [2019-09-08 09:41:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:44,640 INFO L475 AbstractCegarLoop]: Abstraction has 49648 states and 65111 transitions. [2019-09-08 09:41:44,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:41:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 49648 states and 65111 transitions. [2019-09-08 09:41:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 09:41:44,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:44,664 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] [2019-09-08 09:41:44,665 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:44,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1344755562, now seen corresponding path program 1 times [2019-09-08 09:41:44,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:44,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:44,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:44,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:44,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:44,830 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:41:44,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:44,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:41:44,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:41:44,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:41:44,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:41:44,832 INFO L87 Difference]: Start difference. First operand 49648 states and 65111 transitions. Second operand 4 states. [2019-09-08 09:41:48,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:48,326 INFO L93 Difference]: Finished difference Result 93377 states and 122334 transitions. [2019-09-08 09:41:48,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:48,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-08 09:41:48,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:48,366 INFO L225 Difference]: With dead ends: 93377 [2019-09-08 09:41:48,366 INFO L226 Difference]: Without dead ends: 44053 [2019-09-08 09:41:48,392 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:41:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44053 states. [2019-09-08 09:41:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44053 to 43957. [2019-09-08 09:41:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43957 states. [2019-09-08 09:41:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43957 states to 43957 states and 57482 transitions. [2019-09-08 09:41:50,607 INFO L78 Accepts]: Start accepts. Automaton has 43957 states and 57482 transitions. Word has length 169 [2019-09-08 09:41:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:50,607 INFO L475 AbstractCegarLoop]: Abstraction has 43957 states and 57482 transitions. [2019-09-08 09:41:50,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:41:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 43957 states and 57482 transitions. [2019-09-08 09:41:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 09:41:50,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:50,637 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] [2019-09-08 09:41:50,637 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:50,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:50,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1494505164, now seen corresponding path program 1 times [2019-09-08 09:41:50,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:50,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:50,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:50,790 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:41:50,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:50,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:41:50,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:41:50,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:41:50,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:41:50,792 INFO L87 Difference]: Start difference. First operand 43957 states and 57482 transitions. Second operand 4 states. [2019-09-08 09:41:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:53,324 INFO L93 Difference]: Finished difference Result 88047 states and 115111 transitions. [2019-09-08 09:41:53,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:53,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-09-08 09:41:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:53,366 INFO L225 Difference]: With dead ends: 88047 [2019-09-08 09:41:53,366 INFO L226 Difference]: Without dead ends: 44243 [2019-09-08 09:41:53,393 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:41:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44243 states. [2019-09-08 09:41:55,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44243 to 44086. [2019-09-08 09:41:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44086 states. [2019-09-08 09:41:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44086 states to 44086 states and 57615 transitions. [2019-09-08 09:41:55,843 INFO L78 Accepts]: Start accepts. Automaton has 44086 states and 57615 transitions. Word has length 171 [2019-09-08 09:41:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:55,843 INFO L475 AbstractCegarLoop]: Abstraction has 44086 states and 57615 transitions. [2019-09-08 09:41:55,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:41:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 44086 states and 57615 transitions. [2019-09-08 09:41:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:41:55,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:55,868 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] [2019-09-08 09:41:55,868 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:55,869 INFO L82 PathProgramCache]: Analyzing trace with hash -624098332, now seen corresponding path program 1 times [2019-09-08 09:41:55,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:55,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:55,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:55,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:55,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:55,921 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:41:55,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:55,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:55,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:55,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:55,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:55,923 INFO L87 Difference]: Start difference. First operand 44086 states and 57615 transitions. Second operand 3 states. [2019-09-08 09:42:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:01,468 INFO L93 Difference]: Finished difference Result 121107 states and 158344 transitions. [2019-09-08 09:42:01,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:01,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 09:42:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:01,552 INFO L225 Difference]: With dead ends: 121107 [2019-09-08 09:42:01,552 INFO L226 Difference]: Without dead ends: 87970 [2019-09-08 09:42:01,585 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:42:01,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87970 states. [2019-09-08 09:42:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87970 to 44096. [2019-09-08 09:42:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44096 states. [2019-09-08 09:42:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44096 states to 44096 states and 57625 transitions. [2019-09-08 09:42:04,439 INFO L78 Accepts]: Start accepts. Automaton has 44096 states and 57625 transitions. Word has length 172 [2019-09-08 09:42:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:04,439 INFO L475 AbstractCegarLoop]: Abstraction has 44096 states and 57625 transitions. [2019-09-08 09:42:04,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 44096 states and 57625 transitions. [2019-09-08 09:42:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:42:04,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:04,463 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] [2019-09-08 09:42:04,463 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash -53214933, now seen corresponding path program 1 times [2019-09-08 09:42:04,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:04,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:04,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:04,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:04,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:04,621 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:42:04,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:04,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:42:04,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:42:04,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:42:04,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:42:04,624 INFO L87 Difference]: Start difference. First operand 44096 states and 57625 transitions. Second operand 4 states. [2019-09-08 09:42:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:07,414 INFO L93 Difference]: Finished difference Result 77728 states and 101519 transitions. [2019-09-08 09:42:07,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:42:07,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 09:42:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:07,460 INFO L225 Difference]: With dead ends: 77728 [2019-09-08 09:42:07,460 INFO L226 Difference]: Without dead ends: 44086 [2019-09-08 09:42:07,490 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:42:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44086 states. [2019-09-08 09:42:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44086 to 44086. [2019-09-08 09:42:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44086 states. [2019-09-08 09:42:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44086 states to 44086 states and 57610 transitions. [2019-09-08 09:42:10,466 INFO L78 Accepts]: Start accepts. Automaton has 44086 states and 57610 transitions. Word has length 173 [2019-09-08 09:42:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:10,466 INFO L475 AbstractCegarLoop]: Abstraction has 44086 states and 57610 transitions. [2019-09-08 09:42:10,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:42:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 44086 states and 57610 transitions. [2019-09-08 09:42:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:42:10,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:10,492 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] [2019-09-08 09:42:10,492 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1336923536, now seen corresponding path program 1 times [2019-09-08 09:42:10,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:10,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:10,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:10,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:10,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:10,651 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:42:10,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:10,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:42:10,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:42:10,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:42:10,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:42:10,652 INFO L87 Difference]: Start difference. First operand 44086 states and 57610 transitions. Second operand 4 states. [2019-09-08 09:42:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:13,334 INFO L93 Difference]: Finished difference Result 82271 states and 107479 transitions. [2019-09-08 09:42:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:42:13,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 09:42:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:13,368 INFO L225 Difference]: With dead ends: 82271 [2019-09-08 09:42:13,368 INFO L226 Difference]: Without dead ends: 38508 [2019-09-08 09:42:13,390 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:42:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38508 states. [2019-09-08 09:42:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38508 to 38187. [2019-09-08 09:42:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38187 states. [2019-09-08 09:42:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38187 states to 38187 states and 49853 transitions. [2019-09-08 09:42:17,089 INFO L78 Accepts]: Start accepts. Automaton has 38187 states and 49853 transitions. Word has length 173 [2019-09-08 09:42:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:17,090 INFO L475 AbstractCegarLoop]: Abstraction has 38187 states and 49853 transitions. [2019-09-08 09:42:17,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:42:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 38187 states and 49853 transitions. [2019-09-08 09:42:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:42:17,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:17,109 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] [2019-09-08 09:42:17,109 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:17,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:17,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1139907566, now seen corresponding path program 1 times [2019-09-08 09:42:17,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:17,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:17,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:17,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:17,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:17,193 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:42:17,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:17,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:17,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:17,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:17,195 INFO L87 Difference]: Start difference. First operand 38187 states and 49853 transitions. Second operand 3 states. [2019-09-08 09:42:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:21,467 INFO L93 Difference]: Finished difference Result 97576 states and 129125 transitions. [2019-09-08 09:42:21,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:21,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 09:42:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:21,539 INFO L225 Difference]: With dead ends: 97576 [2019-09-08 09:42:21,539 INFO L226 Difference]: Without dead ends: 69793 [2019-09-08 09:42:21,570 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:42:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69793 states. [2019-09-08 09:42:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69793 to 68767. [2019-09-08 09:42:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68767 states. [2019-09-08 09:42:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68767 states to 68767 states and 89752 transitions. [2019-09-08 09:42:26,007 INFO L78 Accepts]: Start accepts. Automaton has 68767 states and 89752 transitions. Word has length 175 [2019-09-08 09:42:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:26,008 INFO L475 AbstractCegarLoop]: Abstraction has 68767 states and 89752 transitions. [2019-09-08 09:42:26,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 68767 states and 89752 transitions. [2019-09-08 09:42:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:42:26,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:26,041 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] [2019-09-08 09:42:26,042 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:26,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:26,042 INFO L82 PathProgramCache]: Analyzing trace with hash -973145431, now seen corresponding path program 1 times [2019-09-08 09:42:26,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:26,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:26,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:26,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:26,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:26,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:26,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:42:26,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:42:26,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:42:26,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:42:26,214 INFO L87 Difference]: Start difference. First operand 68767 states and 89752 transitions. Second operand 6 states. [2019-09-08 09:42:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:32,439 INFO L93 Difference]: Finished difference Result 133132 states and 180633 transitions. [2019-09-08 09:42:32,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:42:32,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 09:42:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:32,524 INFO L225 Difference]: With dead ends: 133132 [2019-09-08 09:42:32,525 INFO L226 Difference]: Without dead ends: 81002 [2019-09-08 09:42:32,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:42:32,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81002 states. [2019-09-08 09:42:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81002 to 63783. [2019-09-08 09:42:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63783 states. [2019-09-08 09:42:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63783 states to 63783 states and 85349 transitions. [2019-09-08 09:42:38,720 INFO L78 Accepts]: Start accepts. Automaton has 63783 states and 85349 transitions. Word has length 175 [2019-09-08 09:42:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:38,721 INFO L475 AbstractCegarLoop]: Abstraction has 63783 states and 85349 transitions. [2019-09-08 09:42:38,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:42:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 63783 states and 85349 transitions. [2019-09-08 09:42:38,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:42:38,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:38,744 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] [2019-09-08 09:42:38,744 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:38,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:38,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1441334035, now seen corresponding path program 1 times [2019-09-08 09:42:38,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:38,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:38,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:38,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:38,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:39,056 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:42:39,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:39,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 09:42:39,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 09:42:39,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 09:42:39,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 09:42:39,057 INFO L87 Difference]: Start difference. First operand 63783 states and 85349 transitions. Second operand 13 states. [2019-09-08 09:42:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:46,659 INFO L93 Difference]: Finished difference Result 107122 states and 145750 transitions. [2019-09-08 09:42:46,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 09:42:46,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 175 [2019-09-08 09:42:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:46,741 INFO L225 Difference]: With dead ends: 107122 [2019-09-08 09:42:46,741 INFO L226 Difference]: Without dead ends: 87205 [2019-09-08 09:42:46,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2019-09-08 09:42:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87205 states. [2019-09-08 09:42:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87205 to 67284. [2019-09-08 09:42:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67284 states. [2019-09-08 09:42:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67284 states to 67284 states and 89361 transitions. [2019-09-08 09:42:52,203 INFO L78 Accepts]: Start accepts. Automaton has 67284 states and 89361 transitions. Word has length 175 [2019-09-08 09:42:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:52,204 INFO L475 AbstractCegarLoop]: Abstraction has 67284 states and 89361 transitions. [2019-09-08 09:42:52,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 09:42:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 67284 states and 89361 transitions. [2019-09-08 09:42:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:42:52,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:52,230 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] [2019-09-08 09:42:52,230 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:52,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1446751773, now seen corresponding path program 1 times [2019-09-08 09:42:52,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:52,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:52,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:52,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:52,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:53,180 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:42:53,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:53,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 09:42:53,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 09:42:53,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 09:42:53,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-09-08 09:42:53,182 INFO L87 Difference]: Start difference. First operand 67284 states and 89361 transitions. Second operand 22 states. [2019-09-08 09:42:53,815 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-09-08 09:42:53,983 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-08 09:42:54,343 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-08 09:42:54,601 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-08 09:42:54,912 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 09:42:55,511 WARN L188 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 09:42:55,889 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 09:42:56,246 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 09:42:56,542 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 09:42:57,085 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-08 09:42:57,348 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 09:42:57,790 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 09:42:58,156 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 09:42:59,471 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-08 09:42:59,714 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 09:43:00,101 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-08 09:43:00,355 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 09:43:01,140 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-08 09:43:01,447 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 09:43:02,002 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-08 09:43:02,267 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-08 09:43:02,552 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 09:43:02,901 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 09:43:03,351 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-08 09:43:03,820 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-08 09:43:04,176 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 09:43:04,630 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-08 09:43:09,679 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-08 09:43:10,624 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2019-09-08 09:43:12,247 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2019-09-08 09:43:12,585 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-08 09:43:12,892 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-08 09:43:13,215 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-08 09:43:14,647 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-09-08 09:43:19,187 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-08 09:43:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:20,265 INFO L93 Difference]: Finished difference Result 153648 states and 215707 transitions. [2019-09-08 09:43:20,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 09:43:20,266 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 175 [2019-09-08 09:43:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:20,432 INFO L225 Difference]: With dead ends: 153648 [2019-09-08 09:43:20,432 INFO L226 Difference]: Without dead ends: 142102 [2019-09-08 09:43:20,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1047, Invalid=4355, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 09:43:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142102 states. [2019-09-08 09:43:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142102 to 68764. [2019-09-08 09:43:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68764 states. [2019-09-08 09:43:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68764 states to 68764 states and 91057 transitions. [2019-09-08 09:43:26,918 INFO L78 Accepts]: Start accepts. Automaton has 68764 states and 91057 transitions. Word has length 175 [2019-09-08 09:43:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:26,918 INFO L475 AbstractCegarLoop]: Abstraction has 68764 states and 91057 transitions. [2019-09-08 09:43:26,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 09:43:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 68764 states and 91057 transitions. [2019-09-08 09:43:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:43:26,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:26,944 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] [2019-09-08 09:43:26,945 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:26,945 INFO L82 PathProgramCache]: Analyzing trace with hash 109000414, now seen corresponding path program 1 times [2019-09-08 09:43:26,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:26,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:26,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:26,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:26,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:27,174 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:43:27,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:27,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 09:43:27,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 09:43:27,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 09:43:27,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 09:43:27,176 INFO L87 Difference]: Start difference. First operand 68764 states and 91057 transitions. Second operand 10 states. [2019-09-08 09:43:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:32,816 INFO L93 Difference]: Finished difference Result 89445 states and 121637 transitions. [2019-09-08 09:43:32,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:43:32,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 175 [2019-09-08 09:43:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:32,876 INFO L225 Difference]: With dead ends: 89445 [2019-09-08 09:43:32,876 INFO L226 Difference]: Without dead ends: 51784 [2019-09-08 09:43:32,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 09:43:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51784 states. [2019-09-08 09:43:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51784 to 40079. [2019-09-08 09:43:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40079 states. [2019-09-08 09:43:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40079 states to 40079 states and 51089 transitions. [2019-09-08 09:43:36,428 INFO L78 Accepts]: Start accepts. Automaton has 40079 states and 51089 transitions. Word has length 175 [2019-09-08 09:43:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:36,429 INFO L475 AbstractCegarLoop]: Abstraction has 40079 states and 51089 transitions. [2019-09-08 09:43:36,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 09:43:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 40079 states and 51089 transitions. [2019-09-08 09:43:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:43:36,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:36,448 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] [2019-09-08 09:43:36,449 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:36,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1693381390, now seen corresponding path program 1 times [2019-09-08 09:43:36,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:36,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:36,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:36,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:36,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:36,868 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:43:36,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:36,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 09:43:36,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 09:43:36,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 09:43:36,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-08 09:43:36,875 INFO L87 Difference]: Start difference. First operand 40079 states and 51089 transitions. Second operand 16 states. [2019-09-08 09:43:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:44,983 INFO L93 Difference]: Finished difference Result 72161 states and 96022 transitions. [2019-09-08 09:43:44,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 09:43:44,985 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 175 [2019-09-08 09:43:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:45,044 INFO L225 Difference]: With dead ends: 72161 [2019-09-08 09:43:45,044 INFO L226 Difference]: Without dead ends: 64584 [2019-09-08 09:43:45,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=355, Invalid=905, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 09:43:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64584 states. [2019-09-08 09:43:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64584 to 43341. [2019-09-08 09:43:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43341 states. [2019-09-08 09:43:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43341 states to 43341 states and 54831 transitions. [2019-09-08 09:43:48,865 INFO L78 Accepts]: Start accepts. Automaton has 43341 states and 54831 transitions. Word has length 175 [2019-09-08 09:43:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:48,866 INFO L475 AbstractCegarLoop]: Abstraction has 43341 states and 54831 transitions. [2019-09-08 09:43:48,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 09:43:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 43341 states and 54831 transitions. [2019-09-08 09:43:48,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:43:48,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:48,888 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] [2019-09-08 09:43:48,888 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:48,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:48,889 INFO L82 PathProgramCache]: Analyzing trace with hash -443994410, now seen corresponding path program 1 times [2019-09-08 09:43:48,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:48,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:48,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:48,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:48,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:50,127 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:43:50,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:50,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 09:43:50,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 09:43:50,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 09:43:50,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-09-08 09:43:50,129 INFO L87 Difference]: Start difference. First operand 43341 states and 54831 transitions. Second operand 21 states. [2019-09-08 09:43:50,510 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2019-09-08 09:43:51,456 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 09:43:51,656 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-08 09:43:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:58,299 INFO L93 Difference]: Finished difference Result 52531 states and 67507 transitions. [2019-09-08 09:43:58,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 09:43:58,300 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 175 [2019-09-08 09:43:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:58,339 INFO L225 Difference]: With dead ends: 52531 [2019-09-08 09:43:58,339 INFO L226 Difference]: Without dead ends: 44642 [2019-09-08 09:43:58,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=336, Invalid=1070, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 09:43:58,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44642 states. [2019-09-08 09:44:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44642 to 43445. [2019-09-08 09:44:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43445 states. [2019-09-08 09:44:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43445 states to 43445 states and 54959 transitions. [2019-09-08 09:44:02,548 INFO L78 Accepts]: Start accepts. Automaton has 43445 states and 54959 transitions. Word has length 175 [2019-09-08 09:44:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:02,548 INFO L475 AbstractCegarLoop]: Abstraction has 43445 states and 54959 transitions. [2019-09-08 09:44:02,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 09:44:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 43445 states and 54959 transitions. [2019-09-08 09:44:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:44:02,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:02,572 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] [2019-09-08 09:44:02,572 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:02,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1360149389, now seen corresponding path program 1 times [2019-09-08 09:44:02,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:02,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:02,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:02,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:02,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:04,186 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:44:04,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:04,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 09:44:04,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 09:44:04,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 09:44:04,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2019-09-08 09:44:04,188 INFO L87 Difference]: Start difference. First operand 43445 states and 54959 transitions. Second operand 25 states. [2019-09-08 09:44:04,983 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 09:44:05,405 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 09:44:05,717 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-08 09:44:06,083 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-09-08 09:44:06,423 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 09:44:06,735 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-08 09:44:07,182 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-08 09:44:07,373 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-08 09:44:07,614 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-08 09:44:07,805 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 09:44:08,279 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 09:44:08,508 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-09-08 09:44:08,846 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-09-08 09:44:11,097 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-08 09:44:11,465 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-09-08 09:44:11,863 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2019-09-08 09:44:12,644 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 35 [2019-09-08 09:44:13,393 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2019-09-08 09:44:13,951 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 35 [2019-09-08 09:44:15,775 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2019-09-08 09:44:15,920 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 09:44:16,383 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-09-08 09:44:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:21,785 INFO L93 Difference]: Finished difference Result 71730 states and 95665 transitions. [2019-09-08 09:44:21,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 09:44:21,785 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 175 [2019-09-08 09:44:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:21,847 INFO L225 Difference]: With dead ends: 71730 [2019-09-08 09:44:21,847 INFO L226 Difference]: Without dead ends: 67841 [2019-09-08 09:44:21,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=595, Invalid=2711, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 09:44:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67841 states. [2019-09-08 09:44:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67841 to 44350. [2019-09-08 09:44:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44350 states. [2019-09-08 09:44:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44350 states to 44350 states and 56004 transitions. [2019-09-08 09:44:26,572 INFO L78 Accepts]: Start accepts. Automaton has 44350 states and 56004 transitions. Word has length 175 [2019-09-08 09:44:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:26,573 INFO L475 AbstractCegarLoop]: Abstraction has 44350 states and 56004 transitions. [2019-09-08 09:44:26,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 09:44:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 44350 states and 56004 transitions. [2019-09-08 09:44:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:44:26,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:26,596 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:26,597 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:26,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:26,597 INFO L82 PathProgramCache]: Analyzing trace with hash 821764910, now seen corresponding path program 1 times [2019-09-08 09:44:26,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:26,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:26,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:26,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:26,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:26,864 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:44:26,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:26,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 09:44:26,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 09:44:26,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 09:44:26,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-08 09:44:26,866 INFO L87 Difference]: Start difference. First operand 44350 states and 56004 transitions. Second operand 11 states. [2019-09-08 09:44:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:30,538 INFO L93 Difference]: Finished difference Result 52766 states and 68563 transitions. [2019-09-08 09:44:30,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:44:30,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2019-09-08 09:44:30,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:30,570 INFO L225 Difference]: With dead ends: 52766 [2019-09-08 09:44:30,570 INFO L226 Difference]: Without dead ends: 36400 [2019-09-08 09:44:30,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 09:44:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36400 states. [2019-09-08 09:44:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36400 to 31990. [2019-09-08 09:44:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31990 states. [2019-09-08 09:44:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31990 states to 31990 states and 38828 transitions. [2019-09-08 09:44:33,665 INFO L78 Accepts]: Start accepts. Automaton has 31990 states and 38828 transitions. Word has length 175 [2019-09-08 09:44:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:33,666 INFO L475 AbstractCegarLoop]: Abstraction has 31990 states and 38828 transitions. [2019-09-08 09:44:33,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 09:44:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 31990 states and 38828 transitions. [2019-09-08 09:44:33,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:44:33,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:33,690 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] [2019-09-08 09:44:33,690 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:33,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:33,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1997349711, now seen corresponding path program 1 times [2019-09-08 09:44:33,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:33,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:33,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:33,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:33,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:35,231 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:44:35,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:35,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 09:44:35,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 09:44:35,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 09:44:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2019-09-08 09:44:35,233 INFO L87 Difference]: Start difference. First operand 31990 states and 38828 transitions. Second operand 24 states. [2019-09-08 09:44:35,804 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 09:44:36,311 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 09:44:36,662 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 09:44:36,894 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-08 09:44:37,052 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-08 09:44:37,933 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-08 09:44:38,904 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-08 09:44:39,255 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-08 09:44:40,145 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-08 09:44:40,569 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-08 09:44:40,997 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-08 09:44:41,342 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-08 09:44:41,562 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-08 09:44:42,496 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-08 09:44:42,820 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-08 09:44:43,323 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 09:44:43,641 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-08 09:44:43,928 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 09:44:44,222 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 09:44:44,387 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 09:44:44,613 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 09:44:45,096 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-08 09:44:45,441 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-08 09:44:48,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:48,503 INFO L93 Difference]: Finished difference Result 46238 states and 57080 transitions. [2019-09-08 09:44:48,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 09:44:48,504 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2019-09-08 09:44:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:48,541 INFO L225 Difference]: With dead ends: 46238 [2019-09-08 09:44:48,541 INFO L226 Difference]: Without dead ends: 46232 [2019-09-08 09:44:48,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=628, Invalid=1822, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 09:44:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46232 states. [2019-09-08 09:44:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46232 to 33909. [2019-09-08 09:44:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33909 states. [2019-09-08 09:44:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33909 states to 33909 states and 41034 transitions. [2019-09-08 09:44:52,190 INFO L78 Accepts]: Start accepts. Automaton has 33909 states and 41034 transitions. Word has length 175 [2019-09-08 09:44:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:52,190 INFO L475 AbstractCegarLoop]: Abstraction has 33909 states and 41034 transitions. [2019-09-08 09:44:52,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 09:44:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 33909 states and 41034 transitions. [2019-09-08 09:44:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:44:52,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:52,212 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] [2019-09-08 09:44:52,212 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:52,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1996733064, now seen corresponding path program 1 times [2019-09-08 09:44:52,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:52,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:52,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:52,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:52,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:53,459 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:44:53,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:53,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 09:44:53,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 09:44:53,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 09:44:53,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-09-08 09:44:53,460 INFO L87 Difference]: Start difference. First operand 33909 states and 41034 transitions. Second operand 26 states. [2019-09-08 09:44:54,648 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-09-08 09:44:54,821 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-09-08 09:44:55,006 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-08 09:44:55,713 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-09-08 09:44:55,934 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-08 09:44:56,204 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-08 09:44:56,402 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-08 09:44:56,800 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-08 09:44:57,079 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-08 09:44:57,261 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-09-08 09:44:57,591 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-08 09:44:57,753 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 09:44:57,951 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 09:44:58,109 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-08 09:44:59,989 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-08 09:45:00,394 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-08 09:45:00,626 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-08 09:45:00,981 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-09-08 09:45:02,027 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-09-08 09:45:02,352 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-09-08 09:45:02,607 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2019-09-08 09:45:02,832 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-09-08 09:45:04,146 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-08 09:45:04,566 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-09-08 09:45:04,839 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 61 [2019-09-08 09:45:05,178 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 65 [2019-09-08 09:45:05,470 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-09-08 09:45:05,735 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-09-08 09:45:05,969 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-09-08 09:45:06,221 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2019-09-08 09:45:06,519 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-09-08 09:45:06,740 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-09-08 09:45:07,681 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2019-09-08 09:45:08,003 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-09-08 09:45:08,278 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-08 09:45:08,574 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 09:45:08,786 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-08 09:45:09,012 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-08 09:45:09,294 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 09:45:09,528 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 09:45:09,741 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 09:45:09,999 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 09:45:10,510 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2019-09-08 09:45:10,890 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 09:45:11,126 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-08 09:45:11,635 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-09-08 09:45:11,878 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 09:45:12,067 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 09:45:12,271 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-08 09:45:12,579 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 09:45:12,953 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-08 09:45:13,284 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 09:45:13,621 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-08 09:45:13,961 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 09:45:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:16,749 INFO L93 Difference]: Finished difference Result 62226 states and 75423 transitions. [2019-09-08 09:45:16,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 09:45:16,749 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 175 [2019-09-08 09:45:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:16,804 INFO L225 Difference]: With dead ends: 62226 [2019-09-08 09:45:16,804 INFO L226 Difference]: Without dead ends: 61534 [2019-09-08 09:45:16,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1784, Invalid=6226, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 09:45:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61534 states. [2019-09-08 09:45:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61534 to 36601. [2019-09-08 09:45:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36601 states. [2019-09-08 09:45:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36601 states to 36601 states and 44130 transitions. [2019-09-08 09:45:21,068 INFO L78 Accepts]: Start accepts. Automaton has 36601 states and 44130 transitions. Word has length 175 [2019-09-08 09:45:21,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:21,069 INFO L475 AbstractCegarLoop]: Abstraction has 36601 states and 44130 transitions. [2019-09-08 09:45:21,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 09:45:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 36601 states and 44130 transitions. [2019-09-08 09:45:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:45:21,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:21,096 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] [2019-09-08 09:45:21,096 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash -702412220, now seen corresponding path program 1 times [2019-09-08 09:45:21,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:21,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:21,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:21,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:21,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:21,894 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 09:45:22,962 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:45:22,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:22,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 09:45:22,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 09:45:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 09:45:22,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-08 09:45:22,963 INFO L87 Difference]: Start difference. First operand 36601 states and 44130 transitions. Second operand 26 states. [2019-09-08 09:45:23,832 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-08 09:45:24,159 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 09:45:24,462 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-08 09:45:25,342 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-08 09:45:25,747 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-08 09:45:26,004 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 09:45:26,398 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 09:45:26,619 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-08 09:45:27,115 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-08 09:45:30,797 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 09:45:31,048 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2019-09-08 09:45:31,303 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-08 09:45:33,136 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-09-08 09:45:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:37,757 INFO L93 Difference]: Finished difference Result 53338 states and 66160 transitions. [2019-09-08 09:45:37,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 09:45:37,758 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 175 [2019-09-08 09:45:37,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:37,803 INFO L225 Difference]: With dead ends: 53338 [2019-09-08 09:45:37,803 INFO L226 Difference]: Without dead ends: 51951 [2019-09-08 09:45:37,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=483, Invalid=2487, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 09:45:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51951 states. [2019-09-08 09:45:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51951 to 38629. [2019-09-08 09:45:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38629 states. [2019-09-08 09:45:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38629 states to 38629 states and 46493 transitions. [2019-09-08 09:45:42,336 INFO L78 Accepts]: Start accepts. Automaton has 38629 states and 46493 transitions. Word has length 175 [2019-09-08 09:45:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:42,336 INFO L475 AbstractCegarLoop]: Abstraction has 38629 states and 46493 transitions. [2019-09-08 09:45:42,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 09:45:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 38629 states and 46493 transitions. [2019-09-08 09:45:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:45:42,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:42,362 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] [2019-09-08 09:45:42,362 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:42,363 INFO L82 PathProgramCache]: Analyzing trace with hash 17947596, now seen corresponding path program 1 times [2019-09-08 09:45:42,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:42,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:42,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:42,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:42,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:43,254 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-08 09:45:44,668 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:45:44,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:44,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 09:45:44,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 09:45:44,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 09:45:44,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2019-09-08 09:45:44,669 INFO L87 Difference]: Start difference. First operand 38629 states and 46493 transitions. Second operand 26 states. [2019-09-08 09:45:45,494 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-08 09:45:45,690 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 09:45:46,452 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 09:45:46,824 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-08 09:45:48,369 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-08 09:45:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:56,842 INFO L93 Difference]: Finished difference Result 50190 states and 60426 transitions. [2019-09-08 09:45:56,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 09:45:56,842 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 175 [2019-09-08 09:45:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:56,876 INFO L225 Difference]: With dead ends: 50190 [2019-09-08 09:45:56,877 INFO L226 Difference]: Without dead ends: 48057 [2019-09-08 09:45:56,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=456, Invalid=1800, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 09:45:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48057 states. [2019-09-08 09:46:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48057 to 40084. [2019-09-08 09:46:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40084 states. [2019-09-08 09:46:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40084 states to 40084 states and 48157 transitions. [2019-09-08 09:46:01,709 INFO L78 Accepts]: Start accepts. Automaton has 40084 states and 48157 transitions. Word has length 175 [2019-09-08 09:46:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:01,709 INFO L475 AbstractCegarLoop]: Abstraction has 40084 states and 48157 transitions. [2019-09-08 09:46:01,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 09:46:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 40084 states and 48157 transitions. [2019-09-08 09:46:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:46:01,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:01,739 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] [2019-09-08 09:46:01,740 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:01,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2009626333, now seen corresponding path program 1 times [2019-09-08 09:46:01,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:01,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:01,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:01,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:02,328 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:46:02,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:02,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:46:02,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:46:02,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:46:02,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:46:02,329 INFO L87 Difference]: Start difference. First operand 40084 states and 48157 transitions. Second operand 17 states. [2019-09-08 09:46:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:13,025 INFO L93 Difference]: Finished difference Result 74868 states and 90587 transitions. [2019-09-08 09:46:13,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 09:46:13,025 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 175 [2019-09-08 09:46:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:13,087 INFO L225 Difference]: With dead ends: 74868 [2019-09-08 09:46:13,087 INFO L226 Difference]: Without dead ends: 69939 [2019-09-08 09:46:13,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=348, Invalid=984, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 09:46:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69939 states. [2019-09-08 09:46:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69939 to 52638. [2019-09-08 09:46:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52638 states. [2019-09-08 09:46:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52638 states to 52638 states and 62536 transitions. [2019-09-08 09:46:19,806 INFO L78 Accepts]: Start accepts. Automaton has 52638 states and 62536 transitions. Word has length 175 [2019-09-08 09:46:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:19,806 INFO L475 AbstractCegarLoop]: Abstraction has 52638 states and 62536 transitions. [2019-09-08 09:46:19,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:46:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 52638 states and 62536 transitions. [2019-09-08 09:46:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:46:19,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:19,839 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] [2019-09-08 09:46:19,840 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:19,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:19,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1224452038, now seen corresponding path program 1 times [2019-09-08 09:46:19,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:19,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:19,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:19,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:19,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:21,084 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:46:21,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:21,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 09:46:21,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 09:46:21,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 09:46:21,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2019-09-08 09:46:21,085 INFO L87 Difference]: Start difference. First operand 52638 states and 62536 transitions. Second operand 22 states. [2019-09-08 09:46:22,682 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-08 09:46:22,918 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-08 09:46:23,139 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 09:46:24,240 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-08 09:46:29,667 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 09:46:29,963 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-08 09:46:30,218 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-08 09:46:31,494 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-08 09:46:33,007 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-08 09:46:33,174 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 09:46:33,358 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-09-08 09:46:33,693 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 09:46:33,862 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 09:46:34,516 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 09:46:34,881 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 09:46:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:38,906 INFO L93 Difference]: Finished difference Result 74370 states and 89830 transitions. [2019-09-08 09:46:38,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 09:46:38,907 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 175 [2019-09-08 09:46:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:38,963 INFO L225 Difference]: With dead ends: 74370 [2019-09-08 09:46:38,963 INFO L226 Difference]: Without dead ends: 72166 [2019-09-08 09:46:38,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=685, Invalid=1967, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 09:46:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72166 states. [2019-09-08 09:46:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72166 to 55536. [2019-09-08 09:46:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55536 states. [2019-09-08 09:46:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55536 states to 55536 states and 65819 transitions. [2019-09-08 09:46:48,041 INFO L78 Accepts]: Start accepts. Automaton has 55536 states and 65819 transitions. Word has length 175 [2019-09-08 09:46:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:48,041 INFO L475 AbstractCegarLoop]: Abstraction has 55536 states and 65819 transitions. [2019-09-08 09:46:48,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 09:46:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 55536 states and 65819 transitions. [2019-09-08 09:46:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:46:48,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:48,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:46:48,081 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:48,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash -348028919, now seen corresponding path program 1 times [2019-09-08 09:46:48,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:48,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:48,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:48,142 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:46:48,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:48,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:48,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:48,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:48,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:48,143 INFO L87 Difference]: Start difference. First operand 55536 states and 65819 transitions. Second operand 3 states. [2019-09-08 09:46:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:54,706 INFO L93 Difference]: Finished difference Result 89806 states and 106891 transitions. [2019-09-08 09:46:54,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:54,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 09:46:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:54,750 INFO L225 Difference]: With dead ends: 89806 [2019-09-08 09:46:54,750 INFO L226 Difference]: Without dead ends: 53589 [2019-09-08 09:46:54,771 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:46:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53589 states. [2019-09-08 09:47:00,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53589 to 52473. [2019-09-08 09:47:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52473 states. [2019-09-08 09:47:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52473 states to 52473 states and 61897 transitions. [2019-09-08 09:47:00,976 INFO L78 Accepts]: Start accepts. Automaton has 52473 states and 61897 transitions. Word has length 176 [2019-09-08 09:47:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:00,976 INFO L475 AbstractCegarLoop]: Abstraction has 52473 states and 61897 transitions. [2019-09-08 09:47:00,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 52473 states and 61897 transitions. [2019-09-08 09:47:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:47:01,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:01,013 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:47:01,013 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:01,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1647546256, now seen corresponding path program 1 times [2019-09-08 09:47:01,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:01,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:01,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:01,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:01,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:01,085 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:47:01,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:01,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:01,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:01,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:01,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:01,086 INFO L87 Difference]: Start difference. First operand 52473 states and 61897 transitions. Second operand 3 states. [2019-09-08 09:47:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:06,820 INFO L93 Difference]: Finished difference Result 72219 states and 86582 transitions. [2019-09-08 09:47:06,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:06,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 09:47:06,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:06,868 INFO L225 Difference]: With dead ends: 72219 [2019-09-08 09:47:06,868 INFO L226 Difference]: Without dead ends: 45505 [2019-09-08 09:47:06,892 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:47:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45505 states. [2019-09-08 09:47:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45505 to 43445. [2019-09-08 09:47:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43445 states. [2019-09-08 09:47:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43445 states to 43445 states and 51287 transitions. [2019-09-08 09:47:11,931 INFO L78 Accepts]: Start accepts. Automaton has 43445 states and 51287 transitions. Word has length 176 [2019-09-08 09:47:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:11,932 INFO L475 AbstractCegarLoop]: Abstraction has 43445 states and 51287 transitions. [2019-09-08 09:47:11,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 43445 states and 51287 transitions. [2019-09-08 09:47:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:47:11,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:11,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:47:11,962 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:11,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash 288937474, now seen corresponding path program 1 times [2019-09-08 09:47:11,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:11,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:11,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:12,028 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:47:12,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:12,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:12,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:12,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:12,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:12,029 INFO L87 Difference]: Start difference. First operand 43445 states and 51287 transitions. Second operand 3 states. [2019-09-08 09:47:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:16,631 INFO L93 Difference]: Finished difference Result 60308 states and 71882 transitions. [2019-09-08 09:47:16,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:16,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 09:47:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:16,667 INFO L225 Difference]: With dead ends: 60308 [2019-09-08 09:47:16,667 INFO L226 Difference]: Without dead ends: 37782 [2019-09-08 09:47:16,684 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:47:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37782 states. [2019-09-08 09:47:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37782 to 37678. [2019-09-08 09:47:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37678 states. [2019-09-08 09:47:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37678 states to 37678 states and 44414 transitions. [2019-09-08 09:47:22,079 INFO L78 Accepts]: Start accepts. Automaton has 37678 states and 44414 transitions. Word has length 176 [2019-09-08 09:47:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:22,079 INFO L475 AbstractCegarLoop]: Abstraction has 37678 states and 44414 transitions. [2019-09-08 09:47:22,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 37678 states and 44414 transitions. [2019-09-08 09:47:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:47:22,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:22,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:47:22,107 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:22,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:22,107 INFO L82 PathProgramCache]: Analyzing trace with hash 620523666, now seen corresponding path program 1 times [2019-09-08 09:47:22,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:22,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:22,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:22,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:22,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:22,165 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:47:22,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:22,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:22,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:22,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:22,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:22,166 INFO L87 Difference]: Start difference. First operand 37678 states and 44414 transitions. Second operand 3 states. [2019-09-08 09:47:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:26,557 INFO L93 Difference]: Finished difference Result 62444 states and 73765 transitions. [2019-09-08 09:47:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:26,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 09:47:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:26,586 INFO L225 Difference]: With dead ends: 62444 [2019-09-08 09:47:26,587 INFO L226 Difference]: Without dead ends: 36606 [2019-09-08 09:47:26,603 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:47:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36606 states. [2019-09-08 09:47:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36606 to 36502. [2019-09-08 09:47:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36502 states. [2019-09-08 09:47:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36502 states to 36502 states and 42708 transitions. [2019-09-08 09:47:30,738 INFO L78 Accepts]: Start accepts. Automaton has 36502 states and 42708 transitions. Word has length 176 [2019-09-08 09:47:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:30,739 INFO L475 AbstractCegarLoop]: Abstraction has 36502 states and 42708 transitions. [2019-09-08 09:47:30,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 36502 states and 42708 transitions. [2019-09-08 09:47:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:47:30,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:30,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:47:30,762 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash -142958053, now seen corresponding path program 1 times [2019-09-08 09:47:30,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:30,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:30,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:30,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:30,815 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:47:30,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:30,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:30,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:30,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:30,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:30,816 INFO L87 Difference]: Start difference. First operand 36502 states and 42708 transitions. Second operand 3 states. [2019-09-08 09:47:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:34,867 INFO L93 Difference]: Finished difference Result 50788 states and 60695 transitions. [2019-09-08 09:47:34,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:34,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 09:47:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:34,898 INFO L225 Difference]: With dead ends: 50788 [2019-09-08 09:47:34,898 INFO L226 Difference]: Without dead ends: 30870 [2019-09-08 09:47:34,909 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:47:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30870 states. [2019-09-08 09:47:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30870 to 28833. [2019-09-08 09:47:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28833 states. [2019-09-08 09:47:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28833 states to 28833 states and 33932 transitions. [2019-09-08 09:47:38,148 INFO L78 Accepts]: Start accepts. Automaton has 28833 states and 33932 transitions. Word has length 176 [2019-09-08 09:47:38,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:38,149 INFO L475 AbstractCegarLoop]: Abstraction has 28833 states and 33932 transitions. [2019-09-08 09:47:38,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 28833 states and 33932 transitions. [2019-09-08 09:47:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:47:38,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:38,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:47:38,167 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1514420973, now seen corresponding path program 1 times [2019-09-08 09:47:38,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:38,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:38,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:38,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:38,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:38,219 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:47:38,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:38,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:38,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:38,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:38,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:38,220 INFO L87 Difference]: Start difference. First operand 28833 states and 33932 transitions. Second operand 3 states. [2019-09-08 09:47:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:41,477 INFO L93 Difference]: Finished difference Result 47574 states and 56372 transitions. [2019-09-08 09:47:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:41,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 09:47:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:41,504 INFO L225 Difference]: With dead ends: 47574 [2019-09-08 09:47:41,504 INFO L226 Difference]: Without dead ends: 27038 [2019-09-08 09:47:41,525 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:47:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27038 states. [2019-09-08 09:47:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27038 to 26022. [2019-09-08 09:47:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26022 states. [2019-09-08 09:47:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26022 states to 26022 states and 30542 transitions. [2019-09-08 09:47:44,527 INFO L78 Accepts]: Start accepts. Automaton has 26022 states and 30542 transitions. Word has length 176 [2019-09-08 09:47:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:44,527 INFO L475 AbstractCegarLoop]: Abstraction has 26022 states and 30542 transitions. [2019-09-08 09:47:44,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 26022 states and 30542 transitions. [2019-09-08 09:47:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 09:47:44,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:44,542 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] [2019-09-08 09:47:44,542 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:44,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:44,542 INFO L82 PathProgramCache]: Analyzing trace with hash 636108721, now seen corresponding path program 1 times [2019-09-08 09:47:44,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:44,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:44,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:44,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:44,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:44,615 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:47:44,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:44,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:44,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:44,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:44,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:44,616 INFO L87 Difference]: Start difference. First operand 26022 states and 30542 transitions. Second operand 3 states. [2019-09-08 09:47:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:47,497 INFO L93 Difference]: Finished difference Result 32346 states and 37941 transitions. [2019-09-08 09:47:47,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:47,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 09:47:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:47,519 INFO L225 Difference]: With dead ends: 32346 [2019-09-08 09:47:47,519 INFO L226 Difference]: Without dead ends: 25742 [2019-09-08 09:47:47,527 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:47:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25742 states. [2019-09-08 09:47:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25742 to 25626. [2019-09-08 09:47:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25626 states. [2019-09-08 09:47:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25626 states to 25626 states and 29931 transitions. [2019-09-08 09:47:50,390 INFO L78 Accepts]: Start accepts. Automaton has 25626 states and 29931 transitions. Word has length 180 [2019-09-08 09:47:50,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:50,390 INFO L475 AbstractCegarLoop]: Abstraction has 25626 states and 29931 transitions. [2019-09-08 09:47:50,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25626 states and 29931 transitions. [2019-09-08 09:47:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 09:47:50,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:50,404 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] [2019-09-08 09:47:50,404 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:50,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:50,405 INFO L82 PathProgramCache]: Analyzing trace with hash -444325036, now seen corresponding path program 1 times [2019-09-08 09:47:50,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:50,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:50,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:50,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:50,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:50,458 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:47:50,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:50,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:50,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:50,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:50,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:50,459 INFO L87 Difference]: Start difference. First operand 25626 states and 29931 transitions. Second operand 3 states. [2019-09-08 09:47:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:53,283 INFO L93 Difference]: Finished difference Result 31616 states and 36904 transitions. [2019-09-08 09:47:53,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:53,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 09:47:53,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:53,304 INFO L225 Difference]: With dead ends: 31616 [2019-09-08 09:47:53,304 INFO L226 Difference]: Without dead ends: 25297 [2019-09-08 09:47:53,310 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:47:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25297 states. [2019-09-08 09:47:56,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25297 to 25143. [2019-09-08 09:47:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25143 states. [2019-09-08 09:47:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25143 states to 25143 states and 29250 transitions. [2019-09-08 09:47:56,098 INFO L78 Accepts]: Start accepts. Automaton has 25143 states and 29250 transitions. Word has length 180 [2019-09-08 09:47:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:56,098 INFO L475 AbstractCegarLoop]: Abstraction has 25143 states and 29250 transitions. [2019-09-08 09:47:56,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 25143 states and 29250 transitions. [2019-09-08 09:47:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 09:47:56,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:56,112 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] [2019-09-08 09:47:56,112 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:56,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash 917076932, now seen corresponding path program 1 times [2019-09-08 09:47:56,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:56,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:56,178 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:47:56,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:56,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:56,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:56,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:56,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:56,179 INFO L87 Difference]: Start difference. First operand 25143 states and 29250 transitions. Second operand 3 states. [2019-09-08 09:47:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:59,451 INFO L93 Difference]: Finished difference Result 28779 states and 33697 transitions. [2019-09-08 09:47:59,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:59,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 09:47:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:59,471 INFO L225 Difference]: With dead ends: 28779 [2019-09-08 09:47:59,471 INFO L226 Difference]: Without dead ends: 23251 [2019-09-08 09:47:59,477 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:47:59,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23251 states. [2019-09-08 09:48:01,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23251 to 23189. [2019-09-08 09:48:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23189 states. [2019-09-08 09:48:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23189 states to 23189 states and 27029 transitions. [2019-09-08 09:48:02,000 INFO L78 Accepts]: Start accepts. Automaton has 23189 states and 27029 transitions. Word has length 180 [2019-09-08 09:48:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:02,000 INFO L475 AbstractCegarLoop]: Abstraction has 23189 states and 27029 transitions. [2019-09-08 09:48:02,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 23189 states and 27029 transitions. [2019-09-08 09:48:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 09:48:02,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:02,014 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] [2019-09-08 09:48:02,014 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1579848431, now seen corresponding path program 1 times [2019-09-08 09:48:02,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:02,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:02,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:02,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:02,066 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:48:02,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:02,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:02,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:02,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:02,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:02,067 INFO L87 Difference]: Start difference. First operand 23189 states and 27029 transitions. Second operand 3 states. [2019-09-08 09:48:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:04,469 INFO L93 Difference]: Finished difference Result 27548 states and 32331 transitions. [2019-09-08 09:48:04,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:04,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 09:48:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:04,486 INFO L225 Difference]: With dead ends: 27548 [2019-09-08 09:48:04,486 INFO L226 Difference]: Without dead ends: 21268 [2019-09-08 09:48:04,492 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:48:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21268 states. [2019-09-08 09:48:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21268 to 21192. [2019-09-08 09:48:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21192 states. [2019-09-08 09:48:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21192 states to 21192 states and 24690 transitions. [2019-09-08 09:48:06,870 INFO L78 Accepts]: Start accepts. Automaton has 21192 states and 24690 transitions. Word has length 180 [2019-09-08 09:48:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:06,870 INFO L475 AbstractCegarLoop]: Abstraction has 21192 states and 24690 transitions. [2019-09-08 09:48:06,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21192 states and 24690 transitions. [2019-09-08 09:48:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 09:48:06,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:06,880 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] [2019-09-08 09:48:06,881 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1857534320, now seen corresponding path program 1 times [2019-09-08 09:48:06,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:06,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:06,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:06,939 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:48:06,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:06,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:06,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:06,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:06,940 INFO L87 Difference]: Start difference. First operand 21192 states and 24690 transitions. Second operand 3 states. [2019-09-08 09:48:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:09,324 INFO L93 Difference]: Finished difference Result 26876 states and 31309 transitions. [2019-09-08 09:48:09,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:09,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 09:48:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:09,345 INFO L225 Difference]: With dead ends: 26876 [2019-09-08 09:48:09,345 INFO L226 Difference]: Without dead ends: 20979 [2019-09-08 09:48:09,352 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:48:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20979 states. [2019-09-08 09:48:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20979 to 20923. [2019-09-08 09:48:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20923 states. [2019-09-08 09:48:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20923 states to 20923 states and 24238 transitions. [2019-09-08 09:48:11,584 INFO L78 Accepts]: Start accepts. Automaton has 20923 states and 24238 transitions. Word has length 180 [2019-09-08 09:48:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:11,585 INFO L475 AbstractCegarLoop]: Abstraction has 20923 states and 24238 transitions. [2019-09-08 09:48:11,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 20923 states and 24238 transitions. [2019-09-08 09:48:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 09:48:11,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:11,685 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] [2019-09-08 09:48:11,686 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:11,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1070549229, now seen corresponding path program 1 times [2019-09-08 09:48:11,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:11,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:11,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:11,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:11,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:11,744 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:48:11,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:11,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:11,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:11,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:11,746 INFO L87 Difference]: Start difference. First operand 20923 states and 24238 transitions. Second operand 3 states. [2019-09-08 09:48:13,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:13,868 INFO L93 Difference]: Finished difference Result 24622 states and 28751 transitions. [2019-09-08 09:48:13,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:13,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 09:48:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:13,886 INFO L225 Difference]: With dead ends: 24622 [2019-09-08 09:48:13,886 INFO L226 Difference]: Without dead ends: 19292 [2019-09-08 09:48:13,894 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:48:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19292 states. [2019-09-08 09:48:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19292 to 19255. [2019-09-08 09:48:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19255 states. [2019-09-08 09:48:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19255 states to 19255 states and 22316 transitions. [2019-09-08 09:48:16,095 INFO L78 Accepts]: Start accepts. Automaton has 19255 states and 22316 transitions. Word has length 180 [2019-09-08 09:48:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:16,095 INFO L475 AbstractCegarLoop]: Abstraction has 19255 states and 22316 transitions. [2019-09-08 09:48:16,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 19255 states and 22316 transitions. [2019-09-08 09:48:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:48:16,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:16,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:48:16,105 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -225002891, now seen corresponding path program 1 times [2019-09-08 09:48:16,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:16,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:16,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:17,730 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:48:17,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:17,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 09:48:17,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 09:48:17,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 09:48:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-09-08 09:48:17,731 INFO L87 Difference]: Start difference. First operand 19255 states and 22316 transitions. Second operand 25 states. [2019-09-08 09:48:18,247 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-08 09:48:18,509 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-08 09:48:18,774 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-08 09:48:19,237 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-08 09:48:19,618 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-09-08 09:48:20,071 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2019-09-08 09:48:20,501 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 92 [2019-09-08 09:48:20,867 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 09:48:21,085 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 09:48:21,333 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 09:48:21,552 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 09:48:21,759 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 09:48:22,106 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 09:48:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:27,103 INFO L93 Difference]: Finished difference Result 23841 states and 28783 transitions. [2019-09-08 09:48:27,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 09:48:27,103 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 181 [2019-09-08 09:48:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:27,119 INFO L225 Difference]: With dead ends: 23841 [2019-09-08 09:48:27,120 INFO L226 Difference]: Without dead ends: 22742 [2019-09-08 09:48:27,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=299, Invalid=1261, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 09:48:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22742 states. [2019-09-08 09:48:29,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22742 to 18980. [2019-09-08 09:48:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18980 states. [2019-09-08 09:48:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18980 states to 18980 states and 22029 transitions. [2019-09-08 09:48:29,363 INFO L78 Accepts]: Start accepts. Automaton has 18980 states and 22029 transitions. Word has length 181 [2019-09-08 09:48:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:29,364 INFO L475 AbstractCegarLoop]: Abstraction has 18980 states and 22029 transitions. [2019-09-08 09:48:29,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 09:48:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 18980 states and 22029 transitions. [2019-09-08 09:48:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:48:29,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:29,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:48:29,373 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash 794548854, now seen corresponding path program 1 times [2019-09-08 09:48:29,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:29,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:29,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:29,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:29,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:30,288 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:48:30,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:30,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 09:48:30,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 09:48:30,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 09:48:30,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2019-09-08 09:48:30,291 INFO L87 Difference]: Start difference. First operand 18980 states and 22029 transitions. Second operand 20 states. [2019-09-08 09:48:30,506 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-08 09:48:31,646 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-08 09:48:31,805 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-08 09:48:32,029 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-08 09:48:32,171 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-08 09:48:33,496 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-09-08 09:48:33,758 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-08 09:48:34,674 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2019-09-08 09:48:34,991 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-08 09:48:35,329 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-08 09:48:35,529 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2019-09-08 09:48:35,945 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-08 09:48:36,343 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 09:48:36,521 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-08 09:48:36,781 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-08 09:48:36,944 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 09:48:37,117 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-08 09:48:37,726 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-08 09:48:37,894 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 09:48:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:43,882 INFO L93 Difference]: Finished difference Result 29176 states and 35747 transitions. [2019-09-08 09:48:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 09:48:43,882 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 181 [2019-09-08 09:48:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:43,909 INFO L225 Difference]: With dead ends: 29176 [2019-09-08 09:48:43,909 INFO L226 Difference]: Without dead ends: 28017 [2019-09-08 09:48:43,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=917, Invalid=4195, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 09:48:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28017 states. [2019-09-08 09:48:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28017 to 19577. [2019-09-08 09:48:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19577 states. [2019-09-08 09:48:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19577 states to 19577 states and 22659 transitions. [2019-09-08 09:48:46,219 INFO L78 Accepts]: Start accepts. Automaton has 19577 states and 22659 transitions. Word has length 181 [2019-09-08 09:48:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:46,219 INFO L475 AbstractCegarLoop]: Abstraction has 19577 states and 22659 transitions. [2019-09-08 09:48:46,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 09:48:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 19577 states and 22659 transitions. [2019-09-08 09:48:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:48:46,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:46,230 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:48:46,230 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:46,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:46,230 INFO L82 PathProgramCache]: Analyzing trace with hash 731765973, now seen corresponding path program 1 times [2019-09-08 09:48:46,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:46,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:46,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:46,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:46,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:47,050 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 25 [2019-09-08 09:48:47,277 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2019-09-08 09:48:47,582 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-09-08 09:48:48,221 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:48:48,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:48,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 09:48:48,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 09:48:48,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 09:48:48,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-09-08 09:48:48,223 INFO L87 Difference]: Start difference. First operand 19577 states and 22659 transitions. Second operand 23 states. [2019-09-08 09:48:49,089 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-08 09:48:49,296 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 09:48:49,640 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-09-08 09:48:49,981 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-08 09:48:50,281 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-08 09:48:50,483 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-08 09:48:50,725 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-08 09:48:50,941 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 09:48:51,132 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-09-08 09:48:52,167 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-09-08 09:48:52,474 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-08 09:48:53,012 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2019-09-08 09:48:53,334 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 47 [2019-09-08 09:48:54,213 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-09-08 09:48:54,497 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-09-08 09:48:55,002 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-08 09:48:55,357 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-08 09:48:55,583 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-08 09:48:56,880 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-08 09:49:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:00,042 INFO L93 Difference]: Finished difference Result 21780 states and 25461 transitions. [2019-09-08 09:49:00,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 09:49:00,042 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 181 [2019-09-08 09:49:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:00,060 INFO L225 Difference]: With dead ends: 21780 [2019-09-08 09:49:00,061 INFO L226 Difference]: Without dead ends: 20707 [2019-09-08 09:49:00,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=767, Invalid=2773, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 09:49:00,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20707 states. [2019-09-08 09:49:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20707 to 20132. [2019-09-08 09:49:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20132 states. [2019-09-08 09:49:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 23241 transitions. [2019-09-08 09:49:02,554 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 23241 transitions. Word has length 181 [2019-09-08 09:49:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:02,555 INFO L475 AbstractCegarLoop]: Abstraction has 20132 states and 23241 transitions. [2019-09-08 09:49:02,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 09:49:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 23241 transitions. [2019-09-08 09:49:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:49:02,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:02,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:49:02,565 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:02,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:02,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1971311766, now seen corresponding path program 1 times [2019-09-08 09:49:02,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:02,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:02,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:02,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:03,329 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:49:03,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:03,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 09:49:03,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 09:49:03,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 09:49:03,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2019-09-08 09:49:03,331 INFO L87 Difference]: Start difference. First operand 20132 states and 23241 transitions. Second operand 24 states. [2019-09-08 09:49:03,536 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 09:49:04,669 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-08 09:49:04,868 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-08 09:49:05,574 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-08 09:49:07,531 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-08 09:49:08,789 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-08 09:49:09,128 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-08 09:49:09,734 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-08 09:49:10,185 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 09:49:11,084 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-08 09:49:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:15,341 INFO L93 Difference]: Finished difference Result 28168 states and 34390 transitions. [2019-09-08 09:49:15,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 09:49:15,342 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 181 [2019-09-08 09:49:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:15,364 INFO L225 Difference]: With dead ends: 28168 [2019-09-08 09:49:15,364 INFO L226 Difference]: Without dead ends: 27009 [2019-09-08 09:49:15,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=637, Invalid=3523, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 09:49:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27009 states. [2019-09-08 09:49:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27009 to 19913. [2019-09-08 09:49:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19913 states. [2019-09-08 09:49:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19913 states to 19913 states and 22998 transitions. [2019-09-08 09:49:17,931 INFO L78 Accepts]: Start accepts. Automaton has 19913 states and 22998 transitions. Word has length 181 [2019-09-08 09:49:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:17,931 INFO L475 AbstractCegarLoop]: Abstraction has 19913 states and 22998 transitions. [2019-09-08 09:49:17,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 09:49:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 19913 states and 22998 transitions. [2019-09-08 09:49:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:49:17,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:17,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:49:17,942 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1719809857, now seen corresponding path program 1 times [2019-09-08 09:49:17,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:17,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:17,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:17,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:17,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:18,720 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:49:18,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:18,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 09:49:18,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 09:49:18,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 09:49:18,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-08 09:49:18,721 INFO L87 Difference]: Start difference. First operand 19913 states and 22998 transitions. Second operand 16 states. [2019-09-08 09:49:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:23,317 INFO L93 Difference]: Finished difference Result 21510 states and 25173 transitions. [2019-09-08 09:49:23,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 09:49:23,318 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 181 [2019-09-08 09:49:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:23,333 INFO L225 Difference]: With dead ends: 21510 [2019-09-08 09:49:23,333 INFO L226 Difference]: Without dead ends: 19810 [2019-09-08 09:49:23,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2019-09-08 09:49:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19810 states. [2019-09-08 09:49:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19810 to 19808. [2019-09-08 09:49:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19808 states. [2019-09-08 09:49:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19808 states to 19808 states and 22876 transitions. [2019-09-08 09:49:25,853 INFO L78 Accepts]: Start accepts. Automaton has 19808 states and 22876 transitions. Word has length 181 [2019-09-08 09:49:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:25,853 INFO L475 AbstractCegarLoop]: Abstraction has 19808 states and 22876 transitions. [2019-09-08 09:49:25,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 09:49:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 19808 states and 22876 transitions. [2019-09-08 09:49:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:49:25,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:25,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:49:25,865 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:25,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash -188723676, now seen corresponding path program 1 times [2019-09-08 09:49:25,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:25,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:25,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:25,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:25,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:26,707 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:49:26,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:26,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 09:49:26,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 09:49:26,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 09:49:26,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-09-08 09:49:26,708 INFO L87 Difference]: Start difference. First operand 19808 states and 22876 transitions. Second operand 19 states. [2019-09-08 09:49:26,828 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-08 09:49:30,939 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-09-08 09:49:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:34,970 INFO L93 Difference]: Finished difference Result 26327 states and 31669 transitions. [2019-09-08 09:49:34,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 09:49:34,971 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 181 [2019-09-08 09:49:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:34,992 INFO L225 Difference]: With dead ends: 26327 [2019-09-08 09:49:34,992 INFO L226 Difference]: Without dead ends: 22608 [2019-09-08 09:49:34,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=693, Invalid=2847, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 09:49:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22608 states. [2019-09-08 09:49:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22608 to 18942. [2019-09-08 09:49:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18942 states. [2019-09-08 09:49:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18942 states to 18942 states and 21957 transitions. [2019-09-08 09:49:37,499 INFO L78 Accepts]: Start accepts. Automaton has 18942 states and 21957 transitions. Word has length 181 [2019-09-08 09:49:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:37,500 INFO L475 AbstractCegarLoop]: Abstraction has 18942 states and 21957 transitions. [2019-09-08 09:49:37,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 09:49:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 18942 states and 21957 transitions. [2019-09-08 09:49:37,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:49:37,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:37,512 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:49:37,512 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:37,513 INFO L82 PathProgramCache]: Analyzing trace with hash 646514906, now seen corresponding path program 1 times [2019-09-08 09:49:37,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:37,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:37,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:37,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:37,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:38,448 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:49:38,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:38,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 09:49:38,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 09:49:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 09:49:38,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-08 09:49:38,449 INFO L87 Difference]: Start difference. First operand 18942 states and 21957 transitions. Second operand 20 states. [2019-09-08 09:49:38,952 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-08 09:49:39,165 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 09:49:39,470 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-08 09:49:39,871 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-09-08 09:49:40,118 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2019-09-08 09:49:40,360 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-08 09:49:40,541 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-08 09:49:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:46,138 INFO L93 Difference]: Finished difference Result 23071 states and 27177 transitions. [2019-09-08 09:49:46,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 09:49:46,138 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 181 [2019-09-08 09:49:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:46,153 INFO L225 Difference]: With dead ends: 23071 [2019-09-08 09:49:46,153 INFO L226 Difference]: Without dead ends: 20842 [2019-09-08 09:49:46,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 09:49:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20842 states. [2019-09-08 09:49:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20842 to 18484. [2019-09-08 09:49:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18484 states. [2019-09-08 09:49:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18484 states to 18484 states and 21483 transitions. [2019-09-08 09:49:48,617 INFO L78 Accepts]: Start accepts. Automaton has 18484 states and 21483 transitions. Word has length 181 [2019-09-08 09:49:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:48,617 INFO L475 AbstractCegarLoop]: Abstraction has 18484 states and 21483 transitions. [2019-09-08 09:49:48,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 09:49:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 18484 states and 21483 transitions. [2019-09-08 09:49:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:49:48,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:48,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:49:48,628 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:48,628 INFO L82 PathProgramCache]: Analyzing trace with hash 815493270, now seen corresponding path program 1 times [2019-09-08 09:49:48,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:48,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:48,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:48,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:48,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:49,965 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:49:49,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:49,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-08 09:49:49,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 09:49:49,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 09:49:49,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2019-09-08 09:49:49,967 INFO L87 Difference]: Start difference. First operand 18484 states and 21483 transitions. Second operand 27 states. [2019-09-08 09:49:50,554 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-08 09:49:50,731 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-08 09:49:51,003 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 09:49:51,255 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-08 09:49:51,607 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 09:49:51,915 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-08 09:49:52,439 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 09:49:52,629 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 09:49:52,870 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 09:49:53,173 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 09:49:56,815 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-09-08 09:50:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:01,229 INFO L93 Difference]: Finished difference Result 25986 states and 31815 transitions. [2019-09-08 09:50:01,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 09:50:01,230 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 181 [2019-09-08 09:50:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:01,249 INFO L225 Difference]: With dead ends: 25986 [2019-09-08 09:50:01,249 INFO L226 Difference]: Without dead ends: 25545 [2019-09-08 09:50:01,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=371, Invalid=1885, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 09:50:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25545 states. [2019-09-08 09:50:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25545 to 18502. [2019-09-08 09:50:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18502 states. [2019-09-08 09:50:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18502 states to 18502 states and 21499 transitions. [2019-09-08 09:50:03,825 INFO L78 Accepts]: Start accepts. Automaton has 18502 states and 21499 transitions. Word has length 181 [2019-09-08 09:50:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:03,825 INFO L475 AbstractCegarLoop]: Abstraction has 18502 states and 21499 transitions. [2019-09-08 09:50:03,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 09:50:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 18502 states and 21499 transitions. [2019-09-08 09:50:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:50:03,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:03,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:50:03,835 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:03,836 INFO L82 PathProgramCache]: Analyzing trace with hash -940362739, now seen corresponding path program 1 times [2019-09-08 09:50:03,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:03,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:03,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:03,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:03,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:04,299 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:50:04,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:04,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:50:04,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:50:04,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:50:04,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:50:04,301 INFO L87 Difference]: Start difference. First operand 18502 states and 21499 transitions. Second operand 17 states. [2019-09-08 09:50:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:11,356 INFO L93 Difference]: Finished difference Result 26695 states and 32540 transitions. [2019-09-08 09:50:11,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 09:50:11,357 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-08 09:50:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:11,378 INFO L225 Difference]: With dead ends: 26695 [2019-09-08 09:50:11,378 INFO L226 Difference]: Without dead ends: 24742 [2019-09-08 09:50:11,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=385, Invalid=1021, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 09:50:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24742 states. [2019-09-08 09:50:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24742 to 19433. [2019-09-08 09:50:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19433 states. [2019-09-08 09:50:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19433 states to 19433 states and 22463 transitions. [2019-09-08 09:50:14,057 INFO L78 Accepts]: Start accepts. Automaton has 19433 states and 22463 transitions. Word has length 181 [2019-09-08 09:50:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:14,058 INFO L475 AbstractCegarLoop]: Abstraction has 19433 states and 22463 transitions. [2019-09-08 09:50:14,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:50:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 19433 states and 22463 transitions. [2019-09-08 09:50:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:50:14,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:14,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:50:14,068 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:14,069 INFO L82 PathProgramCache]: Analyzing trace with hash -914028939, now seen corresponding path program 1 times [2019-09-08 09:50:14,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:14,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:14,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:14,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:14,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:15,041 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:50:15,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:15,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 09:50:15,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 09:50:15,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 09:50:15,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-09-08 09:50:15,042 INFO L87 Difference]: Start difference. First operand 19433 states and 22463 transitions. Second operand 23 states. [2019-09-08 09:50:15,372 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-09-08 09:50:15,671 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-08 09:50:16,640 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 09:50:16,818 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-08 09:50:17,097 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-08 09:50:17,358 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-08 09:50:17,523 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 09:50:17,792 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 09:50:18,026 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 09:50:18,343 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-08 09:50:18,570 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 09:50:27,597 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 09:50:27,783 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-08 09:50:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:28,426 INFO L93 Difference]: Finished difference Result 23985 states and 28884 transitions. [2019-09-08 09:50:28,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 09:50:28,426 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 181 [2019-09-08 09:50:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:28,449 INFO L225 Difference]: With dead ends: 23985 [2019-09-08 09:50:28,449 INFO L226 Difference]: Without dead ends: 23653 [2019-09-08 09:50:28,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=829, Invalid=3331, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 09:50:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23653 states. [2019-09-08 09:50:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23653 to 19361. [2019-09-08 09:50:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19361 states. [2019-09-08 09:50:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19361 states to 19361 states and 22388 transitions. [2019-09-08 09:50:31,156 INFO L78 Accepts]: Start accepts. Automaton has 19361 states and 22388 transitions. Word has length 181 [2019-09-08 09:50:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:31,157 INFO L475 AbstractCegarLoop]: Abstraction has 19361 states and 22388 transitions. [2019-09-08 09:50:31,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 09:50:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 19361 states and 22388 transitions. [2019-09-08 09:50:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:50:31,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:31,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:50:31,168 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:31,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:31,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1093195945, now seen corresponding path program 1 times [2019-09-08 09:50:31,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:31,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:31,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:31,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:31,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:32,390 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:50:32,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:32,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 09:50:32,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 09:50:32,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 09:50:32,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-09-08 09:50:32,391 INFO L87 Difference]: Start difference. First operand 19361 states and 22388 transitions. Second operand 28 states. [2019-09-08 09:50:33,728 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 09:50:33,965 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 09:50:34,331 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-08 09:50:34,636 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-08 09:50:34,959 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 09:50:35,120 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 09:50:35,472 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 09:50:35,863 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 09:50:36,393 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-09-08 09:50:37,321 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 09:50:37,730 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-08 09:50:37,922 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 09:50:38,515 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 09:50:39,281 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-08 09:50:40,215 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-08 09:50:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:43,003 INFO L93 Difference]: Finished difference Result 20134 states and 23452 transitions. [2019-09-08 09:50:43,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 09:50:43,003 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 181 [2019-09-08 09:50:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:43,018 INFO L225 Difference]: With dead ends: 20134 [2019-09-08 09:50:43,018 INFO L226 Difference]: Without dead ends: 19339 [2019-09-08 09:50:43,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=598, Invalid=2482, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 09:50:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19339 states. [2019-09-08 09:50:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19339 to 19202. [2019-09-08 09:50:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19202 states. [2019-09-08 09:50:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19202 states to 19202 states and 22221 transitions. [2019-09-08 09:50:45,695 INFO L78 Accepts]: Start accepts. Automaton has 19202 states and 22221 transitions. Word has length 181 [2019-09-08 09:50:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:45,695 INFO L475 AbstractCegarLoop]: Abstraction has 19202 states and 22221 transitions. [2019-09-08 09:50:45,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 09:50:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 19202 states and 22221 transitions. [2019-09-08 09:50:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:50:45,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:45,706 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:50:45,706 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash -830116433, now seen corresponding path program 1 times [2019-09-08 09:50:45,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:45,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:45,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:45,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:45,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:46,180 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:50:46,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:46,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 09:50:46,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 09:50:46,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 09:50:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-08 09:50:46,182 INFO L87 Difference]: Start difference. First operand 19202 states and 22221 transitions. Second operand 16 states. [2019-09-08 09:50:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:51,137 INFO L93 Difference]: Finished difference Result 19214 states and 22231 transitions. [2019-09-08 09:50:51,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 09:50:51,138 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 181 [2019-09-08 09:50:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:51,152 INFO L225 Difference]: With dead ends: 19214 [2019-09-08 09:50:51,152 INFO L226 Difference]: Without dead ends: 19202 [2019-09-08 09:50:51,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2019-09-08 09:50:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19202 states. [2019-09-08 09:50:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19202 to 19196. [2019-09-08 09:50:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19196 states. [2019-09-08 09:50:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19196 states to 19196 states and 22212 transitions. [2019-09-08 09:50:53,853 INFO L78 Accepts]: Start accepts. Automaton has 19196 states and 22212 transitions. Word has length 181 [2019-09-08 09:50:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:53,853 INFO L475 AbstractCegarLoop]: Abstraction has 19196 states and 22212 transitions. [2019-09-08 09:50:53,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 09:50:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 19196 states and 22212 transitions. [2019-09-08 09:50:53,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:50:53,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:53,863 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:50:53,863 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:53,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:53,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1172654365, now seen corresponding path program 1 times [2019-09-08 09:50:53,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:53,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:53,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:53,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:53,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:54,667 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:50:54,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:54,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 09:50:54,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 09:50:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 09:50:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-09-08 09:50:54,668 INFO L87 Difference]: Start difference. First operand 19196 states and 22212 transitions. Second operand 20 states. [2019-09-08 09:51:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:01,810 INFO L93 Difference]: Finished difference Result 25069 states and 30208 transitions. [2019-09-08 09:51:01,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 09:51:01,811 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 181 [2019-09-08 09:51:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:01,830 INFO L225 Difference]: With dead ends: 25069 [2019-09-08 09:51:01,830 INFO L226 Difference]: Without dead ends: 23895 [2019-09-08 09:51:01,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=298, Invalid=1342, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 09:51:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23895 states. [2019-09-08 09:51:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23895 to 19592. [2019-09-08 09:51:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19592 states. [2019-09-08 09:51:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19592 states to 19592 states and 22606 transitions. [2019-09-08 09:51:04,599 INFO L78 Accepts]: Start accepts. Automaton has 19592 states and 22606 transitions. Word has length 181 [2019-09-08 09:51:04,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:04,600 INFO L475 AbstractCegarLoop]: Abstraction has 19592 states and 22606 transitions. [2019-09-08 09:51:04,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 09:51:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 19592 states and 22606 transitions. [2019-09-08 09:51:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:51:04,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:04,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:04,610 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:04,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1842505912, now seen corresponding path program 1 times [2019-09-08 09:51:04,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:04,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:04,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:04,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:04,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:06,341 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:06,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:06,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 09:51:06,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 09:51:06,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 09:51:06,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2019-09-08 09:51:06,342 INFO L87 Difference]: Start difference. First operand 19592 states and 22606 transitions. Second operand 24 states. [2019-09-08 09:51:06,834 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-08 09:51:07,080 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-08 09:51:07,589 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 09:51:07,843 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-08 09:51:08,038 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-08 09:51:08,425 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-08 09:51:08,678 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-08 09:51:08,908 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-08 09:51:09,119 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2019-09-08 09:51:10,009 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2019-09-08 09:51:10,700 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-09-08 09:51:10,972 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 47 [2019-09-08 09:51:11,738 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-09-08 09:51:12,527 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-09-08 09:51:12,766 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 09:51:13,498 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-08 09:51:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:17,546 INFO L93 Difference]: Finished difference Result 26218 states and 31553 transitions. [2019-09-08 09:51:17,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 09:51:17,546 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 181 [2019-09-08 09:51:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:17,567 INFO L225 Difference]: With dead ends: 26218 [2019-09-08 09:51:17,567 INFO L226 Difference]: Without dead ends: 25902 [2019-09-08 09:51:17,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=418, Invalid=1304, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 09:51:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25902 states. [2019-09-08 09:51:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25902 to 19600. [2019-09-08 09:51:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19600 states. [2019-09-08 09:51:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19600 states to 19600 states and 22613 transitions. [2019-09-08 09:51:20,381 INFO L78 Accepts]: Start accepts. Automaton has 19600 states and 22613 transitions. Word has length 181 [2019-09-08 09:51:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:20,381 INFO L475 AbstractCegarLoop]: Abstraction has 19600 states and 22613 transitions. [2019-09-08 09:51:20,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 09:51:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 19600 states and 22613 transitions. [2019-09-08 09:51:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:51:20,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:20,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:20,395 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:20,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:20,395 INFO L82 PathProgramCache]: Analyzing trace with hash -725435669, now seen corresponding path program 1 times [2019-09-08 09:51:20,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:20,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:20,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:20,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:20,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:21,465 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-09-08 09:51:21,955 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:21,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:21,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 09:51:21,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 09:51:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 09:51:21,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2019-09-08 09:51:21,957 INFO L87 Difference]: Start difference. First operand 19600 states and 22613 transitions. Second operand 25 states. [2019-09-08 09:51:24,228 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-08 09:51:24,842 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-08 09:51:25,115 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-08 09:51:25,281 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 09:51:25,981 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 09:51:26,171 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-08 09:51:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:29,991 INFO L93 Difference]: Finished difference Result 23593 states and 28254 transitions. [2019-09-08 09:51:29,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 09:51:29,992 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 181 [2019-09-08 09:51:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:30,010 INFO L225 Difference]: With dead ends: 23593 [2019-09-08 09:51:30,010 INFO L226 Difference]: Without dead ends: 23435 [2019-09-08 09:51:30,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=346, Invalid=1214, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 09:51:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23435 states. [2019-09-08 09:51:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23435 to 19675. [2019-09-08 09:51:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19675 states. [2019-09-08 09:51:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19675 states to 19675 states and 22691 transitions. [2019-09-08 09:51:32,864 INFO L78 Accepts]: Start accepts. Automaton has 19675 states and 22691 transitions. Word has length 181 [2019-09-08 09:51:32,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:32,865 INFO L475 AbstractCegarLoop]: Abstraction has 19675 states and 22691 transitions. [2019-09-08 09:51:32,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 09:51:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 19675 states and 22691 transitions. [2019-09-08 09:51:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:51:32,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:32,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:32,875 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1584310199, now seen corresponding path program 1 times [2019-09-08 09:51:32,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:32,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:33,468 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,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:33,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:51:33,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:51:33,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:51:33,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:51:33,469 INFO L87 Difference]: Start difference. First operand 19675 states and 22691 transitions. Second operand 17 states. [2019-09-08 09:51:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:41,242 INFO L93 Difference]: Finished difference Result 27906 states and 33804 transitions. [2019-09-08 09:51:41,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 09:51:41,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-08 09:51:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:41,263 INFO L225 Difference]: With dead ends: 27906 [2019-09-08 09:51:41,264 INFO L226 Difference]: Without dead ends: 26312 [2019-09-08 09:51:41,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=1209, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 09:51:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26312 states. [2019-09-08 09:51:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26312 to 20890. [2019-09-08 09:51:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20890 states. [2019-09-08 09:51:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20890 states to 20890 states and 23956 transitions. [2019-09-08 09:51:44,304 INFO L78 Accepts]: Start accepts. Automaton has 20890 states and 23956 transitions. Word has length 181 [2019-09-08 09:51:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:44,304 INFO L475 AbstractCegarLoop]: Abstraction has 20890 states and 23956 transitions. [2019-09-08 09:51:44,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:51:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 20890 states and 23956 transitions. [2019-09-08 09:51:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:51:44,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:44,316 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:44,316 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:44,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1199083704, now seen corresponding path program 1 times [2019-09-08 09:51:44,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:44,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:44,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:44,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:44,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:44,813 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:44,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:44,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:51:44,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:51:44,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:51:44,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:51:44,814 INFO L87 Difference]: Start difference. First operand 20890 states and 23956 transitions. Second operand 17 states. [2019-09-08 09:51:47,754 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2019-09-08 09:51:55,912 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 09:51:56,092 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-08 09:51:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:56,552 INFO L93 Difference]: Finished difference Result 28200 states and 33793 transitions. [2019-09-08 09:51:56,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 09:51:56,552 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-08 09:51:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:56,575 INFO L225 Difference]: With dead ends: 28200 [2019-09-08 09:51:56,575 INFO L226 Difference]: Without dead ends: 27122 [2019-09-08 09:51:56,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=794, Invalid=2746, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 09:51:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27122 states. [2019-09-08 09:51:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27122 to 21224. [2019-09-08 09:51:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21224 states. [2019-09-08 09:51:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21224 states to 21224 states and 24289 transitions. [2019-09-08 09:51:59,745 INFO L78 Accepts]: Start accepts. Automaton has 21224 states and 24289 transitions. Word has length 181 [2019-09-08 09:51:59,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:59,746 INFO L475 AbstractCegarLoop]: Abstraction has 21224 states and 24289 transitions. [2019-09-08 09:51:59,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:51:59,746 INFO L276 IsEmpty]: Start isEmpty. Operand 21224 states and 24289 transitions. [2019-09-08 09:51:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:51:59,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:59,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:59,757 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:59,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:59,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1355364095, now seen corresponding path program 1 times [2019-09-08 09:51:59,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:59,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:59,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:59,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:59,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:00,285 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:00,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:00,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:52:00,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:52:00,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:52:00,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:52:00,289 INFO L87 Difference]: Start difference. First operand 21224 states and 24289 transitions. Second operand 17 states. [2019-09-08 09:52:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:06,610 INFO L93 Difference]: Finished difference Result 27311 states and 32765 transitions. [2019-09-08 09:52:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 09:52:06,610 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-08 09:52:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:06,629 INFO L225 Difference]: With dead ends: 27311 [2019-09-08 09:52:06,630 INFO L226 Difference]: Without dead ends: 24919 [2019-09-08 09:52:06,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=256, Invalid=800, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 09:52:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24919 states. [2019-09-08 09:52:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24919 to 20413. [2019-09-08 09:52:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20413 states. [2019-09-08 09:52:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20413 states to 20413 states and 23442 transitions. [2019-09-08 09:52:09,776 INFO L78 Accepts]: Start accepts. Automaton has 20413 states and 23442 transitions. Word has length 181 [2019-09-08 09:52:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:09,777 INFO L475 AbstractCegarLoop]: Abstraction has 20413 states and 23442 transitions. [2019-09-08 09:52:09,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:52:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 20413 states and 23442 transitions. [2019-09-08 09:52:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:52:09,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:09,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:09,788 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash 970271222, now seen corresponding path program 1 times [2019-09-08 09:52:09,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:09,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:09,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:09,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:09,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:10,176 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:10,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:10,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:52:10,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:52:10,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:52:10,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:52:10,177 INFO L87 Difference]: Start difference. First operand 20413 states and 23442 transitions. Second operand 17 states. [2019-09-08 09:52:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:18,232 INFO L93 Difference]: Finished difference Result 27733 states and 33647 transitions. [2019-09-08 09:52:18,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 09:52:18,233 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-08 09:52:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:18,251 INFO L225 Difference]: With dead ends: 27733 [2019-09-08 09:52:18,251 INFO L226 Difference]: Without dead ends: 24978 [2019-09-08 09:52:18,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=625, Invalid=1727, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 09:52:18,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24978 states. [2019-09-08 09:52:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24978 to 19161. [2019-09-08 09:52:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19161 states. [2019-09-08 09:52:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19161 states to 19161 states and 22098 transitions. [2019-09-08 09:52:21,320 INFO L78 Accepts]: Start accepts. Automaton has 19161 states and 22098 transitions. Word has length 181 [2019-09-08 09:52:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:21,321 INFO L475 AbstractCegarLoop]: Abstraction has 19161 states and 22098 transitions. [2019-09-08 09:52:21,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:52:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 19161 states and 22098 transitions. [2019-09-08 09:52:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:52:21,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:21,330 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:21,331 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:21,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:21,331 INFO L82 PathProgramCache]: Analyzing trace with hash -970137600, now seen corresponding path program 1 times [2019-09-08 09:52:21,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:21,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:21,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:22,252 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:22,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:22,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 09:52:22,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 09:52:22,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 09:52:22,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-09-08 09:52:22,253 INFO L87 Difference]: Start difference. First operand 19161 states and 22098 transitions. Second operand 24 states. [2019-09-08 09:52:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:29,526 INFO L93 Difference]: Finished difference Result 20316 states and 23523 transitions. [2019-09-08 09:52:29,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 09:52:29,526 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 181 [2019-09-08 09:52:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:29,541 INFO L225 Difference]: With dead ends: 20316 [2019-09-08 09:52:29,541 INFO L226 Difference]: Without dead ends: 19758 [2019-09-08 09:52:29,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=466, Invalid=2084, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 09:52:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19758 states. [2019-09-08 09:52:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19758 to 19033. [2019-09-08 09:52:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19033 states. [2019-09-08 09:52:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19033 states to 19033 states and 21965 transitions. [2019-09-08 09:52:32,539 INFO L78 Accepts]: Start accepts. Automaton has 19033 states and 21965 transitions. Word has length 181 [2019-09-08 09:52:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:32,540 INFO L475 AbstractCegarLoop]: Abstraction has 19033 states and 21965 transitions. [2019-09-08 09:52:32,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 09:52:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 19033 states and 21965 transitions. [2019-09-08 09:52:32,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:52:32,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:32,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:32,550 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:32,550 INFO L82 PathProgramCache]: Analyzing trace with hash -807949330, now seen corresponding path program 1 times [2019-09-08 09:52:32,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:32,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:32,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:32,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:32,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:33,262 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:33,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:33,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 09:52:33,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 09:52:33,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 09:52:33,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-08 09:52:33,263 INFO L87 Difference]: Start difference. First operand 19033 states and 21965 transitions. Second operand 16 states. [2019-09-08 09:52:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:39,201 INFO L93 Difference]: Finished difference Result 21523 states and 25168 transitions. [2019-09-08 09:52:39,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 09:52:39,201 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 181 [2019-09-08 09:52:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:39,216 INFO L225 Difference]: With dead ends: 21523 [2019-09-08 09:52:39,216 INFO L226 Difference]: Without dead ends: 21063 [2019-09-08 09:52:39,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-08 09:52:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21063 states. [2019-09-08 09:52:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21063 to 18883. [2019-09-08 09:52:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18883 states. [2019-09-08 09:52:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18883 states to 18883 states and 21813 transitions. [2019-09-08 09:52:42,250 INFO L78 Accepts]: Start accepts. Automaton has 18883 states and 21813 transitions. Word has length 181 [2019-09-08 09:52:42,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:42,250 INFO L475 AbstractCegarLoop]: Abstraction has 18883 states and 21813 transitions. [2019-09-08 09:52:42,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 09:52:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand 18883 states and 21813 transitions. [2019-09-08 09:52:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:52:42,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:42,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:42,260 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash 887599600, now seen corresponding path program 1 times [2019-09-08 09:52:42,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:42,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:42,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:42,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:42,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:42,712 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:42,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:42,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:52:42,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:52:42,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:52:42,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:52:42,713 INFO L87 Difference]: Start difference. First operand 18883 states and 21813 transitions. Second operand 17 states. [2019-09-08 09:52:43,566 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 09:52:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:49,167 INFO L93 Difference]: Finished difference Result 23239 states and 27569 transitions. [2019-09-08 09:52:49,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 09:52:49,167 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2019-09-08 09:52:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:49,187 INFO L225 Difference]: With dead ends: 23239 [2019-09-08 09:52:49,187 INFO L226 Difference]: Without dead ends: 21328 [2019-09-08 09:52:49,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 09:52:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21328 states. [2019-09-08 09:52:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21328 to 18826. [2019-09-08 09:52:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18826 states. [2019-09-08 09:52:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18826 states to 18826 states and 21756 transitions. [2019-09-08 09:52:52,229 INFO L78 Accepts]: Start accepts. Automaton has 18826 states and 21756 transitions. Word has length 181 [2019-09-08 09:52:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:52,230 INFO L475 AbstractCegarLoop]: Abstraction has 18826 states and 21756 transitions. [2019-09-08 09:52:52,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:52:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 18826 states and 21756 transitions. [2019-09-08 09:52:52,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 09:52:52,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:52,239 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:52,240 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:52,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:52,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1116545704, now seen corresponding path program 1 times [2019-09-08 09:52:52,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:52,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:52,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:52,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:52,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:52,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:52,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 09:52:52,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 09:52:52,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 09:52:52,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-08 09:52:52,997 INFO L87 Difference]: Start difference. First operand 18826 states and 21756 transitions. Second operand 21 states. [2019-09-08 09:52:53,865 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-08 09:52:54,031 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65