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.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:40:36,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:40:36,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:40:36,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:40:36,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:40:36,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:40:36,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:40:36,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:40:36,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:40:36,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:40:36,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:40:36,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:40:36,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:40:36,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:40:36,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:40:36,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:40:36,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:40:36,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:40:36,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:40:36,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:40:36,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:40:36,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:40:36,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:40:36,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:40:36,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:40:36,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:40:36,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:40:36,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:40:36,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:40:36,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:40:36,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:40:36,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:40:36,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:40:36,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:40:36,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:40:36,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:40:36,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:40:36,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:40:36,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:40:36,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:40:36,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:40:36,820 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:40:36,834 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:40:36,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:40:36,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:40:36,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:40:36,836 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:40:36,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:40:36,837 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:40:36,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:40:36,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:40:36,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:40:36,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:40:36,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:40:36,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:40:36,838 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:40:36,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:40:36,839 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:40:36,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:40:36,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:40:36,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:40:36,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:40:36,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:40:36,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:40:36,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:40:36,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:40:36,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:40:36,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:40:36,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:40:36,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:40:36,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:40:36,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:40:36,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:40:36,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:40:36,888 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:40:36,888 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:40:36,889 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:40:36,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff155982/ccd7355520634b718134384a25010e40/FLAG897f92db9 [2019-09-08 12:40:37,514 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:40:37,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:40:37,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff155982/ccd7355520634b718134384a25010e40/FLAG897f92db9 [2019-09-08 12:40:37,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff155982/ccd7355520634b718134384a25010e40 [2019-09-08 12:40:37,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:40:37,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:40:37,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:40:37,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:40:37,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:40:37,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:40:37" (1/1) ... [2019-09-08 12:40:37,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ef01b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:37, skipping insertion in model container [2019-09-08 12:40:37,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:40:37" (1/1) ... [2019-09-08 12:40:37,782 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:40:37,847 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:40:38,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:40:38,340 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:40:38,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:40:38,499 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:40:38,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:38 WrapperNode [2019-09-08 12:40:38,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:40:38,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:40:38,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:40:38,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:40:38,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:38" (1/1) ... [2019-09-08 12:40:38,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:38" (1/1) ... [2019-09-08 12:40:38,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:38" (1/1) ... [2019-09-08 12:40:38,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:38" (1/1) ... [2019-09-08 12:40:38,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:38" (1/1) ... [2019-09-08 12:40:38,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:38" (1/1) ... [2019-09-08 12:40:38,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:38" (1/1) ... [2019-09-08 12:40:38,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:40:38,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:40:38,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:40:38,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:40:38,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:38" (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:40:38,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:40:38,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:40:38,661 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:40:38,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:40:38,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:40:38,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:40:38,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:40:38,663 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:40:38,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:40:38,663 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:40:38,664 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:40:38,664 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:40:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:40:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:40:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:40:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:40:38,668 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:40:38,669 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:40:38,669 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:40:38,669 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:40:38,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:40:38,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:40:38,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:40:39,939 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:40:39,939 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:40:39,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:40:39 BoogieIcfgContainer [2019-09-08 12:40:39,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:40:39,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:40:39,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:40:39,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:40:39,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:40:37" (1/3) ... [2019-09-08 12:40:39,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d8dfef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:40:39, skipping insertion in model container [2019-09-08 12:40:39,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:38" (2/3) ... [2019-09-08 12:40:39,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d8dfef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:40:39, skipping insertion in model container [2019-09-08 12:40:39,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:40:39" (3/3) ... [2019-09-08 12:40:39,950 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:40:39,960 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:40:39,971 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:40:39,990 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:40:40,039 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:40:40,040 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:40:40,041 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:40:40,041 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:40:40,041 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:40:40,041 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:40:40,042 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:40:40,042 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:40:40,042 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:40:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-09-08 12:40:40,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:40:40,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:40,103 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] [2019-09-08 12:40:40,109 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1579256941, now seen corresponding path program 1 times [2019-09-08 12:40:40,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:40,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:40,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:40,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:40,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:40,676 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:40:40,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:40,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:40:40,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:40:40,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:40:40,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:40:40,701 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2019-09-08 12:40:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:40,911 INFO L93 Difference]: Finished difference Result 398 states and 660 transitions. [2019-09-08 12:40:40,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:40:40,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-08 12:40:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:40,929 INFO L225 Difference]: With dead ends: 398 [2019-09-08 12:40:40,930 INFO L226 Difference]: Without dead ends: 305 [2019-09-08 12:40:40,934 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:40:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-08 12:40:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2019-09-08 12:40:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 12:40:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 435 transitions. [2019-09-08 12:40:41,033 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 435 transitions. Word has length 111 [2019-09-08 12:40:41,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:41,034 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 435 transitions. [2019-09-08 12:40:41,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:40:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 435 transitions. [2019-09-08 12:40:41,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:40:41,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:41,038 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] [2019-09-08 12:40:41,039 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash -529337958, now seen corresponding path program 1 times [2019-09-08 12:40:41,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:41,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:41,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:41,342 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:40:41,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:41,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:41,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:41,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:41,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:41,346 INFO L87 Difference]: Start difference. First operand 303 states and 435 transitions. Second operand 5 states. [2019-09-08 12:40:41,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:41,794 INFO L93 Difference]: Finished difference Result 749 states and 1131 transitions. [2019-09-08 12:40:41,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:41,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:40:41,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:41,800 INFO L225 Difference]: With dead ends: 749 [2019-09-08 12:40:41,800 INFO L226 Difference]: Without dead ends: 506 [2019-09-08 12:40:41,803 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:40:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-08 12:40:41,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-09-08 12:40:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-08 12:40:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 753 transitions. [2019-09-08 12:40:41,864 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 753 transitions. Word has length 113 [2019-09-08 12:40:41,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:41,865 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 753 transitions. [2019-09-08 12:40:41,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 753 transitions. [2019-09-08 12:40:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:40:41,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:41,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:41,876 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:41,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1399262783, now seen corresponding path program 1 times [2019-09-08 12:40:41,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:41,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:41,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:42,058 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:40:42,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:42,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:42,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:42,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:42,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:42,063 INFO L87 Difference]: Start difference. First operand 504 states and 753 transitions. Second operand 5 states. [2019-09-08 12:40:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:42,316 INFO L93 Difference]: Finished difference Result 944 states and 1441 transitions. [2019-09-08 12:40:42,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:42,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-08 12:40:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:42,321 INFO L225 Difference]: With dead ends: 944 [2019-09-08 12:40:42,322 INFO L226 Difference]: Without dead ends: 504 [2019-09-08 12:40:42,324 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:40:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-08 12:40:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-08 12:40:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-08 12:40:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 748 transitions. [2019-09-08 12:40:42,358 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 748 transitions. Word has length 114 [2019-09-08 12:40:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:42,358 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 748 transitions. [2019-09-08 12:40:42,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 748 transitions. [2019-09-08 12:40:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:40:42,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:42,361 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] [2019-09-08 12:40:42,361 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash -360394647, now seen corresponding path program 1 times [2019-09-08 12:40:42,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:42,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:42,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:42,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:42,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:42,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:42,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:42,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:42,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:42,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:42,573 INFO L87 Difference]: Start difference. First operand 504 states and 748 transitions. Second operand 5 states. [2019-09-08 12:40:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:42,798 INFO L93 Difference]: Finished difference Result 924 states and 1407 transitions. [2019-09-08 12:40:42,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:42,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-09-08 12:40:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:42,802 INFO L225 Difference]: With dead ends: 924 [2019-09-08 12:40:42,802 INFO L226 Difference]: Without dead ends: 504 [2019-09-08 12:40:42,803 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:40:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-08 12:40:42,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-08 12:40:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-08 12:40:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 743 transitions. [2019-09-08 12:40:42,841 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 743 transitions. Word has length 115 [2019-09-08 12:40:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:42,842 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 743 transitions. [2019-09-08 12:40:42,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 743 transitions. [2019-09-08 12:40:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:40:42,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:42,844 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] [2019-09-08 12:40:42,844 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash -72559888, now seen corresponding path program 1 times [2019-09-08 12:40:42,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:42,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:42,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:42,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:42,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:42,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:42,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:42,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:42,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:42,963 INFO L87 Difference]: Start difference. First operand 504 states and 743 transitions. Second operand 5 states. [2019-09-08 12:40:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:43,197 INFO L93 Difference]: Finished difference Result 936 states and 1412 transitions. [2019-09-08 12:40:43,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:43,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-08 12:40:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:43,201 INFO L225 Difference]: With dead ends: 936 [2019-09-08 12:40:43,202 INFO L226 Difference]: Without dead ends: 504 [2019-09-08 12:40:43,203 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:40:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-08 12:40:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-08 12:40:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-08 12:40:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 738 transitions. [2019-09-08 12:40:43,235 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 738 transitions. Word has length 116 [2019-09-08 12:40:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:43,236 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 738 transitions. [2019-09-08 12:40:43,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 738 transitions. [2019-09-08 12:40:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:40:43,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:43,238 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] [2019-09-08 12:40:43,238 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:43,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1918050182, now seen corresponding path program 1 times [2019-09-08 12:40:43,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:43,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:43,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:43,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:43,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:43,357 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:40:43,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:43,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:43,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:43,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:43,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:43,360 INFO L87 Difference]: Start difference. First operand 504 states and 738 transitions. Second operand 5 states. [2019-09-08 12:40:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:43,588 INFO L93 Difference]: Finished difference Result 932 states and 1398 transitions. [2019-09-08 12:40:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:43,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-08 12:40:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:43,593 INFO L225 Difference]: With dead ends: 932 [2019-09-08 12:40:43,594 INFO L226 Difference]: Without dead ends: 504 [2019-09-08 12:40:43,595 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:40:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-08 12:40:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-08 12:40:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-08 12:40:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 733 transitions. [2019-09-08 12:40:43,632 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 733 transitions. Word has length 117 [2019-09-08 12:40:43,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:43,634 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 733 transitions. [2019-09-08 12:40:43,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 733 transitions. [2019-09-08 12:40:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:40:43,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:43,641 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] [2019-09-08 12:40:43,641 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash -694845729, now seen corresponding path program 1 times [2019-09-08 12:40:43,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:43,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:43,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:43,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:43,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:43,782 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:40:43,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:43,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:43,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:43,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:43,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:43,785 INFO L87 Difference]: Start difference. First operand 504 states and 733 transitions. Second operand 5 states. [2019-09-08 12:40:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:44,034 INFO L93 Difference]: Finished difference Result 940 states and 1397 transitions. [2019-09-08 12:40:44,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:44,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-09-08 12:40:44,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:44,037 INFO L225 Difference]: With dead ends: 940 [2019-09-08 12:40:44,038 INFO L226 Difference]: Without dead ends: 504 [2019-09-08 12:40:44,039 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:40:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-08 12:40:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-08 12:40:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-08 12:40:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 728 transitions. [2019-09-08 12:40:44,075 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 728 transitions. Word has length 118 [2019-09-08 12:40:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:44,076 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 728 transitions. [2019-09-08 12:40:44,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:44,076 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 728 transitions. [2019-09-08 12:40:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:40:44,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:44,078 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] [2019-09-08 12:40:44,078 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:44,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:44,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1872587080, now seen corresponding path program 1 times [2019-09-08 12:40:44,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:44,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:44,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:44,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:44,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:44,198 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:40:44,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:44,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:44,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:44,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:44,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:44,201 INFO L87 Difference]: Start difference. First operand 504 states and 728 transitions. Second operand 5 states. [2019-09-08 12:40:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:44,408 INFO L93 Difference]: Finished difference Result 928 states and 1375 transitions. [2019-09-08 12:40:44,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:44,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-08 12:40:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:44,412 INFO L225 Difference]: With dead ends: 928 [2019-09-08 12:40:44,412 INFO L226 Difference]: Without dead ends: 504 [2019-09-08 12:40:44,414 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:40:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-08 12:40:44,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-08 12:40:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-08 12:40:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 723 transitions. [2019-09-08 12:40:44,449 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 723 transitions. Word has length 119 [2019-09-08 12:40:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:44,450 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 723 transitions. [2019-09-08 12:40:44,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 723 transitions. [2019-09-08 12:40:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:44,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:44,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] [2019-09-08 12:40:44,452 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:44,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:44,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1611484050, now seen corresponding path program 1 times [2019-09-08 12:40:44,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:44,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:44,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:44,624 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:40:44,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:44,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:44,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:44,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:44,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:44,626 INFO L87 Difference]: Start difference. First operand 504 states and 723 transitions. Second operand 5 states. [2019-09-08 12:40:44,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:44,947 INFO L93 Difference]: Finished difference Result 1624 states and 2419 transitions. [2019-09-08 12:40:44,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:44,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:40:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:44,958 INFO L225 Difference]: With dead ends: 1624 [2019-09-08 12:40:44,958 INFO L226 Difference]: Without dead ends: 1314 [2019-09-08 12:40:44,961 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:40:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-09-08 12:40:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1202. [2019-09-08 12:40:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1202 states. [2019-09-08 12:40:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1787 transitions. [2019-09-08 12:40:45,109 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1787 transitions. Word has length 120 [2019-09-08 12:40:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:45,109 INFO L475 AbstractCegarLoop]: Abstraction has 1202 states and 1787 transitions. [2019-09-08 12:40:45,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1787 transitions. [2019-09-08 12:40:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:45,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:45,114 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] [2019-09-08 12:40:45,116 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:45,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1110184227, now seen corresponding path program 1 times [2019-09-08 12:40:45,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:45,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:45,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:45,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:45,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:45,297 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:40:45,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:45,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:45,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:45,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:45,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:45,298 INFO L87 Difference]: Start difference. First operand 1202 states and 1787 transitions. Second operand 5 states. [2019-09-08 12:40:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:45,601 INFO L93 Difference]: Finished difference Result 3129 states and 4707 transitions. [2019-09-08 12:40:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:45,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:40:45,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:45,615 INFO L225 Difference]: With dead ends: 3129 [2019-09-08 12:40:45,615 INFO L226 Difference]: Without dead ends: 2195 [2019-09-08 12:40:45,619 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:40:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2019-09-08 12:40:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1703. [2019-09-08 12:40:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-09-08 12:40:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2552 transitions. [2019-09-08 12:40:45,809 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2552 transitions. Word has length 120 [2019-09-08 12:40:45,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:45,810 INFO L475 AbstractCegarLoop]: Abstraction has 1703 states and 2552 transitions. [2019-09-08 12:40:45,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2552 transitions. [2019-09-08 12:40:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:45,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:45,813 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] [2019-09-08 12:40:45,813 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:45,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:45,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1346892231, now seen corresponding path program 1 times [2019-09-08 12:40:45,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:45,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:45,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:45,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:45,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:45,952 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:40:45,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:45,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:45,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:45,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:45,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:45,954 INFO L87 Difference]: Start difference. First operand 1703 states and 2552 transitions. Second operand 5 states. [2019-09-08 12:40:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:46,301 INFO L93 Difference]: Finished difference Result 4009 states and 6051 transitions. [2019-09-08 12:40:46,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:46,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:40:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:46,318 INFO L225 Difference]: With dead ends: 4009 [2019-09-08 12:40:46,318 INFO L226 Difference]: Without dead ends: 2601 [2019-09-08 12:40:46,325 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:40:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2019-09-08 12:40:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2189. [2019-09-08 12:40:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2019-09-08 12:40:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3293 transitions. [2019-09-08 12:40:46,589 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3293 transitions. Word has length 120 [2019-09-08 12:40:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:46,589 INFO L475 AbstractCegarLoop]: Abstraction has 2189 states and 3293 transitions. [2019-09-08 12:40:46,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3293 transitions. [2019-09-08 12:40:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:46,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:46,592 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] [2019-09-08 12:40:46,592 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:46,593 INFO L82 PathProgramCache]: Analyzing trace with hash 628970857, now seen corresponding path program 1 times [2019-09-08 12:40:46,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:46,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:46,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:46,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:46,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:46,690 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:40:46,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:46,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:40:46,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:40:46,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:40:46,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:40:46,692 INFO L87 Difference]: Start difference. First operand 2189 states and 3293 transitions. Second operand 3 states. [2019-09-08 12:40:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:46,923 INFO L93 Difference]: Finished difference Result 4073 states and 6157 transitions. [2019-09-08 12:40:46,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:40:46,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:40:46,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:46,936 INFO L225 Difference]: With dead ends: 4073 [2019-09-08 12:40:46,937 INFO L226 Difference]: Without dead ends: 2191 [2019-09-08 12:40:46,941 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:40:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2019-09-08 12:40:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2189. [2019-09-08 12:40:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2019-09-08 12:40:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3283 transitions. [2019-09-08 12:40:47,226 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3283 transitions. Word has length 120 [2019-09-08 12:40:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:47,227 INFO L475 AbstractCegarLoop]: Abstraction has 2189 states and 3283 transitions. [2019-09-08 12:40:47,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:40:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3283 transitions. [2019-09-08 12:40:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:47,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:47,230 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:47,231 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:47,231 INFO L82 PathProgramCache]: Analyzing trace with hash 385846506, now seen corresponding path program 1 times [2019-09-08 12:40:47,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:47,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:47,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:47,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:47,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:47,382 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:40:47,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:47,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:40:47,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:40:47,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:40:47,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:40:47,384 INFO L87 Difference]: Start difference. First operand 2189 states and 3283 transitions. Second operand 3 states. [2019-09-08 12:40:47,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:47,762 INFO L93 Difference]: Finished difference Result 5803 states and 8725 transitions. [2019-09-08 12:40:47,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:40:47,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:40:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:47,791 INFO L225 Difference]: With dead ends: 5803 [2019-09-08 12:40:47,791 INFO L226 Difference]: Without dead ends: 3921 [2019-09-08 12:40:47,797 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:40:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2019-09-08 12:40:48,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3871. [2019-09-08 12:40:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3871 states. [2019-09-08 12:40:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3871 states and 5759 transitions. [2019-09-08 12:40:48,195 INFO L78 Accepts]: Start accepts. Automaton has 3871 states and 5759 transitions. Word has length 120 [2019-09-08 12:40:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:48,196 INFO L475 AbstractCegarLoop]: Abstraction has 3871 states and 5759 transitions. [2019-09-08 12:40:48,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:40:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3871 states and 5759 transitions. [2019-09-08 12:40:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:48,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:48,200 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] [2019-09-08 12:40:48,200 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:48,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:48,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1534182572, now seen corresponding path program 1 times [2019-09-08 12:40:48,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:48,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:48,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:48,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:48,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:48,427 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:40:48,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:48,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:48,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:48,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:48,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:48,429 INFO L87 Difference]: Start difference. First operand 3871 states and 5759 transitions. Second operand 9 states. [2019-09-08 12:40:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:49,803 INFO L93 Difference]: Finished difference Result 14614 states and 21810 transitions. [2019-09-08 12:40:49,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:40:49,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:49,858 INFO L225 Difference]: With dead ends: 14614 [2019-09-08 12:40:49,858 INFO L226 Difference]: Without dead ends: 11050 [2019-09-08 12:40:49,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:40:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11050 states. [2019-09-08 12:40:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11050 to 4469. [2019-09-08 12:40:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4469 states. [2019-09-08 12:40:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4469 states to 4469 states and 6651 transitions. [2019-09-08 12:40:50,429 INFO L78 Accepts]: Start accepts. Automaton has 4469 states and 6651 transitions. Word has length 120 [2019-09-08 12:40:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:50,430 INFO L475 AbstractCegarLoop]: Abstraction has 4469 states and 6651 transitions. [2019-09-08 12:40:50,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 4469 states and 6651 transitions. [2019-09-08 12:40:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:50,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:50,433 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] [2019-09-08 12:40:50,433 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:50,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2082666138, now seen corresponding path program 1 times [2019-09-08 12:40:50,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:50,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:50,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:50,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:50,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:50,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:50,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:50,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:50,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:50,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:50,559 INFO L87 Difference]: Start difference. First operand 4469 states and 6651 transitions. Second operand 5 states. [2019-09-08 12:40:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:51,219 INFO L93 Difference]: Finished difference Result 9339 states and 13920 transitions. [2019-09-08 12:40:51,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:51,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:40:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:51,248 INFO L225 Difference]: With dead ends: 9339 [2019-09-08 12:40:51,248 INFO L226 Difference]: Without dead ends: 5775 [2019-09-08 12:40:51,262 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:40:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2019-09-08 12:40:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5067. [2019-09-08 12:40:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5067 states. [2019-09-08 12:40:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5067 states to 5067 states and 7545 transitions. [2019-09-08 12:40:51,953 INFO L78 Accepts]: Start accepts. Automaton has 5067 states and 7545 transitions. Word has length 120 [2019-09-08 12:40:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:51,954 INFO L475 AbstractCegarLoop]: Abstraction has 5067 states and 7545 transitions. [2019-09-08 12:40:51,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:51,954 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 7545 transitions. [2019-09-08 12:40:51,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:51,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:51,957 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] [2019-09-08 12:40:51,957 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:51,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:51,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1273267460, now seen corresponding path program 1 times [2019-09-08 12:40:51,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:51,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:51,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:52,226 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:40:52,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:52,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:52,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:52,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:52,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:52,230 INFO L87 Difference]: Start difference. First operand 5067 states and 7545 transitions. Second operand 9 states. [2019-09-08 12:40:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:53,573 INFO L93 Difference]: Finished difference Result 17430 states and 26022 transitions. [2019-09-08 12:40:53,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:40:53,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:53,602 INFO L225 Difference]: With dead ends: 17430 [2019-09-08 12:40:53,602 INFO L226 Difference]: Without dead ends: 13270 [2019-09-08 12:40:53,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:40:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13270 states. [2019-09-08 12:40:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13270 to 5987. [2019-09-08 12:40:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5987 states. [2019-09-08 12:40:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 8917 transitions. [2019-09-08 12:40:54,494 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 8917 transitions. Word has length 120 [2019-09-08 12:40:54,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:54,494 INFO L475 AbstractCegarLoop]: Abstraction has 5987 states and 8917 transitions. [2019-09-08 12:40:54,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 8917 transitions. [2019-09-08 12:40:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:54,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:54,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] [2019-09-08 12:40:54,497 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash -229628659, now seen corresponding path program 1 times [2019-09-08 12:40:54,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:54,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:54,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:54,625 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:40:54,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:54,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:54,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:54,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:54,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:54,627 INFO L87 Difference]: Start difference. First operand 5987 states and 8917 transitions. Second operand 5 states. [2019-09-08 12:40:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:55,572 INFO L93 Difference]: Finished difference Result 15802 states and 23588 transitions. [2019-09-08 12:40:55,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:40:55,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:40:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:55,599 INFO L225 Difference]: With dead ends: 15802 [2019-09-08 12:40:55,599 INFO L226 Difference]: Without dead ends: 11642 [2019-09-08 12:40:55,610 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:40:55,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11642 states. [2019-09-08 12:40:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11642 to 11384. [2019-09-08 12:40:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11384 states. [2019-09-08 12:40:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11384 states to 11384 states and 16988 transitions. [2019-09-08 12:40:56,745 INFO L78 Accepts]: Start accepts. Automaton has 11384 states and 16988 transitions. Word has length 120 [2019-09-08 12:40:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:56,746 INFO L475 AbstractCegarLoop]: Abstraction has 11384 states and 16988 transitions. [2019-09-08 12:40:56,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:40:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 11384 states and 16988 transitions. [2019-09-08 12:40:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:56,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:56,749 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] [2019-09-08 12:40:56,749 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:56,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1978649096, now seen corresponding path program 1 times [2019-09-08 12:40:56,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:56,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:56,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:56,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:56,857 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:40:56,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:56,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:40:56,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:40:56,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:40:56,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:40:56,859 INFO L87 Difference]: Start difference. First operand 11384 states and 16988 transitions. Second operand 5 states. [2019-09-08 12:40:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:58,329 INFO L93 Difference]: Finished difference Result 20260 states and 30163 transitions. [2019-09-08 12:40:58,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:40:58,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-08 12:40:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:58,373 INFO L225 Difference]: With dead ends: 20260 [2019-09-08 12:40:58,373 INFO L226 Difference]: Without dead ends: 20258 [2019-09-08 12:40:58,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:40:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20258 states. [2019-09-08 12:41:00,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20258 to 11472. [2019-09-08 12:41:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11472 states. [2019-09-08 12:41:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17054 transitions. [2019-09-08 12:41:00,016 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17054 transitions. Word has length 121 [2019-09-08 12:41:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:00,016 INFO L475 AbstractCegarLoop]: Abstraction has 11472 states and 17054 transitions. [2019-09-08 12:41:00,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17054 transitions. [2019-09-08 12:41:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:00,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:00,019 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] [2019-09-08 12:41:00,019 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:00,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash -690965260, now seen corresponding path program 1 times [2019-09-08 12:41:00,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:00,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:00,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:00,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:00,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:00,281 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:41:00,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:00,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:00,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:00,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:00,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:00,283 INFO L87 Difference]: Start difference. First operand 11472 states and 17054 transitions. Second operand 9 states. [2019-09-08 12:41:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:02,876 INFO L93 Difference]: Finished difference Result 33776 states and 50264 transitions. [2019-09-08 12:41:02,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:41:02,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:02,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:02,914 INFO L225 Difference]: With dead ends: 33776 [2019-09-08 12:41:02,915 INFO L226 Difference]: Without dead ends: 22570 [2019-09-08 12:41:02,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:41:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22570 states. [2019-09-08 12:41:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22570 to 11472. [2019-09-08 12:41:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11472 states. [2019-09-08 12:41:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17053 transitions. [2019-09-08 12:41:04,816 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17053 transitions. Word has length 121 [2019-09-08 12:41:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:04,816 INFO L475 AbstractCegarLoop]: Abstraction has 11472 states and 17053 transitions. [2019-09-08 12:41:04,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17053 transitions. [2019-09-08 12:41:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:41:04,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:04,819 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] [2019-09-08 12:41:04,819 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:04,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:04,820 INFO L82 PathProgramCache]: Analyzing trace with hash -66846392, now seen corresponding path program 1 times [2019-09-08 12:41:04,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:04,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:04,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:04,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:04,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:05,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:41:05,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:05,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:41:05,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:41:05,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:41:05,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:41:05,071 INFO L87 Difference]: Start difference. First operand 11472 states and 17053 transitions. Second operand 10 states. [2019-09-08 12:41:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:08,076 INFO L93 Difference]: Finished difference Result 31017 states and 46019 transitions. [2019-09-08 12:41:08,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:41:08,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2019-09-08 12:41:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:08,105 INFO L225 Difference]: With dead ends: 31017 [2019-09-08 12:41:08,105 INFO L226 Difference]: Without dead ends: 19750 [2019-09-08 12:41:08,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:41:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19750 states. [2019-09-08 12:41:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19750 to 11472. [2019-09-08 12:41:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11472 states. [2019-09-08 12:41:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17050 transitions. [2019-09-08 12:41:09,511 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17050 transitions. Word has length 122 [2019-09-08 12:41:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:09,512 INFO L475 AbstractCegarLoop]: Abstraction has 11472 states and 17050 transitions. [2019-09-08 12:41:09,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:41:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17050 transitions. [2019-09-08 12:41:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:41:09,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:09,515 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] [2019-09-08 12:41:09,515 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:09,516 INFO L82 PathProgramCache]: Analyzing trace with hash 593355322, now seen corresponding path program 1 times [2019-09-08 12:41:09,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:09,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:09,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:09,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:09,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:09,755 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:41:09,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:09,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:41:09,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:41:09,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:41:09,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:41:09,757 INFO L87 Difference]: Start difference. First operand 11472 states and 17050 transitions. Second operand 10 states. [2019-09-08 12:41:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:13,086 INFO L93 Difference]: Finished difference Result 34288 states and 50886 transitions. [2019-09-08 12:41:13,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:41:13,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2019-09-08 12:41:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:13,115 INFO L225 Difference]: With dead ends: 34288 [2019-09-08 12:41:13,115 INFO L226 Difference]: Without dead ends: 23043 [2019-09-08 12:41:13,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23043 states. [2019-09-08 12:41:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23043 to 11472. [2019-09-08 12:41:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11472 states. [2019-09-08 12:41:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17039 transitions. [2019-09-08 12:41:14,593 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17039 transitions. Word has length 122 [2019-09-08 12:41:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:14,594 INFO L475 AbstractCegarLoop]: Abstraction has 11472 states and 17039 transitions. [2019-09-08 12:41:14,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:41:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17039 transitions. [2019-09-08 12:41:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:41:14,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:14,596 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:14,596 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:14,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash -340793067, now seen corresponding path program 1 times [2019-09-08 12:41:14,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:14,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:14,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:14,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:14,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:14,905 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:41:14,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:14,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:41:14,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:41:14,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:41:14,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:41:14,907 INFO L87 Difference]: Start difference. First operand 11472 states and 17039 transitions. Second operand 10 states. [2019-09-08 12:41:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:20,855 INFO L93 Difference]: Finished difference Result 54393 states and 80280 transitions. [2019-09-08 12:41:20,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:41:20,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-08 12:41:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:20,896 INFO L225 Difference]: With dead ends: 54393 [2019-09-08 12:41:20,896 INFO L226 Difference]: Without dead ends: 43295 [2019-09-08 12:41:20,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:41:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43295 states. [2019-09-08 12:41:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43295 to 11529. [2019-09-08 12:41:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2019-09-08 12:41:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17115 transitions. [2019-09-08 12:41:23,241 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17115 transitions. Word has length 123 [2019-09-08 12:41:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:23,241 INFO L475 AbstractCegarLoop]: Abstraction has 11529 states and 17115 transitions. [2019-09-08 12:41:23,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:41:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17115 transitions. [2019-09-08 12:41:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:41:23,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:23,243 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] [2019-09-08 12:41:23,244 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:23,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:23,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1421082261, now seen corresponding path program 1 times [2019-09-08 12:41:23,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:23,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:23,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:23,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:23,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:23,479 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:41:23,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:23,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:41:23,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:41:23,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:41:23,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:41:23,482 INFO L87 Difference]: Start difference. First operand 11529 states and 17115 transitions. Second operand 10 states. [2019-09-08 12:41:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:27,906 INFO L93 Difference]: Finished difference Result 34362 states and 50951 transitions. [2019-09-08 12:41:27,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:41:27,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-09-08 12:41:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:27,928 INFO L225 Difference]: With dead ends: 34362 [2019-09-08 12:41:27,928 INFO L226 Difference]: Without dead ends: 23121 [2019-09-08 12:41:27,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23121 states. [2019-09-08 12:41:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23121 to 11529. [2019-09-08 12:41:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2019-09-08 12:41:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17100 transitions. [2019-09-08 12:41:29,475 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17100 transitions. Word has length 124 [2019-09-08 12:41:29,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:29,475 INFO L475 AbstractCegarLoop]: Abstraction has 11529 states and 17100 transitions. [2019-09-08 12:41:29,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:41:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17100 transitions. [2019-09-08 12:41:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:41:29,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:29,477 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] [2019-09-08 12:41:29,477 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:29,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:29,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1124170001, now seen corresponding path program 1 times [2019-09-08 12:41:29,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:29,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:29,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:29,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:29,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:29,686 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:41:29,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:29,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:41:29,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:41:29,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:41:29,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:41:29,688 INFO L87 Difference]: Start difference. First operand 11529 states and 17100 transitions. Second operand 10 states. [2019-09-08 12:41:31,194 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2019-09-08 12:41:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:34,205 INFO L93 Difference]: Finished difference Result 34460 states and 51064 transitions. [2019-09-08 12:41:34,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:41:34,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2019-09-08 12:41:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:34,227 INFO L225 Difference]: With dead ends: 34460 [2019-09-08 12:41:34,227 INFO L226 Difference]: Without dead ends: 23134 [2019-09-08 12:41:34,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23134 states. [2019-09-08 12:41:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23134 to 11529. [2019-09-08 12:41:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2019-09-08 12:41:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17094 transitions. [2019-09-08 12:41:35,829 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17094 transitions. Word has length 125 [2019-09-08 12:41:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:35,830 INFO L475 AbstractCegarLoop]: Abstraction has 11529 states and 17094 transitions. [2019-09-08 12:41:35,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:41:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17094 transitions. [2019-09-08 12:41:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:41:35,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:35,832 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] [2019-09-08 12:41:35,832 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1464723913, now seen corresponding path program 1 times [2019-09-08 12:41:35,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:35,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:35,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:36,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:36,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:41:36,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:41:36,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:41:36,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:41:36,064 INFO L87 Difference]: Start difference. First operand 11529 states and 17094 transitions. Second operand 10 states. [2019-09-08 12:41:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:40,248 INFO L93 Difference]: Finished difference Result 34232 states and 50722 transitions. [2019-09-08 12:41:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:41:40,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-09-08 12:41:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:40,271 INFO L225 Difference]: With dead ends: 34232 [2019-09-08 12:41:40,272 INFO L226 Difference]: Without dead ends: 23066 [2019-09-08 12:41:40,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23066 states. [2019-09-08 12:41:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23066 to 11529. [2019-09-08 12:41:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2019-09-08 12:41:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17077 transitions. [2019-09-08 12:41:42,155 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17077 transitions. Word has length 126 [2019-09-08 12:41:42,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:42,156 INFO L475 AbstractCegarLoop]: Abstraction has 11529 states and 17077 transitions. [2019-09-08 12:41:42,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:41:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17077 transitions. [2019-09-08 12:41:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:41:42,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:42,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:42,159 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:42,159 INFO L82 PathProgramCache]: Analyzing trace with hash 195353613, now seen corresponding path program 1 times [2019-09-08 12:41:42,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:42,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:42,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:42,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:42,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:43,201 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:41:43,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:43,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:41:43,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:41:43,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:41:43,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:41:43,204 INFO L87 Difference]: Start difference. First operand 11529 states and 17077 transitions. Second operand 19 states. [2019-09-08 12:41:44,001 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 12:41:44,289 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-08 12:41:44,622 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-08 12:41:44,804 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:41:44,949 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-08 12:41:45,194 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 12:41:45,464 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 12:41:45,617 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-08 12:41:45,878 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-08 12:41:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:56,830 INFO L93 Difference]: Finished difference Result 72572 states and 107902 transitions. [2019-09-08 12:41:56,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:41:56,831 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 127 [2019-09-08 12:41:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:56,891 INFO L225 Difference]: With dead ends: 72572 [2019-09-08 12:41:56,891 INFO L226 Difference]: Without dead ends: 62946 [2019-09-08 12:41:56,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:41:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62946 states. [2019-09-08 12:41:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62946 to 11559. [2019-09-08 12:41:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11559 states. [2019-09-08 12:41:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11559 states to 11559 states and 17103 transitions. [2019-09-08 12:41:59,486 INFO L78 Accepts]: Start accepts. Automaton has 11559 states and 17103 transitions. Word has length 127 [2019-09-08 12:41:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:59,486 INFO L475 AbstractCegarLoop]: Abstraction has 11559 states and 17103 transitions. [2019-09-08 12:41:59,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:41:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 11559 states and 17103 transitions. [2019-09-08 12:41:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:41:59,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:59,488 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] [2019-09-08 12:41:59,488 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash -944880079, now seen corresponding path program 1 times [2019-09-08 12:41:59,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:59,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:59,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:59,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:59,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:00,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:00,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:42:00,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:42:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:42:00,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:42:00,524 INFO L87 Difference]: Start difference. First operand 11559 states and 17103 transitions. Second operand 18 states. [2019-09-08 12:42:01,262 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-08 12:42:01,480 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-08 12:42:01,794 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-08 12:42:01,975 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:42:02,174 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:42:02,348 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 12:42:02,668 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 12:42:03,002 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 12:42:03,420 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 12:42:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:19,567 INFO L93 Difference]: Finished difference Result 82539 states and 122147 transitions. [2019-09-08 12:42:19,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:42:19,568 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 127 [2019-09-08 12:42:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:19,635 INFO L225 Difference]: With dead ends: 82539 [2019-09-08 12:42:19,635 INFO L226 Difference]: Without dead ends: 72343 [2019-09-08 12:42:19,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:42:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72343 states. [2019-09-08 12:42:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72343 to 11581. [2019-09-08 12:42:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11581 states. [2019-09-08 12:42:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11581 states to 11581 states and 17136 transitions. [2019-09-08 12:42:22,767 INFO L78 Accepts]: Start accepts. Automaton has 11581 states and 17136 transitions. Word has length 127 [2019-09-08 12:42:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:22,767 INFO L475 AbstractCegarLoop]: Abstraction has 11581 states and 17136 transitions. [2019-09-08 12:42:22,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:42:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 11581 states and 17136 transitions. [2019-09-08 12:42:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:42:22,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:22,769 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] [2019-09-08 12:42:22,769 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:22,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:22,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2019210254, now seen corresponding path program 1 times [2019-09-08 12:42:22,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:22,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:22,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:22,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:22,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:24,269 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:42:24,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:24,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 12:42:24,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 12:42:24,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 12:42:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:42:24,270 INFO L87 Difference]: Start difference. First operand 11581 states and 17136 transitions. Second operand 24 states. [2019-09-08 12:42:25,581 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 12:42:25,852 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 12:42:26,283 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-08 12:42:26,852 WARN L188 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-08 12:42:27,643 WARN L188 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 109 [2019-09-08 12:42:27,877 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:42:28,106 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:42:28,331 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-08 12:42:29,013 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:42:29,359 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-08 12:42:29,667 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-08 12:42:30,063 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-08 12:42:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:54,067 INFO L93 Difference]: Finished difference Result 94703 states and 140112 transitions. [2019-09-08 12:42:54,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 12:42:54,067 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2019-09-08 12:42:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:54,142 INFO L225 Difference]: With dead ends: 94703 [2019-09-08 12:42:54,142 INFO L226 Difference]: Without dead ends: 85109 [2019-09-08 12:42:54,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=532, Invalid=2120, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 12:42:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85109 states. [2019-09-08 12:42:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85109 to 11601. [2019-09-08 12:42:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11601 states. [2019-09-08 12:42:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11601 states to 11601 states and 17159 transitions. [2019-09-08 12:42:57,885 INFO L78 Accepts]: Start accepts. Automaton has 11601 states and 17159 transitions. Word has length 127 [2019-09-08 12:42:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:57,886 INFO L475 AbstractCegarLoop]: Abstraction has 11601 states and 17159 transitions. [2019-09-08 12:42:57,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 12:42:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 11601 states and 17159 transitions. [2019-09-08 12:42:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:42:57,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:57,887 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] [2019-09-08 12:42:57,887 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:57,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1008657458, now seen corresponding path program 1 times [2019-09-08 12:42:57,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:57,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:57,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:57,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:57,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:57,954 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:42:57,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:57,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:42:57,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:42:57,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:42:57,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:42:57,957 INFO L87 Difference]: Start difference. First operand 11601 states and 17159 transitions. Second operand 3 states. [2019-09-08 12:43:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:04,128 INFO L93 Difference]: Finished difference Result 33205 states and 49461 transitions. [2019-09-08 12:43:04,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:43:04,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-08 12:43:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:04,147 INFO L225 Difference]: With dead ends: 33205 [2019-09-08 12:43:04,148 INFO L226 Difference]: Without dead ends: 22107 [2019-09-08 12:43:04,155 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:43:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22107 states. [2019-09-08 12:43:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22107 to 21513. [2019-09-08 12:43:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21513 states. [2019-09-08 12:43:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21513 states to 21513 states and 31732 transitions. [2019-09-08 12:43:10,250 INFO L78 Accepts]: Start accepts. Automaton has 21513 states and 31732 transitions. Word has length 127 [2019-09-08 12:43:10,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:10,250 INFO L475 AbstractCegarLoop]: Abstraction has 21513 states and 31732 transitions. [2019-09-08 12:43:10,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:43:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 21513 states and 31732 transitions. [2019-09-08 12:43:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:43:10,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:10,252 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] [2019-09-08 12:43:10,252 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash 125385868, now seen corresponding path program 1 times [2019-09-08 12:43:10,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:10,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:10,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:10,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:10,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:11,243 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:43:11,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:11,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:43:11,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:43:11,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:43:11,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:43:11,244 INFO L87 Difference]: Start difference. First operand 21513 states and 31732 transitions. Second operand 19 states. [2019-09-08 12:43:11,862 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:43:12,051 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 12:43:12,369 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-08 12:43:12,701 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-08 12:43:12,885 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:43:13,254 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-08 12:43:13,536 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 12:43:13,699 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:43:13,951 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:43:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:34,843 INFO L93 Difference]: Finished difference Result 76381 states and 112890 transitions. [2019-09-08 12:43:34,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:43:34,843 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 127 [2019-09-08 12:43:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:34,904 INFO L225 Difference]: With dead ends: 76381 [2019-09-08 12:43:34,904 INFO L226 Difference]: Without dead ends: 67173 [2019-09-08 12:43:34,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:43:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67173 states. [2019-09-08 12:43:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67173 to 21503. [2019-09-08 12:43:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21503 states. [2019-09-08 12:43:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21503 states to 21503 states and 31712 transitions. [2019-09-08 12:43:42,169 INFO L78 Accepts]: Start accepts. Automaton has 21503 states and 31712 transitions. Word has length 127 [2019-09-08 12:43:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:42,169 INFO L475 AbstractCegarLoop]: Abstraction has 21503 states and 31712 transitions. [2019-09-08 12:43:42,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:43:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 21503 states and 31712 transitions. [2019-09-08 12:43:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:43:42,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:42,171 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] [2019-09-08 12:43:42,171 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:42,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:42,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1410801195, now seen corresponding path program 1 times [2019-09-08 12:43:42,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:42,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:42,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:42,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:42,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:43,059 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 12:43:43,303 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-08 12:43:43,906 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:43:43,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:43,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:43:43,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:43:43,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:43:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:43:43,908 INFO L87 Difference]: Start difference. First operand 21503 states and 31712 transitions. Second operand 25 states. [2019-09-08 12:43:45,029 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-08 12:43:45,306 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-08 12:43:45,665 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-08 12:43:46,060 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-09-08 12:43:46,560 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 109 [2019-09-08 12:43:47,086 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2019-09-08 12:43:47,331 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-08 12:43:47,845 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-08 12:43:48,320 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-08 12:43:48,561 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:43:48,942 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:43:49,418 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 12:43:49,857 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 12:44:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:31,758 INFO L93 Difference]: Finished difference Result 139097 states and 205728 transitions. [2019-09-08 12:44:31,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:44:31,758 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 127 [2019-09-08 12:44:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:31,889 INFO L225 Difference]: With dead ends: 139097 [2019-09-08 12:44:31,890 INFO L226 Difference]: Without dead ends: 119733 [2019-09-08 12:44:31,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:44:31,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119733 states. [2019-09-08 12:44:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119733 to 21521. [2019-09-08 12:44:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21521 states. [2019-09-08 12:44:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21521 states to 21521 states and 31732 transitions. [2019-09-08 12:44:40,450 INFO L78 Accepts]: Start accepts. Automaton has 21521 states and 31732 transitions. Word has length 127 [2019-09-08 12:44:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:40,450 INFO L475 AbstractCegarLoop]: Abstraction has 21521 states and 31732 transitions. [2019-09-08 12:44:40,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:44:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 21521 states and 31732 transitions. [2019-09-08 12:44:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:44:40,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:40,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] [2019-09-08 12:44:40,452 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:40,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2022749332, now seen corresponding path program 1 times [2019-09-08 12:44:40,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:40,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:40,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:40,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:41,268 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:44:41,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:41,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:44:41,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:44:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:44:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:44:41,269 INFO L87 Difference]: Start difference. First operand 21521 states and 31732 transitions. Second operand 17 states. [2019-09-08 12:44:42,052 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 12:44:42,292 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-09-08 12:44:42,451 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-08 12:44:42,610 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-08 12:44:42,828 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-08 12:44:43,024 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:44:43,193 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:45:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:08,514 INFO L93 Difference]: Finished difference Result 74380 states and 109995 transitions. [2019-09-08 12:45:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:45:08,515 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 127 [2019-09-08 12:45:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:08,574 INFO L225 Difference]: With dead ends: 74380 [2019-09-08 12:45:08,574 INFO L226 Difference]: Without dead ends: 65197 [2019-09-08 12:45:08,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:45:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65197 states. [2019-09-08 12:45:17,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65197 to 21481. [2019-09-08 12:45:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21481 states. [2019-09-08 12:45:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21481 states to 21481 states and 31682 transitions. [2019-09-08 12:45:17,824 INFO L78 Accepts]: Start accepts. Automaton has 21481 states and 31682 transitions. Word has length 127 [2019-09-08 12:45:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:17,825 INFO L475 AbstractCegarLoop]: Abstraction has 21481 states and 31682 transitions. [2019-09-08 12:45:17,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:45:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 21481 states and 31682 transitions. [2019-09-08 12:45:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:45:17,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:17,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:17,827 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:17,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1115215921, now seen corresponding path program 1 times [2019-09-08 12:45:17,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:17,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:17,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:17,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:17,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:17,969 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:45:17,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:17,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:45:17,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:45:17,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:45:17,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:45:17,970 INFO L87 Difference]: Start difference. First operand 21481 states and 31682 transitions. Second operand 4 states. [2019-09-08 12:45:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:30,028 INFO L93 Difference]: Finished difference Result 49953 states and 73872 transitions. [2019-09-08 12:45:30,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:30,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-08 12:45:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:30,056 INFO L225 Difference]: With dead ends: 49953 [2019-09-08 12:45:30,056 INFO L226 Difference]: Without dead ends: 28943 [2019-09-08 12:45:30,069 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:45:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28943 states. [2019-09-08 12:45:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28943 to 28833. [2019-09-08 12:45:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28833 states. [2019-09-08 12:45:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28833 states to 28833 states and 42410 transitions. [2019-09-08 12:45:41,134 INFO L78 Accepts]: Start accepts. Automaton has 28833 states and 42410 transitions. Word has length 128 [2019-09-08 12:45:41,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:41,134 INFO L475 AbstractCegarLoop]: Abstraction has 28833 states and 42410 transitions. [2019-09-08 12:45:41,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:45:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28833 states and 42410 transitions. [2019-09-08 12:45:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:45:41,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:41,136 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] [2019-09-08 12:45:41,136 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:41,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1141789032, now seen corresponding path program 1 times [2019-09-08 12:45:41,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:41,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:41,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:41,795 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-08 12:45:42,095 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:45:42,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:42,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:45:42,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:45:42,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:45:42,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:45:42,096 INFO L87 Difference]: Start difference. First operand 28833 states and 42410 transitions. Second operand 16 states. [2019-09-08 12:45:42,281 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-08 12:45:42,638 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:45:42,874 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 12:45:43,148 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:45:43,374 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-08 12:45:43,724 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-09-08 12:45:44,054 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-09-08 12:45:44,412 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-09-08 12:45:44,592 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 12:45:44,768 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 12:45:45,102 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-08 12:45:45,331 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 12:45:45,555 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:45:45,853 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2019-09-08 12:45:50,035 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-08 12:46:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:58,544 INFO L93 Difference]: Finished difference Result 196682 states and 289939 transitions. [2019-09-08 12:46:58,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:46:58,545 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 128 [2019-09-08 12:46:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:58,731 INFO L225 Difference]: With dead ends: 196682 [2019-09-08 12:46:58,731 INFO L226 Difference]: Without dead ends: 170970 [2019-09-08 12:46:58,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:46:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170970 states. [2019-09-08 12:47:12,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170970 to 28749. [2019-09-08 12:47:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28749 states. [2019-09-08 12:47:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28749 states to 28749 states and 42292 transitions. [2019-09-08 12:47:12,514 INFO L78 Accepts]: Start accepts. Automaton has 28749 states and 42292 transitions. Word has length 128 [2019-09-08 12:47:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:12,514 INFO L475 AbstractCegarLoop]: Abstraction has 28749 states and 42292 transitions. [2019-09-08 12:47:12,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:47:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 28749 states and 42292 transitions. [2019-09-08 12:47:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:47:12,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:12,516 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] [2019-09-08 12:47:12,516 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:12,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:12,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1623352999, now seen corresponding path program 1 times [2019-09-08 12:47:12,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:12,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:12,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:12,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:12,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:13,446 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:47:13,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:13,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:47:13,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:47:13,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:47:13,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:47:13,448 INFO L87 Difference]: Start difference. First operand 28749 states and 42292 transitions. Second operand 19 states. [2019-09-08 12:47:14,315 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:47:14,620 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-08 12:47:15,061 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-08 12:47:15,234 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:47:15,572 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:47:15,827 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:47:16,073 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:47:16,314 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:48:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:29,975 INFO L93 Difference]: Finished difference Result 181294 states and 267422 transitions. [2019-09-08 12:48:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:48:29,975 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2019-09-08 12:48:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:30,145 INFO L225 Difference]: With dead ends: 181294 [2019-09-08 12:48:30,145 INFO L226 Difference]: Without dead ends: 157345 [2019-09-08 12:48:30,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:48:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157345 states. [2019-09-08 12:48:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157345 to 28749. [2019-09-08 12:48:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28749 states. [2019-09-08 12:48:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28749 states to 28749 states and 42289 transitions. [2019-09-08 12:48:44,824 INFO L78 Accepts]: Start accepts. Automaton has 28749 states and 42289 transitions. Word has length 128 [2019-09-08 12:48:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:44,824 INFO L475 AbstractCegarLoop]: Abstraction has 28749 states and 42289 transitions. [2019-09-08 12:48:44,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:48:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 28749 states and 42289 transitions. [2019-09-08 12:48:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:48:44,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:44,826 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] [2019-09-08 12:48:44,826 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:44,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1665133977, now seen corresponding path program 1 times [2019-09-08 12:48:44,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:44,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:44,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:44,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:44,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:45,240 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 12:48:45,483 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:48:45,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:45,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:48:45,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:48:45,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:48:45,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:48:45,485 INFO L87 Difference]: Start difference. First operand 28749 states and 42289 transitions. Second operand 13 states. [2019-09-08 12:48:45,897 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 12:48:46,081 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:48:46,270 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:48:46,635 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:48:46,878 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 12:49:44,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:44,947 INFO L93 Difference]: Finished difference Result 137880 states and 203289 transitions. [2019-09-08 12:49:44,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:44,948 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 128 [2019-09-08 12:49:44,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:45,069 INFO L225 Difference]: With dead ends: 137880 [2019-09-08 12:49:45,069 INFO L226 Difference]: Without dead ends: 113976 [2019-09-08 12:49:45,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:49:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113976 states. [2019-09-08 12:50:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113976 to 28723. [2019-09-08 12:50:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2019-09-08 12:50:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 42255 transitions. [2019-09-08 12:50:00,473 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 42255 transitions. Word has length 128 [2019-09-08 12:50:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:00,474 INFO L475 AbstractCegarLoop]: Abstraction has 28723 states and 42255 transitions. [2019-09-08 12:50:00,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:50:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 42255 transitions. [2019-09-08 12:50:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:50:00,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:00,475 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] [2019-09-08 12:50:00,475 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1025878600, now seen corresponding path program 1 times [2019-09-08 12:50:00,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:00,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:00,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:01,378 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:50:01,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:01,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:50:01,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:50:01,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:50:01,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:50:01,379 INFO L87 Difference]: Start difference. First operand 28723 states and 42255 transitions. Second operand 16 states. [2019-09-08 12:50:02,146 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-08 12:50:02,340 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-08 12:50:02,532 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-08 12:50:02,909 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-08 12:50:03,176 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-08 12:50:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:34,955 INFO L93 Difference]: Finished difference Result 70839 states and 104422 transitions. [2019-09-08 12:50:34,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:50:34,956 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2019-09-08 12:50:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:35,012 INFO L225 Difference]: With dead ends: 70839 [2019-09-08 12:50:35,012 INFO L226 Difference]: Without dead ends: 59511 [2019-09-08 12:50:35,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:50:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59511 states. [2019-09-08 12:50:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59511 to 28653. [2019-09-08 12:50:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28653 states. [2019-09-08 12:50:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28653 states to 28653 states and 42173 transitions. [2019-09-08 12:50:50,679 INFO L78 Accepts]: Start accepts. Automaton has 28653 states and 42173 transitions. Word has length 129 [2019-09-08 12:50:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:50,679 INFO L475 AbstractCegarLoop]: Abstraction has 28653 states and 42173 transitions. [2019-09-08 12:50:50,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:50:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 28653 states and 42173 transitions. [2019-09-08 12:50:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:50:50,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:50,681 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] [2019-09-08 12:50:50,681 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:50,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:50,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1300257325, now seen corresponding path program 1 times [2019-09-08 12:50:50,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:50,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:50,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:51,286 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-08 12:50:51,552 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:50:51,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:51,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:50:51,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:50:51,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:50:51,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:50:51,554 INFO L87 Difference]: Start difference. First operand 28653 states and 42173 transitions. Second operand 14 states. [2019-09-08 12:50:52,151 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 12:50:52,303 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 12:50:52,446 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-08 12:50:52,659 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 12:50:52,854 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-08 12:51:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:55,083 INFO L93 Difference]: Finished difference Result 137753 states and 203138 transitions. [2019-09-08 12:51:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:51:55,084 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 129 [2019-09-08 12:51:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:55,195 INFO L225 Difference]: With dead ends: 137753 [2019-09-08 12:51:55,196 INFO L226 Difference]: Without dead ends: 113834 [2019-09-08 12:51:55,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:51:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113834 states. [2019-09-08 12:52:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113834 to 28609. [2019-09-08 12:52:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28609 states. [2019-09-08 12:52:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28609 states to 28609 states and 42121 transitions. [2019-09-08 12:52:11,759 INFO L78 Accepts]: Start accepts. Automaton has 28609 states and 42121 transitions. Word has length 129 [2019-09-08 12:52:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:11,759 INFO L475 AbstractCegarLoop]: Abstraction has 28609 states and 42121 transitions. [2019-09-08 12:52:11,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:52:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 28609 states and 42121 transitions. [2019-09-08 12:52:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:52:11,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:11,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] [2019-09-08 12:52:11,761 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash 29788909, now seen corresponding path program 1 times [2019-09-08 12:52:11,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:11,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:11,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:12,301 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:52:12,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:12,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:52:12,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:52:12,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:52:12,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:52:12,302 INFO L87 Difference]: Start difference. First operand 28609 states and 42121 transitions. Second operand 13 states. [2019-09-08 12:52:12,862 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-08 12:52:13,034 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 12:52:13,230 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 12:52:13,557 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-08 12:52:13,792 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:52:13,951 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-08 12:52:15,303 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:53:37,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:37,273 INFO L93 Difference]: Finished difference Result 166076 states and 244938 transitions. [2019-09-08 12:53:37,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:53:37,273 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-08 12:53:37,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:37,425 INFO L225 Difference]: With dead ends: 166076 [2019-09-08 12:53:37,425 INFO L226 Difference]: Without dead ends: 142147 [2019-09-08 12:53:37,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:53:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142147 states. [2019-09-08 12:53:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142147 to 28548. [2019-09-08 12:53:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28548 states. [2019-09-08 12:53:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28548 states to 28548 states and 42049 transitions. [2019-09-08 12:53:55,231 INFO L78 Accepts]: Start accepts. Automaton has 28548 states and 42049 transitions. Word has length 129 [2019-09-08 12:53:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:55,231 INFO L475 AbstractCegarLoop]: Abstraction has 28548 states and 42049 transitions. [2019-09-08 12:53:55,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:53:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 28548 states and 42049 transitions. [2019-09-08 12:53:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:53:55,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:55,232 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] [2019-09-08 12:53:55,232 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash -355232424, now seen corresponding path program 1 times [2019-09-08 12:53:55,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:55,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:55,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:55,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:55,829 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:53:55,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:55,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:53:55,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:53:55,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:53:55,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:53:55,830 INFO L87 Difference]: Start difference. First operand 28548 states and 42049 transitions. Second operand 13 states. [2019-09-08 12:53:56,312 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 12:53:56,487 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:53:56,670 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:53:57,045 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:53:57,287 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 12:53:57,428 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 12:54:00,929 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43