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_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:07:50,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:07:50,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:07:50,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:07:50,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:07:50,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:07:50,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:07:50,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:07:50,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:07:50,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:07:50,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:07:50,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:07:50,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:07:50,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:07:50,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:07:50,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:07:50,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:07:50,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:07:50,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:07:50,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:07:50,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:07:50,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:07:50,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:07:50,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:07:50,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:07:50,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:07:50,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:07:50,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:07:50,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:07:50,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:07:50,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:07:50,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:07:50,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:07:50,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:07:50,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:07:50,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:07:50,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:07:50,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:07:50,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:07:50,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:07:50,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:07:50,953 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 13:07:50,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:07:50,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:07:50,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:07:50,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:07:50,969 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:07:50,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:07:50,970 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:07:50,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:07:50,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:07:50,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:07:50,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:07:50,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:07:50,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:07:50,971 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:07:50,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:07:50,971 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:07:50,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:07:50,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:07:50,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:07:50,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:07:50,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:07:50,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:07:50,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:07:50,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:07:50,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:07:50,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:07:50,975 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:07:50,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:07:50,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:07:51,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:07:51,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:07:51,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:07:51,043 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:07:51,044 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:07:51,044 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:07:51,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d943b67e/127dccd463cc41638d4f8bc792a0d50a/FLAG26aac270f [2019-09-08 13:07:51,645 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:07:51,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:07:51,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d943b67e/127dccd463cc41638d4f8bc792a0d50a/FLAG26aac270f [2019-09-08 13:07:51,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d943b67e/127dccd463cc41638d4f8bc792a0d50a [2019-09-08 13:07:51,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:07:51,958 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:07:51,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:07:51,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:07:51,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:07:51,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:07:51" (1/1) ... [2019-09-08 13:07:51,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9eabab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:51, skipping insertion in model container [2019-09-08 13:07:51,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:07:51" (1/1) ... [2019-09-08 13:07:51,975 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:07:52,046 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:07:52,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:07:52,582 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:07:52,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:07:52,868 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:07:52,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:52 WrapperNode [2019-09-08 13:07:52,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:07:52,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:07:52,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:07:52,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:07:52,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:52" (1/1) ... [2019-09-08 13:07:52,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:52" (1/1) ... [2019-09-08 13:07:52,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:52" (1/1) ... [2019-09-08 13:07:52,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:52" (1/1) ... [2019-09-08 13:07:52,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:52" (1/1) ... [2019-09-08 13:07:52,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:52" (1/1) ... [2019-09-08 13:07:52,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:52" (1/1) ... [2019-09-08 13:07:53,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:07:53,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:07:53,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:07:53,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:07:53,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:52" (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 13:07:53,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:07:53,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:07:53,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:07:53,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:07:53,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:07:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:07:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:07:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:07:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:07:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:07:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:07:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:07:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:07:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:07:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:07:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:07:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:07:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:07:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:07:54,662 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:07:54,663 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:07:54,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:07:54 BoogieIcfgContainer [2019-09-08 13:07:54,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:07:54,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:07:54,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:07:54,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:07:54,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:07:51" (1/3) ... [2019-09-08 13:07:54,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3834e1ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:07:54, skipping insertion in model container [2019-09-08 13:07:54,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:52" (2/3) ... [2019-09-08 13:07:54,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3834e1ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:07:54, skipping insertion in model container [2019-09-08 13:07:54,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:07:54" (3/3) ... [2019-09-08 13:07:54,679 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:07:54,689 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:07:54,713 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:07:54,730 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:07:54,769 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:07:54,770 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:07:54,770 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:07:54,770 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:07:54,771 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:07:54,771 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:07:54,771 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:07:54,771 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:07:54,771 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:07:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states. [2019-09-08 13:07:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 13:07:54,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:54,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:54,820 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:54,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:54,824 INFO L82 PathProgramCache]: Analyzing trace with hash 308974954, now seen corresponding path program 1 times [2019-09-08 13:07:54,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:54,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:54,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:54,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:54,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:55,502 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 13:07:55,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:55,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:55,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:55,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:55,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:55,536 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 3 states. [2019-09-08 13:07:55,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:55,703 INFO L93 Difference]: Finished difference Result 623 states and 1074 transitions. [2019-09-08 13:07:55,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:55,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-08 13:07:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:55,738 INFO L225 Difference]: With dead ends: 623 [2019-09-08 13:07:55,738 INFO L226 Difference]: Without dead ends: 465 [2019-09-08 13:07:55,746 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 13:07:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-08 13:07:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 463. [2019-09-08 13:07:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-08 13:07:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 771 transitions. [2019-09-08 13:07:55,890 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 771 transitions. Word has length 110 [2019-09-08 13:07:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:55,892 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 771 transitions. [2019-09-08 13:07:55,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 771 transitions. [2019-09-08 13:07:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 13:07:55,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:55,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:55,906 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash -69317551, now seen corresponding path program 1 times [2019-09-08 13:07:55,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:55,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:55,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:56,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 13:07:56,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:56,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:56,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:56,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:56,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:56,205 INFO L87 Difference]: Start difference. First operand 463 states and 771 transitions. Second operand 3 states. [2019-09-08 13:07:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:56,269 INFO L93 Difference]: Finished difference Result 999 states and 1667 transitions. [2019-09-08 13:07:56,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:56,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-08 13:07:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:56,276 INFO L225 Difference]: With dead ends: 999 [2019-09-08 13:07:56,276 INFO L226 Difference]: Without dead ends: 721 [2019-09-08 13:07:56,281 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 13:07:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-09-08 13:07:56,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 719. [2019-09-08 13:07:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-09-08 13:07:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1198 transitions. [2019-09-08 13:07:56,349 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1198 transitions. Word has length 113 [2019-09-08 13:07:56,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:56,350 INFO L475 AbstractCegarLoop]: Abstraction has 719 states and 1198 transitions. [2019-09-08 13:07:56,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1198 transitions. [2019-09-08 13:07:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 13:07:56,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:56,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:56,354 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:56,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:56,355 INFO L82 PathProgramCache]: Analyzing trace with hash 551083111, now seen corresponding path program 1 times [2019-09-08 13:07:56,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:56,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:56,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:56,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:56,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:56,520 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 13:07:56,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:56,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:56,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:56,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:56,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:56,524 INFO L87 Difference]: Start difference. First operand 719 states and 1198 transitions. Second operand 3 states. [2019-09-08 13:07:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:56,586 INFO L93 Difference]: Finished difference Result 1747 states and 2912 transitions. [2019-09-08 13:07:56,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:56,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 13:07:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:56,599 INFO L225 Difference]: With dead ends: 1747 [2019-09-08 13:07:56,600 INFO L226 Difference]: Without dead ends: 1213 [2019-09-08 13:07:56,603 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 13:07:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-09-08 13:07:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1211. [2019-09-08 13:07:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2019-09-08 13:07:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 2014 transitions. [2019-09-08 13:07:56,668 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 2014 transitions. Word has length 116 [2019-09-08 13:07:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:56,669 INFO L475 AbstractCegarLoop]: Abstraction has 1211 states and 2014 transitions. [2019-09-08 13:07:56,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 2014 transitions. [2019-09-08 13:07:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 13:07:56,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:56,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:56,674 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1790000478, now seen corresponding path program 1 times [2019-09-08 13:07:56,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:56,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:56,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:56,831 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 13:07:56,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:56,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:56,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:56,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:56,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:56,833 INFO L87 Difference]: Start difference. First operand 1211 states and 2014 transitions. Second operand 3 states. [2019-09-08 13:07:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:56,913 INFO L93 Difference]: Finished difference Result 3183 states and 5288 transitions. [2019-09-08 13:07:56,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:56,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-08 13:07:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:56,926 INFO L225 Difference]: With dead ends: 3183 [2019-09-08 13:07:56,926 INFO L226 Difference]: Without dead ends: 2157 [2019-09-08 13:07:56,930 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 13:07:56,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2019-09-08 13:07:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2155. [2019-09-08 13:07:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2155 states. [2019-09-08 13:07:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3570 transitions. [2019-09-08 13:07:57,020 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3570 transitions. Word has length 119 [2019-09-08 13:07:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:57,021 INFO L475 AbstractCegarLoop]: Abstraction has 2155 states and 3570 transitions. [2019-09-08 13:07:57,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3570 transitions. [2019-09-08 13:07:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 13:07:57,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:57,024 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:57,024 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:57,025 INFO L82 PathProgramCache]: Analyzing trace with hash -750482868, now seen corresponding path program 1 times [2019-09-08 13:07:57,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:57,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:57,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:57,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:57,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:57,321 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 13:07:57,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:57,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:07:57,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:07:57,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:07:57,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:07:57,323 INFO L87 Difference]: Start difference. First operand 2155 states and 3570 transitions. Second operand 6 states. [2019-09-08 13:07:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:58,027 INFO L93 Difference]: Finished difference Result 8221 states and 13683 transitions. [2019-09-08 13:07:58,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:07:58,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-09-08 13:07:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:58,066 INFO L225 Difference]: With dead ends: 8221 [2019-09-08 13:07:58,067 INFO L226 Difference]: Without dead ends: 6251 [2019-09-08 13:07:58,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:07:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2019-09-08 13:07:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 4917. [2019-09-08 13:07:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4917 states. [2019-09-08 13:07:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4917 states to 4917 states and 8155 transitions. [2019-09-08 13:07:58,467 INFO L78 Accepts]: Start accepts. Automaton has 4917 states and 8155 transitions. Word has length 122 [2019-09-08 13:07:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:58,468 INFO L475 AbstractCegarLoop]: Abstraction has 4917 states and 8155 transitions. [2019-09-08 13:07:58,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:07:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4917 states and 8155 transitions. [2019-09-08 13:07:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 13:07:58,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:58,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:58,473 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:58,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1856300748, now seen corresponding path program 1 times [2019-09-08 13:07:58,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:58,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:58,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:58,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:58,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:58,639 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 13:07:58,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:58,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:58,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:58,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:58,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:58,641 INFO L87 Difference]: Start difference. First operand 4917 states and 8155 transitions. Second operand 4 states. [2019-09-08 13:07:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:59,190 INFO L93 Difference]: Finished difference Result 13047 states and 21722 transitions. [2019-09-08 13:07:59,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:59,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-08 13:07:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:59,240 INFO L225 Difference]: With dead ends: 13047 [2019-09-08 13:07:59,240 INFO L226 Difference]: Without dead ends: 8315 [2019-09-08 13:07:59,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 13:07:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8315 states. [2019-09-08 13:07:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8315 to 7261. [2019-09-08 13:07:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7261 states. [2019-09-08 13:07:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7261 states to 7261 states and 12058 transitions. [2019-09-08 13:07:59,641 INFO L78 Accepts]: Start accepts. Automaton has 7261 states and 12058 transitions. Word has length 123 [2019-09-08 13:07:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:59,641 INFO L475 AbstractCegarLoop]: Abstraction has 7261 states and 12058 transitions. [2019-09-08 13:07:59,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7261 states and 12058 transitions. [2019-09-08 13:07:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 13:07:59,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:59,647 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:59,647 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:59,649 INFO L82 PathProgramCache]: Analyzing trace with hash -193895636, now seen corresponding path program 1 times [2019-09-08 13:07:59,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:59,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:59,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:59,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:59,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:59,770 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 13:07:59,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:59,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:59,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:59,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:59,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:59,772 INFO L87 Difference]: Start difference. First operand 7261 states and 12058 transitions. Second operand 3 states. [2019-09-08 13:08:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:00,306 INFO L93 Difference]: Finished difference Result 16033 states and 26747 transitions. [2019-09-08 13:08:00,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:00,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 13:08:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:00,372 INFO L225 Difference]: With dead ends: 16033 [2019-09-08 13:08:00,373 INFO L226 Difference]: Without dead ends: 11087 [2019-09-08 13:08:00,387 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 13:08:00,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11087 states. [2019-09-08 13:08:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11087 to 11085. [2019-09-08 13:08:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11085 states. [2019-09-08 13:08:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11085 states to 11085 states and 18413 transitions. [2019-09-08 13:08:00,942 INFO L78 Accepts]: Start accepts. Automaton has 11085 states and 18413 transitions. Word has length 124 [2019-09-08 13:08:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:00,943 INFO L475 AbstractCegarLoop]: Abstraction has 11085 states and 18413 transitions. [2019-09-08 13:08:00,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 11085 states and 18413 transitions. [2019-09-08 13:08:00,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 13:08:00,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:00,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:00,946 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:00,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:00,947 INFO L82 PathProgramCache]: Analyzing trace with hash 383149854, now seen corresponding path program 1 times [2019-09-08 13:08:00,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:00,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:00,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:00,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:00,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:01,061 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 13:08:01,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:01,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:01,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:01,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:01,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:01,063 INFO L87 Difference]: Start difference. First operand 11085 states and 18413 transitions. Second operand 3 states. [2019-09-08 13:08:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:01,727 INFO L93 Difference]: Finished difference Result 23181 states and 38559 transitions. [2019-09-08 13:08:01,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:01,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 13:08:01,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:01,772 INFO L225 Difference]: With dead ends: 23181 [2019-09-08 13:08:01,772 INFO L226 Difference]: Without dead ends: 16360 [2019-09-08 13:08:01,790 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 13:08:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16360 states. [2019-09-08 13:08:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16360 to 16358. [2019-09-08 13:08:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16358 states. [2019-09-08 13:08:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16358 states to 16358 states and 27101 transitions. [2019-09-08 13:08:03,048 INFO L78 Accepts]: Start accepts. Automaton has 16358 states and 27101 transitions. Word has length 124 [2019-09-08 13:08:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:03,049 INFO L475 AbstractCegarLoop]: Abstraction has 16358 states and 27101 transitions. [2019-09-08 13:08:03,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 16358 states and 27101 transitions. [2019-09-08 13:08:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 13:08:03,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:03,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:03,052 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:03,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:03,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1772358637, now seen corresponding path program 1 times [2019-09-08 13:08:03,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:03,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:03,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:03,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:03,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:03,187 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 13:08:03,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:03,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:03,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:03,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:03,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:03,189 INFO L87 Difference]: Start difference. First operand 16358 states and 27101 transitions. Second operand 4 states. [2019-09-08 13:08:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:04,330 INFO L93 Difference]: Finished difference Result 43623 states and 72422 transitions. [2019-09-08 13:08:04,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:08:04,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-08 13:08:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:04,407 INFO L225 Difference]: With dead ends: 43623 [2019-09-08 13:08:04,407 INFO L226 Difference]: Without dead ends: 27616 [2019-09-08 13:08:04,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 13:08:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27616 states. [2019-09-08 13:08:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27616 to 24206. [2019-09-08 13:08:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24206 states. [2019-09-08 13:08:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24206 states to 24206 states and 40030 transitions. [2019-09-08 13:08:05,513 INFO L78 Accepts]: Start accepts. Automaton has 24206 states and 40030 transitions. Word has length 124 [2019-09-08 13:08:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:05,513 INFO L475 AbstractCegarLoop]: Abstraction has 24206 states and 40030 transitions. [2019-09-08 13:08:05,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:08:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 24206 states and 40030 transitions. [2019-09-08 13:08:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 13:08:05,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:05,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:05,516 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:05,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1935100896, now seen corresponding path program 1 times [2019-09-08 13:08:05,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:05,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:05,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:05,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:05,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:05,610 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 13:08:05,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:05,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:05,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:05,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:05,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:05,612 INFO L87 Difference]: Start difference. First operand 24206 states and 40030 transitions. Second operand 3 states. [2019-09-08 13:08:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:07,033 INFO L93 Difference]: Finished difference Result 47438 states and 78542 transitions. [2019-09-08 13:08:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:07,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 13:08:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:07,125 INFO L225 Difference]: With dead ends: 47438 [2019-09-08 13:08:07,125 INFO L226 Difference]: Without dead ends: 33968 [2019-09-08 13:08:07,166 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 13:08:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33968 states. [2019-09-08 13:08:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33968 to 33966. [2019-09-08 13:08:08,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33966 states. [2019-09-08 13:08:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33966 states to 33966 states and 56015 transitions. [2019-09-08 13:08:09,043 INFO L78 Accepts]: Start accepts. Automaton has 33966 states and 56015 transitions. Word has length 124 [2019-09-08 13:08:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:09,044 INFO L475 AbstractCegarLoop]: Abstraction has 33966 states and 56015 transitions. [2019-09-08 13:08:09,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:09,044 INFO L276 IsEmpty]: Start isEmpty. Operand 33966 states and 56015 transitions. [2019-09-08 13:08:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 13:08:09,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:09,046 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:09,046 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:09,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:09,047 INFO L82 PathProgramCache]: Analyzing trace with hash 388299538, now seen corresponding path program 1 times [2019-09-08 13:08:09,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:09,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:09,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:09,143 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 13:08:09,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:09,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:09,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:09,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:09,145 INFO L87 Difference]: Start difference. First operand 33966 states and 56015 transitions. Second operand 3 states. [2019-09-08 13:08:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:11,262 INFO L93 Difference]: Finished difference Result 74031 states and 122216 transitions. [2019-09-08 13:08:11,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:11,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 13:08:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:11,374 INFO L225 Difference]: With dead ends: 74031 [2019-09-08 13:08:11,375 INFO L226 Difference]: Without dead ends: 50505 [2019-09-08 13:08:11,430 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 13:08:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50505 states. [2019-09-08 13:08:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50505 to 50503. [2019-09-08 13:08:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50503 states. [2019-09-08 13:08:13,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50503 states to 50503 states and 82975 transitions. [2019-09-08 13:08:13,234 INFO L78 Accepts]: Start accepts. Automaton has 50503 states and 82975 transitions. Word has length 124 [2019-09-08 13:08:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:13,235 INFO L475 AbstractCegarLoop]: Abstraction has 50503 states and 82975 transitions. [2019-09-08 13:08:13,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 50503 states and 82975 transitions. [2019-09-08 13:08:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 13:08:13,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:13,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:13,237 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash 834404827, now seen corresponding path program 1 times [2019-09-08 13:08:13,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:13,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:13,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:13,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:13,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:13,379 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 13:08:13,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:13,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:08:13,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:08:13,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:08:13,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:08:13,381 INFO L87 Difference]: Start difference. First operand 50503 states and 82975 transitions. Second operand 7 states. [2019-09-08 13:08:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:20,610 INFO L93 Difference]: Finished difference Result 235783 states and 386992 transitions. [2019-09-08 13:08:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:08:20,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-09-08 13:08:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:21,082 INFO L225 Difference]: With dead ends: 235783 [2019-09-08 13:08:21,083 INFO L226 Difference]: Without dead ends: 185533 [2019-09-08 13:08:21,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:08:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185533 states. [2019-09-08 13:08:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185533 to 140526. [2019-09-08 13:08:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140526 states. [2019-09-08 13:08:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140526 states to 140526 states and 228854 transitions. [2019-09-08 13:08:29,065 INFO L78 Accepts]: Start accepts. Automaton has 140526 states and 228854 transitions. Word has length 125 [2019-09-08 13:08:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:29,065 INFO L475 AbstractCegarLoop]: Abstraction has 140526 states and 228854 transitions. [2019-09-08 13:08:29,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:08:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 140526 states and 228854 transitions. [2019-09-08 13:08:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 13:08:29,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:29,067 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:29,067 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:29,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:29,067 INFO L82 PathProgramCache]: Analyzing trace with hash 44251610, now seen corresponding path program 1 times [2019-09-08 13:08:29,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:29,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:29,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:29,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:29,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:29,186 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 13:08:29,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:29,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:29,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:29,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:29,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:29,188 INFO L87 Difference]: Start difference. First operand 140526 states and 228854 transitions. Second operand 4 states. [2019-09-08 13:08:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:40,356 INFO L93 Difference]: Finished difference Result 414531 states and 675281 transitions. [2019-09-08 13:08:40,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:08:40,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-08 13:08:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:40,925 INFO L225 Difference]: With dead ends: 414531 [2019-09-08 13:08:40,925 INFO L226 Difference]: Without dead ends: 274258 [2019-09-08 13:08:41,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:08:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274258 states. [2019-09-08 13:08:53,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274258 to 206983. [2019-09-08 13:08:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206983 states. [2019-09-08 13:08:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206983 states to 206983 states and 336259 transitions. [2019-09-08 13:08:53,583 INFO L78 Accepts]: Start accepts. Automaton has 206983 states and 336259 transitions. Word has length 126 [2019-09-08 13:08:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:53,583 INFO L475 AbstractCegarLoop]: Abstraction has 206983 states and 336259 transitions. [2019-09-08 13:08:53,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:08:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 206983 states and 336259 transitions. [2019-09-08 13:08:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 13:08:53,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:53,585 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:53,585 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:53,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:53,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1913506038, now seen corresponding path program 1 times [2019-09-08 13:08:53,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:53,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:53,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:53,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:53,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:53,908 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 13:08:53,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:53,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:08:53,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:08:53,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:08:53,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:08:53,910 INFO L87 Difference]: Start difference. First operand 206983 states and 336259 transitions. Second operand 6 states. [2019-09-08 13:09:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:10,498 INFO L93 Difference]: Finished difference Result 505583 states and 822125 transitions. [2019-09-08 13:09:10,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:09:10,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-08 13:09:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:11,003 INFO L225 Difference]: With dead ends: 505583 [2019-09-08 13:09:11,004 INFO L226 Difference]: Without dead ends: 298853 [2019-09-08 13:09:11,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:09:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298853 states. [2019-09-08 13:09:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298853 to 236143. [2019-09-08 13:09:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236143 states. [2019-09-08 13:09:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236143 states to 236143 states and 382864 transitions. [2019-09-08 13:09:30,987 INFO L78 Accepts]: Start accepts. Automaton has 236143 states and 382864 transitions. Word has length 128 [2019-09-08 13:09:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:30,988 INFO L475 AbstractCegarLoop]: Abstraction has 236143 states and 382864 transitions. [2019-09-08 13:09:30,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:09:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 236143 states and 382864 transitions. [2019-09-08 13:09:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 13:09:30,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:30,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:09:30,990 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:30,990 INFO L82 PathProgramCache]: Analyzing trace with hash -206799924, now seen corresponding path program 1 times [2019-09-08 13:09:30,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:30,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:30,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:30,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:30,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:09:31,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:31,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:09:31,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:09:31,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:09:31,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:09:31,271 INFO L87 Difference]: Start difference. First operand 236143 states and 382864 transitions. Second operand 6 states. [2019-09-08 13:10:00,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:00,378 INFO L93 Difference]: Finished difference Result 694551 states and 1128720 transitions. [2019-09-08 13:10:00,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:10:00,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-08 13:10:00,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:01,255 INFO L225 Difference]: With dead ends: 694551 [2019-09-08 13:10:01,256 INFO L226 Difference]: Without dead ends: 458661 [2019-09-08 13:10:01,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:10:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458661 states. [2019-09-08 13:10:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458661 to 420175. [2019-09-08 13:10:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420175 states. [2019-09-08 13:10:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420175 states to 420175 states and 680951 transitions. [2019-09-08 13:10:38,834 INFO L78 Accepts]: Start accepts. Automaton has 420175 states and 680951 transitions. Word has length 131 [2019-09-08 13:10:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:38,834 INFO L475 AbstractCegarLoop]: Abstraction has 420175 states and 680951 transitions. [2019-09-08 13:10:38,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:10:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 420175 states and 680951 transitions. [2019-09-08 13:10:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 13:10:38,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:38,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:10:38,835 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2117739481, now seen corresponding path program 1 times [2019-09-08 13:10:38,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:38,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:38,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:38,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:38,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:39,000 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 13:10:39,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:39,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:10:39,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:10:39,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:10:39,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:10:39,004 INFO L87 Difference]: Start difference. First operand 420175 states and 680951 transitions. Second operand 5 states. [2019-09-08 13:11:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:23,846 INFO L93 Difference]: Finished difference Result 704191 states and 1136897 transitions. [2019-09-08 13:11:23,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:11:23,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-08 13:11:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:25,199 INFO L225 Difference]: With dead ends: 704191 [2019-09-08 13:11:25,200 INFO L226 Difference]: Without dead ends: 704189 [2019-09-08 13:11:25,369 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 13:11:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704189 states. [2019-09-08 13:12:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704189 to 426087. [2019-09-08 13:12:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426087 states. [2019-09-08 13:12:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426087 states to 426087 states and 686818 transitions. [2019-09-08 13:12:14,738 INFO L78 Accepts]: Start accepts. Automaton has 426087 states and 686818 transitions. Word has length 132 [2019-09-08 13:12:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:14,739 INFO L475 AbstractCegarLoop]: Abstraction has 426087 states and 686818 transitions. [2019-09-08 13:12:14,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:12:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 426087 states and 686818 transitions. [2019-09-08 13:12:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 13:12:14,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:14,748 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:14,748 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:14,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1363205167, now seen corresponding path program 1 times [2019-09-08 13:12:14,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:14,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:14,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:12:14,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:14,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:12:14,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:12:14,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:12:14,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:12:14,884 INFO L87 Difference]: Start difference. First operand 426087 states and 686818 transitions. Second operand 3 states. [2019-09-08 13:12:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:45,852 INFO L93 Difference]: Finished difference Result 778383 states and 1255311 transitions. [2019-09-08 13:12:45,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:12:45,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 13:12:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:46,541 INFO L225 Difference]: With dead ends: 778383 [2019-09-08 13:12:46,541 INFO L226 Difference]: Without dead ends: 352549 [2019-09-08 13:12:46,860 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 13:12:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352549 states. [2019-09-08 13:13:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352549 to 352314. [2019-09-08 13:13:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352314 states. [2019-09-08 13:13:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352314 states to 352314 states and 566406 transitions. [2019-09-08 13:13:18,653 INFO L78 Accepts]: Start accepts. Automaton has 352314 states and 566406 transitions. Word has length 166 [2019-09-08 13:13:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:13:18,653 INFO L475 AbstractCegarLoop]: Abstraction has 352314 states and 566406 transitions. [2019-09-08 13:13:18,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:13:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 352314 states and 566406 transitions. [2019-09-08 13:13:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 13:13:18,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:13:18,661 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:13:18,661 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:13:18,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:13:18,662 INFO L82 PathProgramCache]: Analyzing trace with hash -378000093, now seen corresponding path program 1 times [2019-09-08 13:13:18,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:13:18,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:13:18,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:18,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:13:18,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:13:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 13:13:18,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:13:18,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:13:18,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:13:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:13:18,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:13:18,829 INFO L87 Difference]: Start difference. First operand 352314 states and 566406 transitions. Second operand 6 states. [2019-09-08 13:13:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:13:55,110 INFO L93 Difference]: Finished difference Result 653480 states and 1053833 transitions. [2019-09-08 13:13:55,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:13:55,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-09-08 13:13:55,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:13:55,895 INFO L225 Difference]: With dead ends: 653480 [2019-09-08 13:13:55,895 INFO L226 Difference]: Without dead ends: 438426 [2019-09-08 13:13:56,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:13:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438426 states. [2019-09-08 13:14:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438426 to 402140. [2019-09-08 13:14:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402140 states. [2019-09-08 13:14:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402140 states to 402140 states and 646378 transitions. [2019-09-08 13:14:31,385 INFO L78 Accepts]: Start accepts. Automaton has 402140 states and 646378 transitions. Word has length 166 [2019-09-08 13:14:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:31,386 INFO L475 AbstractCegarLoop]: Abstraction has 402140 states and 646378 transitions. [2019-09-08 13:14:31,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:14:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 402140 states and 646378 transitions. [2019-09-08 13:14:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 13:14:31,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:31,394 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:31,394 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1111279008, now seen corresponding path program 1 times [2019-09-08 13:14:31,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:31,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:31,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:31,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:14:31,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 13:14:31,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:14:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:32,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 13:14:32,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:14:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:14:32,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:14:32,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 13:14:32,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:14:32,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:14:32,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:14:32,817 INFO L87 Difference]: Start difference. First operand 402140 states and 646378 transitions. Second operand 9 states. [2019-09-08 13:15:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:36,819 INFO L93 Difference]: Finished difference Result 925637 states and 1496867 transitions. [2019-09-08 13:15:36,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:15:36,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-09-08 13:15:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:39,043 INFO L225 Difference]: With dead ends: 925637 [2019-09-08 13:15:39,044 INFO L226 Difference]: Without dead ends: 828315 [2019-09-08 13:15:39,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:15:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828315 states. [2019-09-08 13:16:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828315 to 669827. [2019-09-08 13:16:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669827 states. [2019-09-08 13:16:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669827 states to 669827 states and 1078772 transitions. [2019-09-08 13:16:48,768 INFO L78 Accepts]: Start accepts. Automaton has 669827 states and 1078772 transitions. Word has length 167 [2019-09-08 13:16:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:48,769 INFO L475 AbstractCegarLoop]: Abstraction has 669827 states and 1078772 transitions. [2019-09-08 13:16:48,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:16:48,769 INFO L276 IsEmpty]: Start isEmpty. Operand 669827 states and 1078772 transitions. [2019-09-08 13:16:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 13:16:48,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:48,777 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:16:48,778 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:48,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:48,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2083796398, now seen corresponding path program 1 times [2019-09-08 13:16:48,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:48,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:48,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:48,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:48,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:16:48,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:48,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:16:48,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:16:48,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:16:48,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:16:48,937 INFO L87 Difference]: Start difference. First operand 669827 states and 1078772 transitions. Second operand 3 states. [2019-09-08 13:17:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:20,695 INFO L93 Difference]: Finished difference Result 948070 states and 1528697 transitions. [2019-09-08 13:17:20,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:20,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 13:17:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:21,377 INFO L225 Difference]: With dead ends: 948070 [2019-09-08 13:17:21,377 INFO L226 Difference]: Without dead ends: 278496 [2019-09-08 13:17:21,782 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 13:17:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278496 states. [2019-09-08 13:17:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278496 to 278490. [2019-09-08 13:17:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278490 states. [2019-09-08 13:17:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278490 states to 278490 states and 448660 transitions. [2019-09-08 13:17:43,010 INFO L78 Accepts]: Start accepts. Automaton has 278490 states and 448660 transitions. Word has length 167 [2019-09-08 13:17:43,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:43,011 INFO L475 AbstractCegarLoop]: Abstraction has 278490 states and 448660 transitions. [2019-09-08 13:17:43,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:17:43,011 INFO L276 IsEmpty]: Start isEmpty. Operand 278490 states and 448660 transitions. [2019-09-08 13:17:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:17:43,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:43,017 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:43,017 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:43,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash -156079200, now seen corresponding path program 1 times [2019-09-08 13:17:43,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:43,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:43,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:43,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:43,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:43,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:17:43,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 13:17:43,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:17:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:43,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 13:17:43,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:17:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:17:43,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:17:43,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-09-08 13:17:43,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 13:17:43,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 13:17:43,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:17:43,574 INFO L87 Difference]: Start difference. First operand 278490 states and 448660 transitions. Second operand 11 states.