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_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:44:56,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:44:56,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:44:56,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:44:56,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:44:56,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:44:56,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:44:56,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:44:56,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:44:56,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:44:56,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:44:56,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:44:56,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:44:56,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:44:56,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:44:56,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:44:56,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:44:56,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:44:56,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:44:56,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:44:56,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:44:56,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:44:56,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:44:56,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:44:56,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:44:56,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:44:56,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:44:56,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:44:56,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:44:56,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:44:56,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:44:56,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:44:56,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:44:56,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:44:56,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:44:56,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:44:56,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:44:56,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:44:56,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:44:56,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:44:56,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:44:56,764 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 10:44:56,787 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:44:56,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:44:56,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:44:56,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:44:56,789 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:44:56,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:44:56,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:44:56,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:44:56,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:44:56,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:44:56,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:44:56,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:44:56,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:44:56,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:44:56,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:44:56,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:44:56,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:44:56,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:44:56,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:44:56,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:44:56,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:44:56,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:44:56,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:44:56,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:44:56,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:44:56,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:44:56,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:44:56,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:44:56,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:44:56,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:44:56,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:44:56,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:44:56,841 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:44:56,842 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:44:56,842 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:44:56,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f021ff3ea/21cc445f904f4b7dacc0edccd91e48ca/FLAGb5434557a [2019-09-08 10:44:57,514 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:44:57,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:44:57,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f021ff3ea/21cc445f904f4b7dacc0edccd91e48ca/FLAGb5434557a [2019-09-08 10:44:57,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f021ff3ea/21cc445f904f4b7dacc0edccd91e48ca [2019-09-08 10:44:57,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:44:57,677 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:44:57,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:44:57,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:44:57,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:44:57,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:44:57" (1/1) ... [2019-09-08 10:44:57,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a25d118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:57, skipping insertion in model container [2019-09-08 10:44:57,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:44:57" (1/1) ... [2019-09-08 10:44:57,695 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:44:57,813 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:44:58,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:44:58,854 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:44:59,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:44:59,169 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:44:59,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:59 WrapperNode [2019-09-08 10:44:59,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:44:59,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:44:59,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:44:59,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:44:59,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:59" (1/1) ... [2019-09-08 10:44:59,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:59" (1/1) ... [2019-09-08 10:44:59,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:59" (1/1) ... [2019-09-08 10:44:59,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:59" (1/1) ... [2019-09-08 10:44:59,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:59" (1/1) ... [2019-09-08 10:44:59,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:59" (1/1) ... [2019-09-08 10:44:59,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:59" (1/1) ... [2019-09-08 10:44:59,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:44:59,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:44:59,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:44:59,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:44:59,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:59" (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 10:44:59,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:44:59,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:44:59,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:44:59,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:44:59,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:44:59,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:44:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:44:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:44:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:44:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:44:59,510 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:44:59,510 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:44:59,511 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:44:59,511 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:44:59,512 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:44:59,512 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:44:59,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:44:59,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:44:59,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:45:02,310 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:45:02,311 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:45:02,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:45:02 BoogieIcfgContainer [2019-09-08 10:45:02,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:45:02,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:45:02,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:45:02,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:45:02,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:44:57" (1/3) ... [2019-09-08 10:45:02,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba4622c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:45:02, skipping insertion in model container [2019-09-08 10:45:02,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:59" (2/3) ... [2019-09-08 10:45:02,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba4622c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:45:02, skipping insertion in model container [2019-09-08 10:45:02,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:45:02" (3/3) ... [2019-09-08 10:45:02,320 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:45:02,329 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:45:02,339 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 10:45:02,356 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 10:45:02,392 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:45:02,393 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:45:02,393 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:45:02,393 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:45:02,394 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:45:02,394 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:45:02,394 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:45:02,394 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:45:02,394 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:45:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states. [2019-09-08 10:45:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:45:02,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:02,447 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] [2019-09-08 10:45:02,450 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:02,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:02,455 INFO L82 PathProgramCache]: Analyzing trace with hash -550378324, now seen corresponding path program 1 times [2019-09-08 10:45:02,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:02,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:02,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:02,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:02,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:03,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:03,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:45:03,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:45:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:45:03,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:03,033 INFO L87 Difference]: Start difference. First operand 710 states. Second operand 3 states. [2019-09-08 10:45:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:03,218 INFO L93 Difference]: Finished difference Result 1076 states and 1863 transitions. [2019-09-08 10:45:03,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:45:03,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:45:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:03,255 INFO L225 Difference]: With dead ends: 1076 [2019-09-08 10:45:03,256 INFO L226 Difference]: Without dead ends: 850 [2019-09-08 10:45:03,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-09-08 10:45:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2019-09-08 10:45:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-09-08 10:45:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1156 transitions. [2019-09-08 10:45:03,397 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1156 transitions. Word has length 67 [2019-09-08 10:45:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:03,397 INFO L475 AbstractCegarLoop]: Abstraction has 848 states and 1156 transitions. [2019-09-08 10:45:03,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1156 transitions. [2019-09-08 10:45:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:45:03,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:03,412 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] [2019-09-08 10:45:03,412 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:03,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:03,413 INFO L82 PathProgramCache]: Analyzing trace with hash -808974753, now seen corresponding path program 1 times [2019-09-08 10:45:03,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:03,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:03,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:03,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:03,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:03,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:03,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:45:03,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:45:03,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:45:03,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:03,613 INFO L87 Difference]: Start difference. First operand 848 states and 1156 transitions. Second operand 3 states. [2019-09-08 10:45:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:03,884 INFO L93 Difference]: Finished difference Result 1475 states and 2030 transitions. [2019-09-08 10:45:03,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:45:03,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 10:45:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:03,891 INFO L225 Difference]: With dead ends: 1475 [2019-09-08 10:45:03,892 INFO L226 Difference]: Without dead ends: 1232 [2019-09-08 10:45:03,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 10:45:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-09-08 10:45:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1228. [2019-09-08 10:45:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2019-09-08 10:45:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1659 transitions. [2019-09-08 10:45:03,938 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1659 transitions. Word has length 68 [2019-09-08 10:45:03,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:03,938 INFO L475 AbstractCegarLoop]: Abstraction has 1228 states and 1659 transitions. [2019-09-08 10:45:03,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:03,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1659 transitions. [2019-09-08 10:45:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:45:03,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:03,943 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] [2019-09-08 10:45:03,943 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:03,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:03,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1886079761, now seen corresponding path program 1 times [2019-09-08 10:45:03,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:03,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:03,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:03,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:04,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:04,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:45:04,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:45:04,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:45:04,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:45:04,132 INFO L87 Difference]: Start difference. First operand 1228 states and 1659 transitions. Second operand 6 states. [2019-09-08 10:45:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:04,887 INFO L93 Difference]: Finished difference Result 2899 states and 4057 transitions. [2019-09-08 10:45:04,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:45:04,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-08 10:45:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:04,897 INFO L225 Difference]: With dead ends: 2899 [2019-09-08 10:45:04,898 INFO L226 Difference]: Without dead ends: 1900 [2019-09-08 10:45:04,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 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 10:45:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2019-09-08 10:45:04,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1896. [2019-09-08 10:45:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-09-08 10:45:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2663 transitions. [2019-09-08 10:45:04,980 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2663 transitions. Word has length 68 [2019-09-08 10:45:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:04,981 INFO L475 AbstractCegarLoop]: Abstraction has 1896 states and 2663 transitions. [2019-09-08 10:45:04,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:45:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2663 transitions. [2019-09-08 10:45:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:45:04,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:04,985 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] [2019-09-08 10:45:04,985 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1179154145, now seen corresponding path program 1 times [2019-09-08 10:45:04,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:04,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:04,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:04,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:05,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:05,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:45:05,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:45:05,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:45:05,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:05,100 INFO L87 Difference]: Start difference. First operand 1896 states and 2663 transitions. Second operand 3 states. [2019-09-08 10:45:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:05,302 INFO L93 Difference]: Finished difference Result 4013 states and 5732 transitions. [2019-09-08 10:45:05,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:45:05,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 10:45:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:05,317 INFO L225 Difference]: With dead ends: 4013 [2019-09-08 10:45:05,318 INFO L226 Difference]: Without dead ends: 2727 [2019-09-08 10:45:05,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2019-09-08 10:45:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2717. [2019-09-08 10:45:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2717 states. [2019-09-08 10:45:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3802 transitions. [2019-09-08 10:45:05,431 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3802 transitions. Word has length 69 [2019-09-08 10:45:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:05,432 INFO L475 AbstractCegarLoop]: Abstraction has 2717 states and 3802 transitions. [2019-09-08 10:45:05,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3802 transitions. [2019-09-08 10:45:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:45:05,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:05,436 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] [2019-09-08 10:45:05,437 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1808255150, now seen corresponding path program 1 times [2019-09-08 10:45:05,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:05,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:05,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:05,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:05,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:05,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:05,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:45:05,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:45:05,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:45:05,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:45:05,559 INFO L87 Difference]: Start difference. First operand 2717 states and 3802 transitions. Second operand 6 states. [2019-09-08 10:45:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:06,484 INFO L93 Difference]: Finished difference Result 7999 states and 11383 transitions. [2019-09-08 10:45:06,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:45:06,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:45:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:06,522 INFO L225 Difference]: With dead ends: 7999 [2019-09-08 10:45:06,522 INFO L226 Difference]: Without dead ends: 5621 [2019-09-08 10:45:06,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 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 10:45:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5621 states. [2019-09-08 10:45:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5621 to 5613. [2019-09-08 10:45:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-09-08 10:45:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 7942 transitions. [2019-09-08 10:45:06,951 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 7942 transitions. Word has length 70 [2019-09-08 10:45:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:06,951 INFO L475 AbstractCegarLoop]: Abstraction has 5613 states and 7942 transitions. [2019-09-08 10:45:06,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:45:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 7942 transitions. [2019-09-08 10:45:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:45:06,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:06,958 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] [2019-09-08 10:45:06,958 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:06,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:06,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2110264071, now seen corresponding path program 1 times [2019-09-08 10:45:06,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:06,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:06,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:06,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:06,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:07,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:07,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:45:07,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:45:07,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:45:07,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:07,051 INFO L87 Difference]: Start difference. First operand 5613 states and 7942 transitions. Second operand 3 states. [2019-09-08 10:45:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:07,396 INFO L93 Difference]: Finished difference Result 12717 states and 18203 transitions. [2019-09-08 10:45:07,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:45:07,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 10:45:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:07,435 INFO L225 Difference]: With dead ends: 12717 [2019-09-08 10:45:07,435 INFO L226 Difference]: Without dead ends: 8120 [2019-09-08 10:45:07,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8120 states. [2019-09-08 10:45:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8120 to 8076. [2019-09-08 10:45:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8076 states. [2019-09-08 10:45:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8076 states to 8076 states and 11365 transitions. [2019-09-08 10:45:07,914 INFO L78 Accepts]: Start accepts. Automaton has 8076 states and 11365 transitions. Word has length 70 [2019-09-08 10:45:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:07,920 INFO L475 AbstractCegarLoop]: Abstraction has 8076 states and 11365 transitions. [2019-09-08 10:45:07,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8076 states and 11365 transitions. [2019-09-08 10:45:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:45:07,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:07,929 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] [2019-09-08 10:45:07,929 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:07,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:07,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1046244720, now seen corresponding path program 1 times [2019-09-08 10:45:07,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:07,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:07,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:07,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:07,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:08,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:08,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:45:08,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:45:08,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:45:08,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:45:08,121 INFO L87 Difference]: Start difference. First operand 8076 states and 11365 transitions. Second operand 7 states. [2019-09-08 10:45:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:10,502 INFO L93 Difference]: Finished difference Result 32700 states and 46995 transitions. [2019-09-08 10:45:10,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:45:10,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-08 10:45:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:10,610 INFO L225 Difference]: With dead ends: 32700 [2019-09-08 10:45:10,611 INFO L226 Difference]: Without dead ends: 29846 [2019-09-08 10:45:10,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:45:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29846 states. [2019-09-08 10:45:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29846 to 8100. [2019-09-08 10:45:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8100 states. [2019-09-08 10:45:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8100 states to 8100 states and 11397 transitions. [2019-09-08 10:45:11,969 INFO L78 Accepts]: Start accepts. Automaton has 8100 states and 11397 transitions. Word has length 71 [2019-09-08 10:45:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:11,970 INFO L475 AbstractCegarLoop]: Abstraction has 8100 states and 11397 transitions. [2019-09-08 10:45:11,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:45:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 8100 states and 11397 transitions. [2019-09-08 10:45:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:45:11,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:11,978 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] [2019-09-08 10:45:11,978 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:11,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1662354062, now seen corresponding path program 1 times [2019-09-08 10:45:11,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:11,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:11,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:11,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:11,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:12,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:12,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:45:12,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:45:12,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:45:12,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:45:12,070 INFO L87 Difference]: Start difference. First operand 8100 states and 11397 transitions. Second operand 5 states. [2019-09-08 10:45:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:13,130 INFO L93 Difference]: Finished difference Result 18927 states and 26700 transitions. [2019-09-08 10:45:13,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:45:13,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:45:13,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:13,164 INFO L225 Difference]: With dead ends: 18927 [2019-09-08 10:45:13,164 INFO L226 Difference]: Without dead ends: 11141 [2019-09-08 10:45:13,186 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 10:45:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11141 states. [2019-09-08 10:45:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11141 to 8100. [2019-09-08 10:45:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8100 states. [2019-09-08 10:45:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8100 states to 8100 states and 11346 transitions. [2019-09-08 10:45:13,819 INFO L78 Accepts]: Start accepts. Automaton has 8100 states and 11346 transitions. Word has length 71 [2019-09-08 10:45:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:13,820 INFO L475 AbstractCegarLoop]: Abstraction has 8100 states and 11346 transitions. [2019-09-08 10:45:13,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:45:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 8100 states and 11346 transitions. [2019-09-08 10:45:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:45:13,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:13,828 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] [2019-09-08 10:45:13,828 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:13,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:13,829 INFO L82 PathProgramCache]: Analyzing trace with hash 781936563, now seen corresponding path program 1 times [2019-09-08 10:45:13,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:13,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:13,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:13,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:13,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:13,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:13,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:45:13,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:45:13,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:45:13,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:45:13,925 INFO L87 Difference]: Start difference. First operand 8100 states and 11346 transitions. Second operand 6 states. [2019-09-08 10:45:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:15,357 INFO L93 Difference]: Finished difference Result 24499 states and 34381 transitions. [2019-09-08 10:45:15,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:45:15,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-08 10:45:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:15,404 INFO L225 Difference]: With dead ends: 24499 [2019-09-08 10:45:15,405 INFO L226 Difference]: Without dead ends: 16684 [2019-09-08 10:45:15,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 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 10:45:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16684 states. [2019-09-08 10:45:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16684 to 16576. [2019-09-08 10:45:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16576 states. [2019-09-08 10:45:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16576 states to 16576 states and 23169 transitions. [2019-09-08 10:45:16,456 INFO L78 Accepts]: Start accepts. Automaton has 16576 states and 23169 transitions. Word has length 72 [2019-09-08 10:45:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:16,456 INFO L475 AbstractCegarLoop]: Abstraction has 16576 states and 23169 transitions. [2019-09-08 10:45:16,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:45:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 16576 states and 23169 transitions. [2019-09-08 10:45:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:45:16,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:16,465 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] [2019-09-08 10:45:16,466 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:16,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1774096579, now seen corresponding path program 1 times [2019-09-08 10:45:16,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:16,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:16,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:16,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:16,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:16,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:16,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:45:16,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:45:16,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:45:16,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:45:16,576 INFO L87 Difference]: Start difference. First operand 16576 states and 23169 transitions. Second operand 7 states. [2019-09-08 10:45:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:20,585 INFO L93 Difference]: Finished difference Result 62412 states and 87291 transitions. [2019-09-08 10:45:20,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:45:20,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-08 10:45:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:20,700 INFO L225 Difference]: With dead ends: 62412 [2019-09-08 10:45:20,700 INFO L226 Difference]: Without dead ends: 53845 [2019-09-08 10:45:20,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:45:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-09-08 10:45:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 16604. [2019-09-08 10:45:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16604 states. [2019-09-08 10:45:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16604 states to 16604 states and 23205 transitions. [2019-09-08 10:45:22,056 INFO L78 Accepts]: Start accepts. Automaton has 16604 states and 23205 transitions. Word has length 72 [2019-09-08 10:45:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:22,057 INFO L475 AbstractCegarLoop]: Abstraction has 16604 states and 23205 transitions. [2019-09-08 10:45:22,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:45:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 16604 states and 23205 transitions. [2019-09-08 10:45:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:45:22,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:22,064 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] [2019-09-08 10:45:22,065 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash -985771663, now seen corresponding path program 1 times [2019-09-08 10:45:22,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:22,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:22,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:22,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:22,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:22,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:22,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:45:22,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:45:22,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:45:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:45:22,187 INFO L87 Difference]: Start difference. First operand 16604 states and 23205 transitions. Second operand 7 states. [2019-09-08 10:45:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:27,665 INFO L93 Difference]: Finished difference Result 78848 states and 111441 transitions. [2019-09-08 10:45:27,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:45:27,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-08 10:45:27,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:27,768 INFO L225 Difference]: With dead ends: 78848 [2019-09-08 10:45:27,768 INFO L226 Difference]: Without dead ends: 70766 [2019-09-08 10:45:27,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:45:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70766 states. [2019-09-08 10:45:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70766 to 16701. [2019-09-08 10:45:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16701 states. [2019-09-08 10:45:30,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16701 states to 16701 states and 23334 transitions. [2019-09-08 10:45:30,131 INFO L78 Accepts]: Start accepts. Automaton has 16701 states and 23334 transitions. Word has length 73 [2019-09-08 10:45:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:30,131 INFO L475 AbstractCegarLoop]: Abstraction has 16701 states and 23334 transitions. [2019-09-08 10:45:30,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:45:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 16701 states and 23334 transitions. [2019-09-08 10:45:30,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:45:30,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:30,140 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] [2019-09-08 10:45:30,140 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:30,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:30,141 INFO L82 PathProgramCache]: Analyzing trace with hash -748097079, now seen corresponding path program 1 times [2019-09-08 10:45:30,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:30,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:30,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:30,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:30,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:30,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:30,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:45:30,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:45:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:45:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:45:30,373 INFO L87 Difference]: Start difference. First operand 16701 states and 23334 transitions. Second operand 10 states. [2019-09-08 10:45:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:40,723 INFO L93 Difference]: Finished difference Result 91903 states and 130436 transitions. [2019-09-08 10:45:40,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 10:45:40,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-08 10:45:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:40,824 INFO L225 Difference]: With dead ends: 91903 [2019-09-08 10:45:40,824 INFO L226 Difference]: Without dead ends: 85299 [2019-09-08 10:45:40,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 10:45:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85299 states. [2019-09-08 10:45:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85299 to 16701. [2019-09-08 10:45:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16701 states. [2019-09-08 10:45:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16701 states to 16701 states and 23332 transitions. [2019-09-08 10:45:42,793 INFO L78 Accepts]: Start accepts. Automaton has 16701 states and 23332 transitions. Word has length 74 [2019-09-08 10:45:42,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:42,793 INFO L475 AbstractCegarLoop]: Abstraction has 16701 states and 23332 transitions. [2019-09-08 10:45:42,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:45:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 16701 states and 23332 transitions. [2019-09-08 10:45:42,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:45:42,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:42,800 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] [2019-09-08 10:45:42,800 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:42,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:42,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1361960620, now seen corresponding path program 1 times [2019-09-08 10:45:42,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:42,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:42,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:42,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:42,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:42,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:42,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:45:42,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:45:42,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:45:42,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:45:42,991 INFO L87 Difference]: Start difference. First operand 16701 states and 23332 transitions. Second operand 9 states. [2019-09-08 10:45:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:48,797 INFO L93 Difference]: Finished difference Result 55001 states and 78174 transitions. [2019-09-08 10:45:48,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 10:45:48,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-09-08 10:45:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:48,847 INFO L225 Difference]: With dead ends: 55001 [2019-09-08 10:45:48,847 INFO L226 Difference]: Without dead ends: 41641 [2019-09-08 10:45:48,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:45:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41641 states. [2019-09-08 10:45:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41641 to 16697. [2019-09-08 10:45:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16697 states. [2019-09-08 10:45:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16697 states to 16697 states and 23324 transitions. [2019-09-08 10:45:50,568 INFO L78 Accepts]: Start accepts. Automaton has 16697 states and 23324 transitions. Word has length 74 [2019-09-08 10:45:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:50,568 INFO L475 AbstractCegarLoop]: Abstraction has 16697 states and 23324 transitions. [2019-09-08 10:45:50,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:45:50,568 INFO L276 IsEmpty]: Start isEmpty. Operand 16697 states and 23324 transitions. [2019-09-08 10:45:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:45:50,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:50,575 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] [2019-09-08 10:45:50,575 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:50,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:50,576 INFO L82 PathProgramCache]: Analyzing trace with hash -496781760, now seen corresponding path program 1 times [2019-09-08 10:45:50,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:50,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:50,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:50,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:50,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:51,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:51,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:45:51,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:45:51,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:45:51,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:45:51,029 INFO L87 Difference]: Start difference. First operand 16697 states and 23324 transitions. Second operand 12 states. [2019-09-08 10:46:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:03,270 INFO L93 Difference]: Finished difference Result 105310 states and 150072 transitions. [2019-09-08 10:46:03,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:46:03,270 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2019-09-08 10:46:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:03,393 INFO L225 Difference]: With dead ends: 105310 [2019-09-08 10:46:03,393 INFO L226 Difference]: Without dead ends: 91742 [2019-09-08 10:46:03,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:46:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91742 states. [2019-09-08 10:46:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91742 to 16473. [2019-09-08 10:46:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16473 states. [2019-09-08 10:46:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16473 states to 16473 states and 23044 transitions. [2019-09-08 10:46:05,840 INFO L78 Accepts]: Start accepts. Automaton has 16473 states and 23044 transitions. Word has length 75 [2019-09-08 10:46:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:05,840 INFO L475 AbstractCegarLoop]: Abstraction has 16473 states and 23044 transitions. [2019-09-08 10:46:05,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:46:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 16473 states and 23044 transitions. [2019-09-08 10:46:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:46:05,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:05,847 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] [2019-09-08 10:46:05,847 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:05,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:05,847 INFO L82 PathProgramCache]: Analyzing trace with hash -800259869, now seen corresponding path program 1 times [2019-09-08 10:46:05,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:05,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:05,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:05,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:05,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:05,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 10:46:05,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:05,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:46:05,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:46:05,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:46:05,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:46:05,985 INFO L87 Difference]: Start difference. First operand 16473 states and 23044 transitions. Second operand 7 states. [2019-09-08 10:46:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:16,186 INFO L93 Difference]: Finished difference Result 68751 states and 96766 transitions. [2019-09-08 10:46:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:46:16,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-09-08 10:46:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:16,257 INFO L225 Difference]: With dead ends: 68751 [2019-09-08 10:46:16,258 INFO L226 Difference]: Without dead ends: 60861 [2019-09-08 10:46:16,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:46:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60861 states. [2019-09-08 10:46:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60861 to 16561. [2019-09-08 10:46:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16561 states. [2019-09-08 10:46:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16561 states to 16561 states and 23165 transitions. [2019-09-08 10:46:18,747 INFO L78 Accepts]: Start accepts. Automaton has 16561 states and 23165 transitions. Word has length 75 [2019-09-08 10:46:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:18,747 INFO L475 AbstractCegarLoop]: Abstraction has 16561 states and 23165 transitions. [2019-09-08 10:46:18,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:46:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 16561 states and 23165 transitions. [2019-09-08 10:46:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:46:18,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:18,753 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] [2019-09-08 10:46:18,754 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:18,754 INFO L82 PathProgramCache]: Analyzing trace with hash 396030427, now seen corresponding path program 1 times [2019-09-08 10:46:18,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:18,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:18,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:46:19,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:19,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:46:19,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:46:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:46:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:46:19,239 INFO L87 Difference]: Start difference. First operand 16561 states and 23165 transitions. Second operand 12 states. [2019-09-08 10:46:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:34,784 INFO L93 Difference]: Finished difference Result 104602 states and 149248 transitions. [2019-09-08 10:46:34,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:46:34,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2019-09-08 10:46:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:34,920 INFO L225 Difference]: With dead ends: 104602 [2019-09-08 10:46:34,921 INFO L226 Difference]: Without dead ends: 91218 [2019-09-08 10:46:34,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:46:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91218 states. [2019-09-08 10:46:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91218 to 16529. [2019-09-08 10:46:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16529 states. [2019-09-08 10:46:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16529 states to 16529 states and 23123 transitions. [2019-09-08 10:46:38,952 INFO L78 Accepts]: Start accepts. Automaton has 16529 states and 23123 transitions. Word has length 75 [2019-09-08 10:46:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:38,952 INFO L475 AbstractCegarLoop]: Abstraction has 16529 states and 23123 transitions. [2019-09-08 10:46:38,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:46:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 16529 states and 23123 transitions. [2019-09-08 10:46:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:46:38,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:38,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] [2019-09-08 10:46:38,959 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:38,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:38,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1982405688, now seen corresponding path program 1 times [2019-09-08 10:46:38,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:38,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:38,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:39,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 10:46:39,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:39,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:46:39,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:46:39,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:46:39,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:46:39,110 INFO L87 Difference]: Start difference. First operand 16529 states and 23123 transitions. Second operand 9 states. [2019-09-08 10:46:52,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:52,388 INFO L93 Difference]: Finished difference Result 81602 states and 116624 transitions. [2019-09-08 10:46:52,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:46:52,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:46:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:52,470 INFO L225 Difference]: With dead ends: 81602 [2019-09-08 10:46:52,471 INFO L226 Difference]: Without dead ends: 68192 [2019-09-08 10:46:52,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:46:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68192 states. [2019-09-08 10:46:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68192 to 16501. [2019-09-08 10:46:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16501 states. [2019-09-08 10:46:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16501 states to 16501 states and 23079 transitions. [2019-09-08 10:46:55,507 INFO L78 Accepts]: Start accepts. Automaton has 16501 states and 23079 transitions. Word has length 75 [2019-09-08 10:46:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:55,508 INFO L475 AbstractCegarLoop]: Abstraction has 16501 states and 23079 transitions. [2019-09-08 10:46:55,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:46:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 16501 states and 23079 transitions. [2019-09-08 10:46:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:46:55,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:55,514 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] [2019-09-08 10:46:55,514 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash -721956628, now seen corresponding path program 1 times [2019-09-08 10:46:55,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:55,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:55,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:46:55,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:55,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:46:55,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:46:55,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:46:55,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:46:55,637 INFO L87 Difference]: Start difference. First operand 16501 states and 23079 transitions. Second operand 7 states. [2019-09-08 10:47:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:10,663 INFO L93 Difference]: Finished difference Result 78342 states and 110837 transitions. [2019-09-08 10:47:10,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:47:10,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-09-08 10:47:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:10,746 INFO L225 Difference]: With dead ends: 78342 [2019-09-08 10:47:10,746 INFO L226 Difference]: Without dead ends: 70402 [2019-09-08 10:47:10,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:47:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70402 states. [2019-09-08 10:47:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70402 to 16531. [2019-09-08 10:47:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16531 states. [2019-09-08 10:47:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16531 states to 16531 states and 23119 transitions. [2019-09-08 10:47:13,819 INFO L78 Accepts]: Start accepts. Automaton has 16531 states and 23119 transitions. Word has length 76 [2019-09-08 10:47:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:13,820 INFO L475 AbstractCegarLoop]: Abstraction has 16531 states and 23119 transitions. [2019-09-08 10:47:13,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:47:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 16531 states and 23119 transitions. [2019-09-08 10:47:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:47:13,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:13,827 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] [2019-09-08 10:47:13,827 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:13,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:13,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1501607501, now seen corresponding path program 1 times [2019-09-08 10:47:13,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:13,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:13,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:13,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:13,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:14,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:14,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:47:14,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:47:14,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:47:14,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:47:14,081 INFO L87 Difference]: Start difference. First operand 16531 states and 23119 transitions. Second operand 10 states. [2019-09-08 10:47:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:29,632 INFO L93 Difference]: Finished difference Result 84488 states and 119990 transitions. [2019-09-08 10:47:29,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:47:29,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2019-09-08 10:47:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:29,711 INFO L225 Difference]: With dead ends: 84488 [2019-09-08 10:47:29,711 INFO L226 Difference]: Without dead ends: 70776 [2019-09-08 10:47:29,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-08 10:47:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70776 states. [2019-09-08 10:47:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70776 to 16345. [2019-09-08 10:47:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16345 states. [2019-09-08 10:47:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16345 states to 16345 states and 22877 transitions. [2019-09-08 10:47:33,034 INFO L78 Accepts]: Start accepts. Automaton has 16345 states and 22877 transitions. Word has length 76 [2019-09-08 10:47:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:33,034 INFO L475 AbstractCegarLoop]: Abstraction has 16345 states and 22877 transitions. [2019-09-08 10:47:33,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:47:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 16345 states and 22877 transitions. [2019-09-08 10:47:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:47:33,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:33,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] [2019-09-08 10:47:33,042 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:33,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:33,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1544377412, now seen corresponding path program 1 times [2019-09-08 10:47:33,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:33,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:33,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:33,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:33,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:33,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:33,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:47:33,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:47:33,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:47:33,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:47:33,158 INFO L87 Difference]: Start difference. First operand 16345 states and 22877 transitions. Second operand 7 states. [2019-09-08 10:47:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:48,375 INFO L93 Difference]: Finished difference Result 68455 states and 96389 transitions. [2019-09-08 10:47:48,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:47:48,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-09-08 10:47:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:48,452 INFO L225 Difference]: With dead ends: 68455 [2019-09-08 10:47:48,452 INFO L226 Difference]: Without dead ends: 60589 [2019-09-08 10:47:48,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:47:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60589 states. [2019-09-08 10:47:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60589 to 16388. [2019-09-08 10:47:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16388 states. [2019-09-08 10:47:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16388 states to 16388 states and 22938 transitions. [2019-09-08 10:47:51,915 INFO L78 Accepts]: Start accepts. Automaton has 16388 states and 22938 transitions. Word has length 76 [2019-09-08 10:47:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:51,916 INFO L475 AbstractCegarLoop]: Abstraction has 16388 states and 22938 transitions. [2019-09-08 10:47:51,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:47:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 16388 states and 22938 transitions. [2019-09-08 10:47:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:47:51,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:51,922 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] [2019-09-08 10:47:51,922 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:51,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2116167533, now seen corresponding path program 1 times [2019-09-08 10:47:51,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:51,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:51,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:51,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:51,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:52,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:52,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:47:52,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:47:52,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:47:52,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:47:52,413 INFO L87 Difference]: Start difference. First operand 16388 states and 22938 transitions. Second operand 13 states. [2019-09-08 10:47:53,184 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-08 10:47:53,398 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 10:47:53,576 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 10:47:53,927 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 10:47:54,109 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-08 10:47:54,577 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 10:48:00,373 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-08 10:48:03,060 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 10:48:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:23,696 INFO L93 Difference]: Finished difference Result 122508 states and 173506 transitions. [2019-09-08 10:48:23,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 10:48:23,697 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2019-09-08 10:48:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:23,839 INFO L225 Difference]: With dead ends: 122508 [2019-09-08 10:48:23,839 INFO L226 Difference]: Without dead ends: 114528 [2019-09-08 10:48:23,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=371, Invalid=1189, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 10:48:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114528 states. [2019-09-08 10:48:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114528 to 16356. [2019-09-08 10:48:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16356 states. [2019-09-08 10:48:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16356 states to 16356 states and 22895 transitions. [2019-09-08 10:48:28,220 INFO L78 Accepts]: Start accepts. Automaton has 16356 states and 22895 transitions. Word has length 76 [2019-09-08 10:48:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:28,221 INFO L475 AbstractCegarLoop]: Abstraction has 16356 states and 22895 transitions. [2019-09-08 10:48:28,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:48:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 16356 states and 22895 transitions. [2019-09-08 10:48:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:48:28,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:28,228 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] [2019-09-08 10:48:28,229 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:28,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:28,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1252560031, now seen corresponding path program 1 times [2019-09-08 10:48:28,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:28,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:28,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:28,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:28,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:28,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:28,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:48:28,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:48:28,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:48:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:48:28,861 INFO L87 Difference]: Start difference. First operand 16356 states and 22895 transitions. Second operand 13 states. [2019-09-08 10:48:29,825 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 10:48:30,107 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 10:48:30,389 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 10:48:30,799 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 10:48:31,015 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 10:48:31,224 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 10:48:31,747 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 10:48:31,974 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 10:48:32,299 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 10:48:32,556 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 10:48:33,723 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 10:48:34,103 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:48:35,034 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 10:48:38,269 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 10:48:39,634 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 10:48:40,396 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 10:48:41,248 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 10:48:42,874 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 10:48:43,763 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:49:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:14,279 INFO L93 Difference]: Finished difference Result 143270 states and 203531 transitions. [2019-09-08 10:49:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 10:49:14,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-09-08 10:49:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:14,454 INFO L225 Difference]: With dead ends: 143270 [2019-09-08 10:49:14,454 INFO L226 Difference]: Without dead ends: 135376 [2019-09-08 10:49:14,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=457, Invalid=1435, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 10:49:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135376 states. [2019-09-08 10:49:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135376 to 16347. [2019-09-08 10:49:19,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16347 states. [2019-09-08 10:49:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16347 states to 16347 states and 22883 transitions. [2019-09-08 10:49:19,600 INFO L78 Accepts]: Start accepts. Automaton has 16347 states and 22883 transitions. Word has length 77 [2019-09-08 10:49:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:19,600 INFO L475 AbstractCegarLoop]: Abstraction has 16347 states and 22883 transitions. [2019-09-08 10:49:19,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:49:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 16347 states and 22883 transitions. [2019-09-08 10:49:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:49:19,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:19,606 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] [2019-09-08 10:49:19,606 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:19,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:19,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1021172735, now seen corresponding path program 1 times [2019-09-08 10:49:19,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:19,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:19,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:19,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:19,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:19,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:19,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:49:19,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:49:19,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:49:19,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:49:19,861 INFO L87 Difference]: Start difference. First operand 16347 states and 22883 transitions. Second operand 10 states. [2019-09-08 10:49:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:41,088 INFO L93 Difference]: Finished difference Result 73574 states and 104220 transitions. [2019-09-08 10:49:41,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:49:41,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-09-08 10:49:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:41,158 INFO L225 Difference]: With dead ends: 73574 [2019-09-08 10:49:41,158 INFO L226 Difference]: Without dead ends: 59832 [2019-09-08 10:49:41,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:49:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59832 states. [2019-09-08 10:49:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59832 to 16347. [2019-09-08 10:49:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16347 states. [2019-09-08 10:49:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16347 states to 16347 states and 22881 transitions. [2019-09-08 10:49:46,205 INFO L78 Accepts]: Start accepts. Automaton has 16347 states and 22881 transitions. Word has length 77 [2019-09-08 10:49:46,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:46,206 INFO L475 AbstractCegarLoop]: Abstraction has 16347 states and 22881 transitions. [2019-09-08 10:49:46,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:49:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 16347 states and 22881 transitions. [2019-09-08 10:49:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:49:46,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:46,211 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] [2019-09-08 10:49:46,211 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:46,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1655595086, now seen corresponding path program 1 times [2019-09-08 10:49:46,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:46,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:46,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:46,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:46,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:46,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:46,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:49:46,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:49:46,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:49:46,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:49:46,272 INFO L87 Difference]: Start difference. First operand 16347 states and 22881 transitions. Second operand 3 states. [2019-09-08 10:49:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:51,102 INFO L93 Difference]: Finished difference Result 24616 states and 34548 transitions. [2019-09-08 10:49:51,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:49:51,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:49:51,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:51,123 INFO L225 Difference]: With dead ends: 24616 [2019-09-08 10:49:51,123 INFO L226 Difference]: Without dead ends: 16351 [2019-09-08 10:49:51,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:49:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16351 states. [2019-09-08 10:49:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16351 to 16347. [2019-09-08 10:49:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16347 states. [2019-09-08 10:49:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16347 states to 16347 states and 22644 transitions. [2019-09-08 10:49:56,744 INFO L78 Accepts]: Start accepts. Automaton has 16347 states and 22644 transitions. Word has length 77 [2019-09-08 10:49:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:56,744 INFO L475 AbstractCegarLoop]: Abstraction has 16347 states and 22644 transitions. [2019-09-08 10:49:56,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:49:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 16347 states and 22644 transitions. [2019-09-08 10:49:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:49:56,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:56,750 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] [2019-09-08 10:49:56,750 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:56,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2116867699, now seen corresponding path program 1 times [2019-09-08 10:49:56,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:56,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:56,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:56,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:56,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:56,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:49:56,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:49:56,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:49:56,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:49:56,806 INFO L87 Difference]: Start difference. First operand 16347 states and 22644 transitions. Second operand 3 states. [2019-09-08 10:50:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:04,418 INFO L93 Difference]: Finished difference Result 32713 states and 45624 transitions. [2019-09-08 10:50:04,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:50:04,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:50:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:04,443 INFO L225 Difference]: With dead ends: 32713 [2019-09-08 10:50:04,444 INFO L226 Difference]: Without dead ends: 23716 [2019-09-08 10:50:04,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:50:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23716 states. [2019-09-08 10:50:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23716 to 18752. [2019-09-08 10:50:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18752 states. [2019-09-08 10:50:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18752 states to 18752 states and 26150 transitions. [2019-09-08 10:50:10,818 INFO L78 Accepts]: Start accepts. Automaton has 18752 states and 26150 transitions. Word has length 77 [2019-09-08 10:50:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:10,818 INFO L475 AbstractCegarLoop]: Abstraction has 18752 states and 26150 transitions. [2019-09-08 10:50:10,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:50:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 18752 states and 26150 transitions. [2019-09-08 10:50:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:50:10,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:10,824 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] [2019-09-08 10:50:10,824 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:10,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:10,825 INFO L82 PathProgramCache]: Analyzing trace with hash 356792185, now seen corresponding path program 1 times [2019-09-08 10:50:10,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:10,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:10,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:10,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:10,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:10,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:10,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:50:10,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:50:10,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:50:10,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:50:10,896 INFO L87 Difference]: Start difference. First operand 18752 states and 26150 transitions. Second operand 3 states. [2019-09-08 10:50:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:17,430 INFO L93 Difference]: Finished difference Result 28635 states and 39983 transitions. [2019-09-08 10:50:17,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:50:17,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:50:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:17,447 INFO L225 Difference]: With dead ends: 28635 [2019-09-08 10:50:17,447 INFO L226 Difference]: Without dead ends: 18754 [2019-09-08 10:50:17,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:50:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18754 states. [2019-09-08 10:50:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18754 to 18752. [2019-09-08 10:50:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18752 states. [2019-09-08 10:50:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18752 states to 18752 states and 25894 transitions. [2019-09-08 10:50:23,811 INFO L78 Accepts]: Start accepts. Automaton has 18752 states and 25894 transitions. Word has length 78 [2019-09-08 10:50:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:23,811 INFO L475 AbstractCegarLoop]: Abstraction has 18752 states and 25894 transitions. [2019-09-08 10:50:23,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:50:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 18752 states and 25894 transitions. [2019-09-08 10:50:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:50:23,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:23,816 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] [2019-09-08 10:50:23,817 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1518027636, now seen corresponding path program 1 times [2019-09-08 10:50:23,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:23,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:23,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:23,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:23,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:23,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:23,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:50:23,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:50:23,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:50:23,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:50:23,893 INFO L87 Difference]: Start difference. First operand 18752 states and 25894 transitions. Second operand 3 states. [2019-09-08 10:50:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:30,611 INFO L93 Difference]: Finished difference Result 26863 states and 37026 transitions. [2019-09-08 10:50:30,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:50:30,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:50:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:30,632 INFO L225 Difference]: With dead ends: 26863 [2019-09-08 10:50:30,632 INFO L226 Difference]: Without dead ends: 18421 [2019-09-08 10:50:30,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:50:30,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18421 states. [2019-09-08 10:50:36,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18421 to 18419. [2019-09-08 10:50:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18419 states. [2019-09-08 10:50:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18419 states to 18419 states and 25176 transitions. [2019-09-08 10:50:36,995 INFO L78 Accepts]: Start accepts. Automaton has 18419 states and 25176 transitions. Word has length 78 [2019-09-08 10:50:36,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:36,995 INFO L475 AbstractCegarLoop]: Abstraction has 18419 states and 25176 transitions. [2019-09-08 10:50:36,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:50:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 18419 states and 25176 transitions. [2019-09-08 10:50:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:50:37,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:37,001 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] [2019-09-08 10:50:37,001 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:37,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:37,002 INFO L82 PathProgramCache]: Analyzing trace with hash 466583394, now seen corresponding path program 1 times [2019-09-08 10:50:37,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:37,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:37,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:37,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:37,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:37,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:50:37,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:50:37,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:50:37,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:50:37,063 INFO L87 Difference]: Start difference. First operand 18419 states and 25176 transitions. Second operand 3 states. [2019-09-08 10:50:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:47,890 INFO L93 Difference]: Finished difference Result 37762 states and 51996 transitions. [2019-09-08 10:50:47,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:50:47,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 10:50:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:47,928 INFO L225 Difference]: With dead ends: 37762 [2019-09-08 10:50:47,928 INFO L226 Difference]: Without dead ends: 27388 [2019-09-08 10:50:47,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:50:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27388 states. [2019-09-08 10:50:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27388 to 18032. [2019-09-08 10:50:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18032 states. [2019-09-08 10:50:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18032 states to 18032 states and 24656 transitions. [2019-09-08 10:50:55,655 INFO L78 Accepts]: Start accepts. Automaton has 18032 states and 24656 transitions. Word has length 79 [2019-09-08 10:50:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:55,656 INFO L475 AbstractCegarLoop]: Abstraction has 18032 states and 24656 transitions. [2019-09-08 10:50:55,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:50:55,656 INFO L276 IsEmpty]: Start isEmpty. Operand 18032 states and 24656 transitions. [2019-09-08 10:50:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:50:55,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:55,660 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] [2019-09-08 10:50:55,660 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:55,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:55,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1453165948, now seen corresponding path program 1 times [2019-09-08 10:50:55,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:55,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:55,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:55,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:55,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:55,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:55,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:50:55,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:50:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:50:55,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:50:55,709 INFO L87 Difference]: Start difference. First operand 18032 states and 24656 transitions. Second operand 3 states. [2019-09-08 10:51:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:07,945 INFO L93 Difference]: Finished difference Result 37490 states and 51532 transitions. [2019-09-08 10:51:07,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:51:07,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 10:51:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:07,977 INFO L225 Difference]: With dead ends: 37490 [2019-09-08 10:51:07,977 INFO L226 Difference]: Without dead ends: 27124 [2019-09-08 10:51:07,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:51:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27124 states. [2019-09-08 10:51:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27124 to 17766. [2019-09-08 10:51:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17766 states. [2019-09-08 10:51:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17766 states to 17766 states and 24265 transitions. [2019-09-08 10:51:17,521 INFO L78 Accepts]: Start accepts. Automaton has 17766 states and 24265 transitions. Word has length 79 [2019-09-08 10:51:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:17,521 INFO L475 AbstractCegarLoop]: Abstraction has 17766 states and 24265 transitions. [2019-09-08 10:51:17,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:51:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 17766 states and 24265 transitions. [2019-09-08 10:51:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:51:17,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:17,525 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] [2019-09-08 10:51:17,526 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:17,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1034435502, now seen corresponding path program 1 times [2019-09-08 10:51:17,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:17,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:17,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:17,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:17,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:17,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:17,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:51:17,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:51:17,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:51:17,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:51:17,707 INFO L87 Difference]: Start difference. First operand 17766 states and 24265 transitions. Second operand 9 states. [2019-09-08 10:51:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:44,981 INFO L93 Difference]: Finished difference Result 48506 states and 66827 transitions. [2019-09-08 10:51:44,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:51:44,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-08 10:51:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:45,033 INFO L225 Difference]: With dead ends: 48506 [2019-09-08 10:51:45,033 INFO L226 Difference]: Without dead ends: 47056 [2019-09-08 10:51:45,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-09-08 10:51:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47056 states. [2019-09-08 10:51:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47056 to 17762. [2019-09-08 10:51:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17762 states. [2019-09-08 10:51:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17762 states to 17762 states and 24257 transitions. [2019-09-08 10:51:54,390 INFO L78 Accepts]: Start accepts. Automaton has 17762 states and 24257 transitions. Word has length 79 [2019-09-08 10:51:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:54,390 INFO L475 AbstractCegarLoop]: Abstraction has 17762 states and 24257 transitions. [2019-09-08 10:51:54,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:51:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 17762 states and 24257 transitions. [2019-09-08 10:51:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:51:54,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:54,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] [2019-09-08 10:51:54,394 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:54,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:54,395 INFO L82 PathProgramCache]: Analyzing trace with hash 703952672, now seen corresponding path program 1 times [2019-09-08 10:51:54,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:54,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:54,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:54,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:54,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:51:54,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:51:54,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:51:54,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:51:54,550 INFO L87 Difference]: Start difference. First operand 17762 states and 24257 transitions. Second operand 9 states. [2019-09-08 10:52:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:12,344 INFO L93 Difference]: Finished difference Result 31016 states and 42556 transitions. [2019-09-08 10:52:12,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:52:12,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-08 10:52:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:12,375 INFO L225 Difference]: With dead ends: 31016 [2019-09-08 10:52:12,375 INFO L226 Difference]: Without dead ends: 29562 [2019-09-08 10:52:12,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:52:12,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29562 states. [2019-09-08 10:52:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29562 to 17762. [2019-09-08 10:52:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17762 states. [2019-09-08 10:52:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17762 states to 17762 states and 24255 transitions. [2019-09-08 10:52:22,853 INFO L78 Accepts]: Start accepts. Automaton has 17762 states and 24255 transitions. Word has length 79 [2019-09-08 10:52:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:22,853 INFO L475 AbstractCegarLoop]: Abstraction has 17762 states and 24255 transitions. [2019-09-08 10:52:22,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:52:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 17762 states and 24255 transitions. [2019-09-08 10:52:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:52:22,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:22,858 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] [2019-09-08 10:52:22,859 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:22,859 INFO L82 PathProgramCache]: Analyzing trace with hash 703453167, now seen corresponding path program 1 times [2019-09-08 10:52:22,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:22,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:22,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:22,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:22,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:23,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:23,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:52:23,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:52:23,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:52:23,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:52:23,012 INFO L87 Difference]: Start difference. First operand 17762 states and 24255 transitions. Second operand 9 states. [2019-09-08 10:52:40,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:40,475 INFO L93 Difference]: Finished difference Result 31012 states and 42549 transitions. [2019-09-08 10:52:40,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:52:40,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 10:52:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:40,507 INFO L225 Difference]: With dead ends: 31012 [2019-09-08 10:52:40,507 INFO L226 Difference]: Without dead ends: 29562 [2019-09-08 10:52:40,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:52:40,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29562 states. [2019-09-08 10:52:50,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29562 to 17762. [2019-09-08 10:52:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17762 states. [2019-09-08 10:52:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17762 states to 17762 states and 24253 transitions. [2019-09-08 10:52:50,141 INFO L78 Accepts]: Start accepts. Automaton has 17762 states and 24253 transitions. Word has length 80 [2019-09-08 10:52:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:50,142 INFO L475 AbstractCegarLoop]: Abstraction has 17762 states and 24253 transitions. [2019-09-08 10:52:50,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:52:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 17762 states and 24253 transitions. [2019-09-08 10:52:50,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:52:50,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:50,146 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] [2019-09-08 10:52:50,146 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:50,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:50,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1367950000, now seen corresponding path program 1 times [2019-09-08 10:52:50,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:50,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:50,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:50,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:50,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:50,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:50,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:52:50,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:52:50,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:52:50,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:52:50,288 INFO L87 Difference]: Start difference. First operand 17762 states and 24253 transitions. Second operand 9 states. [2019-09-08 10:53:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:25,156 INFO L93 Difference]: Finished difference Result 56350 states and 77641 transitions. [2019-09-08 10:53:25,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:53:25,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 10:53:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:25,218 INFO L225 Difference]: With dead ends: 56350 [2019-09-08 10:53:25,218 INFO L226 Difference]: Without dead ends: 54862 [2019-09-08 10:53:25,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:53:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54862 states. [2019-09-08 10:53:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54862 to 17762. [2019-09-08 10:53:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17762 states. [2019-09-08 10:53:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17762 states to 17762 states and 24251 transitions. [2019-09-08 10:53:35,059 INFO L78 Accepts]: Start accepts. Automaton has 17762 states and 24251 transitions. Word has length 80 [2019-09-08 10:53:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:35,059 INFO L475 AbstractCegarLoop]: Abstraction has 17762 states and 24251 transitions. [2019-09-08 10:53:35,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:53:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 17762 states and 24251 transitions. [2019-09-08 10:53:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:53:35,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:35,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:53:35,065 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:35,066 INFO L82 PathProgramCache]: Analyzing trace with hash -993377329, now seen corresponding path program 1 times [2019-09-08 10:53:35,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:35,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:35,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:35,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:35,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:53:35,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:53:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:53:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:53:35,132 INFO L87 Difference]: Start difference. First operand 17762 states and 24251 transitions. Second operand 3 states. [2019-09-08 10:53:45,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:45,023 INFO L93 Difference]: Finished difference Result 25720 states and 35031 transitions. [2019-09-08 10:53:45,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:53:45,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 10:53:45,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:45,045 INFO L225 Difference]: With dead ends: 25720 [2019-09-08 10:53:45,045 INFO L226 Difference]: Without dead ends: 17729 [2019-09-08 10:53:45,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:53:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17729 states. [2019-09-08 10:53:53,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17729 to 14947. [2019-09-08 10:53:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14947 states. [2019-09-08 10:53:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14947 states to 14947 states and 20070 transitions. [2019-09-08 10:53:53,278 INFO L78 Accepts]: Start accepts. Automaton has 14947 states and 20070 transitions. Word has length 80 [2019-09-08 10:53:53,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:53,278 INFO L475 AbstractCegarLoop]: Abstraction has 14947 states and 20070 transitions. [2019-09-08 10:53:53,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:53:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 14947 states and 20070 transitions. [2019-09-08 10:53:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:53:53,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:53,282 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] [2019-09-08 10:53:53,283 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:53,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:53,283 INFO L82 PathProgramCache]: Analyzing trace with hash 348839284, now seen corresponding path program 1 times [2019-09-08 10:53:53,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:53,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:53,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:53,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:53,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:53,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:53,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:53:53,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:53:53,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:53:53,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:53:53,434 INFO L87 Difference]: Start difference. First operand 14947 states and 20070 transitions. Second operand 9 states. [2019-09-08 10:53:53,607 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-08 10:54:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:21,295 INFO L93 Difference]: Finished difference Result 46410 states and 63080 transitions. [2019-09-08 10:54:21,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:54:21,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 10:54:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:21,341 INFO L225 Difference]: With dead ends: 46410 [2019-09-08 10:54:21,341 INFO L226 Difference]: Without dead ends: 43451 [2019-09-08 10:54:21,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:54:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43451 states. [2019-09-08 10:54:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43451 to 14924. [2019-09-08 10:54:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14924 states. [2019-09-08 10:54:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14924 states to 14924 states and 20041 transitions. [2019-09-08 10:54:29,970 INFO L78 Accepts]: Start accepts. Automaton has 14924 states and 20041 transitions. Word has length 80 [2019-09-08 10:54:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:29,970 INFO L475 AbstractCegarLoop]: Abstraction has 14924 states and 20041 transitions. [2019-09-08 10:54:29,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:54:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 14924 states and 20041 transitions. [2019-09-08 10:54:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:54:29,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:29,975 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] [2019-09-08 10:54:29,975 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:29,976 INFO L82 PathProgramCache]: Analyzing trace with hash -781067770, now seen corresponding path program 1 times [2019-09-08 10:54:29,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:29,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:29,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:29,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:29,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:54:31,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:31,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 10:54:31,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 10:54:31,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 10:54:31,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-09-08 10:54:31,386 INFO L87 Difference]: Start difference. First operand 14924 states and 20041 transitions. Second operand 23 states. [2019-09-08 10:54:32,369 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-08 10:54:32,637 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-08 10:54:32,981 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-08 10:54:33,456 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-08 10:54:33,744 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-08 10:54:34,227 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-08 10:54:34,489 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-08 10:54:34,869 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 10:54:35,119 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 10:54:35,390 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 10:54:36,100 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 10:54:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:48,316 INFO L93 Difference]: Finished difference Result 19366 states and 26015 transitions. [2019-09-08 10:54:48,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 10:54:48,317 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2019-09-08 10:54:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:48,334 INFO L225 Difference]: With dead ends: 19366 [2019-09-08 10:54:48,335 INFO L226 Difference]: Without dead ends: 18862 [2019-09-08 10:54:48,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=412, Invalid=1310, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 10:54:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2019-09-08 10:54:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 14916. [2019-09-08 10:54:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14916 states. [2019-09-08 10:54:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14916 states to 14916 states and 20027 transitions. [2019-09-08 10:54:56,745 INFO L78 Accepts]: Start accepts. Automaton has 14916 states and 20027 transitions. Word has length 82 [2019-09-08 10:54:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:56,745 INFO L475 AbstractCegarLoop]: Abstraction has 14916 states and 20027 transitions. [2019-09-08 10:54:56,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 10:54:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 14916 states and 20027 transitions. [2019-09-08 10:54:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:54:56,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:56,751 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] [2019-09-08 10:54:56,751 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:56,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash -472721266, now seen corresponding path program 1 times [2019-09-08 10:54:56,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:56,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:56,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:56,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:56,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:54:58,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:58,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 10:54:58,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 10:54:58,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 10:54:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:54:58,018 INFO L87 Difference]: Start difference. First operand 14916 states and 20027 transitions. Second operand 22 states. [2019-09-08 10:54:58,777 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 10:54:59,021 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 10:54:59,259 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-09-08 10:54:59,564 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-08 10:55:00,325 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 80 [2019-09-08 10:55:00,677 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-08 10:55:00,925 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 10:55:01,204 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 10:55:01,771 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 10:55:02,044 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 10:55:02,296 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 10:55:02,819 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-08 10:55:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:23,358 INFO L93 Difference]: Finished difference Result 28106 states and 37787 transitions. [2019-09-08 10:55:23,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 10:55:23,359 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 83 [2019-09-08 10:55:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:23,386 INFO L225 Difference]: With dead ends: 28106 [2019-09-08 10:55:23,387 INFO L226 Difference]: Without dead ends: 27583 [2019-09-08 10:55:23,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=447, Invalid=1445, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 10:55:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27583 states. [2019-09-08 10:55:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27583 to 14887. [2019-09-08 10:55:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14887 states. [2019-09-08 10:55:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14887 states to 14887 states and 19991 transitions. [2019-09-08 10:55:32,141 INFO L78 Accepts]: Start accepts. Automaton has 14887 states and 19991 transitions. Word has length 83 [2019-09-08 10:55:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:32,142 INFO L475 AbstractCegarLoop]: Abstraction has 14887 states and 19991 transitions. [2019-09-08 10:55:32,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 10:55:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 14887 states and 19991 transitions. [2019-09-08 10:55:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:55:32,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:32,148 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] [2019-09-08 10:55:32,148 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:32,148 INFO L82 PathProgramCache]: Analyzing trace with hash -615226109, now seen corresponding path program 1 times [2019-09-08 10:55:32,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:32,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:32,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:32,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:32,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:32,678 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-08 10:55:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:32,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:32,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:55:32,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:55:32,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:55:32,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:55:32,947 INFO L87 Difference]: Start difference. First operand 14887 states and 19991 transitions. Second operand 14 states. [2019-09-08 10:55:33,310 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 10:55:33,504 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 10:55:33,730 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 10:55:34,053 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-08 10:55:34,269 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 10:55:34,622 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 10:55:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:55,117 INFO L93 Difference]: Finished difference Result 33043 states and 44671 transitions. [2019-09-08 10:55:55,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:55:55,118 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-09-08 10:55:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:55,154 INFO L225 Difference]: With dead ends: 33043 [2019-09-08 10:55:55,154 INFO L226 Difference]: Without dead ends: 32503 [2019-09-08 10:55:55,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2019-09-08 10:55:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32503 states. [2019-09-08 10:56:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32503 to 14841. [2019-09-08 10:56:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14841 states. [2019-09-08 10:56:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14841 states to 14841 states and 19933 transitions. [2019-09-08 10:56:04,328 INFO L78 Accepts]: Start accepts. Automaton has 14841 states and 19933 transitions. Word has length 83 [2019-09-08 10:56:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:04,328 INFO L475 AbstractCegarLoop]: Abstraction has 14841 states and 19933 transitions. [2019-09-08 10:56:04,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:56:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 14841 states and 19933 transitions. [2019-09-08 10:56:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:56:04,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:04,334 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] [2019-09-08 10:56:04,334 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:04,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:04,334 INFO L82 PathProgramCache]: Analyzing trace with hash 316359790, now seen corresponding path program 1 times [2019-09-08 10:56:04,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:04,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:04,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:04,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:04,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:05,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 10:56:05,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:05,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 10:56:05,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 10:56:05,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 10:56:05,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:56:05,138 INFO L87 Difference]: Start difference. First operand 14841 states and 19933 transitions. Second operand 18 states. [2019-09-08 10:56:05,721 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-08 10:56:05,938 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 10:56:06,197 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 10:56:06,449 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 10:56:06,746 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 10:56:07,121 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 10:56:07,417 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 10:56:07,604 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 10:56:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:27,435 INFO L93 Difference]: Finished difference Result 30276 states and 40938 transitions. [2019-09-08 10:56:27,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 10:56:27,436 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 83 [2019-09-08 10:56:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:27,469 INFO L225 Difference]: With dead ends: 30276 [2019-09-08 10:56:27,469 INFO L226 Difference]: Without dead ends: 29047 [2019-09-08 10:56:27,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 10:56:27,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29047 states. [2019-09-08 10:56:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29047 to 14810. [2019-09-08 10:56:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14810 states. [2019-09-08 10:56:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14810 states to 14810 states and 19896 transitions. [2019-09-08 10:56:36,836 INFO L78 Accepts]: Start accepts. Automaton has 14810 states and 19896 transitions. Word has length 83 [2019-09-08 10:56:36,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:36,837 INFO L475 AbstractCegarLoop]: Abstraction has 14810 states and 19896 transitions. [2019-09-08 10:56:36,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 10:56:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 14810 states and 19896 transitions. [2019-09-08 10:56:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 10:56:36,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:36,842 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] [2019-09-08 10:56:36,842 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:36,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1671863119, now seen corresponding path program 1 times [2019-09-08 10:56:36,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:36,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:36,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:36,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:36,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:56:37,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:37,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:56:37,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:56:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:56:37,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:56:37,180 INFO L87 Difference]: Start difference. First operand 14810 states and 19896 transitions. Second operand 11 states. [2019-09-08 10:56:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:58,810 INFO L93 Difference]: Finished difference Result 29116 states and 39386 transitions. [2019-09-08 10:56:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 10:56:58,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2019-09-08 10:56:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:58,843 INFO L225 Difference]: With dead ends: 29116 [2019-09-08 10:56:58,843 INFO L226 Difference]: Without dead ends: 28619 [2019-09-08 10:56:58,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:56:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28619 states. [2019-09-08 10:57:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28619 to 14807. [2019-09-08 10:57:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14807 states. [2019-09-08 10:57:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14807 states to 14807 states and 19890 transitions. [2019-09-08 10:57:08,152 INFO L78 Accepts]: Start accepts. Automaton has 14807 states and 19890 transitions. Word has length 84 [2019-09-08 10:57:08,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:08,152 INFO L475 AbstractCegarLoop]: Abstraction has 14807 states and 19890 transitions. [2019-09-08 10:57:08,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:57:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 14807 states and 19890 transitions. [2019-09-08 10:57:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 10:57:08,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:08,158 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] [2019-09-08 10:57:08,158 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:08,158 INFO L82 PathProgramCache]: Analyzing trace with hash -768344913, now seen corresponding path program 1 times [2019-09-08 10:57:08,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:08,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:08,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:08,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 10:57:08,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:08,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:57:08,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:57:08,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:57:08,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:57:08,721 INFO L87 Difference]: Start difference. First operand 14807 states and 19890 transitions. Second operand 13 states. [2019-09-08 10:57:09,603 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 10:57:09,834 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 10:57:10,111 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 10:57:10,366 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 10:57:10,623 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 10:57:10,807 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 10:57:11,891 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 10:57:12,288 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 10:57:15,162 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:57:16,391 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 10:57:17,132 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 10:57:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:55,348 INFO L93 Difference]: Finished difference Result 60817 states and 82513 transitions. [2019-09-08 10:57:55,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:57:55,349 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2019-09-08 10:57:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:55,421 INFO L225 Difference]: With dead ends: 60817 [2019-09-08 10:57:55,421 INFO L226 Difference]: Without dead ends: 60242 [2019-09-08 10:57:55,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=267, Invalid=725, Unknown=0, NotChecked=0, Total=992 [2019-09-08 10:57:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60242 states. [2019-09-08 10:58:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60242 to 14726. [2019-09-08 10:58:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14726 states. [2019-09-08 10:58:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14726 states to 14726 states and 19797 transitions. [2019-09-08 10:58:05,252 INFO L78 Accepts]: Start accepts. Automaton has 14726 states and 19797 transitions. Word has length 84 [2019-09-08 10:58:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:05,252 INFO L475 AbstractCegarLoop]: Abstraction has 14726 states and 19797 transitions. [2019-09-08 10:58:05,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:58:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 14726 states and 19797 transitions. [2019-09-08 10:58:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 10:58:05,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:05,258 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] [2019-09-08 10:58:05,258 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:05,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:05,258 INFO L82 PathProgramCache]: Analyzing trace with hash 359639667, now seen corresponding path program 1 times [2019-09-08 10:58:05,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:05,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:05,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:05,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:05,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:58:05,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:05,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:58:05,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:58:05,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:58:05,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:58:05,640 INFO L87 Difference]: Start difference. First operand 14726 states and 19797 transitions. Second operand 11 states. [2019-09-08 10:58:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:31,344 INFO L93 Difference]: Finished difference Result 34673 states and 47014 transitions. [2019-09-08 10:58:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:58:31,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2019-09-08 10:58:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:31,378 INFO L225 Difference]: With dead ends: 34673 [2019-09-08 10:58:31,378 INFO L226 Difference]: Without dead ends: 34178 [2019-09-08 10:58:31,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:58:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34178 states. [2019-09-08 10:58:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34178 to 14725. [2019-09-08 10:58:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14725 states. [2019-09-08 10:58:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14725 states to 14725 states and 19795 transitions. [2019-09-08 10:58:41,075 INFO L78 Accepts]: Start accepts. Automaton has 14725 states and 19795 transitions. Word has length 84 [2019-09-08 10:58:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:41,075 INFO L475 AbstractCegarLoop]: Abstraction has 14725 states and 19795 transitions. [2019-09-08 10:58:41,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:58:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 14725 states and 19795 transitions. [2019-09-08 10:58:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 10:58:41,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:41,082 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] [2019-09-08 10:58:41,083 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:41,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:41,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1115241070, now seen corresponding path program 1 times [2019-09-08 10:58:41,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:41,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:41,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:41,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:41,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:58:41,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:41,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:58:41,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:58:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:58:41,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:58:41,206 INFO L87 Difference]: Start difference. First operand 14725 states and 19795 transitions. Second operand 7 states.