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.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:48:12,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:48:12,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:48:12,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:48:12,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:48:12,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:48:12,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:48:12,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:48:12,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:48:12,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:48:12,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:48:12,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:48:12,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:48:12,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:48:12,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:48:12,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:48:12,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:48:12,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:48:12,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:48:12,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:48:12,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:48:12,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:48:12,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:48:12,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:48:12,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:48:12,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:48:12,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:48:12,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:48:12,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:48:12,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:48:12,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:48:12,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:48:12,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:48:12,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:48:12,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:48:12,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:48:12,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:48:12,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:48:12,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:48:12,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:48:12,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:48:12,547 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:48:12,564 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:48:12,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:48:12,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:48:12,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:48:12,566 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:48:12,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:48:12,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:48:12,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:48:12,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:48:12,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:48:12,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:48:12,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:48:12,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:48:12,570 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:48:12,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:48:12,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:48:12,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:48:12,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:48:12,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:48:12,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:48:12,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:48:12,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:48:12,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:48:12,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:48:12,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:48:12,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:48:12,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:48:12,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:48:12,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:48:12,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:48:12,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:48:12,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:48:12,623 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:48:12,623 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:48:12,624 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:48:12,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52497799b/4f08ef4c5a4d49679dd9c029fbbf413c/FLAG78702d4cf [2019-09-08 11:48:13,198 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:48:13,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:48:13,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52497799b/4f08ef4c5a4d49679dd9c029fbbf413c/FLAG78702d4cf [2019-09-08 11:48:13,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52497799b/4f08ef4c5a4d49679dd9c029fbbf413c [2019-09-08 11:48:13,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:48:13,529 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:48:13,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:48:13,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:48:13,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:48:13,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:48:13" (1/1) ... [2019-09-08 11:48:13,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@200f2ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:13, skipping insertion in model container [2019-09-08 11:48:13,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:48:13" (1/1) ... [2019-09-08 11:48:13,547 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:48:13,610 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:48:13,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:48:13,977 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:48:14,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:48:14,131 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:48:14,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:14 WrapperNode [2019-09-08 11:48:14,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:48:14,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:48:14,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:48:14,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:48:14,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:14" (1/1) ... [2019-09-08 11:48:14,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:14" (1/1) ... [2019-09-08 11:48:14,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:14" (1/1) ... [2019-09-08 11:48:14,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:14" (1/1) ... [2019-09-08 11:48:14,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:14" (1/1) ... [2019-09-08 11:48:14,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:14" (1/1) ... [2019-09-08 11:48:14,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:14" (1/1) ... [2019-09-08 11:48:14,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:48:14,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:48:14,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:48:14,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:48:14,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:14" (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:48:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:48:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:48:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:48:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:48:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:48:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:48:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:48:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:48:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:48:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:48:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:48:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:48:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:48:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:48:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:48:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:48:14,252 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:48:14,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:48:14,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:48:14,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:48:14,931 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:48:14,932 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:48:14,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:48:14 BoogieIcfgContainer [2019-09-08 11:48:14,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:48:14,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:48:14,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:48:14,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:48:14,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:48:13" (1/3) ... [2019-09-08 11:48:14,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c80f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:48:14, skipping insertion in model container [2019-09-08 11:48:14,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:14" (2/3) ... [2019-09-08 11:48:14,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c80f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:48:14, skipping insertion in model container [2019-09-08 11:48:14,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:48:14" (3/3) ... [2019-09-08 11:48:14,942 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:48:14,953 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:48:14,968 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:48:14,988 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:48:15,040 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:48:15,041 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:48:15,041 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:48:15,041 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:48:15,042 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:48:15,042 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:48:15,042 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:48:15,042 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:48:15,042 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:48:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2019-09-08 11:48:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:48:15,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:15,099 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] [2019-09-08 11:48:15,103 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash 892664727, now seen corresponding path program 1 times [2019-09-08 11:48:15,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:15,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:15,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:15,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:15,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:15,579 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:48:15,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:15,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:48:15,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:48:15,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:48:15,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:48:15,609 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2019-09-08 11:48:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:15,801 INFO L93 Difference]: Finished difference Result 252 states and 408 transitions. [2019-09-08 11:48:15,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:48:15,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 11:48:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:15,822 INFO L225 Difference]: With dead ends: 252 [2019-09-08 11:48:15,822 INFO L226 Difference]: Without dead ends: 188 [2019-09-08 11:48:15,826 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:48:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-08 11:48:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-09-08 11:48:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-08 11:48:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2019-09-08 11:48:15,894 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 65 [2019-09-08 11:48:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:15,894 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2019-09-08 11:48:15,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:48:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2019-09-08 11:48:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:48:15,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:15,898 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:15,898 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:15,899 INFO L82 PathProgramCache]: Analyzing trace with hash -863027836, now seen corresponding path program 1 times [2019-09-08 11:48:15,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:15,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:15,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:15,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:15,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:16,090 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:48:16,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:16,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:48:16,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:48:16,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:48:16,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:48:16,094 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand 5 states. [2019-09-08 11:48:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:16,424 INFO L93 Difference]: Finished difference Result 464 states and 696 transitions. [2019-09-08 11:48:16,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:48:16,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-08 11:48:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:16,429 INFO L225 Difference]: With dead ends: 464 [2019-09-08 11:48:16,429 INFO L226 Difference]: Without dead ends: 311 [2019-09-08 11:48:16,431 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:48:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-08 11:48:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-09-08 11:48:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-08 11:48:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 459 transitions. [2019-09-08 11:48:16,469 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 459 transitions. Word has length 67 [2019-09-08 11:48:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:16,470 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 459 transitions. [2019-09-08 11:48:16,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:48:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 459 transitions. [2019-09-08 11:48:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:48:16,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:16,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:16,474 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash -469367140, now seen corresponding path program 1 times [2019-09-08 11:48:16,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:16,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:16,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:16,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:16,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:16,643 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:48:16,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:16,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:48:16,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:48:16,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:48:16,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:48:16,646 INFO L87 Difference]: Start difference. First operand 309 states and 459 transitions. Second operand 5 states. [2019-09-08 11:48:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:16,845 INFO L93 Difference]: Finished difference Result 577 states and 875 transitions. [2019-09-08 11:48:16,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:48:16,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 11:48:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:16,850 INFO L225 Difference]: With dead ends: 577 [2019-09-08 11:48:16,851 INFO L226 Difference]: Without dead ends: 309 [2019-09-08 11:48:16,854 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:48:16,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-08 11:48:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2019-09-08 11:48:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-08 11:48:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 454 transitions. [2019-09-08 11:48:16,910 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 454 transitions. Word has length 68 [2019-09-08 11:48:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:16,910 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 454 transitions. [2019-09-08 11:48:16,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:48:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 454 transitions. [2019-09-08 11:48:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:48:16,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:16,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:16,914 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash 299075236, now seen corresponding path program 1 times [2019-09-08 11:48:16,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:16,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:16,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:17,051 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:48:17,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:17,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:48:17,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:48:17,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:48:17,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:48:17,053 INFO L87 Difference]: Start difference. First operand 309 states and 454 transitions. Second operand 6 states. [2019-09-08 11:48:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:17,275 INFO L93 Difference]: Finished difference Result 767 states and 1158 transitions. [2019-09-08 11:48:17,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:48:17,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 11:48:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:17,279 INFO L225 Difference]: With dead ends: 767 [2019-09-08 11:48:17,279 INFO L226 Difference]: Without dead ends: 503 [2019-09-08 11:48:17,281 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:48:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-08 11:48:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2019-09-08 11:48:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-08 11:48:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 745 transitions. [2019-09-08 11:48:17,319 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 745 transitions. Word has length 69 [2019-09-08 11:48:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:17,320 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 745 transitions. [2019-09-08 11:48:17,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:48:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 745 transitions. [2019-09-08 11:48:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:48:17,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:17,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:17,324 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1045896819, now seen corresponding path program 1 times [2019-09-08 11:48:17,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:17,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:17,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:17,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:17,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:17,423 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:48:17,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:17,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:48:17,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:48:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:48:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:48:17,425 INFO L87 Difference]: Start difference. First operand 501 states and 745 transitions. Second operand 5 states. [2019-09-08 11:48:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:17,613 INFO L93 Difference]: Finished difference Result 965 states and 1452 transitions. [2019-09-08 11:48:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:48:17,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-08 11:48:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:17,619 INFO L225 Difference]: With dead ends: 965 [2019-09-08 11:48:17,619 INFO L226 Difference]: Without dead ends: 501 [2019-09-08 11:48:17,622 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:48:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-09-08 11:48:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2019-09-08 11:48:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-08 11:48:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 736 transitions. [2019-09-08 11:48:17,658 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 736 transitions. Word has length 70 [2019-09-08 11:48:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:17,658 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 736 transitions. [2019-09-08 11:48:17,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:48:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 736 transitions. [2019-09-08 11:48:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:48:17,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:17,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:17,665 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:17,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:17,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1929984870, now seen corresponding path program 1 times [2019-09-08 11:48:17,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:17,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:17,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:17,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:17,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:17,835 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:48:17,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:17,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:48:17,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:48:17,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:48:17,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:48:17,836 INFO L87 Difference]: Start difference. First operand 501 states and 736 transitions. Second operand 5 states. [2019-09-08 11:48:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:18,004 INFO L93 Difference]: Finished difference Result 1429 states and 2143 transitions. [2019-09-08 11:48:18,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:48:18,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:48:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:18,015 INFO L225 Difference]: With dead ends: 1429 [2019-09-08 11:48:18,015 INFO L226 Difference]: Without dead ends: 1047 [2019-09-08 11:48:18,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:48:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-09-08 11:48:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 694. [2019-09-08 11:48:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-08 11:48:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1032 transitions. [2019-09-08 11:48:18,075 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1032 transitions. Word has length 71 [2019-09-08 11:48:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:18,077 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1032 transitions. [2019-09-08 11:48:18,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:48:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1032 transitions. [2019-09-08 11:48:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:48:18,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:18,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:18,079 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash -165846340, now seen corresponding path program 1 times [2019-09-08 11:48:18,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:18,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:18,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:18,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:18,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:18,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:18,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:48:18,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:48:18,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:48:18,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:48:18,234 INFO L87 Difference]: Start difference. First operand 694 states and 1032 transitions. Second operand 5 states. [2019-09-08 11:48:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:18,411 INFO L93 Difference]: Finished difference Result 1957 states and 2955 transitions. [2019-09-08 11:48:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:48:18,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:48:18,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:18,419 INFO L225 Difference]: With dead ends: 1957 [2019-09-08 11:48:18,419 INFO L226 Difference]: Without dead ends: 1377 [2019-09-08 11:48:18,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:48:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2019-09-08 11:48:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1121. [2019-09-08 11:48:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-09-08 11:48:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1686 transitions. [2019-09-08 11:48:18,537 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1686 transitions. Word has length 71 [2019-09-08 11:48:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:18,538 INFO L475 AbstractCegarLoop]: Abstraction has 1121 states and 1686 transitions. [2019-09-08 11:48:18,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:48:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1686 transitions. [2019-09-08 11:48:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:48:18,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:18,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:18,540 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:18,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:18,541 INFO L82 PathProgramCache]: Analyzing trace with hash -473955093, now seen corresponding path program 1 times [2019-09-08 11:48:18,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:18,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:18,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:18,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:18,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:18,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:18,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:48:18,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:48:18,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:48:18,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:48:18,662 INFO L87 Difference]: Start difference. First operand 1121 states and 1686 transitions. Second operand 5 states. [2019-09-08 11:48:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:18,843 INFO L93 Difference]: Finished difference Result 2515 states and 3811 transitions. [2019-09-08 11:48:18,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:48:18,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:48:18,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:18,851 INFO L225 Difference]: With dead ends: 2515 [2019-09-08 11:48:18,852 INFO L226 Difference]: Without dead ends: 1539 [2019-09-08 11:48:18,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:48:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-09-08 11:48:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1321. [2019-09-08 11:48:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-09-08 11:48:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1992 transitions. [2019-09-08 11:48:18,957 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1992 transitions. Word has length 71 [2019-09-08 11:48:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:18,957 INFO L475 AbstractCegarLoop]: Abstraction has 1321 states and 1992 transitions. [2019-09-08 11:48:18,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:48:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1992 transitions. [2019-09-08 11:48:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:48:18,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:18,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] [2019-09-08 11:48:18,965 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:18,966 INFO L82 PathProgramCache]: Analyzing trace with hash 500097299, now seen corresponding path program 1 times [2019-09-08 11:48:18,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:18,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:18,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:18,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:18,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:19,025 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:48:19,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:19,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:48:19,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:48:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:48:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:48:19,026 INFO L87 Difference]: Start difference. First operand 1321 states and 1992 transitions. Second operand 3 states. [2019-09-08 11:48:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:19,282 INFO L93 Difference]: Finished difference Result 3517 states and 5306 transitions. [2019-09-08 11:48:19,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:48:19,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-08 11:48:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:19,295 INFO L225 Difference]: With dead ends: 3517 [2019-09-08 11:48:19,295 INFO L226 Difference]: Without dead ends: 2343 [2019-09-08 11:48:19,299 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:48:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-09-08 11:48:19,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2293. [2019-09-08 11:48:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-09-08 11:48:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3396 transitions. [2019-09-08 11:48:19,494 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3396 transitions. Word has length 71 [2019-09-08 11:48:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:19,494 INFO L475 AbstractCegarLoop]: Abstraction has 2293 states and 3396 transitions. [2019-09-08 11:48:19,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:48:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3396 transitions. [2019-09-08 11:48:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:48:19,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:19,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] [2019-09-08 11:48:19,496 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:19,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:19,496 INFO L82 PathProgramCache]: Analyzing trace with hash 671723250, now seen corresponding path program 1 times [2019-09-08 11:48:19,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:19,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:19,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:19,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:19,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:19,555 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:48:19,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:19,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:48:19,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:48:19,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:48:19,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:48:19,557 INFO L87 Difference]: Start difference. First operand 2293 states and 3396 transitions. Second operand 3 states. [2019-09-08 11:48:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:19,775 INFO L93 Difference]: Finished difference Result 4441 states and 6598 transitions. [2019-09-08 11:48:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:48:19,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-08 11:48:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:19,790 INFO L225 Difference]: With dead ends: 4441 [2019-09-08 11:48:19,797 INFO L226 Difference]: Without dead ends: 2295 [2019-09-08 11:48:19,804 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:48:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2019-09-08 11:48:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2293. [2019-09-08 11:48:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-09-08 11:48:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3388 transitions. [2019-09-08 11:48:20,039 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3388 transitions. Word has length 71 [2019-09-08 11:48:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:20,039 INFO L475 AbstractCegarLoop]: Abstraction has 2293 states and 3388 transitions. [2019-09-08 11:48:20,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:48:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3388 transitions. [2019-09-08 11:48:20,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:48:20,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:20,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] [2019-09-08 11:48:20,042 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:20,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:20,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1753966399, now seen corresponding path program 1 times [2019-09-08 11:48:20,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:20,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:20,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:20,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:20,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:20,162 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:48:20,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:20,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:48:20,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:48:20,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:48:20,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:48:20,163 INFO L87 Difference]: Start difference. First operand 2293 states and 3388 transitions. Second operand 5 states. [2019-09-08 11:48:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:20,642 INFO L93 Difference]: Finished difference Result 7528 states and 11163 transitions. [2019-09-08 11:48:20,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:48:20,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:48:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:20,668 INFO L225 Difference]: With dead ends: 7528 [2019-09-08 11:48:20,669 INFO L226 Difference]: Without dead ends: 5382 [2019-09-08 11:48:20,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:48:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2019-09-08 11:48:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 5188. [2019-09-08 11:48:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-09-08 11:48:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7691 transitions. [2019-09-08 11:48:21,072 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7691 transitions. Word has length 71 [2019-09-08 11:48:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:21,072 INFO L475 AbstractCegarLoop]: Abstraction has 5188 states and 7691 transitions. [2019-09-08 11:48:21,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:48:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7691 transitions. [2019-09-08 11:48:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:48:21,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:21,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:21,074 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1515656525, now seen corresponding path program 1 times [2019-09-08 11:48:21,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:21,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:21,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:21,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:21,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:21,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:21,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:48:21,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:48:21,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:48:21,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:48:21,290 INFO L87 Difference]: Start difference. First operand 5188 states and 7691 transitions. Second operand 10 states. [2019-09-08 11:48:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:22,975 INFO L93 Difference]: Finished difference Result 15496 states and 22903 transitions. [2019-09-08 11:48:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:48:22,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 11:48:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:23,044 INFO L225 Difference]: With dead ends: 15496 [2019-09-08 11:48:23,044 INFO L226 Difference]: Without dead ends: 10472 [2019-09-08 11:48:23,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:48:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10472 states. [2019-09-08 11:48:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10472 to 5188. [2019-09-08 11:48:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-09-08 11:48:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7681 transitions. [2019-09-08 11:48:23,587 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7681 transitions. Word has length 72 [2019-09-08 11:48:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:23,588 INFO L475 AbstractCegarLoop]: Abstraction has 5188 states and 7681 transitions. [2019-09-08 11:48:23,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:48:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7681 transitions. [2019-09-08 11:48:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:48:23,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:23,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] [2019-09-08 11:48:23,590 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1460244248, now seen corresponding path program 1 times [2019-09-08 11:48:23,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:23,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:23,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:23,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:23,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:23,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:23,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:48:23,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:48:23,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:48:23,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:48:23,814 INFO L87 Difference]: Start difference. First operand 5188 states and 7681 transitions. Second operand 10 states. [2019-09-08 11:48:25,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:25,548 INFO L93 Difference]: Finished difference Result 15603 states and 23019 transitions. [2019-09-08 11:48:25,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:48:25,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-09-08 11:48:25,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:25,574 INFO L225 Difference]: With dead ends: 15603 [2019-09-08 11:48:25,574 INFO L226 Difference]: Without dead ends: 10529 [2019-09-08 11:48:25,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:48:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10529 states. [2019-09-08 11:48:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10529 to 5188. [2019-09-08 11:48:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-09-08 11:48:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7678 transitions. [2019-09-08 11:48:26,184 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7678 transitions. Word has length 73 [2019-09-08 11:48:26,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:26,184 INFO L475 AbstractCegarLoop]: Abstraction has 5188 states and 7678 transitions. [2019-09-08 11:48:26,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:48:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7678 transitions. [2019-09-08 11:48:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:48:26,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:26,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:26,186 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:26,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:26,186 INFO L82 PathProgramCache]: Analyzing trace with hash 236126643, now seen corresponding path program 1 times [2019-09-08 11:48:26,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:26,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:26,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:26,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:26,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:26,404 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:48:26,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:26,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:48:26,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:48:26,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:48:26,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:48:26,406 INFO L87 Difference]: Start difference. First operand 5188 states and 7678 transitions. Second operand 9 states. [2019-09-08 11:48:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:27,963 INFO L93 Difference]: Finished difference Result 17685 states and 26298 transitions. [2019-09-08 11:48:27,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:48:27,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 11:48:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:27,992 INFO L225 Difference]: With dead ends: 17685 [2019-09-08 11:48:27,992 INFO L226 Difference]: Without dead ends: 12626 [2019-09-08 11:48:28,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:48:28,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12626 states. [2019-09-08 11:48:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12626 to 5188. [2019-09-08 11:48:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-09-08 11:48:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7677 transitions. [2019-09-08 11:48:28,677 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7677 transitions. Word has length 73 [2019-09-08 11:48:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:28,677 INFO L475 AbstractCegarLoop]: Abstraction has 5188 states and 7677 transitions. [2019-09-08 11:48:28,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:48:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7677 transitions. [2019-09-08 11:48:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:48:28,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:28,678 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:28,679 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1277245649, now seen corresponding path program 1 times [2019-09-08 11:48:28,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:28,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:28,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:28,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:28,878 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:48:28,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:28,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:48:28,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:48:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:48:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:48:28,880 INFO L87 Difference]: Start difference. First operand 5188 states and 7677 transitions. Second operand 10 states. [2019-09-08 11:48:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:30,873 INFO L93 Difference]: Finished difference Result 15546 states and 22954 transitions. [2019-09-08 11:48:30,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:48:30,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-08 11:48:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:30,892 INFO L225 Difference]: With dead ends: 15546 [2019-09-08 11:48:30,892 INFO L226 Difference]: Without dead ends: 10486 [2019-09-08 11:48:30,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:48:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10486 states. [2019-09-08 11:48:31,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10486 to 5188. [2019-09-08 11:48:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-09-08 11:48:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7671 transitions. [2019-09-08 11:48:31,585 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7671 transitions. Word has length 74 [2019-09-08 11:48:31,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:31,586 INFO L475 AbstractCegarLoop]: Abstraction has 5188 states and 7671 transitions. [2019-09-08 11:48:31,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:48:31,586 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7671 transitions. [2019-09-08 11:48:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:48:31,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:31,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:31,588 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:31,588 INFO L82 PathProgramCache]: Analyzing trace with hash -484955932, now seen corresponding path program 1 times [2019-09-08 11:48:31,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:31,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:31,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:31,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:32,356 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 11:48:33,418 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:48:33,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:33,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 11:48:33,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 11:48:33,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 11:48:33,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:48:33,421 INFO L87 Difference]: Start difference. First operand 5188 states and 7671 transitions. Second operand 24 states. [2019-09-08 11:48:33,566 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 11:48:34,448 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 11:48:34,689 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-08 11:48:34,951 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-08 11:48:35,334 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-08 11:48:35,822 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 107 [2019-09-08 11:48:36,374 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2019-09-08 11:48:36,639 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-08 11:48:36,899 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-08 11:48:37,381 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 11:48:37,764 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 11:48:38,175 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-08 11:48:38,683 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-08 11:48:38,943 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-08 11:48:39,378 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 11:48:41,501 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-08 11:48:45,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:45,205 INFO L93 Difference]: Finished difference Result 46785 states and 69407 transitions. [2019-09-08 11:48:45,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 11:48:45,206 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-09-08 11:48:45,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:45,268 INFO L225 Difference]: With dead ends: 46785 [2019-09-08 11:48:45,268 INFO L226 Difference]: Without dead ends: 41768 [2019-09-08 11:48:45,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=506, Invalid=2044, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 11:48:45,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41768 states. [2019-09-08 11:48:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41768 to 5218. [2019-09-08 11:48:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-09-08 11:48:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 7707 transitions. [2019-09-08 11:48:46,268 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 7707 transitions. Word has length 75 [2019-09-08 11:48:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:46,268 INFO L475 AbstractCegarLoop]: Abstraction has 5218 states and 7707 transitions. [2019-09-08 11:48:46,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 11:48:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 7707 transitions. [2019-09-08 11:48:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:48:46,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:46,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:46,273 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:46,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:46,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1158728316, now seen corresponding path program 1 times [2019-09-08 11:48:46,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:46,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:46,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:46,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:47,972 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:48:47,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:47,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 11:48:47,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 11:48:47,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 11:48:47,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:48:47,974 INFO L87 Difference]: Start difference. First operand 5218 states and 7707 transitions. Second operand 24 states. [2019-09-08 11:48:48,176 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 11:48:48,929 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 11:48:49,128 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 11:48:49,376 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 11:48:49,649 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-08 11:48:49,996 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-08 11:48:50,436 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2019-09-08 11:48:51,078 WARN L188 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 119 [2019-09-08 11:48:51,320 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-08 11:48:51,563 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-08 11:48:51,798 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-08 11:48:52,384 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-08 11:48:52,806 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-08 11:48:53,061 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-08 11:48:53,431 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-08 11:48:55,763 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 11:48:59,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:59,689 INFO L93 Difference]: Finished difference Result 35500 states and 52664 transitions. [2019-09-08 11:48:59,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 11:48:59,690 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-09-08 11:48:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:59,734 INFO L225 Difference]: With dead ends: 35500 [2019-09-08 11:48:59,734 INFO L226 Difference]: Without dead ends: 30482 [2019-09-08 11:48:59,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=513, Invalid=2037, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 11:48:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30482 states. [2019-09-08 11:49:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30482 to 5210. [2019-09-08 11:49:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5210 states. [2019-09-08 11:49:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5210 states to 5210 states and 7693 transitions. [2019-09-08 11:49:01,016 INFO L78 Accepts]: Start accepts. Automaton has 5210 states and 7693 transitions. Word has length 75 [2019-09-08 11:49:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:01,017 INFO L475 AbstractCegarLoop]: Abstraction has 5210 states and 7693 transitions. [2019-09-08 11:49:01,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 11:49:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 5210 states and 7693 transitions. [2019-09-08 11:49:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:49:01,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:01,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:01,019 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:01,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1924985380, now seen corresponding path program 1 times [2019-09-08 11:49:01,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:01,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:01,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:01,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:01,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:02,000 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 11:49:02,773 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:49:02,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:02,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 11:49:02,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 11:49:02,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 11:49:02,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:49:02,774 INFO L87 Difference]: Start difference. First operand 5210 states and 7693 transitions. Second operand 25 states. [2019-09-08 11:49:03,710 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-08 11:49:03,956 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-08 11:49:04,305 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-08 11:49:04,711 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-08 11:49:05,281 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 120 [2019-09-08 11:49:05,906 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 133 [2019-09-08 11:49:06,149 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 11:49:06,316 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-08 11:49:06,672 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-08 11:49:07,082 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 11:49:07,295 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-08 11:49:07,634 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-08 11:49:08,074 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-08 11:49:08,454 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-08 11:49:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:13,606 INFO L93 Difference]: Finished difference Result 21771 states and 32252 transitions. [2019-09-08 11:49:13,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 11:49:13,607 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2019-09-08 11:49:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:13,632 INFO L225 Difference]: With dead ends: 21771 [2019-09-08 11:49:13,632 INFO L226 Difference]: Without dead ends: 18896 [2019-09-08 11:49:13,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 11:49:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18896 states. [2019-09-08 11:49:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18896 to 5218. [2019-09-08 11:49:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-09-08 11:49:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 7699 transitions. [2019-09-08 11:49:15,268 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 7699 transitions. Word has length 75 [2019-09-08 11:49:15,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:15,268 INFO L475 AbstractCegarLoop]: Abstraction has 5218 states and 7699 transitions. [2019-09-08 11:49:15,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 11:49:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 7699 transitions. [2019-09-08 11:49:15,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:49:15,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:15,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:15,270 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:15,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:15,270 INFO L82 PathProgramCache]: Analyzing trace with hash -766941881, now seen corresponding path program 1 times [2019-09-08 11:49:15,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:15,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:15,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:15,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:15,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:15,388 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:49:15,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:15,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:49:15,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:49:15,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:49:15,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:49:15,390 INFO L87 Difference]: Start difference. First operand 5218 states and 7699 transitions. Second operand 4 states. [2019-09-08 11:49:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:16,997 INFO L93 Difference]: Finished difference Result 12405 states and 18394 transitions. [2019-09-08 11:49:16,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:49:16,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-08 11:49:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:17,006 INFO L225 Difference]: With dead ends: 12405 [2019-09-08 11:49:17,006 INFO L226 Difference]: Without dead ends: 7391 [2019-09-08 11:49:17,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:49:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2019-09-08 11:49:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 7339. [2019-09-08 11:49:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7339 states. [2019-09-08 11:49:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7339 states to 7339 states and 10782 transitions. [2019-09-08 11:49:18,622 INFO L78 Accepts]: Start accepts. Automaton has 7339 states and 10782 transitions. Word has length 76 [2019-09-08 11:49:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:18,622 INFO L475 AbstractCegarLoop]: Abstraction has 7339 states and 10782 transitions. [2019-09-08 11:49:18,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:49:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7339 states and 10782 transitions. [2019-09-08 11:49:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:49:18,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:18,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:18,623 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash 95389579, now seen corresponding path program 1 times [2019-09-08 11:49:18,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:18,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:18,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:18,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:18,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:18,691 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:49:18,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:18,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:49:18,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:49:18,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:49:18,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:49:18,694 INFO L87 Difference]: Start difference. First operand 7339 states and 10782 transitions. Second operand 5 states. [2019-09-08 11:49:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:22,017 INFO L93 Difference]: Finished difference Result 11891 states and 17395 transitions. [2019-09-08 11:49:22,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:49:22,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 11:49:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:22,032 INFO L225 Difference]: With dead ends: 11891 [2019-09-08 11:49:22,032 INFO L226 Difference]: Without dead ends: 11889 [2019-09-08 11:49:22,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:49:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11889 states. [2019-09-08 11:49:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11889 to 7411. [2019-09-08 11:49:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7411 states. [2019-09-08 11:49:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7411 states to 7411 states and 10830 transitions. [2019-09-08 11:49:23,617 INFO L78 Accepts]: Start accepts. Automaton has 7411 states and 10830 transitions. Word has length 76 [2019-09-08 11:49:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:23,618 INFO L475 AbstractCegarLoop]: Abstraction has 7411 states and 10830 transitions. [2019-09-08 11:49:23,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:49:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7411 states and 10830 transitions. [2019-09-08 11:49:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:49:23,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:23,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:23,620 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash 318042292, now seen corresponding path program 1 times [2019-09-08 11:49:23,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:23,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:23,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:23,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:23,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:24,132 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-09-08 11:49:24,587 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-08 11:49:24,914 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:49:24,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:24,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:49:24,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:49:24,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:49:24,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:49:24,916 INFO L87 Difference]: Start difference. First operand 7411 states and 10830 transitions. Second operand 16 states. [2019-09-08 11:49:25,075 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2019-09-08 11:49:25,557 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-08 11:49:25,786 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-08 11:49:25,954 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2019-09-08 11:49:26,262 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-08 11:49:26,577 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-09-08 11:49:26,916 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-09-08 11:49:27,086 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-08 11:49:27,254 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 11:49:27,547 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-09-08 11:49:27,750 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 11:49:27,954 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 11:49:28,243 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-08 11:49:29,056 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 11:49:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:36,754 INFO L93 Difference]: Finished difference Result 36648 states and 53645 transitions. [2019-09-08 11:49:36,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 11:49:36,754 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2019-09-08 11:49:36,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:36,784 INFO L225 Difference]: With dead ends: 36648 [2019-09-08 11:49:36,784 INFO L226 Difference]: Without dead ends: 32493 [2019-09-08 11:49:36,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 11:49:36,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32493 states. [2019-09-08 11:49:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32493 to 7356. [2019-09-08 11:49:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-09-08 11:49:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 10762 transitions. [2019-09-08 11:49:38,658 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 10762 transitions. Word has length 76 [2019-09-08 11:49:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:38,658 INFO L475 AbstractCegarLoop]: Abstraction has 7356 states and 10762 transitions. [2019-09-08 11:49:38,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:49:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 10762 transitions. [2019-09-08 11:49:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:49:38,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:38,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:38,659 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:38,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash 58971285, now seen corresponding path program 1 times [2019-09-08 11:49:38,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:38,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:38,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:38,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:38,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:39,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:49:39,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:39,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:49:39,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:49:39,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:49:39,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:49:39,184 INFO L87 Difference]: Start difference. First operand 7356 states and 10762 transitions. Second operand 13 states. [2019-09-08 11:49:39,582 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-08 11:49:39,739 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 11:49:39,905 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 11:49:40,217 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-08 11:49:40,448 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-08 11:49:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:48,214 INFO L93 Difference]: Finished difference Result 36163 states and 53069 transitions. [2019-09-08 11:49:48,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:49:48,217 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2019-09-08 11:49:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:48,247 INFO L225 Difference]: With dead ends: 36163 [2019-09-08 11:49:48,248 INFO L226 Difference]: Without dead ends: 29021 [2019-09-08 11:49:48,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:49:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29021 states. [2019-09-08 11:49:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29021 to 7337. [2019-09-08 11:49:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7337 states. [2019-09-08 11:49:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7337 states to 7337 states and 10736 transitions. [2019-09-08 11:49:50,469 INFO L78 Accepts]: Start accepts. Automaton has 7337 states and 10736 transitions. Word has length 76 [2019-09-08 11:49:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:50,469 INFO L475 AbstractCegarLoop]: Abstraction has 7337 states and 10736 transitions. [2019-09-08 11:49:50,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:49:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 7337 states and 10736 transitions. [2019-09-08 11:49:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:49:50,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:50,470 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:50,470 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:50,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:50,471 INFO L82 PathProgramCache]: Analyzing trace with hash -568372595, now seen corresponding path program 1 times [2019-09-08 11:49:50,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:50,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:50,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:50,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:50,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:49:51,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:51,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 11:49:51,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 11:49:51,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 11:49:51,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:49:51,220 INFO L87 Difference]: Start difference. First operand 7337 states and 10736 transitions. Second operand 25 states. [2019-09-08 11:49:51,398 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-08 11:49:52,608 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 11:49:52,823 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-08 11:49:53,037 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 11:49:53,289 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-08 11:49:53,851 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-08 11:50:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:15,108 INFO L93 Difference]: Finished difference Result 63712 states and 93579 transitions. [2019-09-08 11:50:15,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 11:50:15,108 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2019-09-08 11:50:15,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:15,165 INFO L225 Difference]: With dead ends: 63712 [2019-09-08 11:50:15,166 INFO L226 Difference]: Without dead ends: 57521 [2019-09-08 11:50:15,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=471, Invalid=2609, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 11:50:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57521 states. [2019-09-08 11:50:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57521 to 7345. [2019-09-08 11:50:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7345 states. [2019-09-08 11:50:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7345 states to 7345 states and 10744 transitions. [2019-09-08 11:50:17,744 INFO L78 Accepts]: Start accepts. Automaton has 7345 states and 10744 transitions. Word has length 76 [2019-09-08 11:50:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:17,745 INFO L475 AbstractCegarLoop]: Abstraction has 7345 states and 10744 transitions. [2019-09-08 11:50:17,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 11:50:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 7345 states and 10744 transitions. [2019-09-08 11:50:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:50:17,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:17,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:17,746 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1372189360, now seen corresponding path program 1 times [2019-09-08 11:50:17,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:17,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:17,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:17,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:17,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:18,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:18,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:50:18,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:50:18,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:50:18,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:50:18,428 INFO L87 Difference]: Start difference. First operand 7345 states and 10744 transitions. Second operand 14 states. [2019-09-08 11:50:19,116 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-08 11:50:19,388 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 11:50:19,669 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 11:50:19,849 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 11:50:20,007 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:50:20,253 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 11:50:20,404 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:50:20,645 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 11:50:20,919 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 11:50:21,807 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-08 11:50:35,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:35,704 INFO L93 Difference]: Finished difference Result 50525 states and 74178 transitions. [2019-09-08 11:50:35,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:50:35,705 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2019-09-08 11:50:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:35,748 INFO L225 Difference]: With dead ends: 50525 [2019-09-08 11:50:35,749 INFO L226 Difference]: Without dead ends: 43400 [2019-09-08 11:50:35,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:50:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43400 states. [2019-09-08 11:50:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43400 to 7330. [2019-09-08 11:50:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7330 states. [2019-09-08 11:50:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7330 states to 7330 states and 10724 transitions. [2019-09-08 11:50:38,517 INFO L78 Accepts]: Start accepts. Automaton has 7330 states and 10724 transitions. Word has length 76 [2019-09-08 11:50:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:38,517 INFO L475 AbstractCegarLoop]: Abstraction has 7330 states and 10724 transitions. [2019-09-08 11:50:38,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:50:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 7330 states and 10724 transitions. [2019-09-08 11:50:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:50:38,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:38,518 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:38,518 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:38,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:38,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1118678398, now seen corresponding path program 1 times [2019-09-08 11:50:38,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:38,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:38,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:38,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:38,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:38,994 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-08 11:50:39,325 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:50:39,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:39,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:50:39,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:50:39,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:50:39,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:50:39,327 INFO L87 Difference]: Start difference. First operand 7330 states and 10724 transitions. Second operand 16 states. [2019-09-08 11:50:39,964 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 11:50:40,102 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 11:50:40,241 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 11:50:40,471 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 11:50:40,685 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 11:50:40,907 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 11:50:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:51,399 INFO L93 Difference]: Finished difference Result 31090 states and 45600 transitions. [2019-09-08 11:50:51,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:50:51,400 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2019-09-08 11:50:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:51,426 INFO L225 Difference]: With dead ends: 31090 [2019-09-08 11:50:51,426 INFO L226 Difference]: Without dead ends: 24885 [2019-09-08 11:50:51,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:50:51,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24885 states. [2019-09-08 11:50:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24885 to 7322. [2019-09-08 11:50:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7322 states. [2019-09-08 11:50:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7322 states to 7322 states and 10714 transitions. [2019-09-08 11:50:54,111 INFO L78 Accepts]: Start accepts. Automaton has 7322 states and 10714 transitions. Word has length 77 [2019-09-08 11:50:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:54,112 INFO L475 AbstractCegarLoop]: Abstraction has 7322 states and 10714 transitions. [2019-09-08 11:50:54,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:50:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7322 states and 10714 transitions. [2019-09-08 11:50:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:50:54,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:54,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:54,113 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:54,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:54,113 INFO L82 PathProgramCache]: Analyzing trace with hash 508032095, now seen corresponding path program 1 times [2019-09-08 11:50:54,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:54,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:54,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:54,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:54,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:55,102 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 11:50:55,494 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:50:55,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:55,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 11:50:55,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:50:55,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:50:55,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:50:55,496 INFO L87 Difference]: Start difference. First operand 7322 states and 10714 transitions. Second operand 20 states. [2019-09-08 11:50:56,036 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 11:50:56,204 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 11:50:56,485 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-08 11:50:56,618 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 11:50:56,755 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 11:51:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:10,703 INFO L93 Difference]: Finished difference Result 38461 states and 56476 transitions. [2019-09-08 11:51:10,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:51:10,703 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2019-09-08 11:51:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:10,734 INFO L225 Difference]: With dead ends: 38461 [2019-09-08 11:51:10,735 INFO L226 Difference]: Without dead ends: 32271 [2019-09-08 11:51:10,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=200, Invalid=792, Unknown=0, NotChecked=0, Total=992 [2019-09-08 11:51:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32271 states. [2019-09-08 11:51:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32271 to 7326. [2019-09-08 11:51:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-09-08 11:51:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 10718 transitions. [2019-09-08 11:51:13,681 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 10718 transitions. Word has length 77 [2019-09-08 11:51:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:13,681 INFO L475 AbstractCegarLoop]: Abstraction has 7326 states and 10718 transitions. [2019-09-08 11:51:13,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:51:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 10718 transitions. [2019-09-08 11:51:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:51:13,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:13,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:13,682 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash 127485420, now seen corresponding path program 1 times [2019-09-08 11:51:13,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:13,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:13,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:13,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:13,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:14,642 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 11:51:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:14,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:14,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 11:51:14,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 11:51:14,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 11:51:14,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:51:14,930 INFO L87 Difference]: Start difference. First operand 7326 states and 10718 transitions. Second operand 22 states. [2019-09-08 11:51:15,818 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-08 11:51:16,109 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-08 11:51:16,288 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 11:51:16,598 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-09-08 11:51:16,777 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-08 11:51:16,949 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-08 11:51:17,127 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-08 11:51:17,308 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 11:51:17,444 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-08 11:51:18,007 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 11:51:18,182 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-08 11:51:18,363 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 11:51:18,532 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-08 11:51:18,800 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 11:51:20,943 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-08 11:51:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:48,062 INFO L93 Difference]: Finished difference Result 69834 states and 102370 transitions. [2019-09-08 11:51:48,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 11:51:48,062 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2019-09-08 11:51:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:48,125 INFO L225 Difference]: With dead ends: 69834 [2019-09-08 11:51:48,126 INFO L226 Difference]: Without dead ends: 63644 [2019-09-08 11:51:48,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 11:51:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63644 states. [2019-09-08 11:51:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63644 to 7321. [2019-09-08 11:51:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-09-08 11:51:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 10712 transitions. [2019-09-08 11:51:51,534 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 10712 transitions. Word has length 78 [2019-09-08 11:51:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:51,534 INFO L475 AbstractCegarLoop]: Abstraction has 7321 states and 10712 transitions. [2019-09-08 11:51:51,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 11:51:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 10712 transitions. [2019-09-08 11:51:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:51:51,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:51,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:51,535 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:51,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash -417589621, now seen corresponding path program 1 times [2019-09-08 11:51:51,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:51,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:51,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:51,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:51,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:51,904 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-09-08 11:51:52,351 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:51:52,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:52,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:51:52,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:51:52,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:51:52,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:51:52,353 INFO L87 Difference]: Start difference. First operand 7321 states and 10712 transitions. Second operand 14 states. [2019-09-08 11:51:52,887 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-08 11:52:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:07,521 INFO L93 Difference]: Finished difference Result 35201 states and 51743 transitions. [2019-09-08 11:52:07,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:52:07,521 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 78 [2019-09-08 11:52:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:07,551 INFO L225 Difference]: With dead ends: 35201 [2019-09-08 11:52:07,552 INFO L226 Difference]: Without dead ends: 28996 [2019-09-08 11:52:07,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:52:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28996 states. [2019-09-08 11:52:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28996 to 7220. [2019-09-08 11:52:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7220 states. [2019-09-08 11:52:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 10571 transitions. [2019-09-08 11:52:10,744 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 10571 transitions. Word has length 78 [2019-09-08 11:52:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:10,744 INFO L475 AbstractCegarLoop]: Abstraction has 7220 states and 10571 transitions. [2019-09-08 11:52:10,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:52:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 10571 transitions. [2019-09-08 11:52:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:52:10,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:10,748 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:10,748 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:10,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1533827547, now seen corresponding path program 1 times [2019-09-08 11:52:10,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:10,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:10,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:10,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:10,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:10,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:10,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:10,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:10,807 INFO L87 Difference]: Start difference. First operand 7220 states and 10571 transitions. Second operand 3 states. [2019-09-08 11:52:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:15,449 INFO L93 Difference]: Finished difference Result 15184 states and 22307 transitions. [2019-09-08 11:52:15,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:15,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 11:52:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:15,458 INFO L225 Difference]: With dead ends: 15184 [2019-09-08 11:52:15,458 INFO L226 Difference]: Without dead ends: 10094 [2019-09-08 11:52:15,462 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:52:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10094 states. [2019-09-08 11:52:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10094 to 9660. [2019-09-08 11:52:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9660 states. [2019-09-08 11:52:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9660 states to 9660 states and 14083 transitions. [2019-09-08 11:52:19,641 INFO L78 Accepts]: Start accepts. Automaton has 9660 states and 14083 transitions. Word has length 102 [2019-09-08 11:52:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:19,641 INFO L475 AbstractCegarLoop]: Abstraction has 9660 states and 14083 transitions. [2019-09-08 11:52:19,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 9660 states and 14083 transitions. [2019-09-08 11:52:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:52:19,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:19,643 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:19,643 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:19,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1825781106, now seen corresponding path program 1 times [2019-09-08 11:52:19,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:19,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:19,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:19,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:19,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:52:19,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:52:19,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:52:19,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:52:19,711 INFO L87 Difference]: Start difference. First operand 9660 states and 14083 transitions. Second operand 5 states. [2019-09-08 11:52:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:38,949 INFO L93 Difference]: Finished difference Result 51452 states and 74831 transitions. [2019-09-08 11:52:38,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:52:38,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:52:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:38,992 INFO L225 Difference]: With dead ends: 51452 [2019-09-08 11:52:38,993 INFO L226 Difference]: Without dead ends: 41922 [2019-09-08 11:52:39,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:52:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41922 states. [2019-09-08 11:52:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41922 to 20052. [2019-09-08 11:52:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20052 states. [2019-09-08 11:52:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20052 states to 20052 states and 28891 transitions. [2019-09-08 11:52:47,700 INFO L78 Accepts]: Start accepts. Automaton has 20052 states and 28891 transitions. Word has length 102 [2019-09-08 11:52:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:47,700 INFO L475 AbstractCegarLoop]: Abstraction has 20052 states and 28891 transitions. [2019-09-08 11:52:47,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:52:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 20052 states and 28891 transitions. [2019-09-08 11:52:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:52:47,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:47,702 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:47,703 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:47,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:47,703 INFO L82 PathProgramCache]: Analyzing trace with hash -539707692, now seen corresponding path program 1 times [2019-09-08 11:52:47,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:47,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:47,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:47,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:47,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:47,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:47,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:52:47,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:52:47,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:52:47,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:52:47,768 INFO L87 Difference]: Start difference. First operand 20052 states and 28891 transitions. Second operand 5 states. [2019-09-08 11:53:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:53:23,313 INFO L93 Difference]: Finished difference Result 98876 states and 141311 transitions. [2019-09-08 11:53:23,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:53:23,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:53:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:53:23,408 INFO L225 Difference]: With dead ends: 98876 [2019-09-08 11:53:23,408 INFO L226 Difference]: Without dead ends: 78954 [2019-09-08 11:53:23,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:53:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78954 states. [2019-09-08 11:53:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78954 to 41700. [2019-09-08 11:53:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41700 states. [2019-09-08 11:53:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41700 states to 41700 states and 59371 transitions. [2019-09-08 11:53:42,556 INFO L78 Accepts]: Start accepts. Automaton has 41700 states and 59371 transitions. Word has length 102 [2019-09-08 11:53:42,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:53:42,556 INFO L475 AbstractCegarLoop]: Abstraction has 41700 states and 59371 transitions. [2019-09-08 11:53:42,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:53:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 41700 states and 59371 transitions. [2019-09-08 11:53:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:53:42,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:53:42,558 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:53:42,558 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:53:42,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:53:42,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1344439136, now seen corresponding path program 1 times [2019-09-08 11:53:42,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:53:42,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:53:42,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:42,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:42,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:53:42,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:53:42,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:53:42,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:53:42,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:53:42,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:53:42,620 INFO L87 Difference]: Start difference. First operand 41700 states and 59371 transitions. Second operand 5 states. [2019-09-08 11:54:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:54:12,782 INFO L93 Difference]: Finished difference Result 111454 states and 158027 transitions. [2019-09-08 11:54:12,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:54:12,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:54:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:54:12,869 INFO L225 Difference]: With dead ends: 111454 [2019-09-08 11:54:12,869 INFO L226 Difference]: Without dead ends: 69884 [2019-09-08 11:54:12,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:54:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69884 states. [2019-09-08 11:54:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69884 to 44110. [2019-09-08 11:54:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44110 states. [2019-09-08 11:54:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44110 states to 44110 states and 61771 transitions. [2019-09-08 11:54:33,229 INFO L78 Accepts]: Start accepts. Automaton has 44110 states and 61771 transitions. Word has length 102 [2019-09-08 11:54:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:54:33,230 INFO L475 AbstractCegarLoop]: Abstraction has 44110 states and 61771 transitions. [2019-09-08 11:54:33,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:54:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 44110 states and 61771 transitions. [2019-09-08 11:54:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:54:33,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:54:33,239 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:54:33,239 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:54:33,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:54:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1294947765, now seen corresponding path program 1 times [2019-09-08 11:54:33,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:54:33,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:54:33,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:54:33,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:54:33,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:54:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:54:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:54:33,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:54:33,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:54:33,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:54:33,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:54:33,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:54:33,294 INFO L87 Difference]: Start difference. First operand 44110 states and 61771 transitions. Second operand 3 states. [2019-09-08 11:54:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:54:50,706 INFO L93 Difference]: Finished difference Result 84610 states and 118189 transitions. [2019-09-08 11:54:50,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:54:50,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 11:54:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:54:50,760 INFO L225 Difference]: With dead ends: 84610 [2019-09-08 11:54:50,760 INFO L226 Difference]: Without dead ends: 40656 [2019-09-08 11:54:50,789 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:54:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40656 states. [2019-09-08 11:55:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40656 to 30962. [2019-09-08 11:55:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30962 states. [2019-09-08 11:55:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30962 states to 30962 states and 42267 transitions. [2019-09-08 11:55:05,862 INFO L78 Accepts]: Start accepts. Automaton has 30962 states and 42267 transitions. Word has length 126 [2019-09-08 11:55:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:05,862 INFO L475 AbstractCegarLoop]: Abstraction has 30962 states and 42267 transitions. [2019-09-08 11:55:05,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:55:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand 30962 states and 42267 transitions. [2019-09-08 11:55:05,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 11:55:05,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:05,868 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:05,869 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:05,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1061077742, now seen corresponding path program 1 times [2019-09-08 11:55:05,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:05,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:05,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:55:05,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:05,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:55:05,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:55:05,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:55:05,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:55:05,927 INFO L87 Difference]: Start difference. First operand 30962 states and 42267 transitions. Second operand 3 states. [2019-09-08 11:55:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:31,798 INFO L93 Difference]: Finished difference Result 89550 states and 121493 transitions. [2019-09-08 11:55:31,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:55:31,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-08 11:55:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:31,867 INFO L225 Difference]: With dead ends: 89550 [2019-09-08 11:55:31,867 INFO L226 Difference]: Without dead ends: 58744 [2019-09-08 11:55:31,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:55:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58744 states. [2019-09-08 11:55:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58744 to 54314. [2019-09-08 11:55:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54314 states. [2019-09-08 11:55:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54314 states to 54314 states and 73239 transitions. [2019-09-08 11:55:55,523 INFO L78 Accepts]: Start accepts. Automaton has 54314 states and 73239 transitions. Word has length 127 [2019-09-08 11:55:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:55,524 INFO L475 AbstractCegarLoop]: Abstraction has 54314 states and 73239 transitions. [2019-09-08 11:55:55,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:55:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 54314 states and 73239 transitions. [2019-09-08 11:55:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:55:55,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:55,529 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:55,529 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:55,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash -33343144, now seen corresponding path program 1 times [2019-09-08 11:55:55,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:55,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:55,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:55:55,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:55,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:55:55,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:55:55,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:55:55,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:55:55,584 INFO L87 Difference]: Start difference. First operand 54314 states and 73239 transitions. Second operand 3 states. [2019-09-08 11:56:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:25,700 INFO L93 Difference]: Finished difference Result 119342 states and 160601 transitions. [2019-09-08 11:56:25,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:56:25,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 11:56:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:25,775 INFO L225 Difference]: With dead ends: 119342 [2019-09-08 11:56:25,776 INFO L226 Difference]: Without dead ends: 65180 [2019-09-08 11:56:25,813 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:56:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65180 states. [2019-09-08 11:56:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65180 to 61572. [2019-09-08 11:56:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61572 states. [2019-09-08 11:56:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61572 states to 61572 states and 82427 transitions. [2019-09-08 11:56:53,128 INFO L78 Accepts]: Start accepts. Automaton has 61572 states and 82427 transitions. Word has length 128 [2019-09-08 11:56:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:53,129 INFO L475 AbstractCegarLoop]: Abstraction has 61572 states and 82427 transitions. [2019-09-08 11:56:53,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:56:53,129 INFO L276 IsEmpty]: Start isEmpty. Operand 61572 states and 82427 transitions. [2019-09-08 11:56:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 11:56:53,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:53,135 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:56:53,135 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:53,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:53,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1326570750, now seen corresponding path program 1 times [2019-09-08 11:56:53,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:53,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:53,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:53,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:53,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:53,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:56:53,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:56:53,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:53,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 11:56:53,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:56:53,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:56:53,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:56:53,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:56:53,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:56:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:54,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:56:54,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2019-09-08 11:56:54,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:56:54,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:56:54,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:56:54,095 INFO L87 Difference]: Start difference. First operand 61572 states and 82427 transitions. Second operand 21 states. [2019-09-08 11:57:01,266 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-08 11:59:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:52,681 INFO L93 Difference]: Finished difference Result 399050 states and 527441 transitions. [2019-09-08 11:59:52,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 11:59:52,682 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 129 [2019-09-08 11:59:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:53,556 INFO L225 Difference]: With dead ends: 399050 [2019-09-08 11:59:53,556 INFO L226 Difference]: Without dead ends: 337608 [2019-09-08 11:59:53,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1065, Invalid=4485, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 11:59:54,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337608 states. [2019-09-08 12:01:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337608 to 124786. [2019-09-08 12:01:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124786 states. [2019-09-08 12:01:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124786 states to 124786 states and 166059 transitions. [2019-09-08 12:01:00,368 INFO L78 Accepts]: Start accepts. Automaton has 124786 states and 166059 transitions. Word has length 129 [2019-09-08 12:01:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:01:00,368 INFO L475 AbstractCegarLoop]: Abstraction has 124786 states and 166059 transitions. [2019-09-08 12:01:00,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:01:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 124786 states and 166059 transitions. [2019-09-08 12:01:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:01:00,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:01:00,388 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:01:00,388 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:01:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:01:00,389 INFO L82 PathProgramCache]: Analyzing trace with hash -391212107, now seen corresponding path program 1 times [2019-09-08 12:01:00,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:01:00,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:01:00,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:00,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:01:00,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:01:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:01:00,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:01:00,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:01:00,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:01:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:01:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:01:00,462 INFO L87 Difference]: Start difference. First operand 124786 states and 166059 transitions. Second operand 3 states. [2019-09-08 12:01:49,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:49,978 INFO L93 Difference]: Finished difference Result 214702 states and 285033 transitions. [2019-09-08 12:01:49,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:01:49,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-08 12:01:49,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:50,122 INFO L225 Difference]: With dead ends: 214702 [2019-09-08 12:01:50,122 INFO L226 Difference]: Without dead ends: 90092 [2019-09-08 12:01:50,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:01:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90092 states.