java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:06:03,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:06:03,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:06:03,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:06:03,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:06:03,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:06:03,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:06:03,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:06:03,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:06:03,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:06:03,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:06:03,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:06:03,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:06:03,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:06:03,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:06:03,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:06:03,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:06:03,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:06:03,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:06:03,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:06:03,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:06:03,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:06:03,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:06:03,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:06:03,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:06:03,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:06:03,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:06:03,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:06:03,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:06:03,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:06:03,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:06:03,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:06:03,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:06:03,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:06:03,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:06:03,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:06:03,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:06:03,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:06:03,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:06:03,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:06:03,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:06:03,056 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 11:06:03,070 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:06:03,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:06:03,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:06:03,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:06:03,072 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:06:03,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:06:03,072 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:06:03,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:06:03,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:06:03,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:06:03,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:06:03,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:06:03,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:06:03,074 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:06:03,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:06:03,074 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:06:03,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:06:03,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:06:03,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:06:03,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:06:03,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:06:03,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:06:03,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:06:03,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:06:03,076 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:06:03,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:06:03,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:06:03,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:06:03,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:06:03,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:06:03,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:06:03,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:06:03,132 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:06:03,133 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:06:03,133 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 11:06:03,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf50f613f/95ace435924a4571934c1eb10eca1432/FLAGdb48974a9 [2019-09-08 11:06:03,929 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:06:03,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 11:06:03,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf50f613f/95ace435924a4571934c1eb10eca1432/FLAGdb48974a9 [2019-09-08 11:06:04,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf50f613f/95ace435924a4571934c1eb10eca1432 [2019-09-08 11:06:04,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:06:04,065 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:06:04,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:06:04,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:06:04,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:06:04,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:06:04" (1/1) ... [2019-09-08 11:06:04,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55725c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:04, skipping insertion in model container [2019-09-08 11:06:04,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:06:04" (1/1) ... [2019-09-08 11:06:04,081 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:06:04,255 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:06:05,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:06:05,797 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:06:06,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:06:06,622 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:06:06,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:06 WrapperNode [2019-09-08 11:06:06,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:06:06,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:06:06,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:06:06,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:06:06,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:06" (1/1) ... [2019-09-08 11:06:06,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:06" (1/1) ... [2019-09-08 11:06:06,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:06" (1/1) ... [2019-09-08 11:06:06,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:06" (1/1) ... [2019-09-08 11:06:06,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:06" (1/1) ... [2019-09-08 11:06:06,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:06" (1/1) ... [2019-09-08 11:06:06,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:06" (1/1) ... [2019-09-08 11:06:06,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:06:06,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:06:06,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:06:06,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:06:06,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:06" (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 11:06:07,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:06:07,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:06:07,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:06:07,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:06:07,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:06:07,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:06:07,032 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:06:07,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:06:07,032 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:06:07,032 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:06:07,032 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:06:07,033 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:06:07,033 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:06:07,033 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:06:07,034 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:06:07,034 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:06:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:06:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:06:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:06:07,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:06:12,711 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:06:12,711 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:06:12,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:06:12 BoogieIcfgContainer [2019-09-08 11:06:12,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:06:12,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:06:12,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:06:12,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:06:12,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:06:04" (1/3) ... [2019-09-08 11:06:12,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59271a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:06:12, skipping insertion in model container [2019-09-08 11:06:12,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:06" (2/3) ... [2019-09-08 11:06:12,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59271a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:06:12, skipping insertion in model container [2019-09-08 11:06:12,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:06:12" (3/3) ... [2019-09-08 11:06:12,721 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 11:06:12,731 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:06:12,740 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-08 11:06:12,756 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-08 11:06:12,802 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:06:12,803 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:06:12,803 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:06:12,803 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:06:12,803 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:06:12,803 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:06:12,803 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:06:12,803 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:06:12,804 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:06:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states. [2019-09-08 11:06:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:06:12,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:12,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:12,888 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:12,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:12,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1451255380, now seen corresponding path program 1 times [2019-09-08 11:06:12,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:12,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:12,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:12,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:12,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:13,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:13,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:13,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:13,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:13,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:13,692 INFO L87 Difference]: Start difference. First operand 1764 states. Second operand 3 states. [2019-09-08 11:06:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:13,873 INFO L93 Difference]: Finished difference Result 2345 states and 4116 transitions. [2019-09-08 11:06:13,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:13,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 11:06:13,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:13,904 INFO L225 Difference]: With dead ends: 2345 [2019-09-08 11:06:13,905 INFO L226 Difference]: Without dead ends: 1991 [2019-09-08 11:06:13,912 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 11:06:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-09-08 11:06:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1981. [2019-09-08 11:06:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2019-09-08 11:06:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2665 transitions. [2019-09-08 11:06:14,033 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2665 transitions. Word has length 80 [2019-09-08 11:06:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:14,034 INFO L475 AbstractCegarLoop]: Abstraction has 1981 states and 2665 transitions. [2019-09-08 11:06:14,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2665 transitions. [2019-09-08 11:06:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:06:14,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:14,042 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:14,042 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:14,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:14,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1767927859, now seen corresponding path program 1 times [2019-09-08 11:06:14,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:14,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:14,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:14,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:14,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:14,323 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 11:06:14,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:14,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:06:14,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:06:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:06:14,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:06:14,326 INFO L87 Difference]: Start difference. First operand 1981 states and 2665 transitions. Second operand 6 states. [2019-09-08 11:06:15,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:15,964 INFO L93 Difference]: Finished difference Result 3750 states and 5226 transitions. [2019-09-08 11:06:15,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:06:15,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-09-08 11:06:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:15,976 INFO L225 Difference]: With dead ends: 3750 [2019-09-08 11:06:15,977 INFO L226 Difference]: Without dead ends: 2280 [2019-09-08 11:06:15,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:06:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2019-09-08 11:06:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2260. [2019-09-08 11:06:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2019-09-08 11:06:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3192 transitions. [2019-09-08 11:06:16,059 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3192 transitions. Word has length 80 [2019-09-08 11:06:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:16,060 INFO L475 AbstractCegarLoop]: Abstraction has 2260 states and 3192 transitions. [2019-09-08 11:06:16,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:06:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3192 transitions. [2019-09-08 11:06:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:06:16,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:16,066 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] [2019-09-08 11:06:16,067 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1294715305, now seen corresponding path program 1 times [2019-09-08 11:06:16,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:16,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:16,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:16,202 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 11:06:16,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:16,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:16,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:16,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:16,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:16,204 INFO L87 Difference]: Start difference. First operand 2260 states and 3192 transitions. Second operand 3 states. [2019-09-08 11:06:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:16,340 INFO L93 Difference]: Finished difference Result 4337 states and 6240 transitions. [2019-09-08 11:06:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:16,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:06:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:16,357 INFO L225 Difference]: With dead ends: 4337 [2019-09-08 11:06:16,357 INFO L226 Difference]: Without dead ends: 3248 [2019-09-08 11:06:16,361 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 11:06:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-09-08 11:06:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3234. [2019-09-08 11:06:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2019-09-08 11:06:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4559 transitions. [2019-09-08 11:06:16,469 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4559 transitions. Word has length 81 [2019-09-08 11:06:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:16,470 INFO L475 AbstractCegarLoop]: Abstraction has 3234 states and 4559 transitions. [2019-09-08 11:06:16,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4559 transitions. [2019-09-08 11:06:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:06:16,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:16,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] [2019-09-08 11:06:16,478 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:16,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2068721794, now seen corresponding path program 1 times [2019-09-08 11:06:16,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:16,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:16,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:16,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:16,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:16,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:16,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:06:16,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:06:16,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:06:16,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:06:16,724 INFO L87 Difference]: Start difference. First operand 3234 states and 4559 transitions. Second operand 5 states. [2019-09-08 11:06:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:18,154 INFO L93 Difference]: Finished difference Result 6800 states and 9847 transitions. [2019-09-08 11:06:18,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:06:18,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 11:06:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:18,176 INFO L225 Difference]: With dead ends: 6800 [2019-09-08 11:06:18,176 INFO L226 Difference]: Without dead ends: 4111 [2019-09-08 11:06:18,184 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 11:06:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2019-09-08 11:06:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 4101. [2019-09-08 11:06:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-09-08 11:06:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5946 transitions. [2019-09-08 11:06:18,357 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5946 transitions. Word has length 81 [2019-09-08 11:06:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:18,357 INFO L475 AbstractCegarLoop]: Abstraction has 4101 states and 5946 transitions. [2019-09-08 11:06:18,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:06:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5946 transitions. [2019-09-08 11:06:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:06:18,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:18,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:18,364 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash 383916093, now seen corresponding path program 1 times [2019-09-08 11:06:18,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:18,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:18,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:18,490 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 11:06:18,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:18,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:18,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:18,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:18,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:18,493 INFO L87 Difference]: Start difference. First operand 4101 states and 5946 transitions. Second operand 3 states. [2019-09-08 11:06:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:18,856 INFO L93 Difference]: Finished difference Result 8355 states and 12262 transitions. [2019-09-08 11:06:18,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:18,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 11:06:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:18,883 INFO L225 Difference]: With dead ends: 8355 [2019-09-08 11:06:18,884 INFO L226 Difference]: Without dead ends: 5795 [2019-09-08 11:06:18,890 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 11:06:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5795 states. [2019-09-08 11:06:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5795 to 5775. [2019-09-08 11:06:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5775 states. [2019-09-08 11:06:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5775 states to 5775 states and 8302 transitions. [2019-09-08 11:06:19,136 INFO L78 Accepts]: Start accepts. Automaton has 5775 states and 8302 transitions. Word has length 82 [2019-09-08 11:06:19,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:19,137 INFO L475 AbstractCegarLoop]: Abstraction has 5775 states and 8302 transitions. [2019-09-08 11:06:19,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 5775 states and 8302 transitions. [2019-09-08 11:06:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:06:19,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:19,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:19,146 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:19,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:19,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1654858470, now seen corresponding path program 1 times [2019-09-08 11:06:19,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:19,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:19,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:19,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:19,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:19,294 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 11:06:19,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:19,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:06:19,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:06:19,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:06:19,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:06:19,296 INFO L87 Difference]: Start difference. First operand 5775 states and 8302 transitions. Second operand 5 states. [2019-09-08 11:06:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:20,616 INFO L93 Difference]: Finished difference Result 13576 states and 19849 transitions. [2019-09-08 11:06:20,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:06:20,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 11:06:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:20,656 INFO L225 Difference]: With dead ends: 13576 [2019-09-08 11:06:20,656 INFO L226 Difference]: Without dead ends: 8628 [2019-09-08 11:06:20,669 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 11:06:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8628 states. [2019-09-08 11:06:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8628 to 8618. [2019-09-08 11:06:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8618 states. [2019-09-08 11:06:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8618 states to 8618 states and 12507 transitions. [2019-09-08 11:06:21,121 INFO L78 Accepts]: Start accepts. Automaton has 8618 states and 12507 transitions. Word has length 82 [2019-09-08 11:06:21,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:21,122 INFO L475 AbstractCegarLoop]: Abstraction has 8618 states and 12507 transitions. [2019-09-08 11:06:21,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:06:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 8618 states and 12507 transitions. [2019-09-08 11:06:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:06:21,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:21,131 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:21,132 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:21,132 INFO L82 PathProgramCache]: Analyzing trace with hash 882516511, now seen corresponding path program 1 times [2019-09-08 11:06:21,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:21,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:21,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:21,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:21,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:21,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:21,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:21,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:21,288 INFO L87 Difference]: Start difference. First operand 8618 states and 12507 transitions. Second operand 3 states. [2019-09-08 11:06:21,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:21,937 INFO L93 Difference]: Finished difference Result 17997 states and 26410 transitions. [2019-09-08 11:06:21,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:21,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 11:06:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:21,982 INFO L225 Difference]: With dead ends: 17997 [2019-09-08 11:06:21,982 INFO L226 Difference]: Without dead ends: 11753 [2019-09-08 11:06:21,997 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 11:06:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11753 states. [2019-09-08 11:06:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11753 to 11713. [2019-09-08 11:06:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11713 states. [2019-09-08 11:06:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11713 states to 11713 states and 16867 transitions. [2019-09-08 11:06:22,547 INFO L78 Accepts]: Start accepts. Automaton has 11713 states and 16867 transitions. Word has length 82 [2019-09-08 11:06:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:22,548 INFO L475 AbstractCegarLoop]: Abstraction has 11713 states and 16867 transitions. [2019-09-08 11:06:22,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 11713 states and 16867 transitions. [2019-09-08 11:06:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:06:22,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:22,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:22,560 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash 789996956, now seen corresponding path program 1 times [2019-09-08 11:06:22,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:22,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:22,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:22,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:22,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:22,700 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 11:06:22,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:22,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:22,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:22,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:22,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:22,702 INFO L87 Difference]: Start difference. First operand 11713 states and 16867 transitions. Second operand 3 states. [2019-09-08 11:06:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:23,724 INFO L93 Difference]: Finished difference Result 28989 states and 41704 transitions. [2019-09-08 11:06:23,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:23,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 11:06:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:23,774 INFO L225 Difference]: With dead ends: 28989 [2019-09-08 11:06:23,774 INFO L226 Difference]: Without dead ends: 20494 [2019-09-08 11:06:23,796 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 11:06:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20494 states. [2019-09-08 11:06:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20494 to 20484. [2019-09-08 11:06:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20484 states. [2019-09-08 11:06:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20484 states to 20484 states and 28929 transitions. [2019-09-08 11:06:25,596 INFO L78 Accepts]: Start accepts. Automaton has 20484 states and 28929 transitions. Word has length 82 [2019-09-08 11:06:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:25,596 INFO L475 AbstractCegarLoop]: Abstraction has 20484 states and 28929 transitions. [2019-09-08 11:06:25,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 20484 states and 28929 transitions. [2019-09-08 11:06:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:06:25,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:25,613 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:25,614 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:25,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:25,614 INFO L82 PathProgramCache]: Analyzing trace with hash 929120536, now seen corresponding path program 1 times [2019-09-08 11:06:25,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:25,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:25,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:25,779 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 11:06:25,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:25,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:06:25,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:06:25,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:06:25,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:06:25,780 INFO L87 Difference]: Start difference. First operand 20484 states and 28929 transitions. Second operand 7 states. [2019-09-08 11:06:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:29,778 INFO L93 Difference]: Finished difference Result 79493 states and 113846 transitions. [2019-09-08 11:06:29,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:06:29,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-09-08 11:06:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:29,941 INFO L225 Difference]: With dead ends: 79493 [2019-09-08 11:06:29,941 INFO L226 Difference]: Without dead ends: 72751 [2019-09-08 11:06:29,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:06:30,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72751 states. [2019-09-08 11:06:31,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72751 to 20532. [2019-09-08 11:06:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20532 states. [2019-09-08 11:06:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20532 states to 20532 states and 28993 transitions. [2019-09-08 11:06:31,481 INFO L78 Accepts]: Start accepts. Automaton has 20532 states and 28993 transitions. Word has length 83 [2019-09-08 11:06:31,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:31,481 INFO L475 AbstractCegarLoop]: Abstraction has 20532 states and 28993 transitions. [2019-09-08 11:06:31,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:06:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 20532 states and 28993 transitions. [2019-09-08 11:06:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:06:31,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:31,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:31,496 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:31,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:31,496 INFO L82 PathProgramCache]: Analyzing trace with hash 46675551, now seen corresponding path program 1 times [2019-09-08 11:06:31,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:31,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:31,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:31,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:31,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:31,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:31,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:06:31,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:06:31,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:06:31,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:06:31,661 INFO L87 Difference]: Start difference. First operand 20532 states and 28993 transitions. Second operand 7 states. [2019-09-08 11:06:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:37,351 INFO L93 Difference]: Finished difference Result 86162 states and 123242 transitions. [2019-09-08 11:06:37,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:06:37,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-09-08 11:06:37,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:37,471 INFO L225 Difference]: With dead ends: 86162 [2019-09-08 11:06:37,472 INFO L226 Difference]: Without dead ends: 78104 [2019-09-08 11:06:37,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:06:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78104 states. [2019-09-08 11:06:39,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78104 to 20712. [2019-09-08 11:06:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20712 states. [2019-09-08 11:06:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20712 states to 20712 states and 29233 transitions. [2019-09-08 11:06:39,081 INFO L78 Accepts]: Start accepts. Automaton has 20712 states and 29233 transitions. Word has length 83 [2019-09-08 11:06:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:39,082 INFO L475 AbstractCegarLoop]: Abstraction has 20712 states and 29233 transitions. [2019-09-08 11:06:39,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:06:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 20712 states and 29233 transitions. [2019-09-08 11:06:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:06:39,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:39,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:39,096 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:39,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:39,097 INFO L82 PathProgramCache]: Analyzing trace with hash 9887026, now seen corresponding path program 1 times [2019-09-08 11:06:39,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:39,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:39,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:39,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:39,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:39,246 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 11:06:39,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:39,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:06:39,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:06:39,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:06:39,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:06:39,247 INFO L87 Difference]: Start difference. First operand 20712 states and 29233 transitions. Second operand 7 states. [2019-09-08 11:06:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:46,266 INFO L93 Difference]: Finished difference Result 85892 states and 122732 transitions. [2019-09-08 11:06:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:06:46,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-09-08 11:06:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:46,359 INFO L225 Difference]: With dead ends: 85892 [2019-09-08 11:06:46,359 INFO L226 Difference]: Without dead ends: 77078 [2019-09-08 11:06:46,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:06:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77078 states. [2019-09-08 11:06:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77078 to 21080. [2019-09-08 11:06:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21080 states. [2019-09-08 11:06:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21080 states to 21080 states and 29725 transitions. [2019-09-08 11:06:47,956 INFO L78 Accepts]: Start accepts. Automaton has 21080 states and 29725 transitions. Word has length 83 [2019-09-08 11:06:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:47,957 INFO L475 AbstractCegarLoop]: Abstraction has 21080 states and 29725 transitions. [2019-09-08 11:06:47,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:06:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 21080 states and 29725 transitions. [2019-09-08 11:06:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:06:47,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:47,971 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:47,971 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash -325737957, now seen corresponding path program 1 times [2019-09-08 11:06:47,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:47,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:47,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:48,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 11:06:48,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:48,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:06:48,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:06:48,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:06:48,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:06:48,096 INFO L87 Difference]: Start difference. First operand 21080 states and 29725 transitions. Second operand 4 states. [2019-09-08 11:06:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:50,292 INFO L93 Difference]: Finished difference Result 33376 states and 47630 transitions. [2019-09-08 11:06:50,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:06:50,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-08 11:06:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:50,328 INFO L225 Difference]: With dead ends: 33376 [2019-09-08 11:06:50,328 INFO L226 Difference]: Without dead ends: 33374 [2019-09-08 11:06:50,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:06:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33374 states. [2019-09-08 11:06:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33374 to 21078. [2019-09-08 11:06:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21078 states. [2019-09-08 11:06:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21078 states to 21078 states and 29676 transitions. [2019-09-08 11:06:51,919 INFO L78 Accepts]: Start accepts. Automaton has 21078 states and 29676 transitions. Word has length 84 [2019-09-08 11:06:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:51,920 INFO L475 AbstractCegarLoop]: Abstraction has 21078 states and 29676 transitions. [2019-09-08 11:06:51,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:06:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 21078 states and 29676 transitions. [2019-09-08 11:06:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:06:51,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:51,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:51,931 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:51,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:51,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1023360400, now seen corresponding path program 1 times [2019-09-08 11:06:51,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:51,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:51,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:52,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:52,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:06:52,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:06:52,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:06:52,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:06:52,085 INFO L87 Difference]: Start difference. First operand 21078 states and 29676 transitions. Second operand 4 states. [2019-09-08 11:06:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:55,133 INFO L93 Difference]: Finished difference Result 33374 states and 47581 transitions. [2019-09-08 11:06:55,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:06:55,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-08 11:06:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:55,163 INFO L225 Difference]: With dead ends: 33374 [2019-09-08 11:06:55,164 INFO L226 Difference]: Without dead ends: 33372 [2019-09-08 11:06:55,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:06:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33372 states. [2019-09-08 11:06:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33372 to 21076. [2019-09-08 11:06:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21076 states. [2019-09-08 11:06:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21076 states to 21076 states and 29627 transitions. [2019-09-08 11:06:56,463 INFO L78 Accepts]: Start accepts. Automaton has 21076 states and 29627 transitions. Word has length 84 [2019-09-08 11:06:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:56,463 INFO L475 AbstractCegarLoop]: Abstraction has 21076 states and 29627 transitions. [2019-09-08 11:06:56,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:06:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 21076 states and 29627 transitions. [2019-09-08 11:06:56,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:06:56,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:56,474 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:56,474 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:56,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:56,474 INFO L82 PathProgramCache]: Analyzing trace with hash 213831720, now seen corresponding path program 1 times [2019-09-08 11:06:56,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:56,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:56,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:56,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:56,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:56,586 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 11:06:56,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:56,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:06:56,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:06:56,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:06:56,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:06:56,588 INFO L87 Difference]: Start difference. First operand 21076 states and 29627 transitions. Second operand 5 states. [2019-09-08 11:06:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:59,637 INFO L93 Difference]: Finished difference Result 48257 states and 67810 transitions. [2019-09-08 11:06:59,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:06:59,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-08 11:06:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:59,666 INFO L225 Difference]: With dead ends: 48257 [2019-09-08 11:06:59,666 INFO L226 Difference]: Without dead ends: 27990 [2019-09-08 11:06:59,690 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 11:06:59,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27990 states. [2019-09-08 11:07:01,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27990 to 27894. [2019-09-08 11:07:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27894 states. [2019-09-08 11:07:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27894 states to 27894 states and 38881 transitions. [2019-09-08 11:07:01,553 INFO L78 Accepts]: Start accepts. Automaton has 27894 states and 38881 transitions. Word has length 84 [2019-09-08 11:07:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:01,553 INFO L475 AbstractCegarLoop]: Abstraction has 27894 states and 38881 transitions. [2019-09-08 11:07:01,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:07:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 27894 states and 38881 transitions. [2019-09-08 11:07:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:07:01,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:01,567 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:07:01,567 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:01,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:01,567 INFO L82 PathProgramCache]: Analyzing trace with hash 130103504, now seen corresponding path program 1 times [2019-09-08 11:07:01,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:01,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:01,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:01,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:01,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:01,680 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 11:07:01,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:01,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:07:01,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:07:01,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:07:01,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:07:01,682 INFO L87 Difference]: Start difference. First operand 27894 states and 38881 transitions. Second operand 5 states. [2019-09-08 11:07:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:05,255 INFO L93 Difference]: Finished difference Result 65472 states and 91489 transitions. [2019-09-08 11:07:05,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:07:05,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-08 11:07:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:05,300 INFO L225 Difference]: With dead ends: 65472 [2019-09-08 11:07:05,300 INFO L226 Difference]: Without dead ends: 38454 [2019-09-08 11:07:05,341 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 11:07:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38454 states. [2019-09-08 11:07:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38454 to 27894. [2019-09-08 11:07:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27894 states. [2019-09-08 11:07:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27894 states to 27894 states and 38745 transitions. [2019-09-08 11:07:07,597 INFO L78 Accepts]: Start accepts. Automaton has 27894 states and 38745 transitions. Word has length 84 [2019-09-08 11:07:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:07,598 INFO L475 AbstractCegarLoop]: Abstraction has 27894 states and 38745 transitions. [2019-09-08 11:07:07,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:07:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 27894 states and 38745 transitions. [2019-09-08 11:07:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:07:07,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:07,605 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] [2019-09-08 11:07:07,606 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash 512159968, now seen corresponding path program 1 times [2019-09-08 11:07:07,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:07,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:07,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:07,742 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 11:07:07,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:07,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:07:07,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:07:07,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:07:07,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:07:07,747 INFO L87 Difference]: Start difference. First operand 27894 states and 38745 transitions. Second operand 7 states. [2019-09-08 11:07:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:19,603 INFO L93 Difference]: Finished difference Result 110698 states and 154895 transitions. [2019-09-08 11:07:19,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:07:19,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-09-08 11:07:19,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:19,711 INFO L225 Difference]: With dead ends: 110698 [2019-09-08 11:07:19,711 INFO L226 Difference]: Without dead ends: 98196 [2019-09-08 11:07:19,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:07:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98196 states. [2019-09-08 11:07:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98196 to 28523. [2019-09-08 11:07:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28523 states. [2019-09-08 11:07:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28523 states to 28523 states and 39593 transitions. [2019-09-08 11:07:22,593 INFO L78 Accepts]: Start accepts. Automaton has 28523 states and 39593 transitions. Word has length 85 [2019-09-08 11:07:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:22,593 INFO L475 AbstractCegarLoop]: Abstraction has 28523 states and 39593 transitions. [2019-09-08 11:07:22,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:07:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 28523 states and 39593 transitions. [2019-09-08 11:07:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:07:22,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:22,602 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] [2019-09-08 11:07:22,602 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash 700402578, now seen corresponding path program 1 times [2019-09-08 11:07:22,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:22,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:22,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:22,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:22,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:22,743 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 11:07:22,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:22,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:07:22,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:07:22,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:07:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:07:22,745 INFO L87 Difference]: Start difference. First operand 28523 states and 39593 transitions. Second operand 7 states. [2019-09-08 11:07:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:34,824 INFO L93 Difference]: Finished difference Result 104179 states and 145331 transitions. [2019-09-08 11:07:34,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:07:34,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-09-08 11:07:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:34,927 INFO L225 Difference]: With dead ends: 104179 [2019-09-08 11:07:34,927 INFO L226 Difference]: Without dead ends: 89585 [2019-09-08 11:07:34,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:07:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89585 states. [2019-09-08 11:07:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89585 to 28607. [2019-09-08 11:07:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28607 states. [2019-09-08 11:07:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28607 states to 28607 states and 39701 transitions. [2019-09-08 11:07:38,018 INFO L78 Accepts]: Start accepts. Automaton has 28607 states and 39701 transitions. Word has length 85 [2019-09-08 11:07:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:38,018 INFO L475 AbstractCegarLoop]: Abstraction has 28607 states and 39701 transitions. [2019-09-08 11:07:38,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:07:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 28607 states and 39701 transitions. [2019-09-08 11:07:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:07:38,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:38,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:07:38,028 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:38,028 INFO L82 PathProgramCache]: Analyzing trace with hash 789182652, now seen corresponding path program 1 times [2019-09-08 11:07:38,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:38,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:38,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:38,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:38,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:38,145 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 11:07:38,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:38,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:07:38,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:07:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:07:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:07:38,147 INFO L87 Difference]: Start difference. First operand 28607 states and 39701 transitions. Second operand 4 states. [2019-09-08 11:07:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:43,505 INFO L93 Difference]: Finished difference Result 46915 states and 65973 transitions. [2019-09-08 11:07:43,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:07:43,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-08 11:07:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:43,550 INFO L225 Difference]: With dead ends: 46915 [2019-09-08 11:07:43,550 INFO L226 Difference]: Without dead ends: 46913 [2019-09-08 11:07:43,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:07:43,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46913 states. [2019-09-08 11:07:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46913 to 28605. [2019-09-08 11:07:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28605 states. [2019-09-08 11:07:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28605 states to 28605 states and 39628 transitions. [2019-09-08 11:07:46,503 INFO L78 Accepts]: Start accepts. Automaton has 28605 states and 39628 transitions. Word has length 86 [2019-09-08 11:07:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:46,504 INFO L475 AbstractCegarLoop]: Abstraction has 28605 states and 39628 transitions. [2019-09-08 11:07:46,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:07:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28605 states and 39628 transitions. [2019-09-08 11:07:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:07:46,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:46,513 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] [2019-09-08 11:07:46,513 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash -423507048, now seen corresponding path program 1 times [2019-09-08 11:07:46,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:46,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:46,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:46,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:46,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:46,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 11:07:46,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:46,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:07:46,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:07:46,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:07:46,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:07:46,626 INFO L87 Difference]: Start difference. First operand 28605 states and 39628 transitions. Second operand 4 states. [2019-09-08 11:07:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:52,443 INFO L93 Difference]: Finished difference Result 46913 states and 65900 transitions. [2019-09-08 11:07:52,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:07:52,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-08 11:07:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:52,483 INFO L225 Difference]: With dead ends: 46913 [2019-09-08 11:07:52,483 INFO L226 Difference]: Without dead ends: 46911 [2019-09-08 11:07:52,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:07:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46911 states. [2019-09-08 11:07:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46911 to 28603. [2019-09-08 11:07:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28603 states. [2019-09-08 11:07:55,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28603 states to 28603 states and 39573 transitions. [2019-09-08 11:07:55,538 INFO L78 Accepts]: Start accepts. Automaton has 28603 states and 39573 transitions. Word has length 86 [2019-09-08 11:07:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:55,538 INFO L475 AbstractCegarLoop]: Abstraction has 28603 states and 39573 transitions. [2019-09-08 11:07:55,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:07:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 28603 states and 39573 transitions. [2019-09-08 11:07:55,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:07:55,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:55,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:07:55,550 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:55,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:55,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2070513849, now seen corresponding path program 1 times [2019-09-08 11:07:55,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:55,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:55,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:55,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:55,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:55,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 11:07:55,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:55,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:07:55,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:07:55,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:07:55,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:07:55,691 INFO L87 Difference]: Start difference. First operand 28603 states and 39573 transitions. Second operand 4 states. [2019-09-08 11:08:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:00,973 INFO L93 Difference]: Finished difference Result 46911 states and 65845 transitions. [2019-09-08 11:08:00,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:08:00,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-08 11:08:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:01,016 INFO L225 Difference]: With dead ends: 46911 [2019-09-08 11:08:01,016 INFO L226 Difference]: Without dead ends: 46909 [2019-09-08 11:08:01,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:08:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46909 states. [2019-09-08 11:08:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46909 to 28601. [2019-09-08 11:08:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28601 states. [2019-09-08 11:08:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28601 states to 28601 states and 39464 transitions. [2019-09-08 11:08:04,136 INFO L78 Accepts]: Start accepts. Automaton has 28601 states and 39464 transitions. Word has length 88 [2019-09-08 11:08:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:04,136 INFO L475 AbstractCegarLoop]: Abstraction has 28601 states and 39464 transitions. [2019-09-08 11:08:04,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:08:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 28601 states and 39464 transitions. [2019-09-08 11:08:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:08:04,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:04,151 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:08:04,151 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:04,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:04,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1498257638, now seen corresponding path program 1 times [2019-09-08 11:08:04,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:04,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:04,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:04,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:04,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:04,360 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 11:08:04,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:04,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:08:04,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:08:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:08:04,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:08:04,362 INFO L87 Difference]: Start difference. First operand 28601 states and 39464 transitions. Second operand 9 states. [2019-09-08 11:08:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:22,129 INFO L93 Difference]: Finished difference Result 117286 states and 165379 transitions. [2019-09-08 11:08:22,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:08:22,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 11:08:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:22,237 INFO L225 Difference]: With dead ends: 117286 [2019-09-08 11:08:22,237 INFO L226 Difference]: Without dead ends: 98962 [2019-09-08 11:08:22,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:08:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98962 states. [2019-09-08 11:08:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98962 to 28593. [2019-09-08 11:08:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28593 states. [2019-09-08 11:08:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28593 states to 28593 states and 39440 transitions. [2019-09-08 11:08:26,036 INFO L78 Accepts]: Start accepts. Automaton has 28593 states and 39440 transitions. Word has length 89 [2019-09-08 11:08:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:26,036 INFO L475 AbstractCegarLoop]: Abstraction has 28593 states and 39440 transitions. [2019-09-08 11:08:26,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:08:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 28593 states and 39440 transitions. [2019-09-08 11:08:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:08:26,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:26,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:08:26,047 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash -936806343, now seen corresponding path program 1 times [2019-09-08 11:08:26,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:26,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:26,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:26,182 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 11:08:26,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:26,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:08:26,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:08:26,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:08:26,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:08:26,183 INFO L87 Difference]: Start difference. First operand 28593 states and 39440 transitions. Second operand 7 states. [2019-09-08 11:08:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:43,749 INFO L93 Difference]: Finished difference Result 110161 states and 154034 transitions. [2019-09-08 11:08:43,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:08:43,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:08:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:43,849 INFO L225 Difference]: With dead ends: 110161 [2019-09-08 11:08:43,850 INFO L226 Difference]: Without dead ends: 97949 [2019-09-08 11:08:43,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:08:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97949 states. [2019-09-08 11:08:47,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97949 to 28713. [2019-09-08 11:08:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28713 states. [2019-09-08 11:08:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28713 states to 28713 states and 39600 transitions. [2019-09-08 11:08:47,848 INFO L78 Accepts]: Start accepts. Automaton has 28713 states and 39600 transitions. Word has length 89 [2019-09-08 11:08:47,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:47,848 INFO L475 AbstractCegarLoop]: Abstraction has 28713 states and 39600 transitions. [2019-09-08 11:08:47,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:08:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 28713 states and 39600 transitions. [2019-09-08 11:08:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:08:47,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:47,860 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:08:47,860 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:47,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1511138056, now seen corresponding path program 1 times [2019-09-08 11:08:47,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:47,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:47,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:47,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:47,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:48,166 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 11:08:48,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:48,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:08:48,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:08:48,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:08:48,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:08:48,167 INFO L87 Difference]: Start difference. First operand 28713 states and 39600 transitions. Second operand 10 states. [2019-09-08 11:09:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:11,152 INFO L93 Difference]: Finished difference Result 122383 states and 170821 transitions. [2019-09-08 11:09:11,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:09:11,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-08 11:09:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:11,278 INFO L225 Difference]: With dead ends: 122383 [2019-09-08 11:09:11,279 INFO L226 Difference]: Without dead ends: 116846 [2019-09-08 11:09:11,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:09:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116846 states. [2019-09-08 11:09:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116846 to 28717. [2019-09-08 11:09:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28717 states. [2019-09-08 11:09:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28717 states to 28717 states and 39603 transitions. [2019-09-08 11:09:16,008 INFO L78 Accepts]: Start accepts. Automaton has 28717 states and 39603 transitions. Word has length 89 [2019-09-08 11:09:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:16,008 INFO L475 AbstractCegarLoop]: Abstraction has 28717 states and 39603 transitions. [2019-09-08 11:09:16,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:09:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 28717 states and 39603 transitions. [2019-09-08 11:09:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:09:16,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:16,020 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:09:16,020 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:16,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:16,021 INFO L82 PathProgramCache]: Analyzing trace with hash -245468892, now seen corresponding path program 1 times [2019-09-08 11:09:16,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:16,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:16,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:16,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:16,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:16,244 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 11:09:16,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:16,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:09:16,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:09:16,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:09:16,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:09:16,250 INFO L87 Difference]: Start difference. First operand 28717 states and 39603 transitions. Second operand 9 states. [2019-09-08 11:09:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:36,874 INFO L93 Difference]: Finished difference Result 118169 states and 166621 transitions. [2019-09-08 11:09:36,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:09:36,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 11:09:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:36,989 INFO L225 Difference]: With dead ends: 118169 [2019-09-08 11:09:36,989 INFO L226 Difference]: Without dead ends: 99793 [2019-09-08 11:09:37,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:09:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99793 states. [2019-09-08 11:09:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99793 to 28683. [2019-09-08 11:09:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28683 states. [2019-09-08 11:09:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28683 states to 28683 states and 39551 transitions. [2019-09-08 11:09:41,706 INFO L78 Accepts]: Start accepts. Automaton has 28683 states and 39551 transitions. Word has length 89 [2019-09-08 11:09:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:41,706 INFO L475 AbstractCegarLoop]: Abstraction has 28683 states and 39551 transitions. [2019-09-08 11:09:41,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:09:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 28683 states and 39551 transitions. [2019-09-08 11:09:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:09:41,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:41,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:09:41,718 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:41,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:41,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1145017006, now seen corresponding path program 1 times [2019-09-08 11:09:41,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:41,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:41,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:41,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:41,843 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 11:09:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:41,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:09:41,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:09:41,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:09:41,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:09:41,844 INFO L87 Difference]: Start difference. First operand 28683 states and 39551 transitions. Second operand 7 states. [2019-09-08 11:10:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:05,016 INFO L93 Difference]: Finished difference Result 122729 states and 172280 transitions. [2019-09-08 11:10:05,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:10:05,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:10:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:05,147 INFO L225 Difference]: With dead ends: 122729 [2019-09-08 11:10:05,147 INFO L226 Difference]: Without dead ends: 110449 [2019-09-08 11:10:05,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:10:05,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110449 states. [2019-09-08 11:10:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110449 to 28743. [2019-09-08 11:10:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28743 states. [2019-09-08 11:10:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28743 states to 28743 states and 39631 transitions. [2019-09-08 11:10:10,234 INFO L78 Accepts]: Start accepts. Automaton has 28743 states and 39631 transitions. Word has length 89 [2019-09-08 11:10:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:10,234 INFO L475 AbstractCegarLoop]: Abstraction has 28743 states and 39631 transitions. [2019-09-08 11:10:10,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:10:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 28743 states and 39631 transitions. [2019-09-08 11:10:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:10:10,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:10,247 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] [2019-09-08 11:10:10,247 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1282236021, now seen corresponding path program 1 times [2019-09-08 11:10:10,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:10,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:10,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:10,719 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 11:10:10,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:10,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:10:10,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:10:10,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:10:10,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:10:10,721 INFO L87 Difference]: Start difference. First operand 28743 states and 39631 transitions. Second operand 12 states. [2019-09-08 11:10:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:41,951 INFO L93 Difference]: Finished difference Result 152535 states and 215986 transitions. [2019-09-08 11:10:41,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:10:41,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-08 11:10:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:42,098 INFO L225 Difference]: With dead ends: 152535 [2019-09-08 11:10:42,098 INFO L226 Difference]: Without dead ends: 133299 [2019-09-08 11:10:42,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:10:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133299 states. [2019-09-08 11:10:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133299 to 27795. [2019-09-08 11:10:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27795 states. [2019-09-08 11:10:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27795 states to 27795 states and 38379 transitions. [2019-09-08 11:10:47,965 INFO L78 Accepts]: Start accepts. Automaton has 27795 states and 38379 transitions. Word has length 90 [2019-09-08 11:10:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:47,965 INFO L475 AbstractCegarLoop]: Abstraction has 27795 states and 38379 transitions. [2019-09-08 11:10:47,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:10:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 27795 states and 38379 transitions. [2019-09-08 11:10:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:10:47,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:47,976 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] [2019-09-08 11:10:47,977 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1179261300, now seen corresponding path program 1 times [2019-09-08 11:10:47,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:47,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:47,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:48,289 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 11:10:48,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:48,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:10:48,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:10:48,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:10:48,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:10:48,292 INFO L87 Difference]: Start difference. First operand 27795 states and 38379 transitions. Second operand 10 states. [2019-09-08 11:11:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:20,682 INFO L93 Difference]: Finished difference Result 132612 states and 185687 transitions. [2019-09-08 11:11:20,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:11:20,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-08 11:11:20,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:20,814 INFO L225 Difference]: With dead ends: 132612 [2019-09-08 11:11:20,814 INFO L226 Difference]: Without dead ends: 123285 [2019-09-08 11:11:20,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:11:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123285 states. [2019-09-08 11:11:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123285 to 27791. [2019-09-08 11:11:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27791 states. [2019-09-08 11:11:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 38371 transitions. [2019-09-08 11:11:26,885 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 38371 transitions. Word has length 90 [2019-09-08 11:11:26,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:26,885 INFO L475 AbstractCegarLoop]: Abstraction has 27791 states and 38371 transitions. [2019-09-08 11:11:26,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:11:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 38371 transitions. [2019-09-08 11:11:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:11:26,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:26,896 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] [2019-09-08 11:11:26,896 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1003906654, now seen corresponding path program 1 times [2019-09-08 11:11:26,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:26,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:26,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:26,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:26,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:27,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:27,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 11:11:27,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:11:27,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:11:27,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:11:27,636 INFO L87 Difference]: Start difference. First operand 27791 states and 38371 transitions. Second operand 15 states. [2019-09-08 11:11:28,519 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 11:11:28,799 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-08 11:11:30,228 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-08 11:11:59,729 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-09-08 11:12:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:22,770 INFO L93 Difference]: Finished difference Result 208660 states and 296363 transitions. [2019-09-08 11:12:22,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:12:22,771 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-09-08 11:12:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:22,985 INFO L225 Difference]: With dead ends: 208660 [2019-09-08 11:12:22,986 INFO L226 Difference]: Without dead ends: 190328 [2019-09-08 11:12:23,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 11:12:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190328 states. [2019-09-08 11:12:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190328 to 27767. [2019-09-08 11:12:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27767 states. [2019-09-08 11:12:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27767 states to 27767 states and 38323 transitions. [2019-09-08 11:12:30,223 INFO L78 Accepts]: Start accepts. Automaton has 27767 states and 38323 transitions. Word has length 90 [2019-09-08 11:12:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:30,223 INFO L475 AbstractCegarLoop]: Abstraction has 27767 states and 38323 transitions. [2019-09-08 11:12:30,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 11:12:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 27767 states and 38323 transitions. [2019-09-08 11:12:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:12:30,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:30,234 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] [2019-09-08 11:12:30,234 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash -11377139, now seen corresponding path program 1 times [2019-09-08 11:12:30,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:30,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:30,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:30,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:30,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:30,710 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 11:12:30,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:30,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:12:30,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:12:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:12:30,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:12:30,712 INFO L87 Difference]: Start difference. First operand 27767 states and 38323 transitions. Second operand 13 states. [2019-09-08 11:12:31,190 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-08 11:12:31,346 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:12:31,547 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:12:32,188 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:12:32,593 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-08 11:13:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:21,116 INFO L93 Difference]: Finished difference Result 179650 states and 254282 transitions. [2019-09-08 11:13:21,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:13:21,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2019-09-08 11:13:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:21,295 INFO L225 Difference]: With dead ends: 179650 [2019-09-08 11:13:21,295 INFO L226 Difference]: Without dead ends: 160426 [2019-09-08 11:13:21,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2019-09-08 11:13:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160426 states. [2019-09-08 11:13:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160426 to 26839. [2019-09-08 11:13:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26839 states. [2019-09-08 11:13:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26839 states to 26839 states and 37089 transitions. [2019-09-08 11:13:29,580 INFO L78 Accepts]: Start accepts. Automaton has 26839 states and 37089 transitions. Word has length 90 [2019-09-08 11:13:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:29,580 INFO L475 AbstractCegarLoop]: Abstraction has 26839 states and 37089 transitions. [2019-09-08 11:13:29,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:13:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 26839 states and 37089 transitions. [2019-09-08 11:13:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:13:29,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:29,590 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] [2019-09-08 11:13:29,590 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:29,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:29,591 INFO L82 PathProgramCache]: Analyzing trace with hash 410133443, now seen corresponding path program 1 times [2019-09-08 11:13:29,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:29,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:29,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:29,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:29,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:29,716 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 11:13:29,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:29,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:13:29,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:13:29,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:13:29,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:29,718 INFO L87 Difference]: Start difference. First operand 26839 states and 37089 transitions. Second operand 7 states. [2019-09-08 11:14:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:05,481 INFO L93 Difference]: Finished difference Result 108313 states and 151565 transitions. [2019-09-08 11:14:05,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:14:05,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:14:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:05,581 INFO L225 Difference]: With dead ends: 108313 [2019-09-08 11:14:05,581 INFO L226 Difference]: Without dead ends: 96053 [2019-09-08 11:14:05,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:14:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96053 states. [2019-09-08 11:14:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96053 to 27095. [2019-09-08 11:14:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27095 states. [2019-09-08 11:14:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27095 states to 27095 states and 37435 transitions. [2019-09-08 11:14:16,053 INFO L78 Accepts]: Start accepts. Automaton has 27095 states and 37435 transitions. Word has length 90 [2019-09-08 11:14:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:16,054 INFO L475 AbstractCegarLoop]: Abstraction has 27095 states and 37435 transitions. [2019-09-08 11:14:16,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:14:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 27095 states and 37435 transitions. [2019-09-08 11:14:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 11:14:16,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:16,066 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] [2019-09-08 11:14:16,066 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:16,066 INFO L82 PathProgramCache]: Analyzing trace with hash 777788464, now seen corresponding path program 1 times [2019-09-08 11:14:16,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:16,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:16,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:16,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:16,267 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 11:14:16,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:16,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:14:16,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:14:16,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:14:16,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:14:16,269 INFO L87 Difference]: Start difference. First operand 27095 states and 37435 transitions. Second operand 9 states. [2019-09-08 11:14:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:52,516 INFO L93 Difference]: Finished difference Result 116267 states and 165141 transitions. [2019-09-08 11:14:52,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:14:52,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-08 11:14:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:52,611 INFO L225 Difference]: With dead ends: 116267 [2019-09-08 11:14:52,611 INFO L226 Difference]: Without dead ends: 97787 [2019-09-08 11:14:52,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:14:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97787 states. [2019-09-08 11:15:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97787 to 27009. [2019-09-08 11:15:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27009 states. [2019-09-08 11:15:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27009 states to 27009 states and 37311 transitions. [2019-09-08 11:15:00,988 INFO L78 Accepts]: Start accepts. Automaton has 27009 states and 37311 transitions. Word has length 91 [2019-09-08 11:15:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:00,988 INFO L475 AbstractCegarLoop]: Abstraction has 27009 states and 37311 transitions. [2019-09-08 11:15:00,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:15:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 27009 states and 37311 transitions. [2019-09-08 11:15:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 11:15:00,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:01,000 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] [2019-09-08 11:15:01,000 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash 339227022, now seen corresponding path program 1 times [2019-09-08 11:15:01,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:01,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:01,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:01,120 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 11:15:01,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:01,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:15:01,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:15:01,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:15:01,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:15:01,121 INFO L87 Difference]: Start difference. First operand 27009 states and 37311 transitions. Second operand 7 states. [2019-09-08 11:15:01,372 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-09-08 11:15:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:44,509 INFO L93 Difference]: Finished difference Result 122353 states and 172201 transitions. [2019-09-08 11:15:44,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:15:44,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-08 11:15:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:44,629 INFO L225 Difference]: With dead ends: 122353 [2019-09-08 11:15:44,629 INFO L226 Difference]: Without dead ends: 111127 [2019-09-08 11:15:44,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:15:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111127 states. [2019-09-08 11:15:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111127 to 27084. [2019-09-08 11:15:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27084 states. [2019-09-08 11:15:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27084 states to 27084 states and 37411 transitions. [2019-09-08 11:15:53,506 INFO L78 Accepts]: Start accepts. Automaton has 27084 states and 37411 transitions. Word has length 91 [2019-09-08 11:15:53,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:53,506 INFO L475 AbstractCegarLoop]: Abstraction has 27084 states and 37411 transitions. [2019-09-08 11:15:53,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:15:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 27084 states and 37411 transitions. [2019-09-08 11:15:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 11:15:53,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:53,517 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] [2019-09-08 11:15:53,518 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:53,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:53,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1108145253, now seen corresponding path program 1 times [2019-09-08 11:15:53,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:53,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:53,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:53,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:53,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:53,637 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 11:15:53,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:53,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:15:53,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:15:53,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:15:53,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:15:53,642 INFO L87 Difference]: Start difference. First operand 27084 states and 37411 transitions. Second operand 7 states. [2019-09-08 11:16:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:39,329 INFO L93 Difference]: Finished difference Result 121629 states and 170784 transitions. [2019-09-08 11:16:39,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:16:39,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-08 11:16:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:39,450 INFO L225 Difference]: With dead ends: 121629 [2019-09-08 11:16:39,450 INFO L226 Difference]: Without dead ends: 109185 [2019-09-08 11:16:39,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:16:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109185 states. [2019-09-08 11:16:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109185 to 27232. [2019-09-08 11:16:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27232 states. [2019-09-08 11:16:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27232 states to 27232 states and 37609 transitions. [2019-09-08 11:16:48,488 INFO L78 Accepts]: Start accepts. Automaton has 27232 states and 37609 transitions. Word has length 91 [2019-09-08 11:16:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:48,489 INFO L475 AbstractCegarLoop]: Abstraction has 27232 states and 37609 transitions. [2019-09-08 11:16:48,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:16:48,489 INFO L276 IsEmpty]: Start isEmpty. Operand 27232 states and 37609 transitions. [2019-09-08 11:16:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 11:16:48,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:48,500 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] [2019-09-08 11:16:48,501 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:48,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:48,501 INFO L82 PathProgramCache]: Analyzing trace with hash 170764348, now seen corresponding path program 1 times [2019-09-08 11:16:48,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:48,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:48,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:48,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:48,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:48,723 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 11:16:48,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:48,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:16:48,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:16:48,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:16:48,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:16:48,725 INFO L87 Difference]: Start difference. First operand 27232 states and 37609 transitions. Second operand 10 states. [2019-09-08 11:17:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:31,388 INFO L93 Difference]: Finished difference Result 124018 states and 174942 transitions. [2019-09-08 11:17:31,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:17:31,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-09-08 11:17:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:31,502 INFO L225 Difference]: With dead ends: 124018 [2019-09-08 11:17:31,502 INFO L226 Difference]: Without dead ends: 104592 [2019-09-08 11:17:31,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:17:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104592 states. [2019-09-08 11:17:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104592 to 26658. [2019-09-08 11:17:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26658 states. [2019-09-08 11:17:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26658 states to 26658 states and 36826 transitions. [2019-09-08 11:17:43,883 INFO L78 Accepts]: Start accepts. Automaton has 26658 states and 36826 transitions. Word has length 91 [2019-09-08 11:17:43,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:43,883 INFO L475 AbstractCegarLoop]: Abstraction has 26658 states and 36826 transitions. [2019-09-08 11:17:43,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:17:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 26658 states and 36826 transitions. [2019-09-08 11:17:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 11:17:43,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:43,895 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] [2019-09-08 11:17:43,895 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:43,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:43,895 INFO L82 PathProgramCache]: Analyzing trace with hash -832072873, now seen corresponding path program 1 times [2019-09-08 11:17:43,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:43,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:43,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:43,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:43,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:44,509 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 11:17:44,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:44,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:17:44,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:17:44,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:17:44,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:17:44,511 INFO L87 Difference]: Start difference. First operand 26658 states and 36826 transitions. Second operand 13 states. [2019-09-08 11:17:44,977 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-09-08 11:17:45,164 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 11:17:45,418 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-08 11:17:45,927 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-08 11:17:46,426 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-08 11:17:46,816 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-08 11:17:51,838 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 11:18:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:43,825 INFO L93 Difference]: Finished difference Result 158976 states and 225449 transitions. [2019-09-08 11:18:43,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:18:43,826 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2019-09-08 11:18:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:43,976 INFO L225 Difference]: With dead ends: 158976 [2019-09-08 11:18:43,977 INFO L226 Difference]: Without dead ends: 140397 [2019-09-08 11:18:44,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2019-09-08 11:18:44,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140397 states. [2019-09-08 11:18:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140397 to 26387. [2019-09-08 11:18:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26387 states. [2019-09-08 11:18:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26387 states to 26387 states and 36446 transitions. [2019-09-08 11:18:53,954 INFO L78 Accepts]: Start accepts. Automaton has 26387 states and 36446 transitions. Word has length 92 [2019-09-08 11:18:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:53,954 INFO L475 AbstractCegarLoop]: Abstraction has 26387 states and 36446 transitions. [2019-09-08 11:18:53,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:18:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 26387 states and 36446 transitions. [2019-09-08 11:18:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 11:18:53,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:53,965 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:18:53,965 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:53,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1799124670, now seen corresponding path program 1 times [2019-09-08 11:18:53,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:53,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:53,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:53,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:53,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:54,482 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-09-08 11:18:55,367 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 11:18:55,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:55,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 11:18:55,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 11:18:55,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 11:18:55,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:18:55,368 INFO L87 Difference]: Start difference. First operand 26387 states and 36446 transitions. Second operand 18 states. [2019-09-08 11:18:55,543 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 11:18:56,002 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 11:18:56,165 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-08 11:18:56,463 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 11:18:56,856 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-08 11:18:57,541 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-09-08 11:18:58,630 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-08 11:18:59,796 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-08 11:19:00,466 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-08 11:19:00,820 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-08 11:19:01,177 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-09-08 11:19:02,453 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 11:19:03,127 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 11:19:03,544 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 11:19:24,501 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-08 11:19:25,600 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 11:19:28,627 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43