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.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:23:36,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:23:36,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:23:36,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:23:36,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:23:36,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:23:36,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:23:36,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:23:36,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:23:36,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:23:36,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:23:36,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:23:36,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:23:36,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:23:36,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:23:36,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:23:36,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:23:36,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:23:36,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:23:36,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:23:36,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:23:36,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:23:36,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:23:36,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:23:36,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:23:36,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:23:36,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:23:36,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:23:36,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:23:36,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:23:36,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:23:36,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:23:36,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:23:36,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:23:36,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:23:36,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:23:36,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:23:36,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:23:36,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:23:36,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:23:36,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:23:36,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 11:23:36,748 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:23:36,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:23:36,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:23:36,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:23:36,750 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:23:36,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:23:36,751 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:23:36,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:23:36,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:23:36,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:23:36,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:23:36,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:23:36,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:23:36,753 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:23:36,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:23:36,754 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:23:36,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:23:36,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:23:36,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:23:36,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:23:36,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:23:36,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:23:36,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:23:36,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:23:36,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:23:36,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:23:36,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:23:36,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:23:36,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:23:36,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:23:36,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:23:36,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:23:36,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:23:36,808 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:23:36,809 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.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 11:23:36,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f3be141/710c9cbced384e218c8b175d9327514d/FLAGd4dbafae4 [2019-09-08 11:23:37,349 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:23:37,350 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 11:23:37,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f3be141/710c9cbced384e218c8b175d9327514d/FLAGd4dbafae4 [2019-09-08 11:23:37,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f3be141/710c9cbced384e218c8b175d9327514d [2019-09-08 11:23:37,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:23:37,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:23:37,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:23:37,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:23:37,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:23:37,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:23:37" (1/1) ... [2019-09-08 11:23:37,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4741b8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:37, skipping insertion in model container [2019-09-08 11:23:37,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:23:37" (1/1) ... [2019-09-08 11:23:37,753 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:23:37,835 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:23:38,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:23:38,316 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:23:38,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:23:38,456 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:23:38,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:38 WrapperNode [2019-09-08 11:23:38,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:23:38,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:23:38,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:23:38,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:23:38,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:38" (1/1) ... [2019-09-08 11:23:38,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:38" (1/1) ... [2019-09-08 11:23:38,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:38" (1/1) ... [2019-09-08 11:23:38,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:38" (1/1) ... [2019-09-08 11:23:38,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:38" (1/1) ... [2019-09-08 11:23:38,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:38" (1/1) ... [2019-09-08 11:23:38,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:38" (1/1) ... [2019-09-08 11:23:38,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:23:38,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:23:38,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:23:38,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:23:38,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:23:38,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:23:38,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:23:38,626 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:23:38,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:23:38,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:23:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:23:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:23:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:23:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:23:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:23:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:23:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:23:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:23:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:23:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:23:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 11:23:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:23:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:23:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:23:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:23:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:23:39,904 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:23:39,905 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:23:39,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:23:39 BoogieIcfgContainer [2019-09-08 11:23:39,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:23:39,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:23:39,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:23:39,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:23:39,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:23:37" (1/3) ... [2019-09-08 11:23:39,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3241a718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:23:39, skipping insertion in model container [2019-09-08 11:23:39,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:38" (2/3) ... [2019-09-08 11:23:39,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3241a718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:23:39, skipping insertion in model container [2019-09-08 11:23:39,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:23:39" (3/3) ... [2019-09-08 11:23:39,921 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 11:23:39,932 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:23:39,956 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:23:39,974 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:23:40,022 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:23:40,023 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:23:40,023 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:23:40,023 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:23:40,023 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:23:40,024 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:23:40,024 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:23:40,024 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:23:40,024 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:23:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2019-09-08 11:23:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:23:40,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:40,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:40,078 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash -722684115, now seen corresponding path program 1 times [2019-09-08 11:23:40,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:40,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:40,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:40,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:40,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:40,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:40,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:23:40,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:23:40,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:23:40,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:40,669 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2019-09-08 11:23:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:40,841 INFO L93 Difference]: Finished difference Result 510 states and 840 transitions. [2019-09-08 11:23:40,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:23:40,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:23:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:40,861 INFO L225 Difference]: With dead ends: 510 [2019-09-08 11:23:40,861 INFO L226 Difference]: Without dead ends: 386 [2019-09-08 11:23:40,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-08 11:23:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 384. [2019-09-08 11:23:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-08 11:23:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 572 transitions. [2019-09-08 11:23:40,962 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 572 transitions. Word has length 100 [2019-09-08 11:23:40,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:40,963 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 572 transitions. [2019-09-08 11:23:40,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:23:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 572 transitions. [2019-09-08 11:23:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:23:40,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:40,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:40,969 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1251665587, now seen corresponding path program 1 times [2019-09-08 11:23:40,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:40,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:40,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:41,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:41,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:23:41,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:23:41,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:23:41,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:23:41,417 INFO L87 Difference]: Start difference. First operand 384 states and 572 transitions. Second operand 8 states. [2019-09-08 11:23:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:41,924 INFO L93 Difference]: Finished difference Result 1899 states and 2938 transitions. [2019-09-08 11:23:41,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:23:41,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-08 11:23:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:41,938 INFO L225 Difference]: With dead ends: 1899 [2019-09-08 11:23:41,938 INFO L226 Difference]: Without dead ends: 1615 [2019-09-08 11:23:41,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:23:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2019-09-08 11:23:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1605. [2019-09-08 11:23:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-09-08 11:23:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2476 transitions. [2019-09-08 11:23:42,066 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2476 transitions. Word has length 101 [2019-09-08 11:23:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:42,067 INFO L475 AbstractCegarLoop]: Abstraction has 1605 states and 2476 transitions. [2019-09-08 11:23:42,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:23:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2476 transitions. [2019-09-08 11:23:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:23:42,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:42,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:42,080 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:42,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:42,081 INFO L82 PathProgramCache]: Analyzing trace with hash -162540615, now seen corresponding path program 1 times [2019-09-08 11:23:42,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:42,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:42,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:42,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:42,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:42,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:23:42,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:23:42,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:23:42,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:23:42,304 INFO L87 Difference]: Start difference. First operand 1605 states and 2476 transitions. Second operand 6 states. [2019-09-08 11:23:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:42,941 INFO L93 Difference]: Finished difference Result 5564 states and 8701 transitions. [2019-09-08 11:23:42,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:23:42,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-09-08 11:23:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:42,964 INFO L225 Difference]: With dead ends: 5564 [2019-09-08 11:23:42,965 INFO L226 Difference]: Without dead ends: 4027 [2019-09-08 11:23:42,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:23:42,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4027 states. [2019-09-08 11:23:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4027 to 4023. [2019-09-08 11:23:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4023 states. [2019-09-08 11:23:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4023 states to 4023 states and 6277 transitions. [2019-09-08 11:23:43,203 INFO L78 Accepts]: Start accepts. Automaton has 4023 states and 6277 transitions. Word has length 102 [2019-09-08 11:23:43,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:43,203 INFO L475 AbstractCegarLoop]: Abstraction has 4023 states and 6277 transitions. [2019-09-08 11:23:43,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:23:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4023 states and 6277 transitions. [2019-09-08 11:23:43,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:23:43,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:43,208 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:43,208 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:43,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:43,209 INFO L82 PathProgramCache]: Analyzing trace with hash 198125813, now seen corresponding path program 1 times [2019-09-08 11:23:43,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:43,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:43,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:43,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:43,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:43,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:43,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:23:43,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:23:43,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:23:43,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:23:43,332 INFO L87 Difference]: Start difference. First operand 4023 states and 6277 transitions. Second operand 5 states. [2019-09-08 11:23:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:44,084 INFO L93 Difference]: Finished difference Result 11013 states and 17285 transitions. [2019-09-08 11:23:44,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:23:44,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:23:44,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:44,135 INFO L225 Difference]: With dead ends: 11013 [2019-09-08 11:23:44,135 INFO L226 Difference]: Without dead ends: 7189 [2019-09-08 11:23:44,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:23:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7189 states. [2019-09-08 11:23:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7189 to 7187. [2019-09-08 11:23:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7187 states. [2019-09-08 11:23:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7187 states to 7187 states and 11225 transitions. [2019-09-08 11:23:44,750 INFO L78 Accepts]: Start accepts. Automaton has 7187 states and 11225 transitions. Word has length 102 [2019-09-08 11:23:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:44,751 INFO L475 AbstractCegarLoop]: Abstraction has 7187 states and 11225 transitions. [2019-09-08 11:23:44,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:23:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 7187 states and 11225 transitions. [2019-09-08 11:23:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:23:44,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:44,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:44,757 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:44,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:44,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1305613734, now seen corresponding path program 1 times [2019-09-08 11:23:44,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:44,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:44,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:44,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:44,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:23:44,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:23:44,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:23:44,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:23:44,923 INFO L87 Difference]: Start difference. First operand 7187 states and 11225 transitions. Second operand 5 states. [2019-09-08 11:23:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:45,865 INFO L93 Difference]: Finished difference Result 20572 states and 32218 transitions. [2019-09-08 11:23:45,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:23:45,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:23:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:45,947 INFO L225 Difference]: With dead ends: 20572 [2019-09-08 11:23:45,948 INFO L226 Difference]: Without dead ends: 13543 [2019-09-08 11:23:45,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:23:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13543 states. [2019-09-08 11:23:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13543 to 13541. [2019-09-08 11:23:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13541 states. [2019-09-08 11:23:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13541 states to 13541 states and 21105 transitions. [2019-09-08 11:23:46,713 INFO L78 Accepts]: Start accepts. Automaton has 13541 states and 21105 transitions. Word has length 102 [2019-09-08 11:23:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:46,714 INFO L475 AbstractCegarLoop]: Abstraction has 13541 states and 21105 transitions. [2019-09-08 11:23:46,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:23:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 13541 states and 21105 transitions. [2019-09-08 11:23:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:23:46,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:46,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:46,720 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:46,720 INFO L82 PathProgramCache]: Analyzing trace with hash 715347543, now seen corresponding path program 1 times [2019-09-08 11:23:46,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:46,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:46,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:46,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:46,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:46,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:46,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:23:46,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:23:46,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:23:46,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:23:46,834 INFO L87 Difference]: Start difference. First operand 13541 states and 21105 transitions. Second operand 5 states. [2019-09-08 11:23:48,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:48,279 INFO L93 Difference]: Finished difference Result 39793 states and 62115 transitions. [2019-09-08 11:23:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:23:48,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:23:48,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:48,342 INFO L225 Difference]: With dead ends: 39793 [2019-09-08 11:23:48,342 INFO L226 Difference]: Without dead ends: 26373 [2019-09-08 11:23:48,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:23:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26373 states. [2019-09-08 11:23:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26373 to 26371. [2019-09-08 11:23:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26371 states. [2019-09-08 11:23:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26371 states to 26371 states and 40962 transitions. [2019-09-08 11:23:50,145 INFO L78 Accepts]: Start accepts. Automaton has 26371 states and 40962 transitions. Word has length 102 [2019-09-08 11:23:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:50,145 INFO L475 AbstractCegarLoop]: Abstraction has 26371 states and 40962 transitions. [2019-09-08 11:23:50,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:23:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 26371 states and 40962 transitions. [2019-09-08 11:23:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:23:50,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:50,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:50,154 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1462064376, now seen corresponding path program 1 times [2019-09-08 11:23:50,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:50,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:50,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:50,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:50,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:50,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:23:50,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:23:50,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:23:50,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:23:50,244 INFO L87 Difference]: Start difference. First operand 26371 states and 40962 transitions. Second operand 5 states. [2019-09-08 11:23:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:52,585 INFO L93 Difference]: Finished difference Result 78417 states and 121914 transitions. [2019-09-08 11:23:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:23:52,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:23:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:52,712 INFO L225 Difference]: With dead ends: 78417 [2019-09-08 11:23:52,712 INFO L226 Difference]: Without dead ends: 52137 [2019-09-08 11:23:52,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:23:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52137 states. [2019-09-08 11:23:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52137 to 52135. [2019-09-08 11:23:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52135 states. [2019-09-08 11:23:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52135 states to 52135 states and 80622 transitions. [2019-09-08 11:23:56,018 INFO L78 Accepts]: Start accepts. Automaton has 52135 states and 80622 transitions. Word has length 102 [2019-09-08 11:23:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:56,019 INFO L475 AbstractCegarLoop]: Abstraction has 52135 states and 80622 transitions. [2019-09-08 11:23:56,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:23:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 52135 states and 80622 transitions. [2019-09-08 11:23:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:23:56,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:56,031 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:56,031 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:56,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:56,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1022424041, now seen corresponding path program 1 times [2019-09-08 11:23:56,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:56,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:56,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:56,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:56,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:56,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:56,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:23:56,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:23:56,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:23:56,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:23:56,118 INFO L87 Difference]: Start difference. First operand 52135 states and 80622 transitions. Second operand 5 states. [2019-09-08 11:24:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:00,606 INFO L93 Difference]: Finished difference Result 148304 states and 229477 transitions. [2019-09-08 11:24:00,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:24:00,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:24:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:00,779 INFO L225 Difference]: With dead ends: 148304 [2019-09-08 11:24:00,779 INFO L226 Difference]: Without dead ends: 96253 [2019-09-08 11:24:00,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:24:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96253 states. [2019-09-08 11:24:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96253 to 96251. [2019-09-08 11:24:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96251 states. [2019-09-08 11:24:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96251 states to 96251 states and 148371 transitions. [2019-09-08 11:24:04,322 INFO L78 Accepts]: Start accepts. Automaton has 96251 states and 148371 transitions. Word has length 103 [2019-09-08 11:24:04,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:04,322 INFO L475 AbstractCegarLoop]: Abstraction has 96251 states and 148371 transitions. [2019-09-08 11:24:04,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:24:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 96251 states and 148371 transitions. [2019-09-08 11:24:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:24:04,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:04,345 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:04,346 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:04,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:04,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1830192834, now seen corresponding path program 1 times [2019-09-08 11:24:04,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:04,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:04,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:04,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:04,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:05,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:05,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:24:05,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:24:05,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:24:05,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:24:05,978 INFO L87 Difference]: Start difference. First operand 96251 states and 148371 transitions. Second operand 5 states. [2019-09-08 11:24:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:11,823 INFO L93 Difference]: Finished difference Result 184269 states and 282852 transitions. [2019-09-08 11:24:11,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:24:11,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:24:11,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:12,163 INFO L225 Difference]: With dead ends: 184269 [2019-09-08 11:24:12,163 INFO L226 Difference]: Without dead ends: 184267 [2019-09-08 11:24:12,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:24:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184267 states. [2019-09-08 11:24:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184267 to 97307. [2019-09-08 11:24:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97307 states. [2019-09-08 11:24:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97307 states to 97307 states and 149427 transitions. [2019-09-08 11:24:19,592 INFO L78 Accepts]: Start accepts. Automaton has 97307 states and 149427 transitions. Word has length 103 [2019-09-08 11:24:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:19,593 INFO L475 AbstractCegarLoop]: Abstraction has 97307 states and 149427 transitions. [2019-09-08 11:24:19,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:24:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 97307 states and 149427 transitions. [2019-09-08 11:24:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:24:19,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:19,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:19,611 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:19,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:19,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1225615889, now seen corresponding path program 1 times [2019-09-08 11:24:19,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:19,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:19,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:19,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:19,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:19,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:19,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:24:19,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:24:19,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:24:19,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:24:19,781 INFO L87 Difference]: Start difference. First operand 97307 states and 149427 transitions. Second operand 4 states. [2019-09-08 11:24:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:27,559 INFO L93 Difference]: Finished difference Result 277855 states and 425317 transitions. [2019-09-08 11:24:27,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:24:27,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-08 11:24:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:27,895 INFO L225 Difference]: With dead ends: 277855 [2019-09-08 11:24:27,897 INFO L226 Difference]: Without dead ends: 182973 [2019-09-08 11:24:27,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:24:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182973 states. [2019-09-08 11:24:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182973 to 182971. [2019-09-08 11:24:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182971 states. [2019-09-08 11:24:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182971 states to 182971 states and 278995 transitions. [2019-09-08 11:24:38,909 INFO L78 Accepts]: Start accepts. Automaton has 182971 states and 278995 transitions. Word has length 104 [2019-09-08 11:24:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:38,909 INFO L475 AbstractCegarLoop]: Abstraction has 182971 states and 278995 transitions. [2019-09-08 11:24:38,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:24:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 182971 states and 278995 transitions. [2019-09-08 11:24:38,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:24:38,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:38,926 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:38,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:38,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1191375131, now seen corresponding path program 1 times [2019-09-08 11:24:38,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:38,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:38,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:38,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:38,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:38,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:38,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:24:38,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:24:38,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:24:38,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:24:39,000 INFO L87 Difference]: Start difference. First operand 182971 states and 278995 transitions. Second operand 3 states. [2019-09-08 11:24:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:53,366 INFO L93 Difference]: Finished difference Result 426014 states and 649722 transitions. [2019-09-08 11:24:53,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:24:53,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 11:24:53,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:53,752 INFO L225 Difference]: With dead ends: 426014 [2019-09-08 11:24:53,753 INFO L226 Difference]: Without dead ends: 258782 [2019-09-08 11:24:53,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:24:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258782 states. [2019-09-08 11:25:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258782 to 180648. [2019-09-08 11:25:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180648 states. [2019-09-08 11:25:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180648 states to 180648 states and 273593 transitions. [2019-09-08 11:25:08,315 INFO L78 Accepts]: Start accepts. Automaton has 180648 states and 273593 transitions. Word has length 105 [2019-09-08 11:25:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:08,315 INFO L475 AbstractCegarLoop]: Abstraction has 180648 states and 273593 transitions. [2019-09-08 11:25:08,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 180648 states and 273593 transitions. [2019-09-08 11:25:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:25:08,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:08,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:08,328 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:08,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2081890073, now seen corresponding path program 1 times [2019-09-08 11:25:08,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:08,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:08,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:08,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 11:25:08,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:08,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:08,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:08,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:08,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:08,407 INFO L87 Difference]: Start difference. First operand 180648 states and 273593 transitions. Second operand 3 states. [2019-09-08 11:25:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:20,809 INFO L93 Difference]: Finished difference Result 330004 states and 499677 transitions. [2019-09-08 11:25:20,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:20,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 11:25:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:21,125 INFO L225 Difference]: With dead ends: 330004 [2019-09-08 11:25:21,125 INFO L226 Difference]: Without dead ends: 224630 [2019-09-08 11:25:21,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224630 states. [2019-09-08 11:25:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224630 to 222986. [2019-09-08 11:25:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222986 states. [2019-09-08 11:25:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222986 states to 222986 states and 333833 transitions. [2019-09-08 11:25:34,382 INFO L78 Accepts]: Start accepts. Automaton has 222986 states and 333833 transitions. Word has length 105 [2019-09-08 11:25:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:34,382 INFO L475 AbstractCegarLoop]: Abstraction has 222986 states and 333833 transitions. [2019-09-08 11:25:34,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 222986 states and 333833 transitions. [2019-09-08 11:25:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:25:34,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:34,398 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:34,399 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:34,399 INFO L82 PathProgramCache]: Analyzing trace with hash -90159259, now seen corresponding path program 1 times [2019-09-08 11:25:34,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:34,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:34,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:34,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:34,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:34,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:34,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:34,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:34,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:34,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:34,466 INFO L87 Difference]: Start difference. First operand 222986 states and 333833 transitions. Second operand 3 states. [2019-09-08 11:25:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:49,235 INFO L93 Difference]: Finished difference Result 352130 states and 526307 transitions. [2019-09-08 11:25:49,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:49,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 11:25:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:49,594 INFO L225 Difference]: With dead ends: 352130 [2019-09-08 11:25:49,595 INFO L226 Difference]: Without dead ends: 250432 [2019-09-08 11:25:49,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250432 states. [2019-09-08 11:26:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250432 to 248584. [2019-09-08 11:26:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248584 states. [2019-09-08 11:26:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248584 states to 248584 states and 366907 transitions. [2019-09-08 11:26:08,109 INFO L78 Accepts]: Start accepts. Automaton has 248584 states and 366907 transitions. Word has length 105 [2019-09-08 11:26:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:08,110 INFO L475 AbstractCegarLoop]: Abstraction has 248584 states and 366907 transitions. [2019-09-08 11:26:08,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:26:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 248584 states and 366907 transitions. [2019-09-08 11:26:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:26:08,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:08,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:26:08,134 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:08,135 INFO L82 PathProgramCache]: Analyzing trace with hash 335013402, now seen corresponding path program 1 times [2019-09-08 11:26:08,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:08,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:08,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:08,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:08,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:26:08,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:08,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:26:08,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:26:08,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:26:08,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:26:08,204 INFO L87 Difference]: Start difference. First operand 248584 states and 366907 transitions. Second operand 3 states. [2019-09-08 11:26:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:25,215 INFO L93 Difference]: Finished difference Result 329954 states and 485715 transitions. [2019-09-08 11:26:25,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:26:25,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 11:26:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:25,529 INFO L225 Difference]: With dead ends: 329954 [2019-09-08 11:26:25,529 INFO L226 Difference]: Without dead ends: 255432 [2019-09-08 11:26:25,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:26:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255432 states. [2019-09-08 11:26:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255432 to 232606. [2019-09-08 11:26:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232606 states. [2019-09-08 11:26:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232606 states to 232606 states and 338737 transitions. [2019-09-08 11:26:40,351 INFO L78 Accepts]: Start accepts. Automaton has 232606 states and 338737 transitions. Word has length 105 [2019-09-08 11:26:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:40,351 INFO L475 AbstractCegarLoop]: Abstraction has 232606 states and 338737 transitions. [2019-09-08 11:26:40,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:26:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 232606 states and 338737 transitions. [2019-09-08 11:26:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:26:40,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:40,366 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:26:40,366 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:40,366 INFO L82 PathProgramCache]: Analyzing trace with hash -591285467, now seen corresponding path program 1 times [2019-09-08 11:26:40,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:40,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:40,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:26:40,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:40,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:26:40,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:26:40,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:26:40,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:26:40,429 INFO L87 Difference]: Start difference. First operand 232606 states and 338737 transitions. Second operand 3 states. [2019-09-08 11:26:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:59,378 INFO L93 Difference]: Finished difference Result 482432 states and 701547 transitions. [2019-09-08 11:26:59,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:26:59,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 11:26:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:59,815 INFO L225 Difference]: With dead ends: 482432 [2019-09-08 11:26:59,815 INFO L226 Difference]: Without dead ends: 294666 [2019-09-08 11:26:59,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294666 states. [2019-09-08 11:27:22,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294666 to 292624. [2019-09-08 11:27:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292624 states. [2019-09-08 11:27:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292624 states to 292624 states and 419173 transitions. [2019-09-08 11:27:22,783 INFO L78 Accepts]: Start accepts. Automaton has 292624 states and 419173 transitions. Word has length 105 [2019-09-08 11:27:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:22,783 INFO L475 AbstractCegarLoop]: Abstraction has 292624 states and 419173 transitions. [2019-09-08 11:27:22,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:27:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 292624 states and 419173 transitions. [2019-09-08 11:27:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:27:22,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:22,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:22,800 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:22,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:22,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1654258983, now seen corresponding path program 1 times [2019-09-08 11:27:22,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:22,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:22,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:22,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:22,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:27:22,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:27:22,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:27:22,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:27:22,903 INFO L87 Difference]: Start difference. First operand 292624 states and 419173 transitions. Second operand 7 states. [2019-09-08 11:28:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:53,563 INFO L93 Difference]: Finished difference Result 1435837 states and 2040801 transitions. [2019-09-08 11:28:53,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:28:53,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-08 11:28:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:55,405 INFO L225 Difference]: With dead ends: 1435837 [2019-09-08 11:28:55,405 INFO L226 Difference]: Without dead ends: 1307616 [2019-09-08 11:28:55,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:28:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307616 states. [2019-09-08 11:29:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307616 to 292720. [2019-09-08 11:29:33,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292720 states. [2019-09-08 11:29:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292720 states to 292720 states and 419301 transitions. [2019-09-08 11:29:33,919 INFO L78 Accepts]: Start accepts. Automaton has 292720 states and 419301 transitions. Word has length 105 [2019-09-08 11:29:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:33,920 INFO L475 AbstractCegarLoop]: Abstraction has 292720 states and 419301 transitions. [2019-09-08 11:29:33,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:29:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 292720 states and 419301 transitions. [2019-09-08 11:29:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:29:33,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:33,941 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:29:33,941 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:33,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:33,941 INFO L82 PathProgramCache]: Analyzing trace with hash -608389222, now seen corresponding path program 1 times [2019-09-08 11:29:33,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:33,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:33,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:33,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:33,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:29:38,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:38,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:29:38,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:29:38,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:29:38,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:29:38,770 INFO L87 Difference]: Start difference. First operand 292720 states and 419301 transitions. Second operand 7 states. [2019-09-08 11:30:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:30:57,421 INFO L93 Difference]: Finished difference Result 958872 states and 1357762 transitions. [2019-09-08 11:30:57,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:30:57,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-08 11:30:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:30:58,808 INFO L225 Difference]: With dead ends: 958872 [2019-09-08 11:30:58,809 INFO L226 Difference]: Without dead ends: 907732 [2019-09-08 11:30:58,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:30:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907732 states. [2019-09-08 11:31:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907732 to 354704. [2019-09-08 11:31:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354704 states. [2019-09-08 11:31:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354704 states to 354704 states and 506786 transitions. [2019-09-08 11:31:41,579 INFO L78 Accepts]: Start accepts. Automaton has 354704 states and 506786 transitions. Word has length 105 [2019-09-08 11:31:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:31:41,580 INFO L475 AbstractCegarLoop]: Abstraction has 354704 states and 506786 transitions. [2019-09-08 11:31:41,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:31:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 354704 states and 506786 transitions. [2019-09-08 11:31:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:31:41,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:31:41,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:31:41,602 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:31:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:31:41,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1884535675, now seen corresponding path program 1 times [2019-09-08 11:31:41,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:31:41,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:31:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:41,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:31:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:31:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:31:41,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:31:41,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:31:41,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:31:41,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:31:41,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:31:41,711 INFO L87 Difference]: Start difference. First operand 354704 states and 506786 transitions. Second operand 7 states. [2019-09-08 11:34:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:34:29,587 INFO L93 Difference]: Finished difference Result 1816724 states and 2562774 transitions. [2019-09-08 11:34:29,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:34:29,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-08 11:34:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:34:32,253 INFO L225 Difference]: With dead ends: 1816724 [2019-09-08 11:34:32,253 INFO L226 Difference]: Without dead ends: 1700202 [2019-09-08 11:34:32,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:34:33,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700202 states.