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.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:02:38,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:02:38,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:02:38,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:02:38,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:02:38,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:02:38,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:02:38,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:02:38,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:02:38,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:02:38,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:02:38,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:02:38,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:02:38,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:02:38,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:02:38,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:02:38,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:02:38,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:02:38,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:02:38,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:02:38,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:02:38,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:02:38,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:02:38,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:02:38,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:02:38,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:02:38,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:02:38,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:02:38,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:02:38,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:02:38,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:02:38,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:02:38,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:02:38,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:02:38,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:02:38,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:02:38,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:02:38,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:02:38,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:02:38,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:02:38,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:02:38,752 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 12:02:38,766 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:02:38,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:02:38,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:02:38,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:02:38,768 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:02:38,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:02:38,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:02:38,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:02:38,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:02:38,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:02:38,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:02:38,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:02:38,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:02:38,769 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:02:38,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:02:38,770 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:02:38,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:02:38,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:02:38,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:02:38,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:02:38,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:02:38,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:02:38,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:02:38,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:02:38,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:02:38,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:02:38,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:02:38,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:02:38,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:02:38,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:02:38,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:02:38,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:02:38,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:02:38,817 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:02:38,818 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 12:02:38,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fbefb4e/e8cace7d1f29401fbf890e96fe82da0d/FLAGb8fa32d3a [2019-09-08 12:02:39,433 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:02:39,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 12:02:39,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fbefb4e/e8cace7d1f29401fbf890e96fe82da0d/FLAGb8fa32d3a [2019-09-08 12:02:39,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fbefb4e/e8cace7d1f29401fbf890e96fe82da0d [2019-09-08 12:02:39,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:02:39,702 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:02:39,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:02:39,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:02:39,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:02:39,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:02:39" (1/1) ... [2019-09-08 12:02:39,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d42effb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:02:39, skipping insertion in model container [2019-09-08 12:02:39,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:02:39" (1/1) ... [2019-09-08 12:02:39,718 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:02:39,792 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:02:40,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:02:40,305 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:02:40,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:02:40,727 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:02:40,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:02:40 WrapperNode [2019-09-08 12:02:40,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:02:40,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:02:40,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:02:40,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:02:40,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:02:40" (1/1) ... [2019-09-08 12:02:40,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:02:40" (1/1) ... [2019-09-08 12:02:40,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:02:40" (1/1) ... [2019-09-08 12:02:40,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:02:40" (1/1) ... [2019-09-08 12:02:40,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:02:40" (1/1) ... [2019-09-08 12:02:40,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:02:40" (1/1) ... [2019-09-08 12:02:40,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:02:40" (1/1) ... [2019-09-08 12:02:40,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:02:40,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:02:40,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:02:40,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:02:40,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:02:40" (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 12:02:40,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:02:40,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:02:40,915 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:02:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:02:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:02:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:02:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:02:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:02:40,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:02:40,918 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:02:40,918 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:02:40,919 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:02:40,919 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:02:40,920 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:02:40,921 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:02:40,921 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:02:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:02:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:02:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:02:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:02:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:02:42,322 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:02:42,323 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:02:42,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:02:42 BoogieIcfgContainer [2019-09-08 12:02:42,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:02:42,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:02:42,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:02:42,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:02:42,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:02:39" (1/3) ... [2019-09-08 12:02:42,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7100fdc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:02:42, skipping insertion in model container [2019-09-08 12:02:42,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:02:40" (2/3) ... [2019-09-08 12:02:42,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7100fdc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:02:42, skipping insertion in model container [2019-09-08 12:02:42,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:02:42" (3/3) ... [2019-09-08 12:02:42,333 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 12:02:42,346 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:02:42,354 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:02:42,371 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:02:42,406 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:02:42,407 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:02:42,407 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:02:42,407 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:02:42,408 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:02:42,408 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:02:42,408 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:02:42,408 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:02:42,408 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:02:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states. [2019-09-08 12:02:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:02:42,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:42,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:42,454 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:42,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:42,461 INFO L82 PathProgramCache]: Analyzing trace with hash -764838600, now seen corresponding path program 1 times [2019-09-08 12:02:42,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:42,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:42,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:42,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:42,882 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 12:02:42,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:42,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:02:42,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:02:42,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:02:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:02:42,906 INFO L87 Difference]: Start difference. First operand 341 states. Second operand 4 states. [2019-09-08 12:02:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:43,064 INFO L93 Difference]: Finished difference Result 647 states and 1048 transitions. [2019-09-08 12:02:43,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:02:43,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-08 12:02:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:43,083 INFO L225 Difference]: With dead ends: 647 [2019-09-08 12:02:43,083 INFO L226 Difference]: Without dead ends: 337 [2019-09-08 12:02:43,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:02:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-08 12:02:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2019-09-08 12:02:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-09-08 12:02:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 517 transitions. [2019-09-08 12:02:43,172 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 517 transitions. Word has length 131 [2019-09-08 12:02:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:43,172 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 517 transitions. [2019-09-08 12:02:43,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:02:43,173 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 517 transitions. [2019-09-08 12:02:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:02:43,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:43,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:43,178 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1652103946, now seen corresponding path program 1 times [2019-09-08 12:02:43,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:43,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:43,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:43,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:43,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:43,438 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 12:02:43,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:43,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:43,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:43,442 INFO L87 Difference]: Start difference. First operand 337 states and 517 transitions. Second operand 3 states. [2019-09-08 12:02:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:43,546 INFO L93 Difference]: Finished difference Result 808 states and 1271 transitions. [2019-09-08 12:02:43,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:43,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 12:02:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:43,557 INFO L225 Difference]: With dead ends: 808 [2019-09-08 12:02:43,557 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 12:02:43,560 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 12:02:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 12:02:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2019-09-08 12:02:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-09-08 12:02:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 815 transitions. [2019-09-08 12:02:43,626 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 815 transitions. Word has length 161 [2019-09-08 12:02:43,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:43,627 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 815 transitions. [2019-09-08 12:02:43,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 815 transitions. [2019-09-08 12:02:43,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 12:02:43,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:43,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:43,631 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:43,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash 661220252, now seen corresponding path program 1 times [2019-09-08 12:02:43,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:43,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:43,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:43,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:43,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:43,804 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 12:02:43,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:43,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:43,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:43,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:43,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:43,806 INFO L87 Difference]: Start difference. First operand 525 states and 815 transitions. Second operand 3 states. [2019-09-08 12:02:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:43,893 INFO L93 Difference]: Finished difference Result 1326 states and 2094 transitions. [2019-09-08 12:02:43,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:43,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-08 12:02:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:43,902 INFO L225 Difference]: With dead ends: 1326 [2019-09-08 12:02:43,908 INFO L226 Difference]: Without dead ends: 863 [2019-09-08 12:02:43,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-08 12:02:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 861. [2019-09-08 12:02:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-09-08 12:02:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1345 transitions. [2019-09-08 12:02:43,957 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1345 transitions. Word has length 164 [2019-09-08 12:02:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:43,958 INFO L475 AbstractCegarLoop]: Abstraction has 861 states and 1345 transitions. [2019-09-08 12:02:43,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1345 transitions. [2019-09-08 12:02:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 12:02:43,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:43,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:43,963 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:43,964 INFO L82 PathProgramCache]: Analyzing trace with hash -319418727, now seen corresponding path program 1 times [2019-09-08 12:02:43,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:43,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:43,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:43,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:43,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:44,157 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 12:02:44,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:44,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:44,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:44,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:44,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:44,159 INFO L87 Difference]: Start difference. First operand 861 states and 1345 transitions. Second operand 3 states. [2019-09-08 12:02:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:44,270 INFO L93 Difference]: Finished difference Result 2244 states and 3542 transitions. [2019-09-08 12:02:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:44,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 12:02:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:44,282 INFO L225 Difference]: With dead ends: 2244 [2019-09-08 12:02:44,283 INFO L226 Difference]: Without dead ends: 1451 [2019-09-08 12:02:44,285 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 12:02:44,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-09-08 12:02:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2019-09-08 12:02:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2019-09-08 12:02:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2265 transitions. [2019-09-08 12:02:44,354 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2265 transitions. Word has length 167 [2019-09-08 12:02:44,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:44,355 INFO L475 AbstractCegarLoop]: Abstraction has 1449 states and 2265 transitions. [2019-09-08 12:02:44,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2265 transitions. [2019-09-08 12:02:44,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 12:02:44,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:44,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:44,361 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:44,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:44,361 INFO L82 PathProgramCache]: Analyzing trace with hash 853998267, now seen corresponding path program 1 times [2019-09-08 12:02:44,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:44,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:44,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:44,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:44,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:44,477 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 12:02:44,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:44,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:44,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:44,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:44,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:44,479 INFO L87 Difference]: Start difference. First operand 1449 states and 2265 transitions. Second operand 3 states. [2019-09-08 12:02:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:44,663 INFO L93 Difference]: Finished difference Result 3830 states and 6018 transitions. [2019-09-08 12:02:44,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:44,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 12:02:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:44,678 INFO L225 Difference]: With dead ends: 3830 [2019-09-08 12:02:44,678 INFO L226 Difference]: Without dead ends: 2455 [2019-09-08 12:02:44,681 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 12:02:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2019-09-08 12:02:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2453. [2019-09-08 12:02:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2453 states. [2019-09-08 12:02:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3817 transitions. [2019-09-08 12:02:44,809 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3817 transitions. Word has length 170 [2019-09-08 12:02:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:44,810 INFO L475 AbstractCegarLoop]: Abstraction has 2453 states and 3817 transitions. [2019-09-08 12:02:44,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3817 transitions. [2019-09-08 12:02:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:02:44,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:44,817 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:44,818 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:44,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:44,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1199310348, now seen corresponding path program 1 times [2019-09-08 12:02:44,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:44,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:44,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:44,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:44,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:44,913 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 12:02:44,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:44,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:44,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:44,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:44,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:44,915 INFO L87 Difference]: Start difference. First operand 2453 states and 3817 transitions. Second operand 3 states. [2019-09-08 12:02:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:45,746 INFO L93 Difference]: Finished difference Result 7171 states and 11180 transitions. [2019-09-08 12:02:45,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:45,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 12:02:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:45,779 INFO L225 Difference]: With dead ends: 7171 [2019-09-08 12:02:45,779 INFO L226 Difference]: Without dead ends: 4809 [2019-09-08 12:02:45,785 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 12:02:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2019-09-08 12:02:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4807. [2019-09-08 12:02:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4807 states. [2019-09-08 12:02:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 7431 transitions. [2019-09-08 12:02:46,129 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 7431 transitions. Word has length 173 [2019-09-08 12:02:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:46,130 INFO L475 AbstractCegarLoop]: Abstraction has 4807 states and 7431 transitions. [2019-09-08 12:02:46,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 7431 transitions. [2019-09-08 12:02:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:02:46,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:46,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:46,150 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:46,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:46,150 INFO L82 PathProgramCache]: Analyzing trace with hash -104621536, now seen corresponding path program 1 times [2019-09-08 12:02:46,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:46,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:46,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:46,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:46,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:46,283 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 12:02:46,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:46,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:46,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:46,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:46,286 INFO L87 Difference]: Start difference. First operand 4807 states and 7431 transitions. Second operand 3 states. [2019-09-08 12:02:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:47,044 INFO L93 Difference]: Finished difference Result 13256 states and 20512 transitions. [2019-09-08 12:02:47,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:47,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 12:02:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:47,095 INFO L225 Difference]: With dead ends: 13256 [2019-09-08 12:02:47,095 INFO L226 Difference]: Without dead ends: 9454 [2019-09-08 12:02:47,106 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 12:02:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9454 states. [2019-09-08 12:02:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9454 to 9452. [2019-09-08 12:02:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-09-08 12:02:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 14550 transitions. [2019-09-08 12:02:47,806 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 14550 transitions. Word has length 173 [2019-09-08 12:02:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:47,807 INFO L475 AbstractCegarLoop]: Abstraction has 9452 states and 14550 transitions. [2019-09-08 12:02:47,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 14550 transitions. [2019-09-08 12:02:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:02:47,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:47,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:47,851 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:47,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:47,852 INFO L82 PathProgramCache]: Analyzing trace with hash -721775360, now seen corresponding path program 1 times [2019-09-08 12:02:47,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:47,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:47,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:47,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:47,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:48,141 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 12:02:48,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:48,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:02:48,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:02:48,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:02:48,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:02:48,144 INFO L87 Difference]: Start difference. First operand 9452 states and 14550 transitions. Second operand 5 states. [2019-09-08 12:02:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:49,277 INFO L93 Difference]: Finished difference Result 18844 states and 29029 transitions. [2019-09-08 12:02:49,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:02:49,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-09-08 12:02:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:49,336 INFO L225 Difference]: With dead ends: 18844 [2019-09-08 12:02:49,336 INFO L226 Difference]: Without dead ends: 9452 [2019-09-08 12:02:49,353 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 12:02:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2019-09-08 12:02:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 9452. [2019-09-08 12:02:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-09-08 12:02:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 14448 transitions. [2019-09-08 12:02:49,863 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 14448 transitions. Word has length 173 [2019-09-08 12:02:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:49,864 INFO L475 AbstractCegarLoop]: Abstraction has 9452 states and 14448 transitions. [2019-09-08 12:02:49,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:02:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 14448 transitions. [2019-09-08 12:02:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:02:49,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:49,890 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:49,891 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:49,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:49,891 INFO L82 PathProgramCache]: Analyzing trace with hash -10142673, now seen corresponding path program 1 times [2019-09-08 12:02:49,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:49,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:49,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:49,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:49,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:02:50,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:50,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:02:50,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:02:50,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:02:50,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:02:50,058 INFO L87 Difference]: Start difference. First operand 9452 states and 14448 transitions. Second operand 5 states. [2019-09-08 12:02:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:50,970 INFO L93 Difference]: Finished difference Result 18820 states and 28795 transitions. [2019-09-08 12:02:50,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:02:50,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-09-08 12:02:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:50,995 INFO L225 Difference]: With dead ends: 18820 [2019-09-08 12:02:50,996 INFO L226 Difference]: Without dead ends: 9452 [2019-09-08 12:02:51,015 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 12:02:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2019-09-08 12:02:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 9452. [2019-09-08 12:02:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-09-08 12:02:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 14334 transitions. [2019-09-08 12:02:51,678 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 14334 transitions. Word has length 173 [2019-09-08 12:02:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:51,678 INFO L475 AbstractCegarLoop]: Abstraction has 9452 states and 14334 transitions. [2019-09-08 12:02:51,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:02:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 14334 transitions. [2019-09-08 12:02:51,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:02:51,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:51,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:51,703 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1755429004, now seen corresponding path program 1 times [2019-09-08 12:02:51,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:51,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:51,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:51,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:51,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:51,827 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 12:02:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:51,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:02:51,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:02:51,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:02:51,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:02:51,829 INFO L87 Difference]: Start difference. First operand 9452 states and 14334 transitions. Second operand 5 states. [2019-09-08 12:02:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:52,340 INFO L93 Difference]: Finished difference Result 13174 states and 19991 transitions. [2019-09-08 12:02:52,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:02:52,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-09-08 12:02:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:52,351 INFO L225 Difference]: With dead ends: 13174 [2019-09-08 12:02:52,353 INFO L226 Difference]: Without dead ends: 4807 [2019-09-08 12:02:52,370 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 12:02:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2019-09-08 12:02:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4807. [2019-09-08 12:02:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4807 states. [2019-09-08 12:02:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 7255 transitions. [2019-09-08 12:02:52,604 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 7255 transitions. Word has length 173 [2019-09-08 12:02:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:52,605 INFO L475 AbstractCegarLoop]: Abstraction has 4807 states and 7255 transitions. [2019-09-08 12:02:52,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:02:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 7255 transitions. [2019-09-08 12:02:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:02:52,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:52,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:52,618 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:52,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1314223281, now seen corresponding path program 1 times [2019-09-08 12:02:52,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:52,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:52,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:52,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:52,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:02:52,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:52,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:52,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:52,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:52,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:52,792 INFO L87 Difference]: Start difference. First operand 4807 states and 7255 transitions. Second operand 3 states. [2019-09-08 12:02:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:53,014 INFO L93 Difference]: Finished difference Result 7267 states and 10985 transitions. [2019-09-08 12:02:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:53,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 12:02:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:53,022 INFO L225 Difference]: With dead ends: 7267 [2019-09-08 12:02:53,022 INFO L226 Difference]: Without dead ends: 3185 [2019-09-08 12:02:53,031 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 12:02:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2019-09-08 12:02:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3183. [2019-09-08 12:02:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-09-08 12:02:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4759 transitions. [2019-09-08 12:02:53,182 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4759 transitions. Word has length 173 [2019-09-08 12:02:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:53,182 INFO L475 AbstractCegarLoop]: Abstraction has 3183 states and 4759 transitions. [2019-09-08 12:02:53,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4759 transitions. [2019-09-08 12:02:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:02:53,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:53,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:53,190 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash -598513902, now seen corresponding path program 1 times [2019-09-08 12:02:53,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:53,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:53,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:53,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:53,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:53,391 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 12:02:53,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:53,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:02:53,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:02:53,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:02:53,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:02:53,394 INFO L87 Difference]: Start difference. First operand 3183 states and 4759 transitions. Second operand 7 states. [2019-09-08 12:02:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:55,187 INFO L93 Difference]: Finished difference Result 31158 states and 46736 transitions. [2019-09-08 12:02:55,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:02:55,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2019-09-08 12:02:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:55,248 INFO L225 Difference]: With dead ends: 31158 [2019-09-08 12:02:55,248 INFO L226 Difference]: Without dead ends: 28087 [2019-09-08 12:02:55,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:02:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28087 states. [2019-09-08 12:02:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28087 to 6274. [2019-09-08 12:02:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6274 states. [2019-09-08 12:02:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6274 states to 6274 states and 9241 transitions. [2019-09-08 12:02:56,366 INFO L78 Accepts]: Start accepts. Automaton has 6274 states and 9241 transitions. Word has length 173 [2019-09-08 12:02:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:56,366 INFO L475 AbstractCegarLoop]: Abstraction has 6274 states and 9241 transitions. [2019-09-08 12:02:56,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:02:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 6274 states and 9241 transitions. [2019-09-08 12:02:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:02:56,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:56,377 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:56,377 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1330820116, now seen corresponding path program 1 times [2019-09-08 12:02:56,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:56,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:56,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:56,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:56,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:56,457 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 12:02:56,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:56,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:56,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:56,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:56,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:56,459 INFO L87 Difference]: Start difference. First operand 6274 states and 9241 transitions. Second operand 3 states. [2019-09-08 12:02:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:57,073 INFO L93 Difference]: Finished difference Result 17256 states and 25412 transitions. [2019-09-08 12:02:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:57,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 12:02:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:57,095 INFO L225 Difference]: With dead ends: 17256 [2019-09-08 12:02:57,095 INFO L226 Difference]: Without dead ends: 11069 [2019-09-08 12:02:57,107 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 12:02:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11069 states. [2019-09-08 12:02:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11069 to 11067. [2019-09-08 12:02:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11067 states. [2019-09-08 12:02:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11067 states to 11067 states and 16144 transitions. [2019-09-08 12:02:57,779 INFO L78 Accepts]: Start accepts. Automaton has 11067 states and 16144 transitions. Word has length 176 [2019-09-08 12:02:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:57,779 INFO L475 AbstractCegarLoop]: Abstraction has 11067 states and 16144 transitions. [2019-09-08 12:02:57,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11067 states and 16144 transitions. [2019-09-08 12:02:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 12:02:57,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:57,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:57,796 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:57,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:57,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1768584770, now seen corresponding path program 1 times [2019-09-08 12:02:57,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:57,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:57,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:57,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:57,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:57,909 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 12:02:57,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:57,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:57,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:57,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:57,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:57,910 INFO L87 Difference]: Start difference. First operand 11067 states and 16144 transitions. Second operand 3 states. [2019-09-08 12:02:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:58,379 INFO L93 Difference]: Finished difference Result 15935 states and 23250 transitions. [2019-09-08 12:02:58,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:58,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-08 12:02:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:58,385 INFO L225 Difference]: With dead ends: 15935 [2019-09-08 12:02:58,385 INFO L226 Difference]: Without dead ends: 5610 [2019-09-08 12:02:58,401 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 12:02:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2019-09-08 12:02:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 5608. [2019-09-08 12:02:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5608 states. [2019-09-08 12:02:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5608 states to 5608 states and 8101 transitions. [2019-09-08 12:02:58,719 INFO L78 Accepts]: Start accepts. Automaton has 5608 states and 8101 transitions. Word has length 177 [2019-09-08 12:02:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:58,720 INFO L475 AbstractCegarLoop]: Abstraction has 5608 states and 8101 transitions. [2019-09-08 12:02:58,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 5608 states and 8101 transitions. [2019-09-08 12:02:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 12:02:58,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:58,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:58,727 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:58,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1886201092, now seen corresponding path program 1 times [2019-09-08 12:02:58,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:58,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:58,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:58,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:58,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:02:58,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:58,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:58,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:58,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:58,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:58,826 INFO L87 Difference]: Start difference. First operand 5608 states and 8101 transitions. Second operand 3 states. [2019-09-08 12:02:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:59,004 INFO L93 Difference]: Finished difference Result 7764 states and 11255 transitions. [2019-09-08 12:02:59,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:59,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-08 12:02:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:59,007 INFO L225 Difference]: With dead ends: 7764 [2019-09-08 12:02:59,007 INFO L226 Difference]: Without dead ends: 2922 [2019-09-08 12:02:59,013 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 12:02:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2019-09-08 12:02:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2920. [2019-09-08 12:02:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2019-09-08 12:02:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4173 transitions. [2019-09-08 12:02:59,145 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4173 transitions. Word has length 179 [2019-09-08 12:02:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:59,145 INFO L475 AbstractCegarLoop]: Abstraction has 2920 states and 4173 transitions. [2019-09-08 12:02:59,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4173 transitions. [2019-09-08 12:02:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 12:02:59,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:59,147 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:59,148 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:59,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash 171118654, now seen corresponding path program 1 times [2019-09-08 12:02:59,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:59,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:59,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:59,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:59,347 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 12:02:59,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:59,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:02:59,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:02:59,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:02:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:02:59,351 INFO L87 Difference]: Start difference. First operand 2920 states and 4173 transitions. Second operand 7 states. [2019-09-08 12:03:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:00,532 INFO L93 Difference]: Finished difference Result 16226 states and 23225 transitions. [2019-09-08 12:03:00,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:03:00,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 179 [2019-09-08 12:03:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:00,546 INFO L225 Difference]: With dead ends: 16226 [2019-09-08 12:03:00,546 INFO L226 Difference]: Without dead ends: 14020 [2019-09-08 12:03:00,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:03:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14020 states. [2019-09-08 12:03:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14020 to 5544. [2019-09-08 12:03:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5544 states. [2019-09-08 12:03:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7899 transitions. [2019-09-08 12:03:01,052 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7899 transitions. Word has length 179 [2019-09-08 12:03:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:01,052 INFO L475 AbstractCegarLoop]: Abstraction has 5544 states and 7899 transitions. [2019-09-08 12:03:01,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:03:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7899 transitions. [2019-09-08 12:03:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 12:03:01,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:01,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:01,058 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:01,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:01,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1285098454, now seen corresponding path program 1 times [2019-09-08 12:03:01,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:01,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:01,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:01,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:01,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:01,159 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 12:03:01,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:01,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:03:01,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:03:01,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:03:01,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:03:01,161 INFO L87 Difference]: Start difference. First operand 5544 states and 7899 transitions. Second operand 3 states. [2019-09-08 12:03:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:01,464 INFO L93 Difference]: Finished difference Result 7892 states and 11269 transitions. [2019-09-08 12:03:01,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:03:01,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-08 12:03:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:01,469 INFO L225 Difference]: With dead ends: 7892 [2019-09-08 12:03:01,469 INFO L226 Difference]: Without dead ends: 2848 [2019-09-08 12:03:01,475 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 12:03:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2019-09-08 12:03:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2846. [2019-09-08 12:03:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2846 states. [2019-09-08 12:03:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 4009 transitions. [2019-09-08 12:03:01,673 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 4009 transitions. Word has length 179 [2019-09-08 12:03:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:01,674 INFO L475 AbstractCegarLoop]: Abstraction has 2846 states and 4009 transitions. [2019-09-08 12:03:01,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:03:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 4009 transitions. [2019-09-08 12:03:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 12:03:01,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:01,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:01,676 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:01,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:01,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1112207406, now seen corresponding path program 1 times [2019-09-08 12:03:01,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:01,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:01,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:01,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:01,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:02,037 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 12:03:02,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:02,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:03:02,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:03:02,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:03:02,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:03:02,039 INFO L87 Difference]: Start difference. First operand 2846 states and 4009 transitions. Second operand 7 states. [2019-09-08 12:03:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:02,644 INFO L93 Difference]: Finished difference Result 6896 states and 9754 transitions. [2019-09-08 12:03:02,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:03:02,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 179 [2019-09-08 12:03:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:02,651 INFO L225 Difference]: With dead ends: 6896 [2019-09-08 12:03:02,651 INFO L226 Difference]: Without dead ends: 4156 [2019-09-08 12:03:02,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:03:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2019-09-08 12:03:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 3474. [2019-09-08 12:03:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3474 states. [2019-09-08 12:03:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 4859 transitions. [2019-09-08 12:03:03,068 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 4859 transitions. Word has length 179 [2019-09-08 12:03:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:03,068 INFO L475 AbstractCegarLoop]: Abstraction has 3474 states and 4859 transitions. [2019-09-08 12:03:03,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:03:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 4859 transitions. [2019-09-08 12:03:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 12:03:03,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:03,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:03,072 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1738197105, now seen corresponding path program 1 times [2019-09-08 12:03:03,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:03,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:03,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:03,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:03,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:03,200 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 12:03:03,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:03,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:03:03,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:03:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:03:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:03:03,203 INFO L87 Difference]: Start difference. First operand 3474 states and 4859 transitions. Second operand 3 states. [2019-09-08 12:03:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:03,643 INFO L93 Difference]: Finished difference Result 6844 states and 9600 transitions. [2019-09-08 12:03:03,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:03:03,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-08 12:03:03,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:03,649 INFO L225 Difference]: With dead ends: 6844 [2019-09-08 12:03:03,649 INFO L226 Difference]: Without dead ends: 3472 [2019-09-08 12:03:03,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 12:03:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2019-09-08 12:03:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3472. [2019-09-08 12:03:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3472 states. [2019-09-08 12:03:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4851 transitions. [2019-09-08 12:03:03,929 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4851 transitions. Word has length 179 [2019-09-08 12:03:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:03,929 INFO L475 AbstractCegarLoop]: Abstraction has 3472 states and 4851 transitions. [2019-09-08 12:03:03,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:03:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4851 transitions. [2019-09-08 12:03:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:03:03,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:03,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:03,933 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1571063900, now seen corresponding path program 1 times [2019-09-08 12:03:03,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:03,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:03,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:03,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:03,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:03:04,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:04,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:03:04,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:03:04,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:03:04,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:03:04,056 INFO L87 Difference]: Start difference. First operand 3472 states and 4851 transitions. Second operand 5 states. [2019-09-08 12:03:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:04,689 INFO L93 Difference]: Finished difference Result 7206 states and 10165 transitions. [2019-09-08 12:03:04,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:03:04,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 12:03:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:04,694 INFO L225 Difference]: With dead ends: 7206 [2019-09-08 12:03:04,694 INFO L226 Difference]: Without dead ends: 6102 [2019-09-08 12:03:04,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:03:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2019-09-08 12:03:05,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 6096. [2019-09-08 12:03:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6096 states. [2019-09-08 12:03:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6096 states to 6096 states and 8565 transitions. [2019-09-08 12:03:05,223 INFO L78 Accepts]: Start accepts. Automaton has 6096 states and 8565 transitions. Word has length 180 [2019-09-08 12:03:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:05,224 INFO L475 AbstractCegarLoop]: Abstraction has 6096 states and 8565 transitions. [2019-09-08 12:03:05,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:03:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 6096 states and 8565 transitions. [2019-09-08 12:03:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:03:05,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:05,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:05,228 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1164628298, now seen corresponding path program 1 times [2019-09-08 12:03:05,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:05,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:05,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:05,339 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 12:03:05,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:05,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:03:05,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:03:05,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:03:05,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:03:05,341 INFO L87 Difference]: Start difference. First operand 6096 states and 8565 transitions. Second operand 5 states. [2019-09-08 12:03:06,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:06,087 INFO L93 Difference]: Finished difference Result 10513 states and 14875 transitions. [2019-09-08 12:03:06,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:03:06,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 12:03:06,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:06,094 INFO L225 Difference]: With dead ends: 10513 [2019-09-08 12:03:06,095 INFO L226 Difference]: Without dead ends: 8058 [2019-09-08 12:03:06,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:03:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8058 states. [2019-09-08 12:03:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8058 to 7095. [2019-09-08 12:03:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7095 states. [2019-09-08 12:03:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7095 states to 7095 states and 9994 transitions. [2019-09-08 12:03:06,584 INFO L78 Accepts]: Start accepts. Automaton has 7095 states and 9994 transitions. Word has length 180 [2019-09-08 12:03:06,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:06,584 INFO L475 AbstractCegarLoop]: Abstraction has 7095 states and 9994 transitions. [2019-09-08 12:03:06,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:03:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 7095 states and 9994 transitions. [2019-09-08 12:03:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:03:06,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:06,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:06,589 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:06,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:06,589 INFO L82 PathProgramCache]: Analyzing trace with hash -330356176, now seen corresponding path program 1 times [2019-09-08 12:03:06,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:06,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:06,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:06,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:06,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:06,854 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 12:03:06,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:06,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:03:06,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:03:06,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:03:06,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:03:06,856 INFO L87 Difference]: Start difference. First operand 7095 states and 9994 transitions. Second operand 7 states. [2019-09-08 12:03:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:08,004 INFO L93 Difference]: Finished difference Result 15991 states and 22678 transitions. [2019-09-08 12:03:08,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:03:08,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-08 12:03:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:08,018 INFO L225 Difference]: With dead ends: 15991 [2019-09-08 12:03:08,018 INFO L226 Difference]: Without dead ends: 12761 [2019-09-08 12:03:08,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:03:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12761 states. [2019-09-08 12:03:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12761 to 8389. [2019-09-08 12:03:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8389 states. [2019-09-08 12:03:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8389 states to 8389 states and 11814 transitions. [2019-09-08 12:03:08,741 INFO L78 Accepts]: Start accepts. Automaton has 8389 states and 11814 transitions. Word has length 180 [2019-09-08 12:03:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:08,741 INFO L475 AbstractCegarLoop]: Abstraction has 8389 states and 11814 transitions. [2019-09-08 12:03:08,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:03:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 8389 states and 11814 transitions. [2019-09-08 12:03:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:03:08,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:03:08,750 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:08,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:08,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1319768790, now seen corresponding path program 1 times [2019-09-08 12:03:08,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:08,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:08,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:08,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:08,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:08,929 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 12:03:08,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:08,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:03:08,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:03:08,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:03:08,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:03:08,931 INFO L87 Difference]: Start difference. First operand 8389 states and 11814 transitions. Second operand 5 states. [2019-09-08 12:03:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:09,939 INFO L93 Difference]: Finished difference Result 13649 states and 19311 transitions. [2019-09-08 12:03:09,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:03:09,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 12:03:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:09,948 INFO L225 Difference]: With dead ends: 13649 [2019-09-08 12:03:09,949 INFO L226 Difference]: Without dead ends: 10419 [2019-09-08 12:03:09,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:03:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10419 states. [2019-09-08 12:03:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10419 to 9461. [2019-09-08 12:03:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9461 states. [2019-09-08 12:03:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9461 states to 9461 states and 13344 transitions. [2019-09-08 12:03:10,655 INFO L78 Accepts]: Start accepts. Automaton has 9461 states and 13344 transitions. Word has length 180 [2019-09-08 12:03:10,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:10,655 INFO L475 AbstractCegarLoop]: Abstraction has 9461 states and 13344 transitions. [2019-09-08 12:03:10,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:03:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 9461 states and 13344 transitions. [2019-09-08 12:03:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 12:03:10,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:10,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:10,725 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1141039796, now seen corresponding path program 1 times [2019-09-08 12:03:10,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:10,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:10,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:10,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:11,073 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 12:03:11,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:11,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:03:11,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:03:11,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:03:11,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:03:11,075 INFO L87 Difference]: Start difference. First operand 9461 states and 13344 transitions. Second operand 10 states. [2019-09-08 12:03:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:17,136 INFO L93 Difference]: Finished difference Result 50038 states and 70803 transitions. [2019-09-08 12:03:17,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:03:17,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 182 [2019-09-08 12:03:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:17,175 INFO L225 Difference]: With dead ends: 50038 [2019-09-08 12:03:17,175 INFO L226 Difference]: Without dead ends: 44234 [2019-09-08 12:03:17,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:03:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44234 states. [2019-09-08 12:03:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44234 to 12408. [2019-09-08 12:03:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12408 states. [2019-09-08 12:03:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12408 states to 12408 states and 17387 transitions. [2019-09-08 12:03:18,483 INFO L78 Accepts]: Start accepts. Automaton has 12408 states and 17387 transitions. Word has length 182 [2019-09-08 12:03:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:18,483 INFO L475 AbstractCegarLoop]: Abstraction has 12408 states and 17387 transitions. [2019-09-08 12:03:18,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:03:18,484 INFO L276 IsEmpty]: Start isEmpty. Operand 12408 states and 17387 transitions. [2019-09-08 12:03:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 12:03:18,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:18,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:18,497 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1985534446, now seen corresponding path program 1 times [2019-09-08 12:03:18,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:18,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:18,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:18,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:18,763 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 12:03:18,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:18,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:03:18,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:03:18,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:03:18,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:03:18,765 INFO L87 Difference]: Start difference. First operand 12408 states and 17387 transitions. Second operand 10 states. [2019-09-08 12:03:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:26,795 INFO L93 Difference]: Finished difference Result 71732 states and 100565 transitions. [2019-09-08 12:03:26,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:03:26,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2019-09-08 12:03:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:26,852 INFO L225 Difference]: With dead ends: 71732 [2019-09-08 12:03:26,852 INFO L226 Difference]: Without dead ends: 60120 [2019-09-08 12:03:26,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:03:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60120 states. [2019-09-08 12:03:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60120 to 12544. [2019-09-08 12:03:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12544 states. [2019-09-08 12:03:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12544 states to 12544 states and 17549 transitions. [2019-09-08 12:03:28,458 INFO L78 Accepts]: Start accepts. Automaton has 12544 states and 17549 transitions. Word has length 183 [2019-09-08 12:03:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:28,458 INFO L475 AbstractCegarLoop]: Abstraction has 12544 states and 17549 transitions. [2019-09-08 12:03:28,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:03:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 12544 states and 17549 transitions. [2019-09-08 12:03:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 12:03:28,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:28,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:28,471 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:28,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:28,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1830393954, now seen corresponding path program 1 times [2019-09-08 12:03:28,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:28,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:28,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:28,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:28,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:29,300 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 12:03:29,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:29,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:03:29,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:03:29,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:03:29,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:03:29,302 INFO L87 Difference]: Start difference. First operand 12544 states and 17549 transitions. Second operand 10 states. [2019-09-08 12:03:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:37,265 INFO L93 Difference]: Finished difference Result 63000 states and 88793 transitions. [2019-09-08 12:03:37,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:03:37,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2019-09-08 12:03:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:37,319 INFO L225 Difference]: With dead ends: 63000 [2019-09-08 12:03:37,319 INFO L226 Difference]: Without dead ends: 58096 [2019-09-08 12:03:37,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:03:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58096 states. [2019-09-08 12:03:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58096 to 16848. [2019-09-08 12:03:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16848 states. [2019-09-08 12:03:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16848 states to 16848 states and 23379 transitions. [2019-09-08 12:03:39,561 INFO L78 Accepts]: Start accepts. Automaton has 16848 states and 23379 transitions. Word has length 183 [2019-09-08 12:03:39,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:39,561 INFO L475 AbstractCegarLoop]: Abstraction has 16848 states and 23379 transitions. [2019-09-08 12:03:39,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:03:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 16848 states and 23379 transitions. [2019-09-08 12:03:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 12:03:39,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:39,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:39,573 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:39,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:39,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1227634115, now seen corresponding path program 1 times [2019-09-08 12:03:39,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:39,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:39,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:39,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:39,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:39,671 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 12:03:39,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:39,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:03:39,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:03:39,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:03:39,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:03:39,672 INFO L87 Difference]: Start difference. First operand 16848 states and 23379 transitions. Second operand 3 states. [2019-09-08 12:03:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:40,757 INFO L93 Difference]: Finished difference Result 22803 states and 31954 transitions. [2019-09-08 12:03:40,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:03:40,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-08 12:03:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:40,768 INFO L225 Difference]: With dead ends: 22803 [2019-09-08 12:03:40,768 INFO L226 Difference]: Without dead ends: 9695 [2019-09-08 12:03:40,780 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 12:03:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9695 states. [2019-09-08 12:03:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9695 to 9693. [2019-09-08 12:03:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9693 states. [2019-09-08 12:03:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9693 states to 9693 states and 13322 transitions. [2019-09-08 12:03:41,805 INFO L78 Accepts]: Start accepts. Automaton has 9693 states and 13322 transitions. Word has length 183 [2019-09-08 12:03:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:41,806 INFO L475 AbstractCegarLoop]: Abstraction has 9693 states and 13322 transitions. [2019-09-08 12:03:41,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:03:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 9693 states and 13322 transitions. [2019-09-08 12:03:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 12:03:41,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:41,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:41,815 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:41,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:41,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1647242104, now seen corresponding path program 1 times [2019-09-08 12:03:41,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:41,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:41,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:41,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:41,892 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 12:03:41,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:41,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:03:41,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:03:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:03:41,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:03:41,894 INFO L87 Difference]: Start difference. First operand 9693 states and 13322 transitions. Second operand 3 states. [2019-09-08 12:03:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:43,211 INFO L93 Difference]: Finished difference Result 18912 states and 26036 transitions. [2019-09-08 12:03:43,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:03:43,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-08 12:03:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:43,219 INFO L225 Difference]: With dead ends: 18912 [2019-09-08 12:03:43,219 INFO L226 Difference]: Without dead ends: 9319 [2019-09-08 12:03:43,227 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 12:03:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9319 states. [2019-09-08 12:03:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9319 to 9319. [2019-09-08 12:03:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9319 states. [2019-09-08 12:03:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9319 states to 9319 states and 12700 transitions. [2019-09-08 12:03:44,221 INFO L78 Accepts]: Start accepts. Automaton has 9319 states and 12700 transitions. Word has length 184 [2019-09-08 12:03:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:44,221 INFO L475 AbstractCegarLoop]: Abstraction has 9319 states and 12700 transitions. [2019-09-08 12:03:44,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:03:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 9319 states and 12700 transitions. [2019-09-08 12:03:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 12:03:44,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:03:44,228 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:44,228 INFO L82 PathProgramCache]: Analyzing trace with hash -579554163, now seen corresponding path program 1 times [2019-09-08 12:03:44,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:44,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:44,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:44,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:44,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:44,480 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 12:03:44,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:44,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:03:44,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:03:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:03:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:03:44,482 INFO L87 Difference]: Start difference. First operand 9319 states and 12700 transitions. Second operand 10 states. [2019-09-08 12:03:47,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:47,028 INFO L93 Difference]: Finished difference Result 20109 states and 27476 transitions. [2019-09-08 12:03:47,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:03:47,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2019-09-08 12:03:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:47,040 INFO L225 Difference]: With dead ends: 20109 [2019-09-08 12:03:47,040 INFO L226 Difference]: Without dead ends: 12054 [2019-09-08 12:03:47,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:03:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12054 states. [2019-09-08 12:03:48,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12054 to 9319. [2019-09-08 12:03:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9319 states. [2019-09-08 12:03:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9319 states to 9319 states and 12656 transitions. [2019-09-08 12:03:48,146 INFO L78 Accepts]: Start accepts. Automaton has 9319 states and 12656 transitions. Word has length 184 [2019-09-08 12:03:48,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:48,146 INFO L475 AbstractCegarLoop]: Abstraction has 9319 states and 12656 transitions. [2019-09-08 12:03:48,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:03:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 9319 states and 12656 transitions. [2019-09-08 12:03:48,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 12:03:48,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:48,153 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:48,153 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:48,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:48,153 INFO L82 PathProgramCache]: Analyzing trace with hash -164695771, now seen corresponding path program 1 times [2019-09-08 12:03:48,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:48,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:48,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:48,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:48,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:48,405 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 12:03:48,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:48,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:03:48,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:03:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:03:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:03:48,407 INFO L87 Difference]: Start difference. First operand 9319 states and 12656 transitions. Second operand 10 states. [2019-09-08 12:03:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:56,147 INFO L93 Difference]: Finished difference Result 57339 states and 77906 transitions. [2019-09-08 12:03:56,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:03:56,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2019-09-08 12:03:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:56,191 INFO L225 Difference]: With dead ends: 57339 [2019-09-08 12:03:56,191 INFO L226 Difference]: Without dead ends: 49306 [2019-09-08 12:03:56,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:03:56,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49306 states. [2019-09-08 12:03:58,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49306 to 9367. [2019-09-08 12:03:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9367 states. [2019-09-08 12:03:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9367 states to 9367 states and 12704 transitions. [2019-09-08 12:03:58,479 INFO L78 Accepts]: Start accepts. Automaton has 9367 states and 12704 transitions. Word has length 184 [2019-09-08 12:03:58,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:58,479 INFO L475 AbstractCegarLoop]: Abstraction has 9367 states and 12704 transitions. [2019-09-08 12:03:58,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:03:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 9367 states and 12704 transitions. [2019-09-08 12:03:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 12:03:58,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:58,485 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:58,486 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:58,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:58,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1951322507, now seen corresponding path program 1 times [2019-09-08 12:03:58,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:58,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:58,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:58,537 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 12:03:58,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:58,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:03:58,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:03:58,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:03:58,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:03:58,538 INFO L87 Difference]: Start difference. First operand 9367 states and 12704 transitions. Second operand 3 states. [2019-09-08 12:03:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:59,766 INFO L93 Difference]: Finished difference Result 17644 states and 24026 transitions. [2019-09-08 12:03:59,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:03:59,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-08 12:03:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:59,773 INFO L225 Difference]: With dead ends: 17644 [2019-09-08 12:03:59,774 INFO L226 Difference]: Without dead ends: 8489 [2019-09-08 12:03:59,781 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 12:03:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8489 states. [2019-09-08 12:04:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8489 to 8489. [2019-09-08 12:04:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8489 states. [2019-09-08 12:04:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8489 states to 8489 states and 11450 transitions. [2019-09-08 12:04:00,874 INFO L78 Accepts]: Start accepts. Automaton has 8489 states and 11450 transitions. Word has length 185 [2019-09-08 12:04:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:00,875 INFO L475 AbstractCegarLoop]: Abstraction has 8489 states and 11450 transitions. [2019-09-08 12:04:00,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:04:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 8489 states and 11450 transitions. [2019-09-08 12:04:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 12:04:00,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:00,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:00,881 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:00,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:00,881 INFO L82 PathProgramCache]: Analyzing trace with hash 669495538, now seen corresponding path program 1 times [2019-09-08 12:04:00,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:00,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:00,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:00,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:00,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:01,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 12:04:01,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:01,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:04:01,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:04:01,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:04:01,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:04:01,015 INFO L87 Difference]: Start difference. First operand 8489 states and 11450 transitions. Second operand 4 states. [2019-09-08 12:04:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:03,337 INFO L93 Difference]: Finished difference Result 19129 states and 25982 transitions. [2019-09-08 12:04:03,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:03,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-09-08 12:04:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:03,351 INFO L225 Difference]: With dead ends: 19129 [2019-09-08 12:04:03,351 INFO L226 Difference]: Without dead ends: 14826 [2019-09-08 12:04:03,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14826 states. [2019-09-08 12:04:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14826 to 8489. [2019-09-08 12:04:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8489 states. [2019-09-08 12:04:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8489 states to 8489 states and 11450 transitions. [2019-09-08 12:04:04,642 INFO L78 Accepts]: Start accepts. Automaton has 8489 states and 11450 transitions. Word has length 185 [2019-09-08 12:04:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:04,642 INFO L475 AbstractCegarLoop]: Abstraction has 8489 states and 11450 transitions. [2019-09-08 12:04:04,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:04:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 8489 states and 11450 transitions. [2019-09-08 12:04:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 12:04:04,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:04,648 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:04,648 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:04,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:04,648 INFO L82 PathProgramCache]: Analyzing trace with hash 747316050, now seen corresponding path program 1 times [2019-09-08 12:04:04,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:04,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:04,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:04,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:04,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:05,019 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 12:04:05,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:05,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:04:05,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:04:05,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:04:05,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:04:05,024 INFO L87 Difference]: Start difference. First operand 8489 states and 11450 transitions. Second operand 12 states. [2019-09-08 12:04:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:09,156 INFO L93 Difference]: Finished difference Result 17420 states and 23946 transitions. [2019-09-08 12:04:09,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:09,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 185 [2019-09-08 12:04:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:09,167 INFO L225 Difference]: With dead ends: 17420 [2019-09-08 12:04:09,168 INFO L226 Difference]: Without dead ends: 14487 [2019-09-08 12:04:09,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:04:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14487 states. [2019-09-08 12:04:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14487 to 6423. [2019-09-08 12:04:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6423 states. [2019-09-08 12:04:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6423 states to 6423 states and 8716 transitions. [2019-09-08 12:04:10,268 INFO L78 Accepts]: Start accepts. Automaton has 6423 states and 8716 transitions. Word has length 185 [2019-09-08 12:04:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:10,268 INFO L475 AbstractCegarLoop]: Abstraction has 6423 states and 8716 transitions. [2019-09-08 12:04:10,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:04:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 6423 states and 8716 transitions. [2019-09-08 12:04:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 12:04:10,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:10,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:10,273 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:10,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:10,273 INFO L82 PathProgramCache]: Analyzing trace with hash -616507731, now seen corresponding path program 1 times [2019-09-08 12:04:10,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:10,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:10,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:10,717 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 12:04:10,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:10,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:04:10,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:04:10,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:04:10,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:04:10,719 INFO L87 Difference]: Start difference. First operand 6423 states and 8716 transitions. Second operand 16 states. [2019-09-08 12:04:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:20,526 INFO L93 Difference]: Finished difference Result 30117 states and 41232 transitions. [2019-09-08 12:04:20,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 12:04:20,526 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 185 [2019-09-08 12:04:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:20,548 INFO L225 Difference]: With dead ends: 30117 [2019-09-08 12:04:20,549 INFO L226 Difference]: Without dead ends: 27257 [2019-09-08 12:04:20,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=765, Invalid=2427, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 12:04:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27257 states. [2019-09-08 12:04:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27257 to 7158. [2019-09-08 12:04:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7158 states. [2019-09-08 12:04:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 9648 transitions. [2019-09-08 12:04:22,022 INFO L78 Accepts]: Start accepts. Automaton has 7158 states and 9648 transitions. Word has length 185 [2019-09-08 12:04:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:22,022 INFO L475 AbstractCegarLoop]: Abstraction has 7158 states and 9648 transitions. [2019-09-08 12:04:22,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:04:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 7158 states and 9648 transitions. [2019-09-08 12:04:22,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 12:04:22,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:22,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:22,027 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:22,027 INFO L82 PathProgramCache]: Analyzing trace with hash 590784259, now seen corresponding path program 1 times [2019-09-08 12:04:22,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:22,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:22,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:22,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:22,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:22,508 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 12:04:22,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:22,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:04:22,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:04:22,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:04:22,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:04:22,509 INFO L87 Difference]: Start difference. First operand 7158 states and 9648 transitions. Second operand 16 states. [2019-09-08 12:04:33,211 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-08 12:04:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:35,407 INFO L93 Difference]: Finished difference Result 37903 states and 51608 transitions. [2019-09-08 12:04:35,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 12:04:35,408 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 185 [2019-09-08 12:04:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:35,437 INFO L225 Difference]: With dead ends: 37903 [2019-09-08 12:04:35,438 INFO L226 Difference]: Without dead ends: 33503 [2019-09-08 12:04:35,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1056, Invalid=3636, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 12:04:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33503 states. [2019-09-08 12:04:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33503 to 14193. [2019-09-08 12:04:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14193 states. [2019-09-08 12:04:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14193 states to 14193 states and 18966 transitions. [2019-09-08 12:04:38,751 INFO L78 Accepts]: Start accepts. Automaton has 14193 states and 18966 transitions. Word has length 185 [2019-09-08 12:04:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:38,751 INFO L475 AbstractCegarLoop]: Abstraction has 14193 states and 18966 transitions. [2019-09-08 12:04:38,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:04:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14193 states and 18966 transitions. [2019-09-08 12:04:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 12:04:38,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:38,760 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:38,760 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:38,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1671788559, now seen corresponding path program 1 times [2019-09-08 12:04:38,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:38,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:38,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:38,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04: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 12:04:39,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:39,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:04:39,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:04:39,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:04:39,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:04:39,109 INFO L87 Difference]: Start difference. First operand 14193 states and 18966 transitions. Second operand 14 states. [2019-09-08 12:04:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:53,166 INFO L93 Difference]: Finished difference Result 56484 states and 76064 transitions. [2019-09-08 12:04:53,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 12:04:53,167 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 185 [2019-09-08 12:04:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:53,203 INFO L225 Difference]: With dead ends: 56484 [2019-09-08 12:04:53,204 INFO L226 Difference]: Without dead ends: 42355 [2019-09-08 12:04:53,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:04:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42355 states. [2019-09-08 12:04:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42355 to 15882. [2019-09-08 12:04:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15882 states. [2019-09-08 12:04:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15882 states to 15882 states and 21141 transitions. [2019-09-08 12:04:56,975 INFO L78 Accepts]: Start accepts. Automaton has 15882 states and 21141 transitions. Word has length 185 [2019-09-08 12:04:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:56,976 INFO L475 AbstractCegarLoop]: Abstraction has 15882 states and 21141 transitions. [2019-09-08 12:04:56,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:04:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 15882 states and 21141 transitions. [2019-09-08 12:04:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 12:04:56,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:56,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:56,986 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:56,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2115179440, now seen corresponding path program 1 times [2019-09-08 12:04:56,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:56,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:56,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:56,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:56,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:57,471 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 12:04:57,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:57,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:04:57,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:04:57,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:04:57,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:04:57,473 INFO L87 Difference]: Start difference. First operand 15882 states and 21141 transitions. Second operand 16 states. [2019-09-08 12:05:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:12,408 INFO L93 Difference]: Finished difference Result 46382 states and 63014 transitions. [2019-09-08 12:05:12,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 12:05:12,409 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 185 [2019-09-08 12:05:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:12,443 INFO L225 Difference]: With dead ends: 46382 [2019-09-08 12:05:12,444 INFO L226 Difference]: Without dead ends: 41442 [2019-09-08 12:05:12,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=700, Invalid=2270, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 12:05:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41442 states. [2019-09-08 12:05:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41442 to 14563. [2019-09-08 12:05:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14563 states. [2019-09-08 12:05:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14563 states to 14563 states and 19494 transitions. [2019-09-08 12:05:16,303 INFO L78 Accepts]: Start accepts. Automaton has 14563 states and 19494 transitions. Word has length 185 [2019-09-08 12:05:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:16,304 INFO L475 AbstractCegarLoop]: Abstraction has 14563 states and 19494 transitions. [2019-09-08 12:05:16,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:05:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 14563 states and 19494 transitions. [2019-09-08 12:05:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 12:05:16,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:16,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:16,314 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:16,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:16,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1473143763, now seen corresponding path program 1 times [2019-09-08 12:05:16,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:16,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:16,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:16,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:16,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:16,660 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 12:05:16,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:16,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:05:16,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:05:16,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:05:16,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:05:16,662 INFO L87 Difference]: Start difference. First operand 14563 states and 19494 transitions. Second operand 12 states. [2019-09-08 12:05:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:31,559 INFO L93 Difference]: Finished difference Result 48633 states and 66114 transitions. [2019-09-08 12:05:31,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:05:31,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 186 [2019-09-08 12:05:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:31,595 INFO L225 Difference]: With dead ends: 48633 [2019-09-08 12:05:31,595 INFO L226 Difference]: Without dead ends: 42097 [2019-09-08 12:05:31,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:05:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42097 states. [2019-09-08 12:05:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42097 to 16349. [2019-09-08 12:05:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16349 states. [2019-09-08 12:05:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16349 states to 16349 states and 21745 transitions. [2019-09-08 12:05:36,104 INFO L78 Accepts]: Start accepts. Automaton has 16349 states and 21745 transitions. Word has length 186 [2019-09-08 12:05:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:36,104 INFO L475 AbstractCegarLoop]: Abstraction has 16349 states and 21745 transitions. [2019-09-08 12:05:36,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:05:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 16349 states and 21745 transitions. [2019-09-08 12:05:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 12:05:36,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:36,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:36,116 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:36,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1201932429, now seen corresponding path program 1 times [2019-09-08 12:05:36,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:36,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:36,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:36,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:36,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:36,506 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 12:05:36,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:36,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:05:36,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:05:36,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:05:36,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:05:36,509 INFO L87 Difference]: Start difference. First operand 16349 states and 21745 transitions. Second operand 13 states. [2019-09-08 12:05:38,599 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-08 12:05:39,631 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 12:05:42,436 WARN L188 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 12:05:48,705 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-08 12:05:53,590 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-08 12:05:54,501 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:06:02,140 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 12:06:02,377 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:06:10,985 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 12:06:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:21,941 INFO L93 Difference]: Finished difference Result 83428 states and 112348 transitions. [2019-09-08 12:06:21,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 12:06:21,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-09-08 12:06:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:22,008 INFO L225 Difference]: With dead ends: 83428 [2019-09-08 12:06:22,008 INFO L226 Difference]: Without dead ends: 77484 [2019-09-08 12:06:22,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=950, Invalid=3606, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 12:06:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77484 states. [2019-09-08 12:06:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77484 to 16985. [2019-09-08 12:06:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16985 states. [2019-09-08 12:06:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16985 states to 16985 states and 22545 transitions. [2019-09-08 12:06:27,355 INFO L78 Accepts]: Start accepts. Automaton has 16985 states and 22545 transitions. Word has length 186 [2019-09-08 12:06:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:27,355 INFO L475 AbstractCegarLoop]: Abstraction has 16985 states and 22545 transitions. [2019-09-08 12:06:27,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:06:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 16985 states and 22545 transitions. [2019-09-08 12:06:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 12:06:27,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:27,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:27,367 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash 733863012, now seen corresponding path program 1 times [2019-09-08 12:06:27,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:27,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:27,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:27,576 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 12:06:27,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:27,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:06:27,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:06:27,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:06:27,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:06:27,577 INFO L87 Difference]: Start difference. First operand 16985 states and 22545 transitions. Second operand 10 states. [2019-09-08 12:06:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:51,730 INFO L93 Difference]: Finished difference Result 79952 states and 107295 transitions. [2019-09-08 12:06:51,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:06:51,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2019-09-08 12:06:51,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:51,796 INFO L225 Difference]: With dead ends: 79952 [2019-09-08 12:06:51,796 INFO L226 Difference]: Without dead ends: 70466 [2019-09-08 12:06:51,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:06:51,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70466 states. [2019-09-08 12:06:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70466 to 17179. [2019-09-08 12:06:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17179 states. [2019-09-08 12:06:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17179 states to 17179 states and 22773 transitions. [2019-09-08 12:06:57,318 INFO L78 Accepts]: Start accepts. Automaton has 17179 states and 22773 transitions. Word has length 186 [2019-09-08 12:06:57,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:57,319 INFO L475 AbstractCegarLoop]: Abstraction has 17179 states and 22773 transitions. [2019-09-08 12:06:57,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:06:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17179 states and 22773 transitions. [2019-09-08 12:06:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 12:06:57,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:57,330 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:57,330 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash 225863715, now seen corresponding path program 1 times [2019-09-08 12:06:57,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:57,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:57,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:57,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:57,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:57,771 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 12:06:57,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:57,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:06:57,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:06:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:06:57,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:06:57,773 INFO L87 Difference]: Start difference. First operand 17179 states and 22773 transitions. Second operand 12 states. [2019-09-08 12:07:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:16,073 INFO L93 Difference]: Finished difference Result 52109 states and 70596 transitions. [2019-09-08 12:07:16,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:07:16,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 186 [2019-09-08 12:07:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:16,115 INFO L225 Difference]: With dead ends: 52109 [2019-09-08 12:07:16,115 INFO L226 Difference]: Without dead ends: 46502 [2019-09-08 12:07:16,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:07:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46502 states. [2019-09-08 12:07:21,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46502 to 15910. [2019-09-08 12:07:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15910 states. [2019-09-08 12:07:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15910 states to 15910 states and 21007 transitions. [2019-09-08 12:07:21,597 INFO L78 Accepts]: Start accepts. Automaton has 15910 states and 21007 transitions. Word has length 186 [2019-09-08 12:07:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:21,597 INFO L475 AbstractCegarLoop]: Abstraction has 15910 states and 21007 transitions. [2019-09-08 12:07:21,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:07:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 15910 states and 21007 transitions. [2019-09-08 12:07:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 12:07:21,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:21,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:21,608 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:21,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:21,608 INFO L82 PathProgramCache]: Analyzing trace with hash -341138689, now seen corresponding path program 1 times [2019-09-08 12:07:21,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:21,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:21,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:21,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:21,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:21,811 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 12:07:21,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:21,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:07:21,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:07:21,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:07:21,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:07:21,812 INFO L87 Difference]: Start difference. First operand 15910 states and 21007 transitions. Second operand 10 states. [2019-09-08 12:07:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:46,363 INFO L93 Difference]: Finished difference Result 75229 states and 101053 transitions. [2019-09-08 12:07:46,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:07:46,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2019-09-08 12:07:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:46,421 INFO L225 Difference]: With dead ends: 75229 [2019-09-08 12:07:46,421 INFO L226 Difference]: Without dead ends: 60240 [2019-09-08 12:07:46,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:07:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60240 states. [2019-09-08 12:07:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60240 to 13310. [2019-09-08 12:07:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13310 states. [2019-09-08 12:07:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13310 states to 13310 states and 17651 transitions. [2019-09-08 12:07:51,397 INFO L78 Accepts]: Start accepts. Automaton has 13310 states and 17651 transitions. Word has length 186 [2019-09-08 12:07:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:51,397 INFO L475 AbstractCegarLoop]: Abstraction has 13310 states and 17651 transitions. [2019-09-08 12:07:51,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:07:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 13310 states and 17651 transitions. [2019-09-08 12:07:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 12:07:51,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:51,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:51,407 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:51,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1896087989, now seen corresponding path program 1 times [2019-09-08 12:07:51,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:51,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:51,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:51,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:51,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:51,464 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 12:07:51,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:51,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:07:51,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:07:51,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:07:51,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:51,467 INFO L87 Difference]: Start difference. First operand 13310 states and 17651 transitions. Second operand 3 states. [2019-09-08 12:07:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:56,210 INFO L93 Difference]: Finished difference Result 26253 states and 34922 transitions. [2019-09-08 12:07:56,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:07:56,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-08 12:07:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:56,220 INFO L225 Difference]: With dead ends: 26253 [2019-09-08 12:07:56,221 INFO L226 Difference]: Without dead ends: 13096 [2019-09-08 12:07:56,229 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 12:07:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13096 states. [2019-09-08 12:08:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13096 to 13096. [2019-09-08 12:08:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13096 states. [2019-09-08 12:08:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13096 states to 13096 states and 17275 transitions. [2019-09-08 12:08:00,771 INFO L78 Accepts]: Start accepts. Automaton has 13096 states and 17275 transitions. Word has length 186 [2019-09-08 12:08:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:00,772 INFO L475 AbstractCegarLoop]: Abstraction has 13096 states and 17275 transitions. [2019-09-08 12:08:00,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:08:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 13096 states and 17275 transitions. [2019-09-08 12:08:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 12:08:00,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:00,780 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:00,780 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:00,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash 644602566, now seen corresponding path program 1 times [2019-09-08 12:08:00,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:00,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:00,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:00,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:00,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:01,069 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 12:08:01,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:01,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:08:01,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:08:01,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:08:01,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:08:01,071 INFO L87 Difference]: Start difference. First operand 13096 states and 17275 transitions. Second operand 12 states. [2019-09-08 12:08:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:12,344 INFO L93 Difference]: Finished difference Result 30434 states and 40966 transitions. [2019-09-08 12:08:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:08:12,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2019-09-08 12:08:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:12,367 INFO L225 Difference]: With dead ends: 30434 [2019-09-08 12:08:12,367 INFO L226 Difference]: Without dead ends: 25496 [2019-09-08 12:08:12,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:08:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25496 states. [2019-09-08 12:08:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25496 to 9604. [2019-09-08 12:08:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9604 states. [2019-09-08 12:08:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 12793 transitions. [2019-09-08 12:08:16,325 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 12793 transitions. Word has length 187 [2019-09-08 12:08:16,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:16,325 INFO L475 AbstractCegarLoop]: Abstraction has 9604 states and 12793 transitions. [2019-09-08 12:08:16,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:08:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 12793 transitions. [2019-09-08 12:08:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 12:08:16,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:16,330 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:16,330 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:16,330 INFO L82 PathProgramCache]: Analyzing trace with hash 363345828, now seen corresponding path program 1 times [2019-09-08 12:08:16,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:16,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:16,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:16,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:16,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:16,379 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 12:08:16,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:16,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:08:16,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:08:16,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:08:16,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:08:16,380 INFO L87 Difference]: Start difference. First operand 9604 states and 12793 transitions. Second operand 3 states. [2019-09-08 12:08:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:20,213 INFO L93 Difference]: Finished difference Result 18676 states and 24966 transitions. [2019-09-08 12:08:20,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:08:20,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-08 12:08:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:20,221 INFO L225 Difference]: With dead ends: 18676 [2019-09-08 12:08:20,221 INFO L226 Difference]: Without dead ends: 9463 [2019-09-08 12:08:20,226 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 12:08:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9463 states. [2019-09-08 12:08:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9463 to 9463. [2019-09-08 12:08:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9463 states. [2019-09-08 12:08:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9463 states to 9463 states and 12558 transitions. [2019-09-08 12:08:24,638 INFO L78 Accepts]: Start accepts. Automaton has 9463 states and 12558 transitions. Word has length 187 [2019-09-08 12:08:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:24,638 INFO L475 AbstractCegarLoop]: Abstraction has 9463 states and 12558 transitions. [2019-09-08 12:08:24,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:08:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 9463 states and 12558 transitions. [2019-09-08 12:08:24,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 12:08:24,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:24,643 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:24,643 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:24,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1231450796, now seen corresponding path program 1 times [2019-09-08 12:08:24,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:24,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:24,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:24,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:24,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:24,917 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 12:08:24,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:24,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:08:24,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:08:24,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:08:24,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:08:24,919 INFO L87 Difference]: Start difference. First operand 9463 states and 12558 transitions. Second operand 10 states. [2019-09-08 12:08:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:41,257 INFO L93 Difference]: Finished difference Result 40301 states and 54590 transitions. [2019-09-08 12:08:41,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:08:41,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2019-09-08 12:08:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:41,289 INFO L225 Difference]: With dead ends: 40301 [2019-09-08 12:08:41,289 INFO L226 Difference]: Without dead ends: 35013 [2019-09-08 12:08:41,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:08:41,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35013 states. [2019-09-08 12:08:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35013 to 8933. [2019-09-08 12:08:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8933 states. [2019-09-08 12:08:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8933 states to 8933 states and 11919 transitions. [2019-09-08 12:08:45,216 INFO L78 Accepts]: Start accepts. Automaton has 8933 states and 11919 transitions. Word has length 188 [2019-09-08 12:08:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:45,216 INFO L475 AbstractCegarLoop]: Abstraction has 8933 states and 11919 transitions. [2019-09-08 12:08:45,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:08:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 8933 states and 11919 transitions. [2019-09-08 12:08:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 12:08:45,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:45,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:45,221 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1334872664, now seen corresponding path program 1 times [2019-09-08 12:08:45,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:45,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:45,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:45,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:45,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:45,566 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 12:08:45,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:45,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:08:45,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:08:45,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:08:45,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:08:45,568 INFO L87 Difference]: Start difference. First operand 8933 states and 11919 transitions. Second operand 10 states. [2019-09-08 12:09:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:00,282 INFO L93 Difference]: Finished difference Result 35420 states and 48450 transitions. [2019-09-08 12:09:00,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:09:00,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2019-09-08 12:09:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:00,308 INFO L225 Difference]: With dead ends: 35420 [2019-09-08 12:09:00,308 INFO L226 Difference]: Without dead ends: 30950 [2019-09-08 12:09:00,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:09:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30950 states. [2019-09-08 12:09:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30950 to 8730. [2019-09-08 12:09:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8730 states. [2019-09-08 12:09:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8730 states to 8730 states and 11661 transitions. [2019-09-08 12:09:04,233 INFO L78 Accepts]: Start accepts. Automaton has 8730 states and 11661 transitions. Word has length 188 [2019-09-08 12:09:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:04,233 INFO L475 AbstractCegarLoop]: Abstraction has 8730 states and 11661 transitions. [2019-09-08 12:09:04,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:09:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 8730 states and 11661 transitions. [2019-09-08 12:09:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 12:09:04,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:04,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:04,237 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:04,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:04,237 INFO L82 PathProgramCache]: Analyzing trace with hash -97960162, now seen corresponding path program 1 times [2019-09-08 12:09:04,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:04,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:04,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:04,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:04,573 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 12:09:04,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:04,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:09:04,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:09:04,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:09:04,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:09:04,578 INFO L87 Difference]: Start difference. First operand 8730 states and 11661 transitions. Second operand 10 states. [2019-09-08 12:09:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:16,882 INFO L93 Difference]: Finished difference Result 30970 states and 41886 transitions. [2019-09-08 12:09:16,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:09:16,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-09-08 12:09:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:16,905 INFO L225 Difference]: With dead ends: 30970 [2019-09-08 12:09:16,905 INFO L226 Difference]: Without dead ends: 25435 [2019-09-08 12:09:16,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:09:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25435 states. [2019-09-08 12:09:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25435 to 10139. [2019-09-08 12:09:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10139 states. [2019-09-08 12:09:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10139 states to 10139 states and 13331 transitions. [2019-09-08 12:09:21,529 INFO L78 Accepts]: Start accepts. Automaton has 10139 states and 13331 transitions. Word has length 189 [2019-09-08 12:09:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:21,529 INFO L475 AbstractCegarLoop]: Abstraction has 10139 states and 13331 transitions. [2019-09-08 12:09:21,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:09:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 10139 states and 13331 transitions. [2019-09-08 12:09:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 12:09:21,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:21,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:21,535 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:21,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1701751960, now seen corresponding path program 1 times [2019-09-08 12:09:21,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:21,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:21,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:21,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:21,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:21,665 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 12:09:21,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:21,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:09:21,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:09:21,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:09:21,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:09:21,666 INFO L87 Difference]: Start difference. First operand 10139 states and 13331 transitions. Second operand 4 states. [2019-09-08 12:09:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:26,343 INFO L93 Difference]: Finished difference Result 19659 states and 25816 transitions. [2019-09-08 12:09:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:09:26,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-09-08 12:09:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:26,351 INFO L225 Difference]: With dead ends: 19659 [2019-09-08 12:09:26,352 INFO L226 Difference]: Without dead ends: 10117 [2019-09-08 12:09:26,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2019-09-08 12:09:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 10111. [2019-09-08 12:09:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10111 states. [2019-09-08 12:09:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10111 states to 10111 states and 13225 transitions. [2019-09-08 12:09:30,844 INFO L78 Accepts]: Start accepts. Automaton has 10111 states and 13225 transitions. Word has length 189 [2019-09-08 12:09:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:30,844 INFO L475 AbstractCegarLoop]: Abstraction has 10111 states and 13225 transitions. [2019-09-08 12:09:30,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:09:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 10111 states and 13225 transitions. [2019-09-08 12:09:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 12:09:30,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:30,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:30,851 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:30,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1704543652, now seen corresponding path program 1 times [2019-09-08 12:09:30,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:30,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:30,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:30,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:30,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:30,923 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 12:09:30,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:30,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:09:30,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:09:30,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:09:30,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:30,925 INFO L87 Difference]: Start difference. First operand 10111 states and 13225 transitions. Second operand 3 states. [2019-09-08 12:09:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:37,008 INFO L93 Difference]: Finished difference Result 21481 states and 27949 transitions. [2019-09-08 12:09:37,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:09:37,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-09-08 12:09:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:37,018 INFO L225 Difference]: With dead ends: 21481 [2019-09-08 12:09:37,018 INFO L226 Difference]: Without dead ends: 12785 [2019-09-08 12:09:37,024 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 12:09:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12785 states. [2019-09-08 12:09:42,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12785 to 12155. [2019-09-08 12:09:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12155 states. [2019-09-08 12:09:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12155 states to 12155 states and 15179 transitions. [2019-09-08 12:09:42,746 INFO L78 Accepts]: Start accepts. Automaton has 12155 states and 15179 transitions. Word has length 191 [2019-09-08 12:09:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:42,746 INFO L475 AbstractCegarLoop]: Abstraction has 12155 states and 15179 transitions. [2019-09-08 12:09:42,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:09:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 12155 states and 15179 transitions. [2019-09-08 12:09:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 12:09:42,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:42,753 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1155381955, now seen corresponding path program 1 times [2019-09-08 12:09:42,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:42,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:42,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:42,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:42,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:42,822 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 12:09:42,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:42,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:09:42,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:09:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:09:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:42,823 INFO L87 Difference]: Start difference. First operand 12155 states and 15179 transitions. Second operand 3 states. [2019-09-08 12:09:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:49,336 INFO L93 Difference]: Finished difference Result 18263 states and 23082 transitions. [2019-09-08 12:09:49,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:09:49,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-08 12:09:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:49,348 INFO L225 Difference]: With dead ends: 18263 [2019-09-08 12:09:49,348 INFO L226 Difference]: Without dead ends: 13533 [2019-09-08 12:09:49,353 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 12:09:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13533 states. [2019-09-08 12:09:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13533 to 12917. [2019-09-08 12:09:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12917 states. [2019-09-08 12:09:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12917 states to 12917 states and 16138 transitions. [2019-09-08 12:09:55,418 INFO L78 Accepts]: Start accepts. Automaton has 12917 states and 16138 transitions. Word has length 192 [2019-09-08 12:09:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:55,418 INFO L475 AbstractCegarLoop]: Abstraction has 12917 states and 16138 transitions. [2019-09-08 12:09:55,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:09:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 12917 states and 16138 transitions. [2019-09-08 12:09:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 12:09:55,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:55,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:55,426 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:55,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash -823603493, now seen corresponding path program 1 times [2019-09-08 12:09:55,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:55,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:55,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:55,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:55,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:55,493 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 12:09:55,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:55,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:09:55,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:09:55,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:09:55,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:55,494 INFO L87 Difference]: Start difference. First operand 12917 states and 16138 transitions. Second operand 3 states. [2019-09-08 12:10:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:02,169 INFO L93 Difference]: Finished difference Result 21247 states and 26842 transitions. [2019-09-08 12:10:02,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:10:02,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-09-08 12:10:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:02,180 INFO L225 Difference]: With dead ends: 21247 [2019-09-08 12:10:02,180 INFO L226 Difference]: Without dead ends: 12919 [2019-09-08 12:10:02,187 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 12:10:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12919 states. [2019-09-08 12:10:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12919 to 12917. [2019-09-08 12:10:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12917 states. [2019-09-08 12:10:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12917 states to 12917 states and 16042 transitions. [2019-09-08 12:10:08,204 INFO L78 Accepts]: Start accepts. Automaton has 12917 states and 16042 transitions. Word has length 194 [2019-09-08 12:10:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:08,204 INFO L475 AbstractCegarLoop]: Abstraction has 12917 states and 16042 transitions. [2019-09-08 12:10:08,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:10:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 12917 states and 16042 transitions. [2019-09-08 12:10:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 12:10:08,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:10:08,212 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:08,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:08,212 INFO L82 PathProgramCache]: Analyzing trace with hash 816848708, now seen corresponding path program 1 times [2019-09-08 12:10:08,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:08,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:08,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:08,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:08,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:08,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:08,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:10:08,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:10:08,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:10:08,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:10:08,668 INFO L87 Difference]: Start difference. First operand 12917 states and 16042 transitions. Second operand 18 states. [2019-09-08 12:10:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:35,598 INFO L93 Difference]: Finished difference Result 54756 states and 69077 transitions. [2019-09-08 12:10:35,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:10:35,599 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 195 [2019-09-08 12:10:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:35,641 INFO L225 Difference]: With dead ends: 54756 [2019-09-08 12:10:35,641 INFO L226 Difference]: Without dead ends: 51634 [2019-09-08 12:10:35,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=1128, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:10:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51634 states. [2019-09-08 12:10:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51634 to 14047. [2019-09-08 12:10:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14047 states. [2019-09-08 12:10:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14047 states to 14047 states and 17344 transitions. [2019-09-08 12:10:42,780 INFO L78 Accepts]: Start accepts. Automaton has 14047 states and 17344 transitions. Word has length 195 [2019-09-08 12:10:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:42,780 INFO L475 AbstractCegarLoop]: Abstraction has 14047 states and 17344 transitions. [2019-09-08 12:10:42,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:10:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 14047 states and 17344 transitions. [2019-09-08 12:10:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 12:10:42,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:42,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:42,787 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:42,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:42,787 INFO L82 PathProgramCache]: Analyzing trace with hash 602998145, now seen corresponding path program 1 times [2019-09-08 12:10:42,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:42,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:42,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:42,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:42,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:43,362 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 12:10:43,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:43,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:10:43,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:10:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:10:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:10:43,364 INFO L87 Difference]: Start difference. First operand 14047 states and 17344 transitions. Second operand 18 states. [2019-09-08 12:11:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:18,143 INFO L93 Difference]: Finished difference Result 71591 states and 90315 transitions. [2019-09-08 12:11:18,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:11:18,143 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 195 [2019-09-08 12:11:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:18,198 INFO L225 Difference]: With dead ends: 71591 [2019-09-08 12:11:18,199 INFO L226 Difference]: Without dead ends: 66643 [2019-09-08 12:11:18,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:11:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66643 states. [2019-09-08 12:11:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66643 to 16525. [2019-09-08 12:11:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16525 states. [2019-09-08 12:11:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 20249 transitions. [2019-09-08 12:11:27,199 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 20249 transitions. Word has length 195 [2019-09-08 12:11:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:27,199 INFO L475 AbstractCegarLoop]: Abstraction has 16525 states and 20249 transitions. [2019-09-08 12:11:27,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:11:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 20249 transitions. [2019-09-08 12:11:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 12:11:27,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:27,209 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:27,209 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash -929628895, now seen corresponding path program 1 times [2019-09-08 12:11:27,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:27,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:27,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:27,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:27,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:11:27,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:11:27,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:11:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:11:27,314 INFO L87 Difference]: Start difference. First operand 16525 states and 20249 transitions. Second operand 4 states. [2019-09-08 12:11:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:36,548 INFO L93 Difference]: Finished difference Result 23471 states and 29062 transitions. [2019-09-08 12:11:36,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:11:36,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-09-08 12:11:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:36,560 INFO L225 Difference]: With dead ends: 23471 [2019-09-08 12:11:36,561 INFO L226 Difference]: Without dead ends: 16345 [2019-09-08 12:11:36,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:11:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16345 states. [2019-09-08 12:11:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16345 to 16057. [2019-09-08 12:11:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16057 states. [2019-09-08 12:11:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16057 states to 16057 states and 19588 transitions. [2019-09-08 12:11:44,772 INFO L78 Accepts]: Start accepts. Automaton has 16057 states and 19588 transitions. Word has length 195 [2019-09-08 12:11:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:44,773 INFO L475 AbstractCegarLoop]: Abstraction has 16057 states and 19588 transitions. [2019-09-08 12:11:44,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:11:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 16057 states and 19588 transitions. [2019-09-08 12:11:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 12:11:44,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:44,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:44,781 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:44,781 INFO L82 PathProgramCache]: Analyzing trace with hash -943801001, now seen corresponding path program 1 times [2019-09-08 12:11:44,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:44,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:44,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:44,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:44,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:44,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:44,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:11:44,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:11:44,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:11:44,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:11:44,855 INFO L87 Difference]: Start difference. First operand 16057 states and 19588 transitions. Second operand 3 states. [2019-09-08 12:11:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:53,349 INFO L93 Difference]: Finished difference Result 26079 states and 32326 transitions. [2019-09-08 12:11:53,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:11:53,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-08 12:11:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:53,362 INFO L225 Difference]: With dead ends: 26079 [2019-09-08 12:11:53,363 INFO L226 Difference]: Without dead ends: 16353 [2019-09-08 12:11:53,370 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 12:11:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16353 states. [2019-09-08 12:12:01,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16353 to 16197. [2019-09-08 12:12:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16197 states. [2019-09-08 12:12:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16197 states to 16197 states and 19436 transitions. [2019-09-08 12:12:01,658 INFO L78 Accepts]: Start accepts. Automaton has 16197 states and 19436 transitions. Word has length 199 [2019-09-08 12:12:01,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:01,658 INFO L475 AbstractCegarLoop]: Abstraction has 16197 states and 19436 transitions. [2019-09-08 12:12:01,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 16197 states and 19436 transitions. [2019-09-08 12:12:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 12:12:01,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:01,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:01,667 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:01,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:01,667 INFO L82 PathProgramCache]: Analyzing trace with hash -154370721, now seen corresponding path program 1 times [2019-09-08 12:12:01,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:01,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:01,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:01,786 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 12:12:01,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:01,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:12:01,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:12:01,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:12:01,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:12:01,788 INFO L87 Difference]: Start difference. First operand 16197 states and 19436 transitions. Second operand 6 states. [2019-09-08 12:12:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:12,688 INFO L93 Difference]: Finished difference Result 20911 states and 25549 transitions. [2019-09-08 12:12:12,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:12:12,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 199 [2019-09-08 12:12:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:12,705 INFO L225 Difference]: With dead ends: 20911 [2019-09-08 12:12:12,705 INFO L226 Difference]: Without dead ends: 20909 [2019-09-08 12:12:12,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:12:12,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20909 states. [2019-09-08 12:12:21,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20909 to 16341. [2019-09-08 12:12:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2019-09-08 12:12:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 19532 transitions. [2019-09-08 12:12:21,231 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 19532 transitions. Word has length 199 [2019-09-08 12:12:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:21,232 INFO L475 AbstractCegarLoop]: Abstraction has 16341 states and 19532 transitions. [2019-09-08 12:12:21,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:12:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 19532 transitions. [2019-09-08 12:12:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 12:12:21,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:21,240 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:21,240 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:21,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash 361823537, now seen corresponding path program 1 times [2019-09-08 12:12:21,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:21,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:21,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:21,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:21,324 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 12:12:21,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:21,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:21,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:21,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:21,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:21,325 INFO L87 Difference]: Start difference. First operand 16341 states and 19532 transitions. Second operand 3 states. [2019-09-08 12:12:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:32,146 INFO L93 Difference]: Finished difference Result 29719 states and 36313 transitions. [2019-09-08 12:12:32,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:32,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-08 12:12:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:32,162 INFO L225 Difference]: With dead ends: 29719 [2019-09-08 12:12:32,163 INFO L226 Difference]: Without dead ends: 20745 [2019-09-08 12:12:32,171 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 12:12:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20745 states. [2019-09-08 12:12:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20745 to 20699. [2019-09-08 12:12:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20699 states. [2019-09-08 12:12:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20699 states to 20699 states and 24767 transitions. [2019-09-08 12:12:42,971 INFO L78 Accepts]: Start accepts. Automaton has 20699 states and 24767 transitions. Word has length 200 [2019-09-08 12:12:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:42,971 INFO L475 AbstractCegarLoop]: Abstraction has 20699 states and 24767 transitions. [2019-09-08 12:12:42,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 20699 states and 24767 transitions. [2019-09-08 12:12:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 12:12:42,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:42,987 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:42,987 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:42,987 INFO L82 PathProgramCache]: Analyzing trace with hash 917576246, now seen corresponding path program 1 times [2019-09-08 12:12:42,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:42,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:42,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:42,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:42,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:43,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:12:43,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:12:43,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:43,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 12:12:43,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:12:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 12:12:43,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:12:43,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2019-09-08 12:12:43,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:12:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:12:43,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:12:43,772 INFO L87 Difference]: Start difference. First operand 20699 states and 24767 transitions. Second operand 14 states. [2019-09-08 12:13:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:11,372 INFO L93 Difference]: Finished difference Result 54101 states and 65510 transitions. [2019-09-08 12:13:11,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:13:11,372 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 228 [2019-09-08 12:13:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:11,501 INFO L225 Difference]: With dead ends: 54101 [2019-09-08 12:13:11,501 INFO L226 Difference]: Without dead ends: 38423 [2019-09-08 12:13:11,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:13:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38423 states. [2019-09-08 12:13:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38423 to 25471. [2019-09-08 12:13:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25471 states. [2019-09-08 12:13:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25471 states to 25471 states and 30777 transitions. [2019-09-08 12:13:27,269 INFO L78 Accepts]: Start accepts. Automaton has 25471 states and 30777 transitions. Word has length 228 [2019-09-08 12:13:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:27,269 INFO L475 AbstractCegarLoop]: Abstraction has 25471 states and 30777 transitions. [2019-09-08 12:13:27,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:13:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 25471 states and 30777 transitions. [2019-09-08 12:13:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 12:13:27,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:27,306 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:27,306 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2021402519, now seen corresponding path program 1 times [2019-09-08 12:13:27,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:27,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:27,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:27,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:13:27,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:13:27,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:13:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:28,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 12:13:28,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:13:28,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:13:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:28,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:13:28,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-09-08 12:13:28,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 12:13:28,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 12:13:28,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:13:28,807 INFO L87 Difference]: Start difference. First operand 25471 states and 30777 transitions. Second operand 23 states. [2019-09-08 12:13:28,973 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 12:13:30,431 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-08 12:13:30,904 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-09-08 12:13:31,154 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-08 12:13:34,270 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:13:34,576 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:13:35,218 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 12:13:35,488 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 12:13:38,933 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-08 12:13:39,193 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-08 12:13:39,469 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-08 12:13:39,758 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-08 12:13:40,680 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-09-08 12:13:41,100 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-08 12:13:41,304 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 12:13:41,774 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-08 12:13:44,854 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-08 12:13:45,243 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-08 12:13:45,555 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-08 12:13:47,710 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-08 12:13:48,196 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 12:13:49,026 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-09-08 12:13:49,576 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-08 12:13:49,940 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-08 12:13:50,351 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:13:50,663 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-08 12:13:51,037 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-08 12:13:51,294 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-08 12:13:51,888 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-08 12:13:52,134 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:13:55,265 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-08 12:13:55,685 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-08 12:13:56,976 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-09-08 12:13:57,238 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-08 12:13:57,525 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:13:58,707 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-08 12:13:59,053 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-08 12:14:19,849 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-08 12:14:20,274 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-08 12:14:20,538 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-08 12:14:24,838 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-08 12:14:25,313 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-09-08 12:14:25,625 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-08 12:14:27,137 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-08 12:14:29,437 WARN L188 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-08 12:14:32,986 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 12:14:33,209 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:14:33,638 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-08 12:14:33,911 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-08 12:14:35,567 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:14:38,276 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-08 12:14:40,001 WARN L188 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-09-08 12:15:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:06,803 INFO L93 Difference]: Finished difference Result 126045 states and 156591 transitions. [2019-09-08 12:15:06,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 12:15:06,804 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 228 [2019-09-08 12:15:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:06,945 INFO L225 Difference]: With dead ends: 126045 [2019-09-08 12:15:06,945 INFO L226 Difference]: Without dead ends: 106023 [2019-09-08 12:15:06,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=1409, Invalid=4752, Unknown=1, NotChecked=0, Total=6162 [2019-09-08 12:15:07,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106023 states. [2019-09-08 12:15:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106023 to 70295. [2019-09-08 12:15:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70295 states. [2019-09-08 12:15:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70295 states to 70295 states and 84571 transitions. [2019-09-08 12:15:52,404 INFO L78 Accepts]: Start accepts. Automaton has 70295 states and 84571 transitions. Word has length 228 [2019-09-08 12:15:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:52,405 INFO L475 AbstractCegarLoop]: Abstraction has 70295 states and 84571 transitions. [2019-09-08 12:15:52,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 12:15:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 70295 states and 84571 transitions. [2019-09-08 12:15:52,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 12:15:52,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:52,436 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:15:52,436 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:52,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:52,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1466102844, now seen corresponding path program 1 times [2019-09-08 12:15:52,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:52,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:52,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:52,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:52,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 12:15:52,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:52,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:15:52,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:15:52,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:15:52,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:15:52,923 INFO L87 Difference]: Start difference. First operand 70295 states and 84571 transitions. Second operand 12 states.