java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:30:34,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:30:34,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:30:34,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:30:34,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:30:34,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:30:34,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:30:34,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:30:34,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:30:34,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:30:34,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:30:34,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:30:34,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:30:34,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:30:34,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:30:34,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:30:34,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:30:34,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:30:34,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:30:34,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:30:34,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:30:34,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:30:34,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:30:34,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:30:34,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:30:34,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:30:34,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:30:34,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:30:34,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:30:34,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:30:34,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:30:34,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:30:34,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:30:34,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:30:34,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:30:34,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:30:34,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:30:34,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:30:34,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:30:34,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:30:34,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:30:34,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:30:34,777 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:30:34,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:30:34,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:30:34,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:30:34,780 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:30:34,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:30:34,780 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:30:34,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:30:34,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:30:34,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:30:34,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:30:34,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:30:34,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:30:34,782 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:30:34,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:30:34,783 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:30:34,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:30:34,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:30:34,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:30:34,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:30:34,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:30:34,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:30:34,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:30:34,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:30:34,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:30:34,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:30:34,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:30:34,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:30:34,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:30:34,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:30:34,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:30:34,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:30:34,850 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:30:34,850 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:30:34,851 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 10:30:34,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1554dbac/2ce09870474b46bf8e8c41a53bfb92f1/FLAG248625851 [2019-09-08 10:30:35,418 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:30:35,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 10:30:35,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1554dbac/2ce09870474b46bf8e8c41a53bfb92f1/FLAG248625851 [2019-09-08 10:30:35,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1554dbac/2ce09870474b46bf8e8c41a53bfb92f1 [2019-09-08 10:30:35,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:30:35,747 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:30:35,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:30:35,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:30:35,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:30:35,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:30:35" (1/1) ... [2019-09-08 10:30:35,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:30:35, skipping insertion in model container [2019-09-08 10:30:35,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:30:35" (1/1) ... [2019-09-08 10:30:35,765 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:30:35,814 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:30:36,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:30:36,225 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:30:36,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:30:36,369 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:30:36,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:30:36 WrapperNode [2019-09-08 10:30:36,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:30:36,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:30:36,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:30:36,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:30:36,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:30:36" (1/1) ... [2019-09-08 10:30:36,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:30:36" (1/1) ... [2019-09-08 10:30:36,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:30:36" (1/1) ... [2019-09-08 10:30:36,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:30:36" (1/1) ... [2019-09-08 10:30:36,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:30:36" (1/1) ... [2019-09-08 10:30:36,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:30:36" (1/1) ... [2019-09-08 10:30:36,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:30:36" (1/1) ... [2019-09-08 10:30:36,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:30:36,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:30:36,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:30:36,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:30:36,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:30:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:30:36,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:30:36,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:30:36,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:30:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:30:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:30:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:30:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:30:36,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:30:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:30:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:30:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:30:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:30:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:30:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:30:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:30:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:30:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:30:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:30:37,304 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:30:37,304 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:30:37,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:30:37 BoogieIcfgContainer [2019-09-08 10:30:37,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:30:37,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:30:37,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:30:37,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:30:37,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:30:35" (1/3) ... [2019-09-08 10:30:37,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a7ccb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:30:37, skipping insertion in model container [2019-09-08 10:30:37,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:30:36" (2/3) ... [2019-09-08 10:30:37,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a7ccb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:30:37, skipping insertion in model container [2019-09-08 10:30:37,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:30:37" (3/3) ... [2019-09-08 10:30:37,318 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 10:30:37,329 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:30:37,349 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:30:37,367 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:30:37,415 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:30:37,416 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:30:37,416 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:30:37,416 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:30:37,417 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:30:37,417 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:30:37,417 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:30:37,417 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:30:37,418 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:30:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states. [2019-09-08 10:30:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:30:37,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:37,466 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] [2019-09-08 10:30:37,468 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:37,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1995893501, now seen corresponding path program 1 times [2019-09-08 10:30:37,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:37,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:37,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:37,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:37,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:37,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:37,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:30:37,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:30:37,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:30:37,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:30:37,973 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 6 states. [2019-09-08 10:30:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:38,468 INFO L93 Difference]: Finished difference Result 800 states and 1262 transitions. [2019-09-08 10:30:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:30:38,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-09-08 10:30:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:38,501 INFO L225 Difference]: With dead ends: 800 [2019-09-08 10:30:38,502 INFO L226 Difference]: Without dead ends: 696 [2019-09-08 10:30:38,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:30:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-08 10:30:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 469. [2019-09-08 10:30:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-09-08 10:30:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 711 transitions. [2019-09-08 10:30:38,620 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 711 transitions. Word has length 54 [2019-09-08 10:30:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:38,621 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 711 transitions. [2019-09-08 10:30:38,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:30:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 711 transitions. [2019-09-08 10:30:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:30:38,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:38,624 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] [2019-09-08 10:30:38,624 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:38,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:38,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1306112853, now seen corresponding path program 1 times [2019-09-08 10:30:38,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:38,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:38,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:38,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:38,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:38,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:38,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:38,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:38,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:38,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:38,728 INFO L87 Difference]: Start difference. First operand 469 states and 711 transitions. Second operand 3 states. [2019-09-08 10:30:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:38,799 INFO L93 Difference]: Finished difference Result 1232 states and 1891 transitions. [2019-09-08 10:30:38,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:38,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-08 10:30:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:38,806 INFO L225 Difference]: With dead ends: 1232 [2019-09-08 10:30:38,806 INFO L226 Difference]: Without dead ends: 835 [2019-09-08 10:30:38,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-09-08 10:30:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 833. [2019-09-08 10:30:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-08 10:30:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1259 transitions. [2019-09-08 10:30:38,876 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1259 transitions. Word has length 57 [2019-09-08 10:30:38,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:38,877 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1259 transitions. [2019-09-08 10:30:38,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1259 transitions. [2019-09-08 10:30:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:30:38,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:38,888 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] [2019-09-08 10:30:38,889 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:38,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1081311145, now seen corresponding path program 1 times [2019-09-08 10:30:38,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:38,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:38,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:38,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:38,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:39,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:39,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:39,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:39,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:39,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:39,033 INFO L87 Difference]: Start difference. First operand 833 states and 1259 transitions. Second operand 3 states. [2019-09-08 10:30:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:39,150 INFO L93 Difference]: Finished difference Result 2176 states and 3300 transitions. [2019-09-08 10:30:39,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:39,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-08 10:30:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:39,162 INFO L225 Difference]: With dead ends: 2176 [2019-09-08 10:30:39,162 INFO L226 Difference]: Without dead ends: 1423 [2019-09-08 10:30:39,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:39,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-09-08 10:30:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1421. [2019-09-08 10:30:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-09-08 10:30:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2108 transitions. [2019-09-08 10:30:39,245 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2108 transitions. Word has length 57 [2019-09-08 10:30:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:39,247 INFO L475 AbstractCegarLoop]: Abstraction has 1421 states and 2108 transitions. [2019-09-08 10:30:39,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2108 transitions. [2019-09-08 10:30:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:30:39,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:39,249 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] [2019-09-08 10:30:39,250 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:39,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:39,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1811397466, now seen corresponding path program 1 times [2019-09-08 10:30:39,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:39,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:39,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:39,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:39,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:30:39,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:30:39,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:30:39,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:30:39,364 INFO L87 Difference]: Start difference. First operand 1421 states and 2108 transitions. Second operand 5 states. [2019-09-08 10:30:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:39,758 INFO L93 Difference]: Finished difference Result 3427 states and 5088 transitions. [2019-09-08 10:30:39,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:30:39,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-08 10:30:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:39,770 INFO L225 Difference]: With dead ends: 3427 [2019-09-08 10:30:39,770 INFO L226 Difference]: Without dead ends: 2038 [2019-09-08 10:30:39,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:30:39,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2019-09-08 10:30:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 2021. [2019-09-08 10:30:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-09-08 10:30:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2966 transitions. [2019-09-08 10:30:39,909 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2966 transitions. Word has length 58 [2019-09-08 10:30:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:39,909 INFO L475 AbstractCegarLoop]: Abstraction has 2021 states and 2966 transitions. [2019-09-08 10:30:39,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:30:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2966 transitions. [2019-09-08 10:30:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:30:39,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:39,912 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] [2019-09-08 10:30:39,913 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash -211164811, now seen corresponding path program 1 times [2019-09-08 10:30:39,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:39,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:39,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:39,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:39,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:40,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:40,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:30:40,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:30:40,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:30:40,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:30:40,070 INFO L87 Difference]: Start difference. First operand 2021 states and 2966 transitions. Second operand 6 states. [2019-09-08 10:30:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:40,590 INFO L93 Difference]: Finished difference Result 6463 states and 9510 transitions. [2019-09-08 10:30:40,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:30:40,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-09-08 10:30:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:40,612 INFO L225 Difference]: With dead ends: 6463 [2019-09-08 10:30:40,612 INFO L226 Difference]: Without dead ends: 4492 [2019-09-08 10:30:40,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:30:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4492 states. [2019-09-08 10:30:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4492 to 4458. [2019-09-08 10:30:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4458 states. [2019-09-08 10:30:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4458 states to 4458 states and 6538 transitions. [2019-09-08 10:30:40,846 INFO L78 Accepts]: Start accepts. Automaton has 4458 states and 6538 transitions. Word has length 58 [2019-09-08 10:30:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:40,847 INFO L475 AbstractCegarLoop]: Abstraction has 4458 states and 6538 transitions. [2019-09-08 10:30:40,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:30:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4458 states and 6538 transitions. [2019-09-08 10:30:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:30:40,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:40,849 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] [2019-09-08 10:30:40,849 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:40,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1182977442, now seen corresponding path program 1 times [2019-09-08 10:30:40,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:40,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:40,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:40,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:40,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:40,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:40,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:30:40,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:30:40,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:30:40,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:30:40,942 INFO L87 Difference]: Start difference. First operand 4458 states and 6538 transitions. Second operand 7 states. [2019-09-08 10:30:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:42,202 INFO L93 Difference]: Finished difference Result 19988 states and 29226 transitions. [2019-09-08 10:30:42,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:30:42,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-09-08 10:30:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:42,277 INFO L225 Difference]: With dead ends: 19988 [2019-09-08 10:30:42,277 INFO L226 Difference]: Without dead ends: 15956 [2019-09-08 10:30:42,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:30:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15956 states. [2019-09-08 10:30:42,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15956 to 4478. [2019-09-08 10:30:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4478 states. [2019-09-08 10:30:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 4478 states and 6562 transitions. [2019-09-08 10:30:42,787 INFO L78 Accepts]: Start accepts. Automaton has 4478 states and 6562 transitions. Word has length 59 [2019-09-08 10:30:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:42,787 INFO L475 AbstractCegarLoop]: Abstraction has 4478 states and 6562 transitions. [2019-09-08 10:30:42,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:30:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states and 6562 transitions. [2019-09-08 10:30:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:30:42,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:42,790 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] [2019-09-08 10:30:42,790 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:42,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:42,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1225107520, now seen corresponding path program 1 times [2019-09-08 10:30:42,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:42,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:42,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:42,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:42,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:42,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:42,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:30:42,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:30:42,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:30:42,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:30:42,874 INFO L87 Difference]: Start difference. First operand 4478 states and 6562 transitions. Second operand 7 states. [2019-09-08 10:30:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:44,663 INFO L93 Difference]: Finished difference Result 26575 states and 39431 transitions. [2019-09-08 10:30:44,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:30:44,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-09-08 10:30:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:44,719 INFO L225 Difference]: With dead ends: 26575 [2019-09-08 10:30:44,719 INFO L226 Difference]: Without dead ends: 24055 [2019-09-08 10:30:44,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:30:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24055 states. [2019-09-08 10:30:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24055 to 4514. [2019-09-08 10:30:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4514 states. [2019-09-08 10:30:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 6608 transitions. [2019-09-08 10:30:45,364 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 6608 transitions. Word has length 59 [2019-09-08 10:30:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:45,365 INFO L475 AbstractCegarLoop]: Abstraction has 4514 states and 6608 transitions. [2019-09-08 10:30:45,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:30:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 6608 transitions. [2019-09-08 10:30:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:30:45,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:45,368 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] [2019-09-08 10:30:45,368 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:45,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1930518435, now seen corresponding path program 1 times [2019-09-08 10:30:45,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:45,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:45,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:45,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:45,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:45,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:45,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:30:45,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:30:45,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:30:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:30:45,478 INFO L87 Difference]: Start difference. First operand 4514 states and 6608 transitions. Second operand 6 states. [2019-09-08 10:30:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:46,400 INFO L93 Difference]: Finished difference Result 16335 states and 23901 transitions. [2019-09-08 10:30:46,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:30:46,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-09-08 10:30:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:46,420 INFO L225 Difference]: With dead ends: 16335 [2019-09-08 10:30:46,420 INFO L226 Difference]: Without dead ends: 11941 [2019-09-08 10:30:46,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:30:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11941 states. [2019-09-08 10:30:47,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11941 to 11937. [2019-09-08 10:30:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11937 states. [2019-09-08 10:30:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11937 states to 11937 states and 17282 transitions. [2019-09-08 10:30:47,275 INFO L78 Accepts]: Start accepts. Automaton has 11937 states and 17282 transitions. Word has length 60 [2019-09-08 10:30:47,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:47,275 INFO L475 AbstractCegarLoop]: Abstraction has 11937 states and 17282 transitions. [2019-09-08 10:30:47,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:30:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 11937 states and 17282 transitions. [2019-09-08 10:30:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:30:47,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:47,278 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] [2019-09-08 10:30:47,278 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:47,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash -341979445, now seen corresponding path program 1 times [2019-09-08 10:30:47,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:47,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:47,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:47,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:47,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:47,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 10:30:47,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:47,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:30:47,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:30:47,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:30:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:30:47,353 INFO L87 Difference]: Start difference. First operand 11937 states and 17282 transitions. Second operand 5 states. [2019-09-08 10:30:49,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:49,058 INFO L93 Difference]: Finished difference Result 31058 states and 45266 transitions. [2019-09-08 10:30:49,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:30:49,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-08 10:30:49,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:49,101 INFO L225 Difference]: With dead ends: 31058 [2019-09-08 10:30:49,101 INFO L226 Difference]: Without dead ends: 24873 [2019-09-08 10:30:49,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:30:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24873 states. [2019-09-08 10:30:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24873 to 14649. [2019-09-08 10:30:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14649 states. [2019-09-08 10:30:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14649 states to 14649 states and 21288 transitions. [2019-09-08 10:30:50,410 INFO L78 Accepts]: Start accepts. Automaton has 14649 states and 21288 transitions. Word has length 61 [2019-09-08 10:30:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:50,410 INFO L475 AbstractCegarLoop]: Abstraction has 14649 states and 21288 transitions. [2019-09-08 10:30:50,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:30:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 14649 states and 21288 transitions. [2019-09-08 10:30:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:30:50,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:50,413 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] [2019-09-08 10:30:50,413 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:50,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:50,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1558281363, now seen corresponding path program 1 times [2019-09-08 10:30:50,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:50,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:50,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:50,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:50,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:50,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:50,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:30:50,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:30:50,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:30:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:30:50,490 INFO L87 Difference]: Start difference. First operand 14649 states and 21288 transitions. Second operand 5 states. [2019-09-08 10:30:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:52,183 INFO L93 Difference]: Finished difference Result 33095 states and 48250 transitions. [2019-09-08 10:30:52,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:30:52,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-08 10:30:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:52,217 INFO L225 Difference]: With dead ends: 33095 [2019-09-08 10:30:52,217 INFO L226 Difference]: Without dead ends: 26910 [2019-09-08 10:30:52,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:30:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26910 states. [2019-09-08 10:30:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26910 to 16592. [2019-09-08 10:30:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16592 states. [2019-09-08 10:30:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16592 states to 16592 states and 24158 transitions. [2019-09-08 10:30:53,260 INFO L78 Accepts]: Start accepts. Automaton has 16592 states and 24158 transitions. Word has length 61 [2019-09-08 10:30:53,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:53,260 INFO L475 AbstractCegarLoop]: Abstraction has 16592 states and 24158 transitions. [2019-09-08 10:30:53,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:30:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 16592 states and 24158 transitions. [2019-09-08 10:30:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 10:30:53,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:53,264 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] [2019-09-08 10:30:53,265 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:53,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:53,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1561793871, now seen corresponding path program 1 times [2019-09-08 10:30:53,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:53,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:53,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:53,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:53,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:53,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:53,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:53,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:53,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:53,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:53,318 INFO L87 Difference]: Start difference. First operand 16592 states and 24158 transitions. Second operand 3 states. [2019-09-08 10:30:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:55,101 INFO L93 Difference]: Finished difference Result 40560 states and 59004 transitions. [2019-09-08 10:30:55,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:55,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 10:30:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:55,130 INFO L225 Difference]: With dead ends: 40560 [2019-09-08 10:30:55,130 INFO L226 Difference]: Without dead ends: 24657 [2019-09-08 10:30:55,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24657 states. [2019-09-08 10:30:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24657 to 19938. [2019-09-08 10:30:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19938 states. [2019-09-08 10:30:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19938 states to 19938 states and 28543 transitions. [2019-09-08 10:30:56,488 INFO L78 Accepts]: Start accepts. Automaton has 19938 states and 28543 transitions. Word has length 64 [2019-09-08 10:30:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:56,488 INFO L475 AbstractCegarLoop]: Abstraction has 19938 states and 28543 transitions. [2019-09-08 10:30:56,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 19938 states and 28543 transitions. [2019-09-08 10:30:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 10:30:56,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:56,492 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] [2019-09-08 10:30:56,493 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:56,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash -944536211, now seen corresponding path program 1 times [2019-09-08 10:30:56,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:56,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:56,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:56,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:56,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:56,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 10:30:56,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:56,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:30:56,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:30:56,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:30:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:30:56,580 INFO L87 Difference]: Start difference. First operand 19938 states and 28543 transitions. Second operand 7 states. [2019-09-08 10:31:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:04,111 INFO L93 Difference]: Finished difference Result 90287 states and 128324 transitions. [2019-09-08 10:31:04,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:31:04,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-09-08 10:31:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:04,203 INFO L225 Difference]: With dead ends: 90287 [2019-09-08 10:31:04,203 INFO L226 Difference]: Without dead ends: 81575 [2019-09-08 10:31:04,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:31:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81575 states. [2019-09-08 10:31:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81575 to 20032. [2019-09-08 10:31:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20032 states. [2019-09-08 10:31:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20032 states to 20032 states and 28664 transitions. [2019-09-08 10:31:06,082 INFO L78 Accepts]: Start accepts. Automaton has 20032 states and 28664 transitions. Word has length 64 [2019-09-08 10:31:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:06,082 INFO L475 AbstractCegarLoop]: Abstraction has 20032 states and 28664 transitions. [2019-09-08 10:31:06,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:31:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 20032 states and 28664 transitions. [2019-09-08 10:31:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:31:06,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:06,086 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] [2019-09-08 10:31:06,086 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2106073500, now seen corresponding path program 1 times [2019-09-08 10:31:06,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:06,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:06,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:06,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:06,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:31:06,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:31:06,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:31:06,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:31:06,290 INFO L87 Difference]: Start difference. First operand 20032 states and 28664 transitions. Second operand 10 states. [2019-09-08 10:31:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:12,659 INFO L93 Difference]: Finished difference Result 70160 states and 99855 transitions. [2019-09-08 10:31:12,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:31:12,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-08 10:31:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:12,713 INFO L225 Difference]: With dead ends: 70160 [2019-09-08 10:31:12,714 INFO L226 Difference]: Without dead ends: 51670 [2019-09-08 10:31:12,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:31:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51670 states. [2019-09-08 10:31:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51670 to 19835. [2019-09-08 10:31:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19835 states. [2019-09-08 10:31:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19835 states to 19835 states and 28397 transitions. [2019-09-08 10:31:15,778 INFO L78 Accepts]: Start accepts. Automaton has 19835 states and 28397 transitions. Word has length 66 [2019-09-08 10:31:15,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:15,778 INFO L475 AbstractCegarLoop]: Abstraction has 19835 states and 28397 transitions. [2019-09-08 10:31:15,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:31:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 19835 states and 28397 transitions. [2019-09-08 10:31:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:31:15,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:15,782 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] [2019-09-08 10:31:15,783 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:15,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:15,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1562834592, now seen corresponding path program 1 times [2019-09-08 10:31:15,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:15,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:15,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:15,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:15,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:16,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:16,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:31:16,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:31:16,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:31:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:31:16,005 INFO L87 Difference]: Start difference. First operand 19835 states and 28397 transitions. Second operand 10 states. [2019-09-08 10:31:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:22,889 INFO L93 Difference]: Finished difference Result 69395 states and 98856 transitions. [2019-09-08 10:31:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:31:22,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-08 10:31:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:22,949 INFO L225 Difference]: With dead ends: 69395 [2019-09-08 10:31:22,949 INFO L226 Difference]: Without dead ends: 51225 [2019-09-08 10:31:23,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-09-08 10:31:23,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51225 states. [2019-09-08 10:31:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51225 to 19629. [2019-09-08 10:31:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19629 states. [2019-09-08 10:31:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19629 states to 19629 states and 28096 transitions. [2019-09-08 10:31:25,235 INFO L78 Accepts]: Start accepts. Automaton has 19629 states and 28096 transitions. Word has length 66 [2019-09-08 10:31:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:25,235 INFO L475 AbstractCegarLoop]: Abstraction has 19629 states and 28096 transitions. [2019-09-08 10:31:25,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:31:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 19629 states and 28096 transitions. [2019-09-08 10:31:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:31:25,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:25,239 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] [2019-09-08 10:31:25,239 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1195976158, now seen corresponding path program 1 times [2019-09-08 10:31:25,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:25,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:25,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:25,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:25,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:25,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:25,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:31:25,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:31:25,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:31:25,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:31:25,407 INFO L87 Difference]: Start difference. First operand 19629 states and 28096 transitions. Second operand 10 states. [2019-09-08 10:31:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:39,102 INFO L93 Difference]: Finished difference Result 105776 states and 150136 transitions. [2019-09-08 10:31:39,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 10:31:39,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-08 10:31:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:39,199 INFO L225 Difference]: With dead ends: 105776 [2019-09-08 10:31:39,199 INFO L226 Difference]: Without dead ends: 87495 [2019-09-08 10:31:39,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:31:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87495 states. [2019-09-08 10:31:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87495 to 19379. [2019-09-08 10:31:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19379 states. [2019-09-08 10:31:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19379 states to 19379 states and 27737 transitions. [2019-09-08 10:31:41,922 INFO L78 Accepts]: Start accepts. Automaton has 19379 states and 27737 transitions. Word has length 66 [2019-09-08 10:31:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:41,923 INFO L475 AbstractCegarLoop]: Abstraction has 19379 states and 27737 transitions. [2019-09-08 10:31:41,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:31:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 19379 states and 27737 transitions. [2019-09-08 10:31:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:31:41,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:41,926 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:31:41,926 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash -22489909, now seen corresponding path program 1 times [2019-09-08 10:31:41,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:41,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:41,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:41,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:41,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:41,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 10:31:41,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:41,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:31:41,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:31:41,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:31:41,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:31:41,976 INFO L87 Difference]: Start difference. First operand 19379 states and 27737 transitions. Second operand 3 states. [2019-09-08 10:31:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:44,466 INFO L93 Difference]: Finished difference Result 28065 states and 40051 transitions. [2019-09-08 10:31:44,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:31:44,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:31:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:44,483 INFO L225 Difference]: With dead ends: 28065 [2019-09-08 10:31:44,483 INFO L226 Difference]: Without dead ends: 19381 [2019-09-08 10:31:44,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:31:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19381 states. [2019-09-08 10:31:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19381 to 19379. [2019-09-08 10:31:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19379 states. [2019-09-08 10:31:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19379 states to 19379 states and 27296 transitions. [2019-09-08 10:31:46,764 INFO L78 Accepts]: Start accepts. Automaton has 19379 states and 27296 transitions. Word has length 67 [2019-09-08 10:31:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:46,764 INFO L475 AbstractCegarLoop]: Abstraction has 19379 states and 27296 transitions. [2019-09-08 10:31:46,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:31:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 19379 states and 27296 transitions. [2019-09-08 10:31:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:31:46,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:46,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:31:46,767 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:46,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:46,767 INFO L82 PathProgramCache]: Analyzing trace with hash 910047089, now seen corresponding path program 1 times [2019-09-08 10:31:46,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:46,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:46,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:46,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:46,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:46,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:46,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:31:46,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:31:46,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:31:46,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:31:46,817 INFO L87 Difference]: Start difference. First operand 19379 states and 27296 transitions. Second operand 3 states. [2019-09-08 10:31:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:49,229 INFO L93 Difference]: Finished difference Result 26334 states and 36967 transitions. [2019-09-08 10:31:49,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:31:49,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:31:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:49,248 INFO L225 Difference]: With dead ends: 26334 [2019-09-08 10:31:49,248 INFO L226 Difference]: Without dead ends: 17626 [2019-09-08 10:31:49,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:31:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17626 states. [2019-09-08 10:31:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17626 to 17624. [2019-09-08 10:31:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17624 states. [2019-09-08 10:31:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17624 states to 17624 states and 24408 transitions. [2019-09-08 10:31:51,484 INFO L78 Accepts]: Start accepts. Automaton has 17624 states and 24408 transitions. Word has length 67 [2019-09-08 10:31:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:51,484 INFO L475 AbstractCegarLoop]: Abstraction has 17624 states and 24408 transitions. [2019-09-08 10:31:51,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:31:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 17624 states and 24408 transitions. [2019-09-08 10:31:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:31:51,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:51,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:31:51,487 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:51,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:51,487 INFO L82 PathProgramCache]: Analyzing trace with hash 807080215, now seen corresponding path program 1 times [2019-09-08 10:31:51,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:51,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:51,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:51,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:51,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:51,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:51,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:31:51,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:31:51,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:31:51,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:31:51,528 INFO L87 Difference]: Start difference. First operand 17624 states and 24408 transitions. Second operand 3 states. [2019-09-08 10:31:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:53,494 INFO L93 Difference]: Finished difference Result 23562 states and 32536 transitions. [2019-09-08 10:31:53,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:31:53,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:31:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:53,507 INFO L225 Difference]: With dead ends: 23562 [2019-09-08 10:31:53,507 INFO L226 Difference]: Without dead ends: 13819 [2019-09-08 10:31:53,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:31:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13819 states. [2019-09-08 10:31:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13819 to 13817. [2019-09-08 10:31:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13817 states. [2019-09-08 10:31:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13817 states to 13817 states and 18799 transitions. [2019-09-08 10:31:55,090 INFO L78 Accepts]: Start accepts. Automaton has 13817 states and 18799 transitions. Word has length 67 [2019-09-08 10:31:55,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:55,091 INFO L475 AbstractCegarLoop]: Abstraction has 13817 states and 18799 transitions. [2019-09-08 10:31:55,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:31:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 13817 states and 18799 transitions. [2019-09-08 10:31:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:31:55,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:55,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:31:55,094 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:55,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:55,094 INFO L82 PathProgramCache]: Analyzing trace with hash 951021968, now seen corresponding path program 1 times [2019-09-08 10:31:55,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:55,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:55,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:55,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:55,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:55,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:55,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 10:31:55,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 10:31:55,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 10:31:55,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:31:55,809 INFO L87 Difference]: Start difference. First operand 13817 states and 18799 transitions. Second operand 17 states. [2019-09-08 10:31:56,369 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 10:31:56,530 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-08 10:31:56,855 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-09-08 10:31:57,089 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-08 10:31:57,252 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 10:31:57,452 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 10:31:57,642 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 10:31:57,856 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 10:31:58,116 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 10:32:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:04,838 INFO L93 Difference]: Finished difference Result 38191 states and 52137 transitions. [2019-09-08 10:32:04,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:32:04,839 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-09-08 10:32:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:04,875 INFO L225 Difference]: With dead ends: 38191 [2019-09-08 10:32:04,876 INFO L226 Difference]: Without dead ends: 37169 [2019-09-08 10:32:04,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 10:32:04,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37169 states. [2019-09-08 10:32:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37169 to 13737. [2019-09-08 10:32:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13737 states. [2019-09-08 10:32:06,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13737 states to 13737 states and 18691 transitions. [2019-09-08 10:32:06,893 INFO L78 Accepts]: Start accepts. Automaton has 13737 states and 18691 transitions. Word has length 68 [2019-09-08 10:32:06,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:06,893 INFO L475 AbstractCegarLoop]: Abstraction has 13737 states and 18691 transitions. [2019-09-08 10:32:06,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 10:32:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 13737 states and 18691 transitions. [2019-09-08 10:32:06,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:32:06,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:06,896 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:32:06,896 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:06,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:06,896 INFO L82 PathProgramCache]: Analyzing trace with hash 313084076, now seen corresponding path program 1 times [2019-09-08 10:32:06,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:06,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:06,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:06,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:06,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:32:07,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:07,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 10:32:07,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 10:32:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 10:32:07,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-08 10:32:07,540 INFO L87 Difference]: Start difference. First operand 13737 states and 18691 transitions. Second operand 16 states. [2019-09-08 10:32:07,957 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 10:32:08,228 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 10:32:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:13,458 INFO L93 Difference]: Finished difference Result 28220 states and 38622 transitions. [2019-09-08 10:32:13,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:32:13,458 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-09-08 10:32:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:13,486 INFO L225 Difference]: With dead ends: 28220 [2019-09-08 10:32:13,487 INFO L226 Difference]: Without dead ends: 25427 [2019-09-08 10:32:13,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-09-08 10:32:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25427 states. [2019-09-08 10:32:15,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25427 to 13624. [2019-09-08 10:32:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13624 states. [2019-09-08 10:32:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13624 states to 13624 states and 18539 transitions. [2019-09-08 10:32:15,547 INFO L78 Accepts]: Start accepts. Automaton has 13624 states and 18539 transitions. Word has length 68 [2019-09-08 10:32:15,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:15,548 INFO L475 AbstractCegarLoop]: Abstraction has 13624 states and 18539 transitions. [2019-09-08 10:32:15,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 10:32:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 13624 states and 18539 transitions. [2019-09-08 10:32:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:32:15,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:15,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:32:15,550 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:15,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:15,551 INFO L82 PathProgramCache]: Analyzing trace with hash 717078376, now seen corresponding path program 1 times [2019-09-08 10:32:15,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:15,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:15,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:15,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:15,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:32:15,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:15,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:32:15,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:32:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:32:15,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:15,583 INFO L87 Difference]: Start difference. First operand 13624 states and 18539 transitions. Second operand 3 states. [2019-09-08 10:32:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:18,638 INFO L93 Difference]: Finished difference Result 25270 states and 34474 transitions. [2019-09-08 10:32:18,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:32:18,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 10:32:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:18,657 INFO L225 Difference]: With dead ends: 25270 [2019-09-08 10:32:18,658 INFO L226 Difference]: Without dead ends: 20187 [2019-09-08 10:32:18,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20187 states. [2019-09-08 10:32:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20187 to 13481. [2019-09-08 10:32:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13481 states. [2019-09-08 10:32:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13481 states to 13481 states and 18320 transitions. [2019-09-08 10:32:20,830 INFO L78 Accepts]: Start accepts. Automaton has 13481 states and 18320 transitions. Word has length 68 [2019-09-08 10:32:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:20,831 INFO L475 AbstractCegarLoop]: Abstraction has 13481 states and 18320 transitions. [2019-09-08 10:32:20,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:32:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 13481 states and 18320 transitions. [2019-09-08 10:32:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:32:20,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:20,833 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:32:20,833 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:20,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1369153575, now seen corresponding path program 1 times [2019-09-08 10:32:20,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:20,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:20,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:20,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:20,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:32:20,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:20,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:32:20,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:32:20,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:32:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:20,870 INFO L87 Difference]: Start difference. First operand 13481 states and 18320 transitions. Second operand 3 states. [2019-09-08 10:32:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:24,139 INFO L93 Difference]: Finished difference Result 24972 states and 34035 transitions. [2019-09-08 10:32:24,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:32:24,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 10:32:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:24,157 INFO L225 Difference]: With dead ends: 24972 [2019-09-08 10:32:24,158 INFO L226 Difference]: Without dead ends: 19965 [2019-09-08 10:32:24,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19965 states. [2019-09-08 10:32:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19965 to 13259. [2019-09-08 10:32:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13259 states. [2019-09-08 10:32:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13259 states to 13259 states and 18002 transitions. [2019-09-08 10:32:26,530 INFO L78 Accepts]: Start accepts. Automaton has 13259 states and 18002 transitions. Word has length 68 [2019-09-08 10:32:26,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:26,530 INFO L475 AbstractCegarLoop]: Abstraction has 13259 states and 18002 transitions. [2019-09-08 10:32:26,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:32:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 13259 states and 18002 transitions. [2019-09-08 10:32:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:32:26,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:26,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:32:26,534 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:26,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:26,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1358366886, now seen corresponding path program 1 times [2019-09-08 10:32:26,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:26,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:26,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:32:26,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:26,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:32:26,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:32:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:32:26,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:32:26,598 INFO L87 Difference]: Start difference. First operand 13259 states and 18002 transitions. Second operand 5 states. [2019-09-08 10:32:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:29,008 INFO L93 Difference]: Finished difference Result 13265 states and 18005 transitions. [2019-09-08 10:32:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:32:29,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-09-08 10:32:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:29,021 INFO L225 Difference]: With dead ends: 13265 [2019-09-08 10:32:29,021 INFO L226 Difference]: Without dead ends: 12399 [2019-09-08 10:32:29,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:32:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2019-09-08 10:32:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 12395. [2019-09-08 10:32:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12395 states. [2019-09-08 10:32:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12395 states to 12395 states and 16857 transitions. [2019-09-08 10:32:31,157 INFO L78 Accepts]: Start accepts. Automaton has 12395 states and 16857 transitions. Word has length 73 [2019-09-08 10:32:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:31,158 INFO L475 AbstractCegarLoop]: Abstraction has 12395 states and 16857 transitions. [2019-09-08 10:32:31,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:32:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 12395 states and 16857 transitions. [2019-09-08 10:32:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:32:31,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:31,161 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:32:31,161 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:31,162 INFO L82 PathProgramCache]: Analyzing trace with hash -168810636, now seen corresponding path program 1 times [2019-09-08 10:32:31,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:31,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:31,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:31,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:31,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:32:31,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:31,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:32:31,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:32:31,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:32:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:32:31,229 INFO L87 Difference]: Start difference. First operand 12395 states and 16857 transitions. Second operand 6 states. [2019-09-08 10:32:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:35,693 INFO L93 Difference]: Finished difference Result 23404 states and 31528 transitions. [2019-09-08 10:32:35,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:32:35,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 10:32:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:35,718 INFO L225 Difference]: With dead ends: 23404 [2019-09-08 10:32:35,718 INFO L226 Difference]: Without dead ends: 23402 [2019-09-08 10:32:35,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:32:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23402 states. [2019-09-08 10:32:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23402 to 12794. [2019-09-08 10:32:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12794 states. [2019-09-08 10:32:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12794 states to 12794 states and 17147 transitions. [2019-09-08 10:32:38,113 INFO L78 Accepts]: Start accepts. Automaton has 12794 states and 17147 transitions. Word has length 76 [2019-09-08 10:32:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:38,113 INFO L475 AbstractCegarLoop]: Abstraction has 12794 states and 17147 transitions. [2019-09-08 10:32:38,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:32:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 12794 states and 17147 transitions. [2019-09-08 10:32:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:32:38,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:38,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:32:38,117 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:38,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1576523007, now seen corresponding path program 1 times [2019-09-08 10:32:38,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:38,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:38,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:38,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:38,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:32:38,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:38,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:32:38,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:32:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:32:38,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:38,162 INFO L87 Difference]: Start difference. First operand 12794 states and 17147 transitions. Second operand 3 states. [2019-09-08 10:32:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:42,734 INFO L93 Difference]: Finished difference Result 35595 states and 47704 transitions. [2019-09-08 10:32:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:32:42,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:32:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:42,757 INFO L225 Difference]: With dead ends: 35595 [2019-09-08 10:32:42,758 INFO L226 Difference]: Without dead ends: 23523 [2019-09-08 10:32:42,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23523 states. [2019-09-08 10:32:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23523 to 21813. [2019-09-08 10:32:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21813 states. [2019-09-08 10:32:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21813 states to 21813 states and 28970 transitions. [2019-09-08 10:32:46,820 INFO L78 Accepts]: Start accepts. Automaton has 21813 states and 28970 transitions. Word has length 77 [2019-09-08 10:32:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:46,820 INFO L475 AbstractCegarLoop]: Abstraction has 21813 states and 28970 transitions. [2019-09-08 10:32:46,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:32:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 21813 states and 28970 transitions. [2019-09-08 10:32:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:32:46,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:46,823 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:32:46,823 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:46,824 INFO L82 PathProgramCache]: Analyzing trace with hash 175965857, now seen corresponding path program 1 times [2019-09-08 10:32:46,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:46,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:46,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:46,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:32:46,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:46,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:32:46,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:32:46,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:32:46,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:46,869 INFO L87 Difference]: Start difference. First operand 21813 states and 28970 transitions. Second operand 3 states. [2019-09-08 10:32:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:53,097 INFO L93 Difference]: Finished difference Result 53507 states and 71070 transitions. [2019-09-08 10:32:53,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:32:53,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:32:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:53,130 INFO L225 Difference]: With dead ends: 53507 [2019-09-08 10:32:53,130 INFO L226 Difference]: Without dead ends: 32445 [2019-09-08 10:32:53,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32445 states. [2019-09-08 10:32:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32445 to 32443. [2019-09-08 10:32:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32443 states. [2019-09-08 10:32:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32443 states to 32443 states and 42708 transitions. [2019-09-08 10:32:59,345 INFO L78 Accepts]: Start accepts. Automaton has 32443 states and 42708 transitions. Word has length 78 [2019-09-08 10:32:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:59,345 INFO L475 AbstractCegarLoop]: Abstraction has 32443 states and 42708 transitions. [2019-09-08 10:32:59,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:32:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 32443 states and 42708 transitions. [2019-09-08 10:32:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 10:32:59,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:59,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:32:59,350 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:59,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:59,350 INFO L82 PathProgramCache]: Analyzing trace with hash -847980887, now seen corresponding path program 1 times [2019-09-08 10:32:59,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:59,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:59,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:59,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:59,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:32:59,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:59,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:32:59,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:32:59,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:32:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:32:59,396 INFO L87 Difference]: Start difference. First operand 32443 states and 42708 transitions. Second operand 5 states. [2019-09-08 10:33:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:33:23,913 INFO L93 Difference]: Finished difference Result 142046 states and 186144 transitions. [2019-09-08 10:33:23,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:33:23,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 10:33:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:33:24,038 INFO L225 Difference]: With dead ends: 142046 [2019-09-08 10:33:24,039 INFO L226 Difference]: Without dead ends: 110354 [2019-09-08 10:33:24,069 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 10:33:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110354 states. [2019-09-08 10:33:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110354 to 64823. [2019-09-08 10:33:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64823 states. [2019-09-08 10:33:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64823 states to 64823 states and 85110 transitions. [2019-09-08 10:33:36,288 INFO L78 Accepts]: Start accepts. Automaton has 64823 states and 85110 transitions. Word has length 86 [2019-09-08 10:33:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:33:36,289 INFO L475 AbstractCegarLoop]: Abstraction has 64823 states and 85110 transitions. [2019-09-08 10:33:36,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:33:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 64823 states and 85110 transitions. [2019-09-08 10:33:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 10:33:36,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:33:36,297 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:33:36,297 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:33:36,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:33:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1083848738, now seen corresponding path program 1 times [2019-09-08 10:33:36,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:33:36,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:33:36,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:36,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:33:36,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:33:36,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:33:36,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:33:36,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:33:36,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:33:36,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:33:36,362 INFO L87 Difference]: Start difference. First operand 64823 states and 85110 transitions. Second operand 5 states. [2019-09-08 10:34:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:03,910 INFO L93 Difference]: Finished difference Result 194048 states and 253839 transitions. [2019-09-08 10:34:03,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:34:03,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 10:34:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:04,063 INFO L225 Difference]: With dead ends: 194048 [2019-09-08 10:34:04,063 INFO L226 Difference]: Without dead ends: 129860 [2019-09-08 10:34:04,115 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 10:34:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129860 states. [2019-09-08 10:34:22,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129860 to 83693. [2019-09-08 10:34:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83693 states. [2019-09-08 10:34:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83693 states to 83693 states and 107669 transitions. [2019-09-08 10:34:23,044 INFO L78 Accepts]: Start accepts. Automaton has 83693 states and 107669 transitions. Word has length 92 [2019-09-08 10:34:23,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:23,044 INFO L475 AbstractCegarLoop]: Abstraction has 83693 states and 107669 transitions. [2019-09-08 10:34:23,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:34:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 83693 states and 107669 transitions. [2019-09-08 10:34:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:34:23,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:23,060 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:34:23,061 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1080560380, now seen corresponding path program 1 times [2019-09-08 10:34:23,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:23,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:23,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:34:23,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:23,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:23,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:23,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:23,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:23,109 INFO L87 Difference]: Start difference. First operand 83693 states and 107669 transitions. Second operand 3 states. [2019-09-08 10:34:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:56,676 INFO L93 Difference]: Finished difference Result 240789 states and 308549 transitions. [2019-09-08 10:34:56,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:56,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 10:34:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:56,857 INFO L225 Difference]: With dead ends: 240789 [2019-09-08 10:34:56,858 INFO L226 Difference]: Without dead ends: 157835 [2019-09-08 10:34:56,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157835 states. [2019-09-08 10:35:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157835 to 113319. [2019-09-08 10:35:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113319 states. [2019-09-08 10:35:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113319 states to 113319 states and 142971 transitions. [2019-09-08 10:35:22,995 INFO L78 Accepts]: Start accepts. Automaton has 113319 states and 142971 transitions. Word has length 97 [2019-09-08 10:35:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:22,995 INFO L475 AbstractCegarLoop]: Abstraction has 113319 states and 142971 transitions. [2019-09-08 10:35:22,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:35:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 113319 states and 142971 transitions. [2019-09-08 10:35:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 10:35:23,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:23,007 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:35:23,008 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash 143028520, now seen corresponding path program 1 times [2019-09-08 10:35:23,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:23,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:23,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:35:23,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:23,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:35:23,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:35:23,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:35:23,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:35:23,064 INFO L87 Difference]: Start difference. First operand 113319 states and 142971 transitions. Second operand 3 states. [2019-09-08 10:35:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:56,257 INFO L93 Difference]: Finished difference Result 253387 states and 317863 transitions. [2019-09-08 10:35:56,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:35:56,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 10:35:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:56,417 INFO L225 Difference]: With dead ends: 253387 [2019-09-08 10:35:56,417 INFO L226 Difference]: Without dead ends: 140807 [2019-09-08 10:35:56,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:35:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140807 states. [2019-09-08 10:36:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140807 to 120429. [2019-09-08 10:36:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120429 states. [2019-09-08 10:36:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120429 states to 120429 states and 149119 transitions. [2019-09-08 10:36:22,013 INFO L78 Accepts]: Start accepts. Automaton has 120429 states and 149119 transitions. Word has length 98 [2019-09-08 10:36:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:22,013 INFO L475 AbstractCegarLoop]: Abstraction has 120429 states and 149119 transitions. [2019-09-08 10:36:22,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 120429 states and 149119 transitions. [2019-09-08 10:36:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 10:36:22,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:22,023 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:36:22,023 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:22,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1368780627, now seen corresponding path program 1 times [2019-09-08 10:36:22,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:22,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:22,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:22,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:22,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:36:22,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:36:22,138 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) [2019-09-08 10:36:22,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:36:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:22,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 10:36:22,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:36:22,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:36:22,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:36:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 10:36:23,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:36:23,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12] total 15 [2019-09-08 10:36:23,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 10:36:23,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 10:36:23,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:36:23,785 INFO L87 Difference]: Start difference. First operand 120429 states and 149119 transitions. Second operand 15 states. [2019-09-08 10:36:25,512 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 10:36:26,907 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-08 10:36:28,107 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 10:37:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:40,592 INFO L93 Difference]: Finished difference Result 412278 states and 511319 transitions. [2019-09-08 10:37:40,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 10:37:40,592 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 101 [2019-09-08 10:37:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:41,081 INFO L225 Difference]: With dead ends: 412278 [2019-09-08 10:37:41,081 INFO L226 Difference]: Without dead ends: 292588 [2019-09-08 10:37:41,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 10:37:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292588 states. [2019-09-08 10:38:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292588 to 163881. [2019-09-08 10:38:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163881 states. [2019-09-08 10:38:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163881 states to 163881 states and 203040 transitions. [2019-09-08 10:38:26,429 INFO L78 Accepts]: Start accepts. Automaton has 163881 states and 203040 transitions. Word has length 101 [2019-09-08 10:38:26,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:26,429 INFO L475 AbstractCegarLoop]: Abstraction has 163881 states and 203040 transitions. [2019-09-08 10:38:26,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 10:38:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 163881 states and 203040 transitions. [2019-09-08 10:38:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 10:38:26,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:26,473 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:38:26,474 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:26,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:26,474 INFO L82 PathProgramCache]: Analyzing trace with hash -498710089, now seen corresponding path program 1 times [2019-09-08 10:38:26,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:26,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:26,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 10:38:26,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:26,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:38:26,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:38:26,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:38:26,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:38:26,554 INFO L87 Difference]: Start difference. First operand 163881 states and 203040 transitions. Second operand 4 states. [2019-09-08 10:39:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:30,852 INFO L93 Difference]: Finished difference Result 428658 states and 531060 transitions. [2019-09-08 10:39:30,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:39:30,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-08 10:39:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:31,160 INFO L225 Difference]: With dead ends: 428658 [2019-09-08 10:39:31,160 INFO L226 Difference]: Without dead ends: 267052 [2019-09-08 10:39:31,271 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 10:39:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267052 states. [2019-09-08 10:40:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267052 to 163349. [2019-09-08 10:40:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163349 states. [2019-09-08 10:40:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163349 states to 163349 states and 202413 transitions. [2019-09-08 10:40:14,324 INFO L78 Accepts]: Start accepts. Automaton has 163349 states and 202413 transitions. Word has length 111 [2019-09-08 10:40:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:14,324 INFO L475 AbstractCegarLoop]: Abstraction has 163349 states and 202413 transitions. [2019-09-08 10:40:14,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:40:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 163349 states and 202413 transitions. [2019-09-08 10:40:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 10:40:14,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:14,335 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:40:14,335 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:14,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:14,336 INFO L82 PathProgramCache]: Analyzing trace with hash 767120476, now seen corresponding path program 1 times [2019-09-08 10:40:14,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:14,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:14,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:14,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:14,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:40:14,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:14,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:40:14,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:40:14,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:40:14,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:40:14,393 INFO L87 Difference]: Start difference. First operand 163349 states and 202413 transitions. Second operand 5 states. [2019-09-08 10:41:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:05,773 INFO L93 Difference]: Finished difference Result 356000 states and 440452 transitions. [2019-09-08 10:41:05,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:41:05,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-08 10:41:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:06,009 INFO L225 Difference]: With dead ends: 356000 [2019-09-08 10:41:06,009 INFO L226 Difference]: Without dead ends: 193832 [2019-09-08 10:41:06,112 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 10:41:06,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193832 states. [2019-09-08 10:41:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193832 to 159025. [2019-09-08 10:41:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159025 states. [2019-09-08 10:41:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159025 states to 159025 states and 194618 transitions. [2019-09-08 10:41:44,396 INFO L78 Accepts]: Start accepts. Automaton has 159025 states and 194618 transitions. Word has length 111 [2019-09-08 10:41:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:44,396 INFO L475 AbstractCegarLoop]: Abstraction has 159025 states and 194618 transitions. [2019-09-08 10:41:44,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:41:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 159025 states and 194618 transitions. [2019-09-08 10:41:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 10:41:44,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:44,410 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:41:44,410 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:44,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:44,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1656308014, now seen corresponding path program 1 times [2019-09-08 10:41:44,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:44,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:44,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:44,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:44,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:44,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:44,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:41:44,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:41:44,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:41:44,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:41:44,706 INFO L87 Difference]: Start difference. First operand 159025 states and 194618 transitions. Second operand 10 states. [2019-09-08 10:43:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:38,041 INFO L93 Difference]: Finished difference Result 513844 states and 624976 transitions. [2019-09-08 10:43:38,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:43:38,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-09-08 10:43:38,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted.