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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:52:10,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:52:10,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:52:10,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:52:10,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:52:10,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:52:10,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:52:10,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:52:10,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:52:10,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:52:10,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:52:10,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:52:10,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:52:10,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:52:10,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:52:10,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:52:10,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:52:10,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:52:10,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:52:10,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:52:10,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:52:10,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:52:10,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:52:10,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:52:10,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:52:10,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:52:10,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:52:10,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:52:10,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:52:10,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:52:10,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:52:10,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:52:10,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:52:10,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:52:10,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:52:10,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:52:10,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:52:10,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:52:10,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:52:10,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:52:10,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:52:10,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:52:10,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:52:10,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:52:10,954 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:52:10,954 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:52:10,955 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:52:10,955 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:52:10,955 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:52:10,956 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:52:10,956 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:52:10,956 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:52:10,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:52:10,959 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:52:10,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:52:10,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:52:10,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:52:10,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:52:10,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:52:10,960 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:52:10,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:52:10,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:52:10,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:52:10,961 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:52:10,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:52:10,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:52:10,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:52:10,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:52:10,962 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:52:10,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:52:10,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:52:10,963 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:52:11,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:52:11,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:52:11,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:52:11,022 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:52:11,022 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:52:11,023 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 07:52:11,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e82815b1/6c721c114585493ab77fb4106e5dbfd4/FLAGd346b970a [2019-09-10 07:52:11,644 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:52:11,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 07:52:11,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e82815b1/6c721c114585493ab77fb4106e5dbfd4/FLAGd346b970a [2019-09-10 07:52:11,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e82815b1/6c721c114585493ab77fb4106e5dbfd4 [2019-09-10 07:52:11,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:52:11,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:52:11,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:52:11,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:52:11,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:52:11,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:52:11" (1/1) ... [2019-09-10 07:52:11,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5c22f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:11, skipping insertion in model container [2019-09-10 07:52:11,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:52:11" (1/1) ... [2019-09-10 07:52:11,924 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:52:11,983 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:52:12,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:52:12,429 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:52:12,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:52:12,628 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:52:12,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:12 WrapperNode [2019-09-10 07:52:12,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:52:12,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:52:12,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:52:12,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:52:12,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:12" (1/1) ... [2019-09-10 07:52:12,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:12" (1/1) ... [2019-09-10 07:52:12,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:12" (1/1) ... [2019-09-10 07:52:12,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:12" (1/1) ... [2019-09-10 07:52:12,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:12" (1/1) ... [2019-09-10 07:52:12,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:12" (1/1) ... [2019-09-10 07:52:12,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:12" (1/1) ... [2019-09-10 07:52:12,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:52:12,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:52:12,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:52:12,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:52:12,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:12" (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-10 07:52:12,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:52:12,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:52:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:52:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:52:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:52:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:52:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:52:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:52:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:52:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:52:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:52:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:52:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:52:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:52:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:52:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:52:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:52:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:52:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:52:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:52:13,981 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:52:13,982 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:52:13,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:52:13 BoogieIcfgContainer [2019-09-10 07:52:13,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:52:13,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:52:13,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:52:13,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:52:13,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:52:11" (1/3) ... [2019-09-10 07:52:13,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6458d022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:52:13, skipping insertion in model container [2019-09-10 07:52:13,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:12" (2/3) ... [2019-09-10 07:52:13,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6458d022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:52:13, skipping insertion in model container [2019-09-10 07:52:13,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:52:13" (3/3) ... [2019-09-10 07:52:13,992 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 07:52:14,001 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:52:14,009 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:52:14,026 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:52:14,076 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:52:14,076 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:52:14,076 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:52:14,076 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:52:14,077 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:52:14,077 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:52:14,077 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:52:14,077 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:52:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2019-09-10 07:52:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:52:14,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:14,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:14,121 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:14,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1992210695, now seen corresponding path program 1 times [2019-09-10 07:52:14,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:14,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:14,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:14,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:14,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:14,491 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-10 07:52:14,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:14,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:52:14,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:14,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:52:14,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:52:14,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:52:14,519 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 4 states. [2019-09-10 07:52:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:14,700 INFO L93 Difference]: Finished difference Result 226 states and 366 transitions. [2019-09-10 07:52:14,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:14,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-10 07:52:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:14,731 INFO L225 Difference]: With dead ends: 226 [2019-09-10 07:52:14,731 INFO L226 Difference]: Without dead ends: 216 [2019-09-10 07:52:14,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-10 07:52:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-09-10 07:52:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-10 07:52:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 321 transitions. [2019-09-10 07:52:14,836 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 321 transitions. Word has length 83 [2019-09-10 07:52:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:14,837 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 321 transitions. [2019-09-10 07:52:14,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:52:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 321 transitions. [2019-09-10 07:52:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 07:52:14,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:14,851 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-10 07:52:14,852 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:14,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1513227412, now seen corresponding path program 1 times [2019-09-10 07:52:14,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:14,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:14,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:14,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:14,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:15,099 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-10 07:52:15,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:15,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:15,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:15,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:15,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:15,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:15,105 INFO L87 Difference]: Start difference. First operand 216 states and 321 transitions. Second operand 3 states. [2019-09-10 07:52:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:15,161 INFO L93 Difference]: Finished difference Result 313 states and 472 transitions. [2019-09-10 07:52:15,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:15,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-10 07:52:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:15,169 INFO L225 Difference]: With dead ends: 313 [2019-09-10 07:52:15,169 INFO L226 Difference]: Without dead ends: 313 [2019-09-10 07:52:15,170 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-10 07:52:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-10 07:52:15,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2019-09-10 07:52:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-10 07:52:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 471 transitions. [2019-09-10 07:52:15,188 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 471 transitions. Word has length 113 [2019-09-10 07:52:15,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:15,189 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 471 transitions. [2019-09-10 07:52:15,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 471 transitions. [2019-09-10 07:52:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 07:52:15,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:15,192 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] [2019-09-10 07:52:15,192 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:15,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:15,192 INFO L82 PathProgramCache]: Analyzing trace with hash -397003732, now seen corresponding path program 1 times [2019-09-10 07:52:15,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:15,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:15,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:15,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:15,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:15,373 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-10 07:52:15,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:15,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:15,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:15,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:15,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:15,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:15,379 INFO L87 Difference]: Start difference. First operand 311 states and 471 transitions. Second operand 3 states. [2019-09-10 07:52:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:15,431 INFO L93 Difference]: Finished difference Result 479 states and 734 transitions. [2019-09-10 07:52:15,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:15,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 07:52:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:15,438 INFO L225 Difference]: With dead ends: 479 [2019-09-10 07:52:15,438 INFO L226 Difference]: Without dead ends: 479 [2019-09-10 07:52:15,439 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-10 07:52:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-10 07:52:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2019-09-10 07:52:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-10 07:52:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 733 transitions. [2019-09-10 07:52:15,496 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 733 transitions. Word has length 115 [2019-09-10 07:52:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:15,497 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 733 transitions. [2019-09-10 07:52:15,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 733 transitions. [2019-09-10 07:52:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:52:15,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:15,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:15,500 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:15,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:15,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1397368894, now seen corresponding path program 1 times [2019-09-10 07:52:15,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:15,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:15,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:15,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:15,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:15,590 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-10 07:52:15,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:15,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:15,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:15,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:15,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:15,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:15,593 INFO L87 Difference]: Start difference. First operand 477 states and 733 transitions. Second operand 3 states. [2019-09-10 07:52:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:15,637 INFO L93 Difference]: Finished difference Result 759 states and 1174 transitions. [2019-09-10 07:52:15,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:15,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 07:52:15,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:15,643 INFO L225 Difference]: With dead ends: 759 [2019-09-10 07:52:15,643 INFO L226 Difference]: Without dead ends: 759 [2019-09-10 07:52:15,643 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-10 07:52:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-09-10 07:52:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 757. [2019-09-10 07:52:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-09-10 07:52:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1173 transitions. [2019-09-10 07:52:15,666 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1173 transitions. Word has length 117 [2019-09-10 07:52:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:15,666 INFO L475 AbstractCegarLoop]: Abstraction has 757 states and 1173 transitions. [2019-09-10 07:52:15,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1173 transitions. [2019-09-10 07:52:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 07:52:15,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:15,670 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-10 07:52:15,670 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:15,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:15,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2031984001, now seen corresponding path program 1 times [2019-09-10 07:52:15,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:15,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:15,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:15,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:15,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:15,747 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-10 07:52:15,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:15,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:15,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:15,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:15,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:15,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:15,750 INFO L87 Difference]: Start difference. First operand 757 states and 1173 transitions. Second operand 3 states. [2019-09-10 07:52:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:15,786 INFO L93 Difference]: Finished difference Result 1211 states and 1878 transitions. [2019-09-10 07:52:15,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:15,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-10 07:52:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:15,794 INFO L225 Difference]: With dead ends: 1211 [2019-09-10 07:52:15,794 INFO L226 Difference]: Without dead ends: 1211 [2019-09-10 07:52:15,795 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-10 07:52:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-10 07:52:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1209. [2019-09-10 07:52:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2019-09-10 07:52:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1877 transitions. [2019-09-10 07:52:15,827 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1877 transitions. Word has length 119 [2019-09-10 07:52:15,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:15,828 INFO L475 AbstractCegarLoop]: Abstraction has 1209 states and 1877 transitions. [2019-09-10 07:52:15,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1877 transitions. [2019-09-10 07:52:15,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 07:52:15,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:15,832 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] [2019-09-10 07:52:15,833 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:15,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:15,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1164316389, now seen corresponding path program 1 times [2019-09-10 07:52:15,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:15,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:15,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:15,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:15,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:15,917 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-10 07:52:15,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:15,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:15,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:15,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:15,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:15,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:15,919 INFO L87 Difference]: Start difference. First operand 1209 states and 1877 transitions. Second operand 3 states. [2019-09-10 07:52:15,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:15,978 INFO L93 Difference]: Finished difference Result 1895 states and 2926 transitions. [2019-09-10 07:52:15,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:15,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 07:52:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:15,989 INFO L225 Difference]: With dead ends: 1895 [2019-09-10 07:52:15,989 INFO L226 Difference]: Without dead ends: 1895 [2019-09-10 07:52:15,990 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-10 07:52:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2019-09-10 07:52:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1893. [2019-09-10 07:52:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-09-10 07:52:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2925 transitions. [2019-09-10 07:52:16,036 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2925 transitions. Word has length 121 [2019-09-10 07:52:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:16,037 INFO L475 AbstractCegarLoop]: Abstraction has 1893 states and 2925 transitions. [2019-09-10 07:52:16,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2925 transitions. [2019-09-10 07:52:16,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 07:52:16,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:16,043 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-10 07:52:16,044 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1584689036, now seen corresponding path program 1 times [2019-09-10 07:52:16,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:16,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:16,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:16,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:16,130 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-10 07:52:16,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:16,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:16,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:16,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:16,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:16,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:16,132 INFO L87 Difference]: Start difference. First operand 1893 states and 2925 transitions. Second operand 3 states. [2019-09-10 07:52:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:16,424 INFO L93 Difference]: Finished difference Result 3711 states and 5729 transitions. [2019-09-10 07:52:16,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:16,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 07:52:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:16,444 INFO L225 Difference]: With dead ends: 3711 [2019-09-10 07:52:16,444 INFO L226 Difference]: Without dead ends: 3711 [2019-09-10 07:52:16,445 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-10 07:52:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-09-10 07:52:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3709. [2019-09-10 07:52:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3709 states. [2019-09-10 07:52:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 5728 transitions. [2019-09-10 07:52:16,541 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 5728 transitions. Word has length 123 [2019-09-10 07:52:16,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:16,541 INFO L475 AbstractCegarLoop]: Abstraction has 3709 states and 5728 transitions. [2019-09-10 07:52:16,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 5728 transitions. [2019-09-10 07:52:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 07:52:16,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:16,552 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-10 07:52:16,552 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:16,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1263248665, now seen corresponding path program 1 times [2019-09-10 07:52:16,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:16,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:16,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:16,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:16,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:16,666 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-10 07:52:16,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:16,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:16,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:16,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:16,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:16,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:16,669 INFO L87 Difference]: Start difference. First operand 3709 states and 5728 transitions. Second operand 3 states. [2019-09-10 07:52:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:17,038 INFO L93 Difference]: Finished difference Result 7275 states and 11171 transitions. [2019-09-10 07:52:17,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:17,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 07:52:17,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:17,072 INFO L225 Difference]: With dead ends: 7275 [2019-09-10 07:52:17,072 INFO L226 Difference]: Without dead ends: 7275 [2019-09-10 07:52:17,073 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-10 07:52:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2019-09-10 07:52:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 7273. [2019-09-10 07:52:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-10 07:52:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 11170 transitions. [2019-09-10 07:52:17,252 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 11170 transitions. Word has length 123 [2019-09-10 07:52:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:17,252 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 11170 transitions. [2019-09-10 07:52:17,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 11170 transitions. [2019-09-10 07:52:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 07:52:17,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:17,274 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-10 07:52:17,274 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:17,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:17,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1757850626, now seen corresponding path program 1 times [2019-09-10 07:52:17,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:17,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:17,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:17,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:17,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:17,465 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-10 07:52:17,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:17,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:17,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:17,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:17,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:17,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:17,467 INFO L87 Difference]: Start difference. First operand 7273 states and 11170 transitions. Second operand 5 states. [2019-09-10 07:52:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:17,735 INFO L93 Difference]: Finished difference Result 7273 states and 11097 transitions. [2019-09-10 07:52:17,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:17,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-10 07:52:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:17,768 INFO L225 Difference]: With dead ends: 7273 [2019-09-10 07:52:17,768 INFO L226 Difference]: Without dead ends: 7273 [2019-09-10 07:52:17,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:17,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7273 states. [2019-09-10 07:52:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7273 to 7273. [2019-09-10 07:52:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-10 07:52:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 11097 transitions. [2019-09-10 07:52:17,937 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 11097 transitions. Word has length 123 [2019-09-10 07:52:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:17,937 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 11097 transitions. [2019-09-10 07:52:17,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 11097 transitions. [2019-09-10 07:52:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 07:52:17,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:17,956 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-10 07:52:17,956 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:17,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2108867320, now seen corresponding path program 1 times [2019-09-10 07:52:17,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:17,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:17,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:17,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:18,072 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-10 07:52:18,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:18,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:18,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:18,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:18,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:18,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:18,075 INFO L87 Difference]: Start difference. First operand 7273 states and 11097 transitions. Second operand 5 states. [2019-09-10 07:52:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:18,278 INFO L93 Difference]: Finished difference Result 7273 states and 10999 transitions. [2019-09-10 07:52:18,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:18,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-10 07:52:18,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:18,319 INFO L225 Difference]: With dead ends: 7273 [2019-09-10 07:52:18,320 INFO L226 Difference]: Without dead ends: 7273 [2019-09-10 07:52:18,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7273 states. [2019-09-10 07:52:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7273 to 7273. [2019-09-10 07:52:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-10 07:52:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 10999 transitions. [2019-09-10 07:52:18,473 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 10999 transitions. Word has length 123 [2019-09-10 07:52:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:18,473 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 10999 transitions. [2019-09-10 07:52:18,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 10999 transitions. [2019-09-10 07:52:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 07:52:18,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:18,491 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-10 07:52:18,491 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:18,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:18,492 INFO L82 PathProgramCache]: Analyzing trace with hash 561649966, now seen corresponding path program 1 times [2019-09-10 07:52:18,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:18,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:18,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:18,593 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-10 07:52:18,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:18,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:18,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:18,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:18,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:18,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:18,595 INFO L87 Difference]: Start difference. First operand 7273 states and 10999 transitions. Second operand 5 states. [2019-09-10 07:52:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:18,775 INFO L93 Difference]: Finished difference Result 3709 states and 5575 transitions. [2019-09-10 07:52:18,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:18,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-10 07:52:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:18,784 INFO L225 Difference]: With dead ends: 3709 [2019-09-10 07:52:18,785 INFO L226 Difference]: Without dead ends: 3709 [2019-09-10 07:52:18,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2019-09-10 07:52:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3709. [2019-09-10 07:52:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3709 states. [2019-09-10 07:52:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 5575 transitions. [2019-09-10 07:52:18,840 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 5575 transitions. Word has length 123 [2019-09-10 07:52:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:18,841 INFO L475 AbstractCegarLoop]: Abstraction has 3709 states and 5575 transitions. [2019-09-10 07:52:18,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 5575 transitions. [2019-09-10 07:52:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 07:52:18,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:18,851 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-10 07:52:18,851 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:18,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1342752456, now seen corresponding path program 1 times [2019-09-10 07:52:18,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:18,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:18,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:18,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:18,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:18,949 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-10 07:52:18,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:18,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:18,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:18,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:18,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:18,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:18,951 INFO L87 Difference]: Start difference. First operand 3709 states and 5575 transitions. Second operand 5 states. [2019-09-10 07:52:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:19,163 INFO L93 Difference]: Finished difference Result 1893 states and 2827 transitions. [2019-09-10 07:52:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:19,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-10 07:52:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:19,168 INFO L225 Difference]: With dead ends: 1893 [2019-09-10 07:52:19,168 INFO L226 Difference]: Without dead ends: 1893 [2019-09-10 07:52:19,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2019-09-10 07:52:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1893. [2019-09-10 07:52:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-09-10 07:52:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2827 transitions. [2019-09-10 07:52:19,194 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2827 transitions. Word has length 123 [2019-09-10 07:52:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:19,194 INFO L475 AbstractCegarLoop]: Abstraction has 1893 states and 2827 transitions. [2019-09-10 07:52:19,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2827 transitions. [2019-09-10 07:52:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 07:52:19,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:19,199 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-10 07:52:19,200 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1836799170, now seen corresponding path program 1 times [2019-09-10 07:52:19,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:19,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:19,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:19,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:19,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:19,402 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-10 07:52:19,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:19,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:52:19,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:19,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:19,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:19,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:19,404 INFO L87 Difference]: Start difference. First operand 1893 states and 2827 transitions. Second operand 7 states. [2019-09-10 07:52:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:19,784 INFO L93 Difference]: Finished difference Result 11932 states and 17534 transitions. [2019-09-10 07:52:19,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:52:19,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2019-09-10 07:52:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:19,810 INFO L225 Difference]: With dead ends: 11932 [2019-09-10 07:52:19,811 INFO L226 Difference]: Without dead ends: 11932 [2019-09-10 07:52:19,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11932 states. [2019-09-10 07:52:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11932 to 5199. [2019-09-10 07:52:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5199 states. [2019-09-10 07:52:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 7669 transitions. [2019-09-10 07:52:19,944 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 7669 transitions. Word has length 123 [2019-09-10 07:52:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:19,944 INFO L475 AbstractCegarLoop]: Abstraction has 5199 states and 7669 transitions. [2019-09-10 07:52:19,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 7669 transitions. [2019-09-10 07:52:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:52:19,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:19,959 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] [2019-09-10 07:52:19,959 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:19,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash 676747649, now seen corresponding path program 1 times [2019-09-10 07:52:19,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:19,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:19,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:19,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:19,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:20,054 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-10 07:52:20,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:20,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:20,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:20,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:20,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:20,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:20,057 INFO L87 Difference]: Start difference. First operand 5199 states and 7669 transitions. Second operand 3 states. [2019-09-10 07:52:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:20,099 INFO L93 Difference]: Finished difference Result 4589 states and 6701 transitions. [2019-09-10 07:52:20,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:20,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-10 07:52:20,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:20,152 INFO L225 Difference]: With dead ends: 4589 [2019-09-10 07:52:20,153 INFO L226 Difference]: Without dead ends: 4589 [2019-09-10 07:52:20,154 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-10 07:52:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2019-09-10 07:52:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4587. [2019-09-10 07:52:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4587 states. [2019-09-10 07:52:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4587 states to 4587 states and 6700 transitions. [2019-09-10 07:52:20,216 INFO L78 Accepts]: Start accepts. Automaton has 4587 states and 6700 transitions. Word has length 127 [2019-09-10 07:52:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:20,217 INFO L475 AbstractCegarLoop]: Abstraction has 4587 states and 6700 transitions. [2019-09-10 07:52:20,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4587 states and 6700 transitions. [2019-09-10 07:52:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:52:20,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:20,224 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] [2019-09-10 07:52:20,224 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:20,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:20,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1123021911, now seen corresponding path program 1 times [2019-09-10 07:52:20,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:20,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:20,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:20,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:20,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:20,519 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-10 07:52:20,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:20,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:52:20,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:20,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:20,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:20,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:20,521 INFO L87 Difference]: Start difference. First operand 4587 states and 6700 transitions. Second operand 7 states. [2019-09-10 07:52:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:20,738 INFO L93 Difference]: Finished difference Result 5976 states and 8704 transitions. [2019-09-10 07:52:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:20,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2019-09-10 07:52:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:20,750 INFO L225 Difference]: With dead ends: 5976 [2019-09-10 07:52:20,750 INFO L226 Difference]: Without dead ends: 5976 [2019-09-10 07:52:20,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:52:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2019-09-10 07:52:20,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 4587. [2019-09-10 07:52:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4587 states. [2019-09-10 07:52:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4587 states to 4587 states and 6651 transitions. [2019-09-10 07:52:20,827 INFO L78 Accepts]: Start accepts. Automaton has 4587 states and 6651 transitions. Word has length 127 [2019-09-10 07:52:20,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:20,827 INFO L475 AbstractCegarLoop]: Abstraction has 4587 states and 6651 transitions. [2019-09-10 07:52:20,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4587 states and 6651 transitions. [2019-09-10 07:52:20,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:52:20,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:20,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] [2019-09-10 07:52:20,835 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:20,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:20,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1782507606, now seen corresponding path program 1 times [2019-09-10 07:52:20,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:20,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:20,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:20,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:20,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:20,912 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-10 07:52:20,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:20,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:20,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:20,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:20,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:20,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:20,914 INFO L87 Difference]: Start difference. First operand 4587 states and 6651 transitions. Second operand 3 states. [2019-09-10 07:52:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:20,970 INFO L93 Difference]: Finished difference Result 6366 states and 9078 transitions. [2019-09-10 07:52:20,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:20,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-10 07:52:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:20,984 INFO L225 Difference]: With dead ends: 6366 [2019-09-10 07:52:20,985 INFO L226 Difference]: Without dead ends: 6366 [2019-09-10 07:52:20,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6366 states. [2019-09-10 07:52:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6366 to 6364. [2019-09-10 07:52:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6364 states. [2019-09-10 07:52:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 9077 transitions. [2019-09-10 07:52:21,082 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 9077 transitions. Word has length 127 [2019-09-10 07:52:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:21,082 INFO L475 AbstractCegarLoop]: Abstraction has 6364 states and 9077 transitions. [2019-09-10 07:52:21,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 9077 transitions. [2019-09-10 07:52:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:52:21,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:21,091 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-10 07:52:21,091 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:21,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:21,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1836626465, now seen corresponding path program 1 times [2019-09-10 07:52:21,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:21,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:21,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:21,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:21,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:21,259 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-10 07:52:21,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:21,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:21,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:21,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:21,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:21,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:21,261 INFO L87 Difference]: Start difference. First operand 6364 states and 9077 transitions. Second operand 5 states. [2019-09-10 07:52:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:21,465 INFO L93 Difference]: Finished difference Result 13902 states and 19792 transitions. [2019-09-10 07:52:21,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:21,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-10 07:52:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:21,503 INFO L225 Difference]: With dead ends: 13902 [2019-09-10 07:52:21,503 INFO L226 Difference]: Without dead ends: 13902 [2019-09-10 07:52:21,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:52:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13902 states. [2019-09-10 07:52:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13902 to 12014. [2019-09-10 07:52:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12014 states. [2019-09-10 07:52:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12014 states to 12014 states and 17190 transitions. [2019-09-10 07:52:21,725 INFO L78 Accepts]: Start accepts. Automaton has 12014 states and 17190 transitions. Word has length 128 [2019-09-10 07:52:21,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:21,726 INFO L475 AbstractCegarLoop]: Abstraction has 12014 states and 17190 transitions. [2019-09-10 07:52:21,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 12014 states and 17190 transitions. [2019-09-10 07:52:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:52:21,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:21,737 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-10 07:52:21,737 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash -613499603, now seen corresponding path program 1 times [2019-09-10 07:52:21,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:21,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:21,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:21,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:21,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:21,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:21,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:52:21,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:21,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:21,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:21,945 INFO L87 Difference]: Start difference. First operand 12014 states and 17190 transitions. Second operand 7 states. [2019-09-10 07:52:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:22,209 INFO L93 Difference]: Finished difference Result 25365 states and 36188 transitions. [2019-09-10 07:52:22,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:22,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-10 07:52:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:22,343 INFO L225 Difference]: With dead ends: 25365 [2019-09-10 07:52:22,343 INFO L226 Difference]: Without dead ends: 25365 [2019-09-10 07:52:22,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25365 states. [2019-09-10 07:52:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25365 to 15800. [2019-09-10 07:52:22,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15800 states. [2019-09-10 07:52:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15800 states to 15800 states and 22499 transitions. [2019-09-10 07:52:22,620 INFO L78 Accepts]: Start accepts. Automaton has 15800 states and 22499 transitions. Word has length 128 [2019-09-10 07:52:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:22,620 INFO L475 AbstractCegarLoop]: Abstraction has 15800 states and 22499 transitions. [2019-09-10 07:52:22,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 15800 states and 22499 transitions. [2019-09-10 07:52:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:52:22,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:22,636 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-10 07:52:22,637 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:22,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:22,637 INFO L82 PathProgramCache]: Analyzing trace with hash -331054105, now seen corresponding path program 1 times [2019-09-10 07:52:22,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:22,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:22,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:22,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:22,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:22,823 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-10 07:52:22,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:22,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:52:22,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:22,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:22,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:22,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:22,826 INFO L87 Difference]: Start difference. First operand 15800 states and 22499 transitions. Second operand 7 states. [2019-09-10 07:52:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:23,127 INFO L93 Difference]: Finished difference Result 29107 states and 41442 transitions. [2019-09-10 07:52:23,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:23,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-10 07:52:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:23,177 INFO L225 Difference]: With dead ends: 29107 [2019-09-10 07:52:23,178 INFO L226 Difference]: Without dead ends: 29107 [2019-09-10 07:52:23,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29107 states. [2019-09-10 07:52:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29107 to 21467. [2019-09-10 07:52:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21467 states. [2019-09-10 07:52:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21467 states to 21467 states and 30412 transitions. [2019-09-10 07:52:24,141 INFO L78 Accepts]: Start accepts. Automaton has 21467 states and 30412 transitions. Word has length 128 [2019-09-10 07:52:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:24,141 INFO L475 AbstractCegarLoop]: Abstraction has 21467 states and 30412 transitions. [2019-09-10 07:52:24,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 21467 states and 30412 transitions. [2019-09-10 07:52:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:52:24,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:24,153 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-10 07:52:24,154 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:24,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:24,154 INFO L82 PathProgramCache]: Analyzing trace with hash -11712549, now seen corresponding path program 1 times [2019-09-10 07:52:24,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:24,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:24,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:24,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:24,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:24,309 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-10 07:52:24,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:24,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:52:24,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:24,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:24,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:24,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:24,311 INFO L87 Difference]: Start difference. First operand 21467 states and 30412 transitions. Second operand 7 states. [2019-09-10 07:52:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:24,692 INFO L93 Difference]: Finished difference Result 40561 states and 57982 transitions. [2019-09-10 07:52:24,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:24,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-10 07:52:24,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:24,759 INFO L225 Difference]: With dead ends: 40561 [2019-09-10 07:52:24,760 INFO L226 Difference]: Without dead ends: 40561 [2019-09-10 07:52:24,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40561 states. [2019-09-10 07:52:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40561 to 25436. [2019-09-10 07:52:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25436 states. [2019-09-10 07:52:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25436 states to 25436 states and 36074 transitions. [2019-09-10 07:52:25,339 INFO L78 Accepts]: Start accepts. Automaton has 25436 states and 36074 transitions. Word has length 128 [2019-09-10 07:52:25,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:25,339 INFO L475 AbstractCegarLoop]: Abstraction has 25436 states and 36074 transitions. [2019-09-10 07:52:25,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 25436 states and 36074 transitions. [2019-09-10 07:52:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:52:25,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:25,355 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-10 07:52:25,356 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:25,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1708899051, now seen corresponding path program 1 times [2019-09-10 07:52:25,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:25,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:25,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:25,531 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-10 07:52:25,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:25,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:52:25,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:25,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:25,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:25,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:25,533 INFO L87 Difference]: Start difference. First operand 25436 states and 36074 transitions. Second operand 7 states. [2019-09-10 07:52:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:25,909 INFO L93 Difference]: Finished difference Result 40765 states and 58382 transitions. [2019-09-10 07:52:25,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:25,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-10 07:52:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:25,967 INFO L225 Difference]: With dead ends: 40765 [2019-09-10 07:52:25,967 INFO L226 Difference]: Without dead ends: 40765 [2019-09-10 07:52:25,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40765 states. [2019-09-10 07:52:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40765 to 28099. [2019-09-10 07:52:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28099 states. [2019-09-10 07:52:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28099 states to 28099 states and 39940 transitions. [2019-09-10 07:52:26,427 INFO L78 Accepts]: Start accepts. Automaton has 28099 states and 39940 transitions. Word has length 128 [2019-09-10 07:52:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:26,427 INFO L475 AbstractCegarLoop]: Abstraction has 28099 states and 39940 transitions. [2019-09-10 07:52:26,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 28099 states and 39940 transitions. [2019-09-10 07:52:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:52:26,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:26,444 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] [2019-09-10 07:52:26,445 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:26,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash -94422578, now seen corresponding path program 1 times [2019-09-10 07:52:26,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:26,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:26,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:26,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:26,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:27,128 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-10 07:52:27,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:27,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:52:27,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:27,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:52:27,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:52:27,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:52:27,130 INFO L87 Difference]: Start difference. First operand 28099 states and 39940 transitions. Second operand 14 states. [2019-09-10 07:52:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:31,262 INFO L93 Difference]: Finished difference Result 223114 states and 315018 transitions. [2019-09-10 07:52:31,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 07:52:31,264 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-09-10 07:52:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:31,543 INFO L225 Difference]: With dead ends: 223114 [2019-09-10 07:52:31,543 INFO L226 Difference]: Without dead ends: 223114 [2019-09-10 07:52:31,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=522, Invalid=2028, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 07:52:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223114 states. [2019-09-10 07:52:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223114 to 28259. [2019-09-10 07:52:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28259 states. [2019-09-10 07:52:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28259 states to 28259 states and 40162 transitions. [2019-09-10 07:52:34,536 INFO L78 Accepts]: Start accepts. Automaton has 28259 states and 40162 transitions. Word has length 130 [2019-09-10 07:52:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:34,536 INFO L475 AbstractCegarLoop]: Abstraction has 28259 states and 40162 transitions. [2019-09-10 07:52:34,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:52:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 28259 states and 40162 transitions. [2019-09-10 07:52:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:52:34,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:34,547 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] [2019-09-10 07:52:34,547 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:34,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:34,547 INFO L82 PathProgramCache]: Analyzing trace with hash 188022920, now seen corresponding path program 1 times [2019-09-10 07:52:34,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:34,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:34,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:34,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:34,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:34,784 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-10 07:52:34,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:34,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:52:34,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:34,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:52:34,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:52:34,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:34,787 INFO L87 Difference]: Start difference. First operand 28259 states and 40162 transitions. Second operand 10 states. [2019-09-10 07:52:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:37,045 INFO L93 Difference]: Finished difference Result 188537 states and 268431 transitions. [2019-09-10 07:52:37,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:52:37,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2019-09-10 07:52:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:37,241 INFO L225 Difference]: With dead ends: 188537 [2019-09-10 07:52:37,242 INFO L226 Difference]: Without dead ends: 188537 [2019-09-10 07:52:37,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:52:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188537 states. [2019-09-10 07:52:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188537 to 28281. [2019-09-10 07:52:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28281 states. [2019-09-10 07:52:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28281 states to 28281 states and 40186 transitions. [2019-09-10 07:52:38,667 INFO L78 Accepts]: Start accepts. Automaton has 28281 states and 40186 transitions. Word has length 130 [2019-09-10 07:52:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:38,667 INFO L475 AbstractCegarLoop]: Abstraction has 28281 states and 40186 transitions. [2019-09-10 07:52:38,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:52:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 28281 states and 40186 transitions. [2019-09-10 07:52:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:52:38,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:38,679 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] [2019-09-10 07:52:38,680 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:38,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1678184802, now seen corresponding path program 1 times [2019-09-10 07:52:38,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:38,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:38,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:38,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:38,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:38,758 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-10 07:52:38,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:38,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:38,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:38,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:38,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:38,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:38,760 INFO L87 Difference]: Start difference. First operand 28281 states and 40186 transitions. Second operand 3 states. [2019-09-10 07:52:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:38,809 INFO L93 Difference]: Finished difference Result 14437 states and 20304 transitions. [2019-09-10 07:52:38,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:38,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-09-10 07:52:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:38,826 INFO L225 Difference]: With dead ends: 14437 [2019-09-10 07:52:38,826 INFO L226 Difference]: Without dead ends: 14437 [2019-09-10 07:52:38,827 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-10 07:52:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14437 states. [2019-09-10 07:52:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14437 to 14435. [2019-09-10 07:52:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14435 states. [2019-09-10 07:52:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14435 states to 14435 states and 20303 transitions. [2019-09-10 07:52:38,983 INFO L78 Accepts]: Start accepts. Automaton has 14435 states and 20303 transitions. Word has length 130 [2019-09-10 07:52:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:38,984 INFO L475 AbstractCegarLoop]: Abstraction has 14435 states and 20303 transitions. [2019-09-10 07:52:38,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 14435 states and 20303 transitions. [2019-09-10 07:52:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:52:38,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:38,993 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] [2019-09-10 07:52:38,993 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:38,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:38,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1152932228, now seen corresponding path program 1 times [2019-09-10 07:52:38,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:38,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:38,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:39,214 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-10 07:52:39,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:39,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:52:39,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:39,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:52:39,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:52:39,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:39,216 INFO L87 Difference]: Start difference. First operand 14435 states and 20303 transitions. Second operand 10 states. [2019-09-10 07:52:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:40,953 INFO L93 Difference]: Finished difference Result 101938 states and 143228 transitions. [2019-09-10 07:52:40,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:52:40,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2019-09-10 07:52:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:41,049 INFO L225 Difference]: With dead ends: 101938 [2019-09-10 07:52:41,049 INFO L226 Difference]: Without dead ends: 101938 [2019-09-10 07:52:41,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:52:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101938 states. [2019-09-10 07:52:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101938 to 24390. [2019-09-10 07:52:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24390 states. [2019-09-10 07:52:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24390 states to 24390 states and 34259 transitions. [2019-09-10 07:52:41,856 INFO L78 Accepts]: Start accepts. Automaton has 24390 states and 34259 transitions. Word has length 130 [2019-09-10 07:52:41,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:41,857 INFO L475 AbstractCegarLoop]: Abstraction has 24390 states and 34259 transitions. [2019-09-10 07:52:41,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:52:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 24390 states and 34259 transitions. [2019-09-10 07:52:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:52:41,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:41,864 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] [2019-09-10 07:52:41,864 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:41,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:41,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1123357200, now seen corresponding path program 1 times [2019-09-10 07:52:41,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:41,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:41,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:41,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:41,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:41,936 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-10 07:52:41,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:41,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:41,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:41,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:41,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:41,938 INFO L87 Difference]: Start difference. First operand 24390 states and 34259 transitions. Second operand 3 states. [2019-09-10 07:52:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:41,976 INFO L93 Difference]: Finished difference Result 10694 states and 15026 transitions. [2019-09-10 07:52:41,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:41,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-09-10 07:52:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:41,987 INFO L225 Difference]: With dead ends: 10694 [2019-09-10 07:52:41,988 INFO L226 Difference]: Without dead ends: 10694 [2019-09-10 07:52:41,988 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-10 07:52:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10694 states. [2019-09-10 07:52:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10694 to 10692. [2019-09-10 07:52:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10692 states. [2019-09-10 07:52:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10692 states to 10692 states and 15025 transitions. [2019-09-10 07:52:42,104 INFO L78 Accepts]: Start accepts. Automaton has 10692 states and 15025 transitions. Word has length 130 [2019-09-10 07:52:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:42,105 INFO L475 AbstractCegarLoop]: Abstraction has 10692 states and 15025 transitions. [2019-09-10 07:52:42,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 10692 states and 15025 transitions. [2019-09-10 07:52:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:52:42,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:42,110 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-10 07:52:42,110 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:42,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:42,111 INFO L82 PathProgramCache]: Analyzing trace with hash -984371191, now seen corresponding path program 1 times [2019-09-10 07:52:42,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:42,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:42,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:42,169 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-10 07:52:42,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:42,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:42,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:42,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:42,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:42,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:42,171 INFO L87 Difference]: Start difference. First operand 10692 states and 15025 transitions. Second operand 3 states. [2019-09-10 07:52:42,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:42,281 INFO L93 Difference]: Finished difference Result 7029 states and 9867 transitions. [2019-09-10 07:52:42,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:42,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 07:52:42,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:42,289 INFO L225 Difference]: With dead ends: 7029 [2019-09-10 07:52:42,289 INFO L226 Difference]: Without dead ends: 7029 [2019-09-10 07:52:42,290 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-10 07:52:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7029 states. [2019-09-10 07:52:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7029 to 7029. [2019-09-10 07:52:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7029 states. [2019-09-10 07:52:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7029 states to 7029 states and 9867 transitions. [2019-09-10 07:52:42,369 INFO L78 Accepts]: Start accepts. Automaton has 7029 states and 9867 transitions. Word has length 131 [2019-09-10 07:52:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:42,369 INFO L475 AbstractCegarLoop]: Abstraction has 7029 states and 9867 transitions. [2019-09-10 07:52:42,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 7029 states and 9867 transitions. [2019-09-10 07:52:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:52:42,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:42,373 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-10 07:52:42,373 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1829066464, now seen corresponding path program 1 times [2019-09-10 07:52:42,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:42,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:42,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:42,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:42,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:42,594 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-10 07:52:42,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:42,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:52:42,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:42,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:52:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:52:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:42,596 INFO L87 Difference]: Start difference. First operand 7029 states and 9867 transitions. Second operand 10 states. [2019-09-10 07:52:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:44,384 INFO L93 Difference]: Finished difference Result 52952 states and 74277 transitions. [2019-09-10 07:52:44,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:52:44,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-09-10 07:52:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:44,431 INFO L225 Difference]: With dead ends: 52952 [2019-09-10 07:52:44,431 INFO L226 Difference]: Without dead ends: 52952 [2019-09-10 07:52:44,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:52:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52952 states. [2019-09-10 07:52:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52952 to 7209. [2019-09-10 07:52:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-09-10 07:52:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 10081 transitions. [2019-09-10 07:52:44,778 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 10081 transitions. Word has length 131 [2019-09-10 07:52:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:44,778 INFO L475 AbstractCegarLoop]: Abstraction has 7209 states and 10081 transitions. [2019-09-10 07:52:44,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:52:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 10081 transitions. [2019-09-10 07:52:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:52:44,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:44,781 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-10 07:52:44,781 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:44,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:44,782 INFO L82 PathProgramCache]: Analyzing trace with hash 999887890, now seen corresponding path program 1 times [2019-09-10 07:52:44,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:44,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:44,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:44,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:44,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:44,852 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-10 07:52:44,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:44,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:44,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:44,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:44,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:44,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:44,853 INFO L87 Difference]: Start difference. First operand 7209 states and 10081 transitions. Second operand 3 states. [2019-09-10 07:52:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:44,875 INFO L93 Difference]: Finished difference Result 3845 states and 5281 transitions. [2019-09-10 07:52:44,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:44,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 07:52:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:44,879 INFO L225 Difference]: With dead ends: 3845 [2019-09-10 07:52:44,880 INFO L226 Difference]: Without dead ends: 3845 [2019-09-10 07:52:44,880 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-10 07:52:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2019-09-10 07:52:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3843. [2019-09-10 07:52:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3843 states. [2019-09-10 07:52:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 3843 states and 5280 transitions. [2019-09-10 07:52:44,919 INFO L78 Accepts]: Start accepts. Automaton has 3843 states and 5280 transitions. Word has length 131 [2019-09-10 07:52:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:44,920 INFO L475 AbstractCegarLoop]: Abstraction has 3843 states and 5280 transitions. [2019-09-10 07:52:44,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 5280 transitions. [2019-09-10 07:52:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:52:44,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:44,922 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-10 07:52:44,923 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:44,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:44,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1261748561, now seen corresponding path program 1 times [2019-09-10 07:52:44,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:44,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:44,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:44,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:44,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:45,141 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-10 07:52:45,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:45,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:52:45,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:45,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:52:45,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:52:45,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:45,143 INFO L87 Difference]: Start difference. First operand 3843 states and 5280 transitions. Second operand 10 states. [2019-09-10 07:52:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:46,821 INFO L93 Difference]: Finished difference Result 26976 states and 37399 transitions. [2019-09-10 07:52:46,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:52:46,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2019-09-10 07:52:46,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:46,855 INFO L225 Difference]: With dead ends: 26976 [2019-09-10 07:52:46,856 INFO L226 Difference]: Without dead ends: 26976 [2019-09-10 07:52:46,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:52:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26976 states. [2019-09-10 07:52:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26976 to 4239. [2019-09-10 07:52:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-09-10 07:52:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 5766 transitions. [2019-09-10 07:52:47,040 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 5766 transitions. Word has length 132 [2019-09-10 07:52:47,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:47,041 INFO L475 AbstractCegarLoop]: Abstraction has 4239 states and 5766 transitions. [2019-09-10 07:52:47,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:52:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 5766 transitions. [2019-09-10 07:52:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:52:47,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:47,044 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-10 07:52:47,045 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:47,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1979861581, now seen corresponding path program 1 times [2019-09-10 07:52:47,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:47,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:47,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:47,133 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-10 07:52:47,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:47,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:47,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:47,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:47,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:47,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:47,135 INFO L87 Difference]: Start difference. First operand 4239 states and 5766 transitions. Second operand 3 states. [2019-09-10 07:52:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:47,160 INFO L93 Difference]: Finished difference Result 2589 states and 3427 transitions. [2019-09-10 07:52:47,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:47,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-10 07:52:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:47,163 INFO L225 Difference]: With dead ends: 2589 [2019-09-10 07:52:47,163 INFO L226 Difference]: Without dead ends: 2589 [2019-09-10 07:52:47,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-09-10 07:52:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2587. [2019-09-10 07:52:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2587 states. [2019-09-10 07:52:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3426 transitions. [2019-09-10 07:52:47,190 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3426 transitions. Word has length 132 [2019-09-10 07:52:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:47,191 INFO L475 AbstractCegarLoop]: Abstraction has 2587 states and 3426 transitions. [2019-09-10 07:52:47,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3426 transitions. [2019-09-10 07:52:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:52:47,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:47,193 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, 1] [2019-09-10 07:52:47,193 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:47,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:47,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1909986315, now seen corresponding path program 1 times [2019-09-10 07:52:47,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:47,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:47,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:47,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:52:47,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:47,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:52:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:52:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:52:47,288 INFO L87 Difference]: Start difference. First operand 2587 states and 3426 transitions. Second operand 4 states. [2019-09-10 07:52:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:47,310 INFO L93 Difference]: Finished difference Result 2619 states and 3442 transitions. [2019-09-10 07:52:47,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:52:47,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 07:52:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:47,320 INFO L225 Difference]: With dead ends: 2619 [2019-09-10 07:52:47,321 INFO L226 Difference]: Without dead ends: 2583 [2019-09-10 07:52:47,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-10 07:52:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2582. [2019-09-10 07:52:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2019-09-10 07:52:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 3394 transitions. [2019-09-10 07:52:47,349 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 3394 transitions. Word has length 133 [2019-09-10 07:52:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:47,349 INFO L475 AbstractCegarLoop]: Abstraction has 2582 states and 3394 transitions. [2019-09-10 07:52:47,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:52:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3394 transitions. [2019-09-10 07:52:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 07:52:47,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:47,352 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, 1, 1, 1] [2019-09-10 07:52:47,352 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1901756694, now seen corresponding path program 1 times [2019-09-10 07:52:47,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:47,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:47,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:47,413 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-10 07:52:47,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:47,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:47,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:47,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:47,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:47,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:47,419 INFO L87 Difference]: Start difference. First operand 2582 states and 3394 transitions. Second operand 3 states. [2019-09-10 07:52:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:47,460 INFO L93 Difference]: Finished difference Result 3415 states and 4339 transitions. [2019-09-10 07:52:47,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:47,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-09-10 07:52:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:47,477 INFO L225 Difference]: With dead ends: 3415 [2019-09-10 07:52:47,477 INFO L226 Difference]: Without dead ends: 3414 [2019-09-10 07:52:47,478 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-10 07:52:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2019-09-10 07:52:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 3312. [2019-09-10 07:52:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2019-09-10 07:52:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 4217 transitions. [2019-09-10 07:52:47,529 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 4217 transitions. Word has length 135 [2019-09-10 07:52:47,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:47,530 INFO L475 AbstractCegarLoop]: Abstraction has 3312 states and 4217 transitions. [2019-09-10 07:52:47,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 4217 transitions. [2019-09-10 07:52:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:52:47,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:47,533 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, 1, 1, 1, 1] [2019-09-10 07:52:47,534 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:47,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:47,534 INFO L82 PathProgramCache]: Analyzing trace with hash -775741639, now seen corresponding path program 1 times [2019-09-10 07:52:47,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:47,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:47,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:47,606 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-10 07:52:47,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:47,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:47,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:47,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:47,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:47,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:47,607 INFO L87 Difference]: Start difference. First operand 3312 states and 4217 transitions. Second operand 3 states. [2019-09-10 07:52:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:47,651 INFO L93 Difference]: Finished difference Result 3653 states and 4667 transitions. [2019-09-10 07:52:47,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:47,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 07:52:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:47,657 INFO L225 Difference]: With dead ends: 3653 [2019-09-10 07:52:47,657 INFO L226 Difference]: Without dead ends: 3653 [2019-09-10 07:52:47,658 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-10 07:52:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2019-09-10 07:52:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 3291. [2019-09-10 07:52:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3291 states. [2019-09-10 07:52:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 4182 transitions. [2019-09-10 07:52:47,692 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 4182 transitions. Word has length 136 [2019-09-10 07:52:47,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:47,692 INFO L475 AbstractCegarLoop]: Abstraction has 3291 states and 4182 transitions. [2019-09-10 07:52:47,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 4182 transitions. [2019-09-10 07:52:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 07:52:47,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:47,695 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, 1, 1, 1, 1, 1] [2019-09-10 07:52:47,695 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:47,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1789290556, now seen corresponding path program 1 times [2019-09-10 07:52:47,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:47,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:47,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:47,764 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-10 07:52:47,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:47,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:47,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:47,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:47,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:47,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:47,766 INFO L87 Difference]: Start difference. First operand 3291 states and 4182 transitions. Second operand 3 states. [2019-09-10 07:52:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:47,815 INFO L93 Difference]: Finished difference Result 3509 states and 4441 transitions. [2019-09-10 07:52:47,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:47,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-10 07:52:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:47,821 INFO L225 Difference]: With dead ends: 3509 [2019-09-10 07:52:47,821 INFO L226 Difference]: Without dead ends: 3505 [2019-09-10 07:52:47,822 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-10 07:52:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2019-09-10 07:52:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 3074. [2019-09-10 07:52:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3074 states. [2019-09-10 07:52:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 3879 transitions. [2019-09-10 07:52:47,855 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 3879 transitions. Word has length 137 [2019-09-10 07:52:47,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:47,855 INFO L475 AbstractCegarLoop]: Abstraction has 3074 states and 3879 transitions. [2019-09-10 07:52:47,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 3879 transitions. [2019-09-10 07:52:47,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 07:52:47,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:47,859 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, 1, 1, 1, 1, 1] [2019-09-10 07:52:47,859 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:47,860 INFO L82 PathProgramCache]: Analyzing trace with hash 747257794, now seen corresponding path program 1 times [2019-09-10 07:52:47,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:47,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:47,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:47,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:47,934 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-10 07:52:47,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:47,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:47,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:47,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:47,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:47,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:47,936 INFO L87 Difference]: Start difference. First operand 3074 states and 3879 transitions. Second operand 3 states. [2019-09-10 07:52:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:47,971 INFO L93 Difference]: Finished difference Result 3163 states and 3953 transitions. [2019-09-10 07:52:47,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:47,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-10 07:52:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:47,976 INFO L225 Difference]: With dead ends: 3163 [2019-09-10 07:52:47,976 INFO L226 Difference]: Without dead ends: 3163 [2019-09-10 07:52:47,977 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-10 07:52:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2019-09-10 07:52:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3076. [2019-09-10 07:52:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-09-10 07:52:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 3850 transitions. [2019-09-10 07:52:48,012 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 3850 transitions. Word has length 137 [2019-09-10 07:52:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:48,012 INFO L475 AbstractCegarLoop]: Abstraction has 3076 states and 3850 transitions. [2019-09-10 07:52:48,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 3850 transitions. [2019-09-10 07:52:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 07:52:48,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:48,015 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, 1, 1, 1, 1, 1] [2019-09-10 07:52:48,015 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:48,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:48,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1357258310, now seen corresponding path program 1 times [2019-09-10 07:52:48,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:48,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:48,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:48,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:48,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:48,121 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-10 07:52:48,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:48,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:52:48,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:48,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:52:48,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:52:48,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:52:48,125 INFO L87 Difference]: Start difference. First operand 3076 states and 3850 transitions. Second operand 6 states. [2019-09-10 07:52:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:48,243 INFO L93 Difference]: Finished difference Result 4451 states and 5617 transitions. [2019-09-10 07:52:48,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:48,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-09-10 07:52:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:48,250 INFO L225 Difference]: With dead ends: 4451 [2019-09-10 07:52:48,250 INFO L226 Difference]: Without dead ends: 4451 [2019-09-10 07:52:48,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4451 states. [2019-09-10 07:52:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4451 to 3128. [2019-09-10 07:52:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2019-09-10 07:52:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 3894 transitions. [2019-09-10 07:52:48,284 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 3894 transitions. Word has length 137 [2019-09-10 07:52:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:48,284 INFO L475 AbstractCegarLoop]: Abstraction has 3128 states and 3894 transitions. [2019-09-10 07:52:48,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:52:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 3894 transitions. [2019-09-10 07:52:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 07:52:48,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:48,286 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, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:48,287 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:48,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash 590602360, now seen corresponding path program 1 times [2019-09-10 07:52:48,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:48,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:48,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:48,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:48,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:48,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:48,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:48,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:48,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:48,353 INFO L87 Difference]: Start difference. First operand 3128 states and 3894 transitions. Second operand 3 states. [2019-09-10 07:52:48,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:48,403 INFO L93 Difference]: Finished difference Result 4120 states and 5131 transitions. [2019-09-10 07:52:48,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:48,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 07:52:48,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:48,410 INFO L225 Difference]: With dead ends: 4120 [2019-09-10 07:52:48,410 INFO L226 Difference]: Without dead ends: 4120 [2019-09-10 07:52:48,410 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-10 07:52:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2019-09-10 07:52:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4118. [2019-09-10 07:52:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4118 states. [2019-09-10 07:52:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 5130 transitions. [2019-09-10 07:52:48,452 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 5130 transitions. Word has length 138 [2019-09-10 07:52:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:48,452 INFO L475 AbstractCegarLoop]: Abstraction has 4118 states and 5130 transitions. [2019-09-10 07:52:48,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 5130 transitions. [2019-09-10 07:52:48,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 07:52:48,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:48,455 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:48,456 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:48,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1537561535, now seen corresponding path program 1 times [2019-09-10 07:52:48,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:48,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:48,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:48,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:48,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:48,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:48,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:52:48,821 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2019-09-10 07:52:48,824 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [256], [262], [266], [268], [271], [274], [277], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [326], [334], [336], [339], [342], [348], [351], [352], [354], [356], [359], [370], [379], [381], [384], [387], [389], [404], [406], [409], [412], [414], [429], [431], [434], [437], [439], [454], [456], [459], [462], [464], [472], [475], [481], [484], [487], [489], [498], [501], [589], [592], [647], [650], [665], [668], [671], [673], [690], [693], [696], [698], [715], [718], [721], [723], [740], [743], [746], [748], [765], [768], [771], [773], [846], [847], [851], [852], [853] [2019-09-10 07:52:48,887 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:52:48,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:52:49,099 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:52:49,310 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:52:49,312 INFO L272 AbstractInterpreter]: Visited 100 different actions 100 times. Never merged. Never widened. Performed 530 root evaluator evaluations with a maximum evaluation depth of 5. Performed 530 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 163 variables. [2019-09-10 07:52:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:49,319 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:52:49,802 INFO L227 lantSequenceWeakener]: Weakened 72 states. On average, predicates are now at 75.77% of their original sizes. [2019-09-10 07:52:49,802 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:52:55,277 INFO L420 sIntCurrentIteration]: We unified 164 AI predicates to 164 [2019-09-10 07:52:55,277 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:52:55,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:52:55,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [12] total 66 [2019-09-10 07:52:55,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:55,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 07:52:55,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 07:52:55,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2821, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:52:55,281 INFO L87 Difference]: Start difference. First operand 4118 states and 5130 transitions. Second operand 56 states. [2019-09-10 07:53:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:23,713 INFO L93 Difference]: Finished difference Result 3445 states and 4311 transitions. [2019-09-10 07:53:23,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 07:53:23,714 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 165 [2019-09-10 07:53:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:23,719 INFO L225 Difference]: With dead ends: 3445 [2019-09-10 07:53:23,719 INFO L226 Difference]: Without dead ends: 3435 [2019-09-10 07:53:23,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2208 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=558, Invalid=7452, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 07:53:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2019-09-10 07:53:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3404. [2019-09-10 07:53:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-09-10 07:53:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4260 transitions. [2019-09-10 07:53:23,754 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4260 transitions. Word has length 165 [2019-09-10 07:53:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:23,755 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4260 transitions. [2019-09-10 07:53:23,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 07:53:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4260 transitions. [2019-09-10 07:53:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 07:53:23,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:23,757 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:23,758 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:23,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2050312060, now seen corresponding path program 1 times [2019-09-10 07:53:23,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:23,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:23,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:23,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:23,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:53:23,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:23,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:53:23,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:23,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:53:23,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:53:23,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:53:23,972 INFO L87 Difference]: Start difference. First operand 3404 states and 4260 transitions. Second operand 4 states. [2019-09-10 07:53:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:24,008 INFO L93 Difference]: Finished difference Result 3656 states and 4538 transitions. [2019-09-10 07:53:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:53:24,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-10 07:53:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:24,013 INFO L225 Difference]: With dead ends: 3656 [2019-09-10 07:53:24,013 INFO L226 Difference]: Without dead ends: 3656 [2019-09-10 07:53:24,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:53:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2019-09-10 07:53:24,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3360. [2019-09-10 07:53:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3360 states. [2019-09-10 07:53:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3360 states to 3360 states and 4205 transitions. [2019-09-10 07:53:24,053 INFO L78 Accepts]: Start accepts. Automaton has 3360 states and 4205 transitions. Word has length 165 [2019-09-10 07:53:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:24,053 INFO L475 AbstractCegarLoop]: Abstraction has 3360 states and 4205 transitions. [2019-09-10 07:53:24,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:53:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3360 states and 4205 transitions. [2019-09-10 07:53:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 07:53:24,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:24,055 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:24,056 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:24,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:24,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1733916732, now seen corresponding path program 1 times [2019-09-10 07:53:24,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:24,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:24,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:24,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:24,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:53:24,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:24,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:53:24,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:24,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:53:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:53:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:53:24,193 INFO L87 Difference]: Start difference. First operand 3360 states and 4205 transitions. Second operand 5 states. [2019-09-10 07:53:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:24,280 INFO L93 Difference]: Finished difference Result 4102 states and 5141 transitions. [2019-09-10 07:53:24,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:53:24,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-10 07:53:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:24,285 INFO L225 Difference]: With dead ends: 4102 [2019-09-10 07:53:24,285 INFO L226 Difference]: Without dead ends: 4102 [2019-09-10 07:53:24,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:53:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-09-10 07:53:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3102. [2019-09-10 07:53:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2019-09-10 07:53:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 3887 transitions. [2019-09-10 07:53:24,322 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 3887 transitions. Word has length 165 [2019-09-10 07:53:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:24,323 INFO L475 AbstractCegarLoop]: Abstraction has 3102 states and 3887 transitions. [2019-09-10 07:53:24,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:53:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 3887 transitions. [2019-09-10 07:53:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 07:53:24,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:24,325 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:24,325 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:24,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:24,326 INFO L82 PathProgramCache]: Analyzing trace with hash -872696702, now seen corresponding path program 1 times [2019-09-10 07:53:24,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:24,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:24,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:24,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:24,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 07:53:24,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:24,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:53:24,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:24,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:53:24,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:53:24,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:53:24,453 INFO L87 Difference]: Start difference. First operand 3102 states and 3887 transitions. Second operand 5 states. [2019-09-10 07:53:24,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:24,553 INFO L93 Difference]: Finished difference Result 3832 states and 4805 transitions. [2019-09-10 07:53:24,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:53:24,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-10 07:53:24,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:24,557 INFO L225 Difference]: With dead ends: 3832 [2019-09-10 07:53:24,558 INFO L226 Difference]: Without dead ends: 3832 [2019-09-10 07:53:24,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:53:24,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3832 states. [2019-09-10 07:53:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3832 to 3192. [2019-09-10 07:53:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3192 states. [2019-09-10 07:53:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 3192 states and 4002 transitions. [2019-09-10 07:53:24,594 INFO L78 Accepts]: Start accepts. Automaton has 3192 states and 4002 transitions. Word has length 165 [2019-09-10 07:53:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:24,594 INFO L475 AbstractCegarLoop]: Abstraction has 3192 states and 4002 transitions. [2019-09-10 07:53:24,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:53:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3192 states and 4002 transitions. [2019-09-10 07:53:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 07:53:24,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:24,596 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:24,596 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:24,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:24,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1435932244, now seen corresponding path program 1 times [2019-09-10 07:53:24,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:24,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:24,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:24,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:24,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:53:24,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:24,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:53:24,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:24,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:53:24,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:53:24,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:53:24,724 INFO L87 Difference]: Start difference. First operand 3192 states and 4002 transitions. Second operand 5 states. [2019-09-10 07:53:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:24,811 INFO L93 Difference]: Finished difference Result 3886 states and 4866 transitions. [2019-09-10 07:53:24,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:53:24,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-10 07:53:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:24,815 INFO L225 Difference]: With dead ends: 3886 [2019-09-10 07:53:24,815 INFO L226 Difference]: Without dead ends: 3886 [2019-09-10 07:53:24,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:53:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2019-09-10 07:53:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3164. [2019-09-10 07:53:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3164 states. [2019-09-10 07:53:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 3973 transitions. [2019-09-10 07:53:24,856 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 3973 transitions. Word has length 165 [2019-09-10 07:53:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:24,856 INFO L475 AbstractCegarLoop]: Abstraction has 3164 states and 3973 transitions. [2019-09-10 07:53:24,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:53:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 3973 transitions. [2019-09-10 07:53:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 07:53:24,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:24,858 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:24,859 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:24,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1412187022, now seen corresponding path program 1 times [2019-09-10 07:53:24,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:24,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:24,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:24,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:53:24,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:24,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:53:24,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:24,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:53:24,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:53:24,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:53:24,970 INFO L87 Difference]: Start difference. First operand 3164 states and 3973 transitions. Second operand 5 states. [2019-09-10 07:53:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:25,087 INFO L93 Difference]: Finished difference Result 6740 states and 8501 transitions. [2019-09-10 07:53:25,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:53:25,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-10 07:53:25,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:25,094 INFO L225 Difference]: With dead ends: 6740 [2019-09-10 07:53:25,094 INFO L226 Difference]: Without dead ends: 6735 [2019-09-10 07:53:25,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:53:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6735 states. [2019-09-10 07:53:25,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6735 to 6718. [2019-09-10 07:53:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6718 states. [2019-09-10 07:53:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 8479 transitions. [2019-09-10 07:53:25,160 INFO L78 Accepts]: Start accepts. Automaton has 6718 states and 8479 transitions. Word has length 165 [2019-09-10 07:53:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:25,160 INFO L475 AbstractCegarLoop]: Abstraction has 6718 states and 8479 transitions. [2019-09-10 07:53:25,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:53:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6718 states and 8479 transitions. [2019-09-10 07:53:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 07:53:25,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:25,162 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:25,162 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:25,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:25,162 INFO L82 PathProgramCache]: Analyzing trace with hash -550614226, now seen corresponding path program 1 times [2019-09-10 07:53:25,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:25,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:25,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:25,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:25,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 07:53:25,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:25,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:53:25,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:25,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:53:25,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:53:25,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:53:25,269 INFO L87 Difference]: Start difference. First operand 6718 states and 8479 transitions. Second operand 5 states. [2019-09-10 07:53:25,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:25,374 INFO L93 Difference]: Finished difference Result 8256 states and 10401 transitions. [2019-09-10 07:53:25,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:53:25,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-10 07:53:25,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:25,385 INFO L225 Difference]: With dead ends: 8256 [2019-09-10 07:53:25,385 INFO L226 Difference]: Without dead ends: 8256 [2019-09-10 07:53:25,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:53:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8256 states. [2019-09-10 07:53:25,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8256 to 7260. [2019-09-10 07:53:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2019-09-10 07:53:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 9164 transitions. [2019-09-10 07:53:25,481 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 9164 transitions. Word has length 165 [2019-09-10 07:53:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:25,482 INFO L475 AbstractCegarLoop]: Abstraction has 7260 states and 9164 transitions. [2019-09-10 07:53:25,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:53:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 9164 transitions. [2019-09-10 07:53:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 07:53:25,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:25,484 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:53:25,484 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash -870744250, now seen corresponding path program 1 times [2019-09-10 07:53:25,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:25,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:25,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:25,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:25,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:25,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:25,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:53:25,847 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2019-09-10 07:53:25,849 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [207], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [268], [271], [274], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [326], [334], [336], [339], [342], [346], [348], [351], [352], [354], [356], [361], [363], [366], [379], [381], [384], [387], [389], [404], [406], [409], [412], [414], [429], [431], [434], [437], [439], [454], [456], [459], [462], [464], [479], [481], [484], [487], [489], [505], [508], [647], [650], [665], [668], [671], [673], [690], [693], [696], [698], [715], [718], [721], [723], [740], [743], [746], [748], [765], [768], [771], [773], [846], [847], [851], [852], [853] [2019-09-10 07:53:25,861 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:53:25,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:53:25,889 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:53:26,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:53:26,868 INFO L272 AbstractInterpreter]: Visited 156 different actions 1053 times. Merged at 53 different actions 776 times. Widened at 24 different actions 150 times. Performed 3750 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3750 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 125 fixpoints after 23 different actions. Largest state had 163 variables. [2019-09-10 07:53:26,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:26,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:53:26,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:26,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10 07:53:26,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:26,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:53:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:27,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:53:27,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:53:27,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:27,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:28,078 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:53:28,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:28,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:30,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:30,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:53:30,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:53:30,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:53:30,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:53:30,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:53:30,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:53:30,537 INFO L87 Difference]: Start difference. First operand 7260 states and 9164 transitions. Second operand 21 states. [2019-09-10 07:53:30,859 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:53:31,529 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:53:32,470 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:53:33,039 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:53:33,557 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:53:33,788 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:53:34,264 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:53:34,534 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:53:35,491 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:53:35,844 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:53:36,181 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:53:36,545 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:53:37,207 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-10 07:53:37,557 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 07:53:38,034 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:53:38,285 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 07:53:39,685 WARN L188 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:53:40,004 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:53:40,352 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 07:53:40,766 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-10 07:53:41,026 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:53:41,570 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-10 07:53:41,906 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:53:42,286 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:53:43,088 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-10 07:53:43,706 WARN L188 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-10 07:53:44,110 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:53:44,648 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:53:45,059 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:53:45,923 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-10 07:53:46,235 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:53:46,887 WARN L188 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:53:47,385 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:53:47,796 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:53:48,272 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:53:48,656 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:53:49,033 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:53:49,504 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:53:50,001 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:53:50,469 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:53:51,237 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-10 07:53:51,851 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:53:52,470 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:53:52,873 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:53:53,434 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:53:53,806 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:53:54,204 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:53:54,714 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 07:53:55,320 WARN L188 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:53:55,727 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 07:53:56,120 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 07:53:56,552 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 07:53:56,926 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:53:57,393 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:53:59,046 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:53:59,431 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:53:59,935 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:54:00,445 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:54:01,060 WARN L188 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:54:01,538 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 07:54:02,031 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:54:02,341 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:54:02,736 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:54:03,186 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 07:54:03,641 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:54:04,124 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-09-10 07:54:04,481 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:54:04,820 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-10 07:54:05,174 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-10 07:54:05,553 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-10 07:54:06,126 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-10 07:54:06,512 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:54:06,865 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 07:54:07,290 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-10 07:54:07,650 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:54:08,288 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-10 07:54:08,680 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 07:54:09,166 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-09-10 07:54:09,564 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 07:54:09,915 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 07:54:10,284 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 07:54:11,679 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2019-09-10 07:54:12,096 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 07:54:12,608 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 07:54:13,204 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 07:54:13,633 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-09-10 07:54:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:54:13,944 INFO L93 Difference]: Finished difference Result 110936 states and 138245 transitions. [2019-09-10 07:54:13,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-10 07:54:13,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 165 [2019-09-10 07:54:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:54:14,294 INFO L225 Difference]: With dead ends: 110936 [2019-09-10 07:54:14,294 INFO L226 Difference]: Without dead ends: 110936 [2019-09-10 07:54:14,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 280 SyntacticMatches, 32 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=2997, Invalid=11283, Unknown=0, NotChecked=0, Total=14280 [2019-09-10 07:54:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110936 states. [2019-09-10 07:54:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110936 to 48724. [2019-09-10 07:54:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48724 states. [2019-09-10 07:54:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48724 states to 48724 states and 60513 transitions. [2019-09-10 07:54:15,930 INFO L78 Accepts]: Start accepts. Automaton has 48724 states and 60513 transitions. Word has length 165 [2019-09-10 07:54:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:54:15,931 INFO L475 AbstractCegarLoop]: Abstraction has 48724 states and 60513 transitions. [2019-09-10 07:54:15,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:54:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 48724 states and 60513 transitions. [2019-09-10 07:54:15,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 07:54:15,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:54:15,949 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:54:15,949 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:54:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:15,950 INFO L82 PathProgramCache]: Analyzing trace with hash -379887478, now seen corresponding path program 1 times [2019-09-10 07:54:15,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:54:15,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:15,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:15,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:15,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:54:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:16,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:16,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:54:16,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2019-09-10 07:54:16,583 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [207], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [268], [271], [274], [282], [284], [287], [295], [297], [300], [303], [308], [310], [313], [316], [321], [323], [326], [334], [336], [339], [346], [348], [351], [352], [354], [363], [366], [370], [379], [381], [384], [387], [389], [397], [400], [406], [409], [412], [414], [422], [425], [431], [434], [437], [439], [454], [456], [459], [462], [464], [479], [481], [484], [487], [489], [505], [508], [647], [650], [665], [668], [671], [673], [690], [693], [696], [698], [715], [718], [721], [723], [740], [743], [746], [748], [765], [768], [771], [773], [846], [847], [851], [852], [853] [2019-09-10 07:54:16,587 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:54:16,587 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:54:16,611 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:54:17,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:54:17,144 INFO L272 AbstractInterpreter]: Visited 158 different actions 982 times. Merged at 55 different actions 723 times. Widened at 18 different actions 99 times. Performed 3461 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3461 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 89 fixpoints after 20 different actions. Largest state had 163 variables. [2019-09-10 07:54:17,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:17,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:54:17,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:17,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10 07:54:17,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:17,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:54:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:17,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:54:17,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:54:17,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:17,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:17,991 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:54:18,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:21,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:21,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:54:21,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 38 [2019-09-10 07:54:21,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:54:21,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 07:54:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 07:54:21,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1291, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:54:21,680 INFO L87 Difference]: Start difference. First operand 48724 states and 60513 transitions. Second operand 28 states. [2019-09-10 07:54:21,936 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:54:22,771 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:54:23,414 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 07:54:23,618 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 07:54:24,007 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 07:54:24,235 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:54:24,708 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:54:25,142 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:54:25,402 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:54:25,727 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:54:26,015 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:54:26,483 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 07:54:26,995 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:54:27,458 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:54:27,974 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:54:28,231 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:54:28,718 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:54:29,679 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 07:54:30,098 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 07:54:30,418 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-09-10 07:54:30,809 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-09-10 07:54:31,341 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 07:54:31,703 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 07:54:32,278 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2019-09-10 07:54:33,817 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2019-09-10 07:54:34,174 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-09-10 07:54:34,752 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-10 07:54:35,080 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 07:54:35,421 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-10 07:54:35,743 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 07:54:36,149 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-09-10 07:54:36,508 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-09-10 07:54:37,140 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 07:54:37,559 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 07:54:37,821 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:54:38,138 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-09-10 07:54:38,541 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:54:38,930 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 07:54:39,380 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:54:39,700 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 07:54:40,037 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:54:40,270 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:54:40,612 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:54:40,995 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-09-10 07:54:41,356 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:54:41,635 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 07:54:41,941 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:54:42,260 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:54:42,512 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:54:42,770 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:54:44,215 WARN L188 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-09-10 07:54:44,577 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:54:44,920 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 07:54:45,244 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 07:54:45,986 WARN L188 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-10 07:54:46,396 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-09-10 07:54:46,671 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:54:47,085 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:54:47,569 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:54:47,818 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:54:48,066 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:54:48,301 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:54:49,034 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-09-10 07:54:49,415 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:54:50,058 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:54:50,389 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 07:54:51,117 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-09-10 07:54:51,504 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:54:51,950 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 07:54:52,286 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 07:54:52,749 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-09-10 07:54:53,081 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:54:53,395 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:54:53,694 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 07:54:54,264 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 07:54:54,658 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:54:55,265 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-09-10 07:54:55,617 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-10 07:54:55,988 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-09-10 07:54:56,398 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:54:56,732 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:54:57,476 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:54:59,996 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2019-09-10 07:55:00,531 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-09-10 07:55:00,855 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-09-10 07:55:01,385 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 07:55:01,717 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:55:02,001 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:55:02,398 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-09-10 07:55:02,839 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-09-10 07:55:03,133 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 07:55:03,590 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 07:55:04,055 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:55:04,493 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:55:04,746 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:55:05,152 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-09-10 07:55:05,544 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:55:05,895 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 07:55:06,248 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 07:55:06,666 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:55:07,062 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:55:07,429 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-09-10 07:55:07,883 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-09-10 07:55:08,271 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-09-10 07:55:08,875 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 07:55:09,342 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-09-10 07:55:10,018 WARN L188 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:55:10,258 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:55:10,576 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:55:10,869 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 07:55:11,383 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:55:11,658 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:55:12,021 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 07:55:12,327 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:55:12,682 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 07:55:12,951 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:55:13,391 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 07:55:13,788 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2019-09-10 07:55:14,321 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2019-09-10 07:55:14,616 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:55:15,092 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:55:15,425 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:55:15,943 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-09-10 07:55:16,562 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-09-10 07:55:17,188 WARN L188 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2019-09-10 07:55:17,927 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 07:55:21,185 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 07:55:21,608 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 07:55:22,059 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 07:55:22,376 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:55:22,820 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:55:23,374 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2019-09-10 07:55:23,765 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 07:55:24,280 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-09-10 07:55:24,549 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:55:24,836 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:55:25,096 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:55:25,372 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 07:55:25,667 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-10 07:55:25,960 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:55:26,353 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-09-10 07:55:26,660 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:55:27,073 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:55:27,524 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-09-10 07:55:27,846 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:55:28,243 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-09-10 07:55:28,559 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:55:29,004 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-10 07:55:29,671 WARN L188 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 07:55:30,063 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-09-10 07:55:31,057 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2019-09-10 07:55:31,349 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 07:55:31,804 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-09-10 07:55:32,172 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-09-10 07:55:32,546 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:55:32,932 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:55:33,214 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:55:33,478 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:55:33,771 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-10 07:55:34,087 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-09-10 07:55:34,528 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 07:55:34,876 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 07:55:35,247 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 07:55:35,558 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 07:55:35,905 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-09-10 07:55:36,404 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-09-10 07:55:36,717 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-09-10 07:55:37,100 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-09-10 07:55:37,617 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-09-10 07:55:38,007 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-10 07:55:38,309 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-10 07:55:38,634 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:55:38,968 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 07:55:39,372 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-09-10 07:55:39,995 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 07:55:40,304 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 07:55:40,653 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-09-10 07:55:41,056 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-09-10 07:55:41,496 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:55:41,814 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:55:42,224 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 07:55:42,515 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:55:42,874 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 07:55:43,150 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:55:43,493 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 07:55:44,183 WARN L188 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 07:55:44,648 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-09-10 07:55:45,097 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 07:55:45,641 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-09-10 07:55:45,940 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:55:46,232 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:55:46,593 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:55:46,959 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:55:47,369 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 07:55:49,734 WARN L188 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-09-10 07:55:50,107 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-09-10 07:55:50,476 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-09-10 07:55:50,942 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 07:55:53,495 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-09-10 07:55:54,018 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:55:54,420 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-09-10 07:55:54,786 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 07:55:55,135 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 07:55:55,651 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 96 [2019-09-10 07:55:56,117 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-10 07:55:56,664 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 102 [2019-09-10 07:55:57,456 WARN L188 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-09-10 07:55:59,504 WARN L188 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 07:56:00,145 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-09-10 07:56:00,547 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 07:56:01,082 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 07:56:01,389 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 07:56:01,794 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2019-09-10 07:56:02,138 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-09-10 07:56:02,612 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:56:02,959 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-09-10 07:56:03,364 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2019-09-10 07:56:03,754 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 07:56:04,125 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-09-10 07:56:04,546 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-09-10 07:56:05,181 WARN L188 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-09-10 07:56:05,771 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2019-09-10 07:56:06,219 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2019-09-10 07:56:06,922 WARN L188 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 100 [2019-09-10 07:56:07,456 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2019-09-10 07:56:07,804 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 07:56:08,413 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-09-10 07:56:08,824 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-09-10 07:56:09,234 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 07:56:09,753 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2019-09-10 07:56:10,145 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2019-09-10 07:56:10,535 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-09-10 07:56:11,008 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2019-09-10 07:56:11,378 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-09-10 07:56:11,974 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 07:56:13,572 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 07:56:14,223 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 90 [2019-09-10 07:56:14,577 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 07:56:15,102 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:56:15,426 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:56:15,905 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 07:56:16,241 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 07:56:16,660 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2019-09-10 07:56:17,110 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2019-09-10 07:56:17,701 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-09-10 07:56:18,299 WARN L188 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-09-10 07:56:18,617 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 07:56:18,934 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 07:56:19,196 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:56:19,642 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-10 07:56:20,145 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:56:20,476 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 07:56:20,732 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:56:21,132 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:56:21,436 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-10 07:56:22,074 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-09-10 07:56:22,482 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-09-10 07:56:22,843 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2019-09-10 07:56:23,353 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-10 07:56:24,131 WARN L188 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-09-10 07:56:24,496 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 07:56:24,860 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 07:56:25,382 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 07:56:25,629 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:56:25,911 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:56:26,521 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-10 07:56:26,790 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:56:27,104 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:56:27,617 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:56:27,935 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:56:28,266 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:56:28,574 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:56:28,997 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:56:29,417 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:56:29,786 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 07:56:30,136 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-09-10 07:56:30,565 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:56:30,859 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:56:31,452 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:56:31,787 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:56:32,090 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:56:32,452 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:56:33,205 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:56:33,607 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:56:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:33,953 INFO L93 Difference]: Finished difference Result 328960 states and 410677 transitions. [2019-09-10 07:56:33,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2019-09-10 07:56:33,954 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 166 [2019-09-10 07:56:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:34,426 INFO L225 Difference]: With dead ends: 328960 [2019-09-10 07:56:34,427 INFO L226 Difference]: Without dead ends: 328960 [2019-09-10 07:56:34,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 258 SyntacticMatches, 55 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43481 ImplicationChecksByTransitivity, 121.3s TimeCoverageRelationStatistics Valid=12782, Invalid=92518, Unknown=0, NotChecked=0, Total=105300 [2019-09-10 07:56:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328960 states. [2019-09-10 07:56:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328960 to 148259. [2019-09-10 07:56:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148259 states. [2019-09-10 07:56:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148259 states to 148259 states and 180757 transitions. [2019-09-10 07:56:39,131 INFO L78 Accepts]: Start accepts. Automaton has 148259 states and 180757 transitions. Word has length 166 [2019-09-10 07:56:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:39,131 INFO L475 AbstractCegarLoop]: Abstraction has 148259 states and 180757 transitions. [2019-09-10 07:56:39,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 07:56:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 148259 states and 180757 transitions. [2019-09-10 07:56:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 07:56:39,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:39,139 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:39,140 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash 607495314, now seen corresponding path program 1 times [2019-09-10 07:56:39,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:39,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:39,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:39,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:39,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:39,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:56:39,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:56:39,463 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2019-09-10 07:56:39,464 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [268], [271], [274], [282], [284], [287], [290], [295], [297], [300], [308], [310], [313], [316], [321], [323], [326], [334], [336], [339], [346], [348], [351], [352], [354], [363], [366], [370], [379], [381], [384], [387], [389], [397], [400], [406], [409], [412], [414], [429], [431], [434], [437], [439], [447], [450], [456], [459], [462], [464], [479], [481], [484], [487], [489], [505], [508], [589], [594], [647], [650], [665], [668], [671], [673], [690], [693], [696], [698], [715], [718], [721], [723], [740], [743], [746], [748], [765], [768], [771], [773], [846], [847], [851], [852], [853] [2019-09-10 07:56:39,467 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:56:39,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:56:39,495 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:56:40,022 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:56:40,023 INFO L272 AbstractInterpreter]: Visited 159 different actions 936 times. Merged at 55 different actions 679 times. Widened at 21 different actions 127 times. Performed 3391 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3391 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 79 fixpoints after 21 different actions. Largest state had 163 variables. [2019-09-10 07:56:40,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:40,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:56:40,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:56:40,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:56:40,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:40,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:56:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:40,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:56:40,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:56:40,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:40,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:40,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:40,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:40,616 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:56:40,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:40,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:40,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:40,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:40,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:42,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:56:42,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:56:42,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2019-09-10 07:56:42,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:56:42,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:56:42,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:56:42,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:56:42,940 INFO L87 Difference]: Start difference. First operand 148259 states and 180757 transitions. Second operand 21 states. [2019-09-10 07:56:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:50,548 INFO L93 Difference]: Finished difference Result 362899 states and 446471 transitions. [2019-09-10 07:56:50,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 07:56:50,549 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 167 [2019-09-10 07:56:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:50,968 INFO L225 Difference]: With dead ends: 362899 [2019-09-10 07:56:50,968 INFO L226 Difference]: Without dead ends: 362899 [2019-09-10 07:56:50,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 282 SyntacticMatches, 31 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2932 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1559, Invalid=6097, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 07:56:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362899 states. [2019-09-10 07:56:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362899 to 204683. [2019-09-10 07:56:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204683 states. [2019-09-10 07:56:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204683 states to 204683 states and 248928 transitions. [2019-09-10 07:56:56,949 INFO L78 Accepts]: Start accepts. Automaton has 204683 states and 248928 transitions. Word has length 167 [2019-09-10 07:56:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:56,949 INFO L475 AbstractCegarLoop]: Abstraction has 204683 states and 248928 transitions. [2019-09-10 07:56:56,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:56:56,949 INFO L276 IsEmpty]: Start isEmpty. Operand 204683 states and 248928 transitions. [2019-09-10 07:56:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 07:56:56,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:56,959 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:56,960 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:56,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:56,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1220019077, now seen corresponding path program 1 times [2019-09-10 07:56:56,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:56,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:56,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:56,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:56,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:57,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:56:57,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:56:57,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2019-09-10 07:56:57,338 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [207], [209], [211], [214], [217], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [268], [271], [274], [282], [284], [287], [290], [295], [297], [300], [303], [308], [310], [313], [321], [323], [326], [334], [336], [339], [346], [348], [351], [352], [354], [363], [366], [370], [379], [381], [384], [387], [389], [404], [406], [409], [412], [414], [422], [425], [431], [434], [437], [439], [447], [450], [456], [459], [462], [464], [479], [481], [484], [487], [489], [505], [508], [564], [569], [647], [650], [665], [668], [671], [673], [690], [693], [696], [698], [715], [718], [721], [723], [740], [743], [746], [748], [765], [768], [771], [773], [846], [847], [851], [852], [853] [2019-09-10 07:56:57,341 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:56:57,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:56:57,382 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:56:57,995 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:56:57,996 INFO L272 AbstractInterpreter]: Visited 159 different actions 903 times. Merged at 55 different actions 653 times. Widened at 18 different actions 98 times. Performed 3307 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3307 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 80 fixpoints after 16 different actions. Largest state had 163 variables. [2019-09-10 07:56:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:57,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:56:57,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:56:57,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:56:58,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:58,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:56:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:58,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:56:58,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:56:58,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:58,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:58,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:59,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:59,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:56:59,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:59,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:59,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:59,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:59,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:01,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:01,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:57:01,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2019-09-10 07:57:01,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:57:01,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:57:01,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:57:01,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:57:01,163 INFO L87 Difference]: Start difference. First operand 204683 states and 248928 transitions. Second operand 23 states. [2019-09-10 07:57:01,308 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:57:03,842 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 07:57:04,543 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:57:04,704 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 07:57:04,879 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:57:05,041 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 07:57:05,687 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:57:06,005 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:57:06,205 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:57:06,359 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 07:57:06,697 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:57:06,904 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 07:57:07,071 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:57:07,231 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 07:57:07,406 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:57:07,588 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 07:57:08,005 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 07:57:08,211 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:57:08,407 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 07:57:08,731 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 07:57:08,956 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 07:57:10,023 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:57:10,436 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 07:57:10,803 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-09-10 07:57:10,965 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:57:11,187 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 07:57:11,818 WARN L188 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-09-10 07:57:12,178 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-09-10 07:57:12,713 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 07:57:13,211 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 07:57:13,571 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:57:13,821 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-09-10 07:57:14,076 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 07:57:14,249 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:57:15,282 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 07:57:15,517 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-09-10 07:57:15,710 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-10 07:57:16,319 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 07:57:16,577 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-09-10 07:57:17,227 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-09-10 07:57:17,431 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-09-10 07:57:18,019 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 07:57:18,213 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 07:57:18,425 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-09-10 07:57:18,600 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-09-10 07:57:18,819 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-09-10 07:57:19,257 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-10 07:57:19,513 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-09-10 07:57:20,915 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-10 07:57:21,195 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-09-10 07:57:21,423 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-10 07:57:21,594 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 07:57:21,890 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 07:57:22,099 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-09-10 07:57:22,311 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 07:57:22,529 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 07:57:22,903 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 07:57:23,130 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 07:57:23,316 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 07:57:23,496 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2019-09-10 07:57:23,743 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 07:57:24,684 WARN L188 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-09-10 07:57:25,309 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:57:25,516 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 07:57:25,820 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 07:57:26,055 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 07:57:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:26,977 INFO L93 Difference]: Finished difference Result 937141 states and 1137414 transitions. [2019-09-10 07:57:26,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-10 07:57:26,977 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 167 [2019-09-10 07:57:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:28,116 INFO L225 Difference]: With dead ends: 937141 [2019-09-10 07:57:28,117 INFO L226 Difference]: Without dead ends: 937141 [2019-09-10 07:57:28,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 281 SyntacticMatches, 32 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5705 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=3730, Invalid=15452, Unknown=0, NotChecked=0, Total=19182 [2019-09-10 07:57:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937141 states. [2019-09-10 07:57:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937141 to 296524. [2019-09-10 07:57:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296524 states. [2019-09-10 07:57:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296524 states to 296524 states and 360094 transitions. [2019-09-10 07:57:41,848 INFO L78 Accepts]: Start accepts. Automaton has 296524 states and 360094 transitions. Word has length 167 [2019-09-10 07:57:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:41,849 INFO L475 AbstractCegarLoop]: Abstraction has 296524 states and 360094 transitions. [2019-09-10 07:57:41,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:57:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 296524 states and 360094 transitions. [2019-09-10 07:57:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 07:57:41,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:41,871 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:41,871 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:41,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:41,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1938215473, now seen corresponding path program 1 times [2019-09-10 07:57:41,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:41,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:41,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:41,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:41,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 07:57:41,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:41,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:57:41,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:41,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:57:41,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:57:41,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:57:41,943 INFO L87 Difference]: Start difference. First operand 296524 states and 360094 transitions. Second operand 3 states. [2019-09-10 07:57:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:42,354 INFO L93 Difference]: Finished difference Result 158597 states and 192130 transitions. [2019-09-10 07:57:42,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:57:42,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 07:57:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:42,507 INFO L225 Difference]: With dead ends: 158597 [2019-09-10 07:57:42,508 INFO L226 Difference]: Without dead ends: 158597 [2019-09-10 07:57:42,508 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-10 07:57:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158597 states. [2019-09-10 07:57:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158597 to 158597. [2019-09-10 07:57:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158597 states. [2019-09-10 07:57:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158597 states to 158597 states and 192130 transitions. [2019-09-10 07:57:44,881 INFO L78 Accepts]: Start accepts. Automaton has 158597 states and 192130 transitions. Word has length 168 [2019-09-10 07:57:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:44,882 INFO L475 AbstractCegarLoop]: Abstraction has 158597 states and 192130 transitions. [2019-09-10 07:57:44,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:57:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 158597 states and 192130 transitions. [2019-09-10 07:57:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 07:57:44,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:44,897 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:44,897 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:44,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:44,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1571753531, now seen corresponding path program 1 times [2019-09-10 07:57:44,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:44,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:44,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:44,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:57:45,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:45,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:57:45,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:45,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:57:45,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:57:45,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:57:45,006 INFO L87 Difference]: Start difference. First operand 158597 states and 192130 transitions. Second operand 5 states. [2019-09-10 07:57:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:46,910 INFO L93 Difference]: Finished difference Result 355271 states and 431020 transitions. [2019-09-10 07:57:46,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:57:46,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-09-10 07:57:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:47,354 INFO L225 Difference]: With dead ends: 355271 [2019-09-10 07:57:47,354 INFO L226 Difference]: Without dead ends: 355221 [2019-09-10 07:57:47,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:57:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355221 states. [2019-09-10 07:57:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355221 to 355135. [2019-09-10 07:57:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355135 states. [2019-09-10 07:58:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355135 states to 355135 states and 430887 transitions. [2019-09-10 07:58:00,290 INFO L78 Accepts]: Start accepts. Automaton has 355135 states and 430887 transitions. Word has length 168 [2019-09-10 07:58:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:00,290 INFO L475 AbstractCegarLoop]: Abstraction has 355135 states and 430887 transitions. [2019-09-10 07:58:00,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:58:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 355135 states and 430887 transitions. [2019-09-10 07:58:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 07:58:00,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:00,315 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:00,315 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash -339289027, now seen corresponding path program 1 times [2019-09-10 07:58:00,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:00,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:00,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:00,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:00,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:00,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:00,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:58:00,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2019-09-10 07:58:00,579 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [207], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [248], [250], [253], [260], [262], [266], [268], [271], [274], [282], [284], [287], [290], [295], [297], [300], [303], [306], [308], [310], [313], [316], [321], [323], [326], [334], [336], [339], [346], [348], [351], [352], [354], [363], [366], [370], [379], [381], [384], [387], [389], [397], [400], [406], [409], [412], [414], [431], [434], [437], [439], [447], [450], [456], [459], [462], [464], [479], [481], [484], [487], [489], [505], [508], [514], [519], [647], [650], [665], [668], [671], [673], [690], [693], [696], [698], [715], [718], [721], [723], [740], [743], [746], [748], [765], [768], [771], [773], [846], [847], [851], [852], [853] [2019-09-10 07:58:00,582 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:58:00,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:58:00,601 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:58:01,083 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:58:01,084 INFO L272 AbstractInterpreter]: Visited 160 different actions 866 times. Merged at 56 different actions 621 times. Widened at 18 different actions 79 times. Performed 3222 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3222 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 74 fixpoints after 17 different actions. Largest state had 163 variables. [2019-09-10 07:58:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:01,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:58:01,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:01,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:58:01,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:01,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:58:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:01,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:58:01,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:58:01,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:01,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:01,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:01,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:01,601 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:58:01,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:01,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:01,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:01,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:01,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:03,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:03,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:58:03,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2019-09-10 07:58:03,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:58:03,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:58:03,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:58:03,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:58:03,950 INFO L87 Difference]: Start difference. First operand 355135 states and 430887 transitions. Second operand 21 states. [2019-09-10 07:58:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:09,625 INFO L93 Difference]: Finished difference Result 734084 states and 899902 transitions. [2019-09-10 07:58:09,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:58:09,625 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 168 [2019-09-10 07:58:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:10,652 INFO L225 Difference]: With dead ends: 734084 [2019-09-10 07:58:10,652 INFO L226 Difference]: Without dead ends: 734084 [2019-09-10 07:58:10,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 261 SyntacticMatches, 54 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2291 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=713, Invalid=2947, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 07:58:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734084 states. [2019-09-10 07:58:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734084 to 354935. [2019-09-10 07:58:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354935 states. [2019-09-10 07:58:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354935 states to 354935 states and 430687 transitions. [2019-09-10 07:58:24,294 INFO L78 Accepts]: Start accepts. Automaton has 354935 states and 430687 transitions. Word has length 168 [2019-09-10 07:58:24,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:24,295 INFO L475 AbstractCegarLoop]: Abstraction has 354935 states and 430687 transitions. [2019-09-10 07:58:24,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:58:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 354935 states and 430687 transitions. [2019-09-10 07:58:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 07:58:24,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:24,307 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:24,307 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:24,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:24,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1937959652, now seen corresponding path program 1 times [2019-09-10 07:58:24,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:24,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:24,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:24,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:24,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:24,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:24,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:58:24,743 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2019-09-10 07:58:24,743 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [207], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [268], [271], [274], [277], [280], [282], [284], [287], [290], [295], [297], [300], [303], [306], [308], [310], [313], [316], [321], [323], [326], [334], [336], [339], [346], [348], [351], [352], [354], [363], [366], [370], [379], [381], [384], [387], [389], [397], [400], [406], [409], [412], [414], [431], [434], [437], [439], [447], [450], [456], [459], [462], [464], [481], [484], [487], [489], [505], [508], [647], [650], [665], [668], [671], [673], [690], [693], [696], [698], [715], [718], [721], [723], [740], [743], [746], [748], [765], [768], [771], [773], [846], [847], [851], [852], [853] [2019-09-10 07:58:24,746 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:58:24,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:58:24,766 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:58:25,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:58:25,322 INFO L272 AbstractInterpreter]: Visited 160 different actions 927 times. Merged at 57 different actions 681 times. Widened at 18 different actions 96 times. Performed 3448 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3448 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 79 fixpoints after 16 different actions. Largest state had 163 variables. [2019-09-10 07:58:25,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:25,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:58:25,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:25,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:58:25,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:25,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:58:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:25,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:58:25,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:58:25,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:25,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:26,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:58:30,283 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 21 [2019-09-10 07:58:30,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:30,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:33,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:33,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:58:33,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:58:33,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:58:33,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:58:33,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:58:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:58:33,371 INFO L87 Difference]: Start difference. First operand 354935 states and 430687 transitions. Second operand 20 states. [2019-09-10 07:58:33,607 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:58:34,552 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:58:34,996 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:58:35,653 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:58:35,882 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:58:36,490 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:58:36,663 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:58:37,262 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:58:37,823 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:58:38,261 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:58:38,720 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:58:38,923 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:58:39,155 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:58:40,338 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:58:40,525 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:58:40,937 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:58:41,130 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:58:41,541 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:58:41,775 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:58:42,004 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:58:42,456 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:58:42,765 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:58:45,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:45,569 INFO L93 Difference]: Finished difference Result 1496492 states and 1775229 transitions. [2019-09-10 07:58:45,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:58:45,569 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 168 [2019-09-10 07:58:45,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:55,131 INFO L225 Difference]: With dead ends: 1496492 [2019-09-10 07:58:55,131 INFO L226 Difference]: Without dead ends: 1496492 [2019-09-10 07:58:55,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 288 SyntacticMatches, 35 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=671, Invalid=1879, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 07:58:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496492 states. [2019-09-10 07:59:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496492 to 854584. [2019-09-10 07:59:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854584 states. [2019-09-10 07:59:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854584 states to 854584 states and 1035687 transitions. [2019-09-10 07:59:16,408 INFO L78 Accepts]: Start accepts. Automaton has 854584 states and 1035687 transitions. Word has length 168 [2019-09-10 07:59:16,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:16,408 INFO L475 AbstractCegarLoop]: Abstraction has 854584 states and 1035687 transitions. [2019-09-10 07:59:16,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:59:16,409 INFO L276 IsEmpty]: Start isEmpty. Operand 854584 states and 1035687 transitions. [2019-09-10 07:59:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 07:59:16,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:16,440 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:59:16,440 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:16,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:16,440 INFO L82 PathProgramCache]: Analyzing trace with hash 492036931, now seen corresponding path program 1 times [2019-09-10 07:59:16,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:16,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:16,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:16,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:16,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:59:16,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:16,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:59:16,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:16,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:59:16,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:59:16,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:59:16,601 INFO L87 Difference]: Start difference. First operand 854584 states and 1035687 transitions. Second operand 7 states. [2019-09-10 07:59:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:27,162 INFO L93 Difference]: Finished difference Result 1368028 states and 1667503 transitions. [2019-09-10 07:59:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:59:27,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2019-09-10 07:59:27,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:28,912 INFO L225 Difference]: With dead ends: 1368028 [2019-09-10 07:59:28,913 INFO L226 Difference]: Without dead ends: 1367848 [2019-09-10 07:59:28,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:59:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367848 states. [2019-09-10 08:00:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367848 to 1075292. [2019-09-10 08:00:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075292 states. [2019-09-10 08:00:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075292 states to 1075292 states and 1307145 transitions. [2019-09-10 08:00:05,454 INFO L78 Accepts]: Start accepts. Automaton has 1075292 states and 1307145 transitions. Word has length 169 [2019-09-10 08:00:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:05,454 INFO L475 AbstractCegarLoop]: Abstraction has 1075292 states and 1307145 transitions. [2019-09-10 08:00:05,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:00:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1075292 states and 1307145 transitions. [2019-09-10 08:00:05,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 08:00:05,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:05,486 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:00:05,486 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:05,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:05,486 INFO L82 PathProgramCache]: Analyzing trace with hash -548060353, now seen corresponding path program 1 times [2019-09-10 08:00:05,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:05,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:05,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:05,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:05,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:00:05,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:00:05,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:00:05,746 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2019-09-10 08:00:05,747 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [207], [209], [211], [214], [217], [222], [224], [227], [230], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [268], [271], [274], [277], [280], [282], [284], [287], [290], [295], [297], [300], [303], [308], [310], [313], [321], [323], [326], [334], [336], [339], [346], [348], [351], [352], [354], [363], [366], [370], [379], [381], [384], [387], [389], [404], [406], [409], [412], [414], [422], [425], [431], [434], [437], [439], [447], [450], [456], [459], [462], [464], [481], [484], [487], [489], [505], [508], [539], [544], [564], [569], [647], [650], [665], [668], [671], [673], [690], [693], [696], [698], [715], [718], [721], [723], [740], [743], [746], [748], [765], [768], [771], [773], [846], [847], [851], [852], [853] [2019-09-10 08:00:05,749 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:00:05,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:00:05,764 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:00:06,168 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:00:06,169 INFO L272 AbstractInterpreter]: Visited 161 different actions 865 times. Merged at 56 different actions 622 times. Widened at 18 different actions 86 times. Performed 3216 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3216 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 74 fixpoints after 17 different actions. Largest state had 163 variables. [2019-09-10 08:00:06,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:06,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:00:06,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:00:06,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:00:06,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:06,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:00:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:06,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:00:06,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:00:06,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:06,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:06,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:06,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:00:06,706 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:00:06,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:06,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:07,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:07,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:07,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:08,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:00:09,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:00:09,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2019-09-10 08:00:09,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:00:09,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:00:09,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:00:09,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:00:09,427 INFO L87 Difference]: Start difference. First operand 1075292 states and 1307145 transitions. Second operand 21 states. [2019-09-10 08:00:22,973 WARN L188 SmtUtils]: Spent 6.60 s on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 08:00:26,774 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 08:00:34,779 WARN L188 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 08:00:36,542 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 08:00:37,245 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 08:00:39,531 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 08:00:39,822 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47