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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:59:02,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:59:02,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:59:02,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:59:02,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:59:02,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:59:02,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:59:02,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:59:02,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:59:02,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:59:02,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:59:02,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:59:02,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:59:02,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:59:02,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:59:02,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:59:02,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:59:02,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:59:02,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:59:02,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:59:02,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:59:02,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:59:02,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:59:02,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:59:02,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:59:02,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:59:02,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:59:02,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:59:02,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:59:02,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:59:02,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:59:02,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:59:02,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:59:02,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:59:02,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:59:02,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:59:02,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:59:02,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:59:02,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:59:02,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:59:02,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:59:02,861 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:59:02,875 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:59:02,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:59:02,876 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:59:02,876 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:59:02,877 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:59:02,877 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:59:02,877 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:59:02,877 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:59:02,878 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:59:02,878 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:59:02,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:59:02,879 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:59:02,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:59:02,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:59:02,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:59:02,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:59:02,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:59:02,880 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:59:02,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:59:02,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:59:02,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:59:02,880 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:59:02,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:59:02,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:59:02,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:59:02,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:59:02,882 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:59:02,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:59:02,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:59:02,882 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:59:02,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:59:02,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:59:02,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:59:02,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:59:02,949 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:59:02,949 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:59:03,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85ce4b7e8/4238524cb0ee4139bc878d70ce8313c7/FLAGb0a96ab9a [2019-09-10 07:59:03,588 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:59:03,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:59:03,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85ce4b7e8/4238524cb0ee4139bc878d70ce8313c7/FLAGb0a96ab9a [2019-09-10 07:59:03,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85ce4b7e8/4238524cb0ee4139bc878d70ce8313c7 [2019-09-10 07:59:03,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:59:03,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:59:03,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:59:03,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:59:03,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:59:03,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:59:03" (1/1) ... [2019-09-10 07:59:03,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ec451f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:03, skipping insertion in model container [2019-09-10 07:59:03,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:59:03" (1/1) ... [2019-09-10 07:59:03,798 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:59:03,926 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:59:04,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:59:04,837 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:59:05,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:59:05,224 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:59:05,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:05 WrapperNode [2019-09-10 07:59:05,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:59:05,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:59:05,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:59:05,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:59:05,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:05" (1/1) ... [2019-09-10 07:59:05,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:05" (1/1) ... [2019-09-10 07:59:05,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:05" (1/1) ... [2019-09-10 07:59:05,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:05" (1/1) ... [2019-09-10 07:59:05,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:05" (1/1) ... [2019-09-10 07:59:05,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:05" (1/1) ... [2019-09-10 07:59:05,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:05" (1/1) ... [2019-09-10 07:59:05,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:59:05,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:59:05,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:59:05,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:59:05,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:05" (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:59:05,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:59:05,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:59:05,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:59:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:59:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:59:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:59:05,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:59:05,458 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:59:05,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:59:05,458 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:59:05,459 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:59:05,459 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:59:05,460 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:59:05,461 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:59:05,461 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:59:05,461 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:59:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:59:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:59:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:59:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:59:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:59:07,909 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:59:07,909 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:59:07,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:59:07 BoogieIcfgContainer [2019-09-10 07:59:07,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:59:07,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:59:07,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:59:07,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:59:07,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:59:03" (1/3) ... [2019-09-10 07:59:07,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222b7a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:59:07, skipping insertion in model container [2019-09-10 07:59:07,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:05" (2/3) ... [2019-09-10 07:59:07,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222b7a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:59:07, skipping insertion in model container [2019-09-10 07:59:07,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:59:07" (3/3) ... [2019-09-10 07:59:07,918 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:59:07,927 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:59:07,935 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-10 07:59:07,951 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-10 07:59:07,974 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:59:07,974 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:59:07,974 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:59:07,974 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:59:07,975 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:59:07,975 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:59:07,975 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:59:07,975 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:59:08,004 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states. [2019-09-10 07:59:08,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:59:08,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:08,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:59:08,039 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:08,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:08,045 INFO L82 PathProgramCache]: Analyzing trace with hash -753741321, now seen corresponding path program 1 times [2019-09-10 07:59:08,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:08,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:08,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:08,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:08,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:08,622 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:59:08,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:08,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:59:08,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:08,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:59:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:59:08,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:08,647 INFO L87 Difference]: Start difference. First operand 631 states. Second operand 5 states. [2019-09-10 07:59:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:09,535 INFO L93 Difference]: Finished difference Result 727 states and 1206 transitions. [2019-09-10 07:59:09,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:09,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 07:59:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:09,556 INFO L225 Difference]: With dead ends: 727 [2019-09-10 07:59:09,556 INFO L226 Difference]: Without dead ends: 715 [2019-09-10 07:59:09,558 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:59:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-09-10 07:59:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 655. [2019-09-10 07:59:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-10 07:59:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 871 transitions. [2019-09-10 07:59:09,644 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 871 transitions. Word has length 75 [2019-09-10 07:59:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:09,644 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 871 transitions. [2019-09-10 07:59:09,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:59:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 871 transitions. [2019-09-10 07:59:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:59:09,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:09,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:59:09,650 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash -4055452, now seen corresponding path program 1 times [2019-09-10 07:59:09,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:09,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:09,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:09,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:09,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:09,890 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:59:09,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:09,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:59:09,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:09,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:59:09,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:59:09,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:09,893 INFO L87 Difference]: Start difference. First operand 655 states and 871 transitions. Second operand 5 states. [2019-09-10 07:59:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:10,306 INFO L93 Difference]: Finished difference Result 594 states and 800 transitions. [2019-09-10 07:59:10,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:10,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 07:59:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:10,314 INFO L225 Difference]: With dead ends: 594 [2019-09-10 07:59:10,314 INFO L226 Difference]: Without dead ends: 594 [2019-09-10 07:59:10,317 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:59:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-10 07:59:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-09-10 07:59:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-09-10 07:59:10,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 800 transitions. [2019-09-10 07:59:10,350 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 800 transitions. Word has length 76 [2019-09-10 07:59:10,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:10,351 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 800 transitions. [2019-09-10 07:59:10,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:59:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 800 transitions. [2019-09-10 07:59:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:59:10,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:10,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:59:10,359 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:10,359 INFO L82 PathProgramCache]: Analyzing trace with hash 211673049, now seen corresponding path program 1 times [2019-09-10 07:59:10,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:10,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:10,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:10,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:10,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:10,563 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:59:10,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:10,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:59:10,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:10,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:59:10,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:59:10,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:10,570 INFO L87 Difference]: Start difference. First operand 594 states and 800 transitions. Second operand 5 states. [2019-09-10 07:59:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:11,018 INFO L93 Difference]: Finished difference Result 568 states and 768 transitions. [2019-09-10 07:59:11,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:11,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 07:59:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:11,023 INFO L225 Difference]: With dead ends: 568 [2019-09-10 07:59:11,023 INFO L226 Difference]: Without dead ends: 568 [2019-09-10 07:59:11,023 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:59:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-10 07:59:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-10 07:59:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-10 07:59:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 768 transitions. [2019-09-10 07:59:11,040 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 768 transitions. Word has length 77 [2019-09-10 07:59:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:11,041 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 768 transitions. [2019-09-10 07:59:11,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:59:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 768 transitions. [2019-09-10 07:59:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:59:11,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:11,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] [2019-09-10 07:59:11,045 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:11,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash -11531761, now seen corresponding path program 1 times [2019-09-10 07:59:11,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:11,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:11,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:11,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:11,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:11,168 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:59:11,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:11,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:59:11,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:11,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:59:11,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:59:11,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:11,171 INFO L87 Difference]: Start difference. First operand 568 states and 768 transitions. Second operand 5 states. [2019-09-10 07:59:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:11,919 INFO L93 Difference]: Finished difference Result 558 states and 754 transitions. [2019-09-10 07:59:11,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:11,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 07:59:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:11,923 INFO L225 Difference]: With dead ends: 558 [2019-09-10 07:59:11,923 INFO L226 Difference]: Without dead ends: 558 [2019-09-10 07:59:11,924 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:59:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-10 07:59:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2019-09-10 07:59:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-10 07:59:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 754 transitions. [2019-09-10 07:59:11,938 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 754 transitions. Word has length 78 [2019-09-10 07:59:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:11,939 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 754 transitions. [2019-09-10 07:59:11,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:59:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 754 transitions. [2019-09-10 07:59:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:59:11,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:11,941 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:59:11,942 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:11,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:11,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1775015611, now seen corresponding path program 1 times [2019-09-10 07:59:11,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:11,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:11,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:11,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:11,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:12,039 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:59:12,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:12,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:59:12,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:12,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:59:12,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:59:12,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:12,041 INFO L87 Difference]: Start difference. First operand 558 states and 754 transitions. Second operand 5 states. [2019-09-10 07:59:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:12,432 INFO L93 Difference]: Finished difference Result 547 states and 740 transitions. [2019-09-10 07:59:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:12,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 07:59:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:12,436 INFO L225 Difference]: With dead ends: 547 [2019-09-10 07:59:12,437 INFO L226 Difference]: Without dead ends: 547 [2019-09-10 07:59:12,437 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:59:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-10 07:59:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2019-09-10 07:59:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 740 transitions. [2019-09-10 07:59:12,452 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 740 transitions. Word has length 79 [2019-09-10 07:59:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:12,453 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 740 transitions. [2019-09-10 07:59:12,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:59:12,453 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 740 transitions. [2019-09-10 07:59:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:59:12,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:12,455 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] [2019-09-10 07:59:12,456 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:12,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:12,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1857846520, now seen corresponding path program 1 times [2019-09-10 07:59:12,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:12,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:12,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:12,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:12,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:12,699 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:59:12,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:12,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:12,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:12,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:12,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:12,702 INFO L87 Difference]: Start difference. First operand 547 states and 740 transitions. Second operand 9 states. [2019-09-10 07:59:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:14,504 INFO L93 Difference]: Finished difference Result 1130 states and 1576 transitions. [2019-09-10 07:59:14,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:14,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 07:59:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:14,512 INFO L225 Difference]: With dead ends: 1130 [2019-09-10 07:59:14,513 INFO L226 Difference]: Without dead ends: 1130 [2019-09-10 07:59:14,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-10 07:59:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-10 07:59:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 739 transitions. [2019-09-10 07:59:14,539 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 739 transitions. Word has length 80 [2019-09-10 07:59:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:14,541 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 739 transitions. [2019-09-10 07:59:14,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 739 transitions. [2019-09-10 07:59:14,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:59:14,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:14,545 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] [2019-09-10 07:59:14,552 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:14,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:14,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1356435279, now seen corresponding path program 1 times [2019-09-10 07:59:14,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:14,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:14,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:14,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:14,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:14,783 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:59:14,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:14,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:14,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:14,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:14,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:14,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:14,785 INFO L87 Difference]: Start difference. First operand 547 states and 739 transitions. Second operand 9 states. [2019-09-10 07:59:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:16,334 INFO L93 Difference]: Finished difference Result 1087 states and 1506 transitions. [2019-09-10 07:59:16,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:59:16,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 07:59:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:16,340 INFO L225 Difference]: With dead ends: 1087 [2019-09-10 07:59:16,340 INFO L226 Difference]: Without dead ends: 1087 [2019-09-10 07:59:16,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:59:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2019-09-10 07:59:16,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 547. [2019-09-10 07:59:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 738 transitions. [2019-09-10 07:59:16,359 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 738 transitions. Word has length 80 [2019-09-10 07:59:16,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:16,360 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 738 transitions. [2019-09-10 07:59:16,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 738 transitions. [2019-09-10 07:59:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:59:16,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:16,362 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] [2019-09-10 07:59:16,362 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:16,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:16,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1849417194, now seen corresponding path program 1 times [2019-09-10 07:59:16,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:16,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:16,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:16,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:16,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:16,546 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:59:16,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:16,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:59:16,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:16,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:59:16,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:59:16,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:59:16,548 INFO L87 Difference]: Start difference. First operand 547 states and 738 transitions. Second operand 8 states. [2019-09-10 07:59:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:17,519 INFO L93 Difference]: Finished difference Result 775 states and 1023 transitions. [2019-09-10 07:59:17,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:59:17,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-09-10 07:59:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:17,524 INFO L225 Difference]: With dead ends: 775 [2019-09-10 07:59:17,524 INFO L226 Difference]: Without dead ends: 775 [2019-09-10 07:59:17,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:59:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-10 07:59:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 547. [2019-09-10 07:59:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 737 transitions. [2019-09-10 07:59:17,539 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 737 transitions. Word has length 80 [2019-09-10 07:59:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:17,540 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 737 transitions. [2019-09-10 07:59:17,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:59:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 737 transitions. [2019-09-10 07:59:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:59:17,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:17,542 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] [2019-09-10 07:59:17,542 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1030150032, now seen corresponding path program 1 times [2019-09-10 07:59:17,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:17,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:17,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:17,706 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:59:17,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:17,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:17,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:17,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:17,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:17,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:17,708 INFO L87 Difference]: Start difference. First operand 547 states and 737 transitions. Second operand 9 states. [2019-09-10 07:59:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:19,444 INFO L93 Difference]: Finished difference Result 1106 states and 1532 transitions. [2019-09-10 07:59:19,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:19,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 07:59:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:19,451 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 07:59:19,451 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 07:59:19,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 07:59:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 07:59:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 736 transitions. [2019-09-10 07:59:19,468 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 736 transitions. Word has length 82 [2019-09-10 07:59:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:19,468 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 736 transitions. [2019-09-10 07:59:19,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 736 transitions. [2019-09-10 07:59:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:59:19,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:19,470 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:59:19,471 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:19,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1206210007, now seen corresponding path program 1 times [2019-09-10 07:59:19,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:19,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:19,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:19,627 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:59:19,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:19,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:19,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:19,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:19,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:19,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:19,629 INFO L87 Difference]: Start difference. First operand 547 states and 736 transitions. Second operand 9 states. [2019-09-10 07:59:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:21,137 INFO L93 Difference]: Finished difference Result 1130 states and 1570 transitions. [2019-09-10 07:59:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:21,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 07:59:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:21,144 INFO L225 Difference]: With dead ends: 1130 [2019-09-10 07:59:21,144 INFO L226 Difference]: Without dead ends: 1130 [2019-09-10 07:59:21,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-10 07:59:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-10 07:59:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 735 transitions. [2019-09-10 07:59:21,161 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 735 transitions. Word has length 82 [2019-09-10 07:59:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:21,161 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 735 transitions. [2019-09-10 07:59:21,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 735 transitions. [2019-09-10 07:59:21,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:59:21,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:21,163 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] [2019-09-10 07:59:21,163 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:21,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2075347116, now seen corresponding path program 1 times [2019-09-10 07:59:21,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:21,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:21,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:21,319 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:59:21,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:21,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:21,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:21,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:21,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:21,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:21,320 INFO L87 Difference]: Start difference. First operand 547 states and 735 transitions. Second operand 9 states. [2019-09-10 07:59:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:23,176 INFO L93 Difference]: Finished difference Result 1106 states and 1530 transitions. [2019-09-10 07:59:23,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:23,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 07:59:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:23,182 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 07:59:23,183 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 07:59:23,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 07:59:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 07:59:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 734 transitions. [2019-09-10 07:59:23,199 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 734 transitions. Word has length 82 [2019-09-10 07:59:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:23,199 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 734 transitions. [2019-09-10 07:59:23,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 734 transitions. [2019-09-10 07:59:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:59:23,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:23,201 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] [2019-09-10 07:59:23,201 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:23,202 INFO L82 PathProgramCache]: Analyzing trace with hash -147519972, now seen corresponding path program 1 times [2019-09-10 07:59:23,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:23,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:23,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:23,383 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:59:23,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:23,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:23,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:23,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:23,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:23,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:23,386 INFO L87 Difference]: Start difference. First operand 547 states and 734 transitions. Second operand 9 states. [2019-09-10 07:59:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:25,121 INFO L93 Difference]: Finished difference Result 1106 states and 1528 transitions. [2019-09-10 07:59:25,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:25,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 07:59:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:25,127 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 07:59:25,127 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 07:59:25,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:25,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 07:59:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 07:59:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 733 transitions. [2019-09-10 07:59:25,143 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 733 transitions. Word has length 82 [2019-09-10 07:59:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:25,143 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 733 transitions. [2019-09-10 07:59:25,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 733 transitions. [2019-09-10 07:59:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:59:25,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:25,145 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] [2019-09-10 07:59:25,146 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1924278388, now seen corresponding path program 1 times [2019-09-10 07:59:25,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:25,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:25,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:25,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:25,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:25,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:25,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:25,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:25,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:25,302 INFO L87 Difference]: Start difference. First operand 547 states and 733 transitions. Second operand 9 states. [2019-09-10 07:59:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:27,034 INFO L93 Difference]: Finished difference Result 1106 states and 1526 transitions. [2019-09-10 07:59:27,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:27,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 07:59:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:27,042 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 07:59:27,042 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 07:59:27,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 07:59:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 07:59:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 731 transitions. [2019-09-10 07:59:27,061 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 731 transitions. Word has length 82 [2019-09-10 07:59:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:27,061 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 731 transitions. [2019-09-10 07:59:27,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 731 transitions. [2019-09-10 07:59:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:59:27,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:27,063 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] [2019-09-10 07:59:27,064 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:27,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1020669943, now seen corresponding path program 1 times [2019-09-10 07:59:27,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:27,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:27,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:27,293 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:59:27,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:27,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:27,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:27,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:27,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:27,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:27,295 INFO L87 Difference]: Start difference. First operand 547 states and 731 transitions. Second operand 9 states. [2019-09-10 07:59:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:28,697 INFO L93 Difference]: Finished difference Result 1130 states and 1564 transitions. [2019-09-10 07:59:28,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:28,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 07:59:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:28,703 INFO L225 Difference]: With dead ends: 1130 [2019-09-10 07:59:28,704 INFO L226 Difference]: Without dead ends: 1130 [2019-09-10 07:59:28,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-10 07:59:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-10 07:59:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 729 transitions. [2019-09-10 07:59:28,718 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 729 transitions. Word has length 82 [2019-09-10 07:59:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:28,718 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 729 transitions. [2019-09-10 07:59:28,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 729 transitions. [2019-09-10 07:59:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:59:28,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:28,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:59:28,721 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1567452331, now seen corresponding path program 1 times [2019-09-10 07:59:28,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:28,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:28,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:28,875 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:59:28,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:28,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:28,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:28,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:28,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:28,877 INFO L87 Difference]: Start difference. First operand 547 states and 729 transitions. Second operand 9 states. [2019-09-10 07:59:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:30,177 INFO L93 Difference]: Finished difference Result 874 states and 1213 transitions. [2019-09-10 07:59:30,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:59:30,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 07:59:30,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:30,181 INFO L225 Difference]: With dead ends: 874 [2019-09-10 07:59:30,181 INFO L226 Difference]: Without dead ends: 874 [2019-09-10 07:59:30,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:59:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-10 07:59:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 547. [2019-09-10 07:59:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 727 transitions. [2019-09-10 07:59:30,194 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 727 transitions. Word has length 82 [2019-09-10 07:59:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:30,194 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 727 transitions. [2019-09-10 07:59:30,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 727 transitions. [2019-09-10 07:59:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:30,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:30,196 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] [2019-09-10 07:59:30,197 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:30,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1772826454, now seen corresponding path program 1 times [2019-09-10 07:59:30,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:30,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:30,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:30,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:30,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:30,378 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:59:30,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:30,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:30,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:30,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:30,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:30,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:30,382 INFO L87 Difference]: Start difference. First operand 547 states and 727 transitions. Second operand 9 states. [2019-09-10 07:59:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:32,004 INFO L93 Difference]: Finished difference Result 1082 states and 1480 transitions. [2019-09-10 07:59:32,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:32,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:32,010 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 07:59:32,010 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 07:59:32,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:32,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 07:59:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 07:59:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 726 transitions. [2019-09-10 07:59:32,024 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 726 transitions. Word has length 84 [2019-09-10 07:59:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:32,024 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 726 transitions. [2019-09-10 07:59:32,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 726 transitions. [2019-09-10 07:59:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:32,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:32,026 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] [2019-09-10 07:59:32,026 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash 156330058, now seen corresponding path program 1 times [2019-09-10 07:59:32,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:32,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:32,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:32,274 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:59:32,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:32,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:32,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:32,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:32,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:32,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:32,275 INFO L87 Difference]: Start difference. First operand 547 states and 726 transitions. Second operand 9 states. [2019-09-10 07:59:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:34,195 INFO L93 Difference]: Finished difference Result 1106 states and 1518 transitions. [2019-09-10 07:59:34,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:34,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:34,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:34,201 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 07:59:34,201 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 07:59:34,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 07:59:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 07:59:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 725 transitions. [2019-09-10 07:59:34,214 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 725 transitions. Word has length 84 [2019-09-10 07:59:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:34,214 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 725 transitions. [2019-09-10 07:59:34,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 725 transitions. [2019-09-10 07:59:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:34,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:34,216 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] [2019-09-10 07:59:34,217 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash -808913805, now seen corresponding path program 1 times [2019-09-10 07:59:34,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:34,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:34,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:34,401 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:59:34,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:34,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:34,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:34,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:34,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:34,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:34,402 INFO L87 Difference]: Start difference. First operand 547 states and 725 transitions. Second operand 9 states. [2019-09-10 07:59:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:36,136 INFO L93 Difference]: Finished difference Result 1082 states and 1478 transitions. [2019-09-10 07:59:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:36,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:36,142 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 07:59:36,142 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 07:59:36,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 07:59:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 07:59:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 724 transitions. [2019-09-10 07:59:36,155 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 724 transitions. Word has length 84 [2019-09-10 07:59:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:36,155 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 724 transitions. [2019-09-10 07:59:36,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 724 transitions. [2019-09-10 07:59:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:36,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:36,157 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] [2019-09-10 07:59:36,158 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:36,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1360926238, now seen corresponding path program 1 times [2019-09-10 07:59:36,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:36,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:36,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:36,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:36,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:36,313 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:59:36,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:36,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:36,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:36,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:36,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:36,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:36,315 INFO L87 Difference]: Start difference. First operand 547 states and 724 transitions. Second operand 9 states. [2019-09-10 07:59:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:38,121 INFO L93 Difference]: Finished difference Result 1082 states and 1476 transitions. [2019-09-10 07:59:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:38,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:38,127 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 07:59:38,127 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 07:59:38,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 07:59:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 07:59:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 723 transitions. [2019-09-10 07:59:38,139 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 723 transitions. Word has length 84 [2019-09-10 07:59:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:38,140 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 723 transitions. [2019-09-10 07:59:38,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 723 transitions. [2019-09-10 07:59:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:38,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:38,141 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] [2019-09-10 07:59:38,142 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:38,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:38,142 INFO L82 PathProgramCache]: Analyzing trace with hash -948259243, now seen corresponding path program 1 times [2019-09-10 07:59:38,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:38,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:38,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:38,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:38,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:38,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:38,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:38,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:38,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:38,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:38,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:38,290 INFO L87 Difference]: Start difference. First operand 547 states and 723 transitions. Second operand 9 states. [2019-09-10 07:59:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:39,997 INFO L93 Difference]: Finished difference Result 1082 states and 1474 transitions. [2019-09-10 07:59:39,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:39,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:40,003 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 07:59:40,003 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 07:59:40,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 07:59:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 07:59:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 722 transitions. [2019-09-10 07:59:40,014 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 722 transitions. Word has length 84 [2019-09-10 07:59:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:40,014 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 722 transitions. [2019-09-10 07:59:40,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 722 transitions. [2019-09-10 07:59:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:40,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:40,016 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] [2019-09-10 07:59:40,016 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:40,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:40,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1254134787, now seen corresponding path program 1 times [2019-09-10 07:59:40,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:40,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:40,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:40,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:40,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:40,164 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:59:40,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:40,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:40,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:40,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:40,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:40,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:40,166 INFO L87 Difference]: Start difference. First operand 547 states and 722 transitions. Second operand 9 states. [2019-09-10 07:59:41,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:41,776 INFO L93 Difference]: Finished difference Result 1082 states and 1473 transitions. [2019-09-10 07:59:41,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:41,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:41,782 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 07:59:41,783 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 07:59:41,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 07:59:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 07:59:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 721 transitions. [2019-09-10 07:59:41,796 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 721 transitions. Word has length 84 [2019-09-10 07:59:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:41,797 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 721 transitions. [2019-09-10 07:59:41,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 721 transitions. [2019-09-10 07:59:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:41,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:41,799 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] [2019-09-10 07:59:41,799 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:41,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:41,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1128458993, now seen corresponding path program 1 times [2019-09-10 07:59:41,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:41,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:41,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:41,980 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:59:41,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:41,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:41,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:41,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:41,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:41,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:41,982 INFO L87 Difference]: Start difference. First operand 547 states and 721 transitions. Second operand 9 states. [2019-09-10 07:59:43,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:43,600 INFO L93 Difference]: Finished difference Result 1082 states and 1472 transitions. [2019-09-10 07:59:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:43,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:43,607 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 07:59:43,607 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 07:59:43,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 07:59:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 07:59:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 720 transitions. [2019-09-10 07:59:43,618 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 720 transitions. Word has length 84 [2019-09-10 07:59:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:43,618 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 720 transitions. [2019-09-10 07:59:43,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 720 transitions. [2019-09-10 07:59:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:43,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:43,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:59:43,620 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:43,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:43,621 INFO L82 PathProgramCache]: Analyzing trace with hash -145040535, now seen corresponding path program 1 times [2019-09-10 07:59:43,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:43,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:43,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:43,765 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:59:43,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:43,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:43,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:43,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:43,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:43,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:43,767 INFO L87 Difference]: Start difference. First operand 547 states and 720 transitions. Second operand 9 states. [2019-09-10 07:59:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:45,444 INFO L93 Difference]: Finished difference Result 1082 states and 1470 transitions. [2019-09-10 07:59:45,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:45,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:45,450 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 07:59:45,450 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 07:59:45,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 07:59:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 07:59:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 719 transitions. [2019-09-10 07:59:45,460 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 719 transitions. Word has length 84 [2019-09-10 07:59:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:45,461 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 719 transitions. [2019-09-10 07:59:45,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 719 transitions. [2019-09-10 07:59:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:45,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:45,463 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] [2019-09-10 07:59:45,463 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:45,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1972694375, now seen corresponding path program 1 times [2019-09-10 07:59:45,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:45,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:45,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:45,607 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:59:45,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:45,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:45,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:45,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:45,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:45,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:45,612 INFO L87 Difference]: Start difference. First operand 547 states and 719 transitions. Second operand 9 states. [2019-09-10 07:59:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:47,194 INFO L93 Difference]: Finished difference Result 1082 states and 1468 transitions. [2019-09-10 07:59:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:47,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:47,200 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 07:59:47,200 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 07:59:47,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 07:59:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 07:59:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 717 transitions. [2019-09-10 07:59:47,210 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 717 transitions. Word has length 84 [2019-09-10 07:59:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:47,211 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 717 transitions. [2019-09-10 07:59:47,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 717 transitions. [2019-09-10 07:59:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:47,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:47,213 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] [2019-09-10 07:59:47,213 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1587646214, now seen corresponding path program 1 times [2019-09-10 07:59:47,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:47,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:47,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:47,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:47,357 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:59:47,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:47,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:47,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:47,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:47,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:47,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:47,359 INFO L87 Difference]: Start difference. First operand 547 states and 717 transitions. Second operand 9 states. [2019-09-10 07:59:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:49,032 INFO L93 Difference]: Finished difference Result 1106 states and 1502 transitions. [2019-09-10 07:59:49,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:49,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:49,037 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 07:59:49,037 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 07:59:49,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 07:59:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 07:59:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 715 transitions. [2019-09-10 07:59:49,046 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 715 transitions. Word has length 84 [2019-09-10 07:59:49,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:49,047 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 715 transitions. [2019-09-10 07:59:49,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 715 transitions. [2019-09-10 07:59:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:49,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:49,048 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] [2019-09-10 07:59:49,049 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:49,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1234023999, now seen corresponding path program 1 times [2019-09-10 07:59:49,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:49,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:49,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:49,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:49,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:49,181 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:59:49,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:49,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:49,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:49,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:49,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:49,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:49,183 INFO L87 Difference]: Start difference. First operand 547 states and 715 transitions. Second operand 9 states. [2019-09-10 07:59:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:50,812 INFO L93 Difference]: Finished difference Result 1082 states and 1464 transitions. [2019-09-10 07:59:50,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:50,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:50,819 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 07:59:50,819 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 07:59:50,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 07:59:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 07:59:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 713 transitions. [2019-09-10 07:59:50,831 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 713 transitions. Word has length 84 [2019-09-10 07:59:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:50,831 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 713 transitions. [2019-09-10 07:59:50,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 713 transitions. [2019-09-10 07:59:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:50,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:50,833 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:59:50,833 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:50,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1787094233, now seen corresponding path program 1 times [2019-09-10 07:59:50,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:50,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:50,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:51,007 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:59:51,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:51,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:51,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:51,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:51,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:51,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:51,009 INFO L87 Difference]: Start difference. First operand 547 states and 713 transitions. Second operand 9 states. [2019-09-10 07:59:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:52,760 INFO L93 Difference]: Finished difference Result 1082 states and 1460 transitions. [2019-09-10 07:59:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:52,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:52,765 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 07:59:52,766 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 07:59:52,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 07:59:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 07:59:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 711 transitions. [2019-09-10 07:59:52,776 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 711 transitions. Word has length 84 [2019-09-10 07:59:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:52,776 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 711 transitions. [2019-09-10 07:59:52,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 711 transitions. [2019-09-10 07:59:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:52,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:52,778 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] [2019-09-10 07:59:52,778 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:52,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:52,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1753371594, now seen corresponding path program 1 times [2019-09-10 07:59:52,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:52,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:52,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:52,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:52,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:52,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:52,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:52,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:52,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:52,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:52,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:52,923 INFO L87 Difference]: Start difference. First operand 547 states and 711 transitions. Second operand 9 states. [2019-09-10 07:59:54,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:54,394 INFO L93 Difference]: Finished difference Result 1106 states and 1496 transitions. [2019-09-10 07:59:54,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:54,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:54,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:54,398 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 07:59:54,398 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 07:59:54,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 07:59:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 07:59:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 709 transitions. [2019-09-10 07:59:54,409 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 709 transitions. Word has length 84 [2019-09-10 07:59:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:54,409 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 709 transitions. [2019-09-10 07:59:54,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 709 transitions. [2019-09-10 07:59:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:54,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:54,411 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] [2019-09-10 07:59:54,411 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:54,411 INFO L82 PathProgramCache]: Analyzing trace with hash -175784918, now seen corresponding path program 1 times [2019-09-10 07:59:54,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:54,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:54,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:54,545 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:59:54,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:54,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:54,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:54,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:54,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:54,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:54,546 INFO L87 Difference]: Start difference. First operand 547 states and 709 transitions. Second operand 9 states. [2019-09-10 07:59:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:56,165 INFO L93 Difference]: Finished difference Result 1082 states and 1456 transitions. [2019-09-10 07:59:56,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:56,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:56,168 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 07:59:56,169 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 07:59:56,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 07:59:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 07:59:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 707 transitions. [2019-09-10 07:59:56,180 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 707 transitions. Word has length 84 [2019-09-10 07:59:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:56,180 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 707 transitions. [2019-09-10 07:59:56,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 707 transitions. [2019-09-10 07:59:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:59:56,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:56,182 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] [2019-09-10 07:59:56,182 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:56,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1958628796, now seen corresponding path program 1 times [2019-09-10 07:59:56,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:56,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:56,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:56,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:56,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:56,323 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:59:56,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:56,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:59:56,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:56,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:59:56,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:59:56,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:56,325 INFO L87 Difference]: Start difference. First operand 547 states and 707 transitions. Second operand 9 states. [2019-09-10 07:59:58,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:58,113 INFO L93 Difference]: Finished difference Result 1130 states and 1530 transitions. [2019-09-10 07:59:58,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:58,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:59:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:58,121 INFO L225 Difference]: With dead ends: 1130 [2019-09-10 07:59:58,121 INFO L226 Difference]: Without dead ends: 1130 [2019-09-10 07:59:58,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:59:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-10 07:59:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-10 07:59:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 07:59:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 705 transitions. [2019-09-10 07:59:58,129 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 705 transitions. Word has length 84 [2019-09-10 07:59:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:58,129 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 705 transitions. [2019-09-10 07:59:58,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:59:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 705 transitions. [2019-09-10 07:59:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:59:58,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:58,131 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:59:58,132 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:58,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:58,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1126502043, now seen corresponding path program 1 times [2019-09-10 07:59:58,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:58,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:58,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:58,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:58,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:00,049 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 08:00:00,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:00,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:00:00,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:00,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:00:00,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:00:00,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:00:00,051 INFO L87 Difference]: Start difference. First operand 547 states and 705 transitions. Second operand 25 states. [2019-09-10 08:00:00,224 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-09-10 08:00:01,234 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-10 08:00:01,550 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-09-10 08:00:01,842 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 62 [2019-09-10 08:00:02,285 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 74 [2019-09-10 08:00:02,529 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 08:00:02,779 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 08:00:03,007 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-10 08:00:03,229 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-09-10 08:00:03,460 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-09-10 08:00:03,740 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:00:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:07,775 INFO L93 Difference]: Finished difference Result 859 states and 1133 transitions. [2019-09-10 08:00:07,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:00:07,775 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2019-09-10 08:00:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:07,777 INFO L225 Difference]: With dead ends: 859 [2019-09-10 08:00:07,777 INFO L226 Difference]: Without dead ends: 859 [2019-09-10 08:00:07,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:00:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-09-10 08:00:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 558. [2019-09-10 08:00:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-10 08:00:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 717 transitions. [2019-09-10 08:00:07,786 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 717 transitions. Word has length 86 [2019-09-10 08:00:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:07,786 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 717 transitions. [2019-09-10 08:00:07,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:00:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 717 transitions. [2019-09-10 08:00:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:00:07,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:07,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:00:07,791 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:07,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash 863263109, now seen corresponding path program 1 times [2019-09-10 08:00:07,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:07,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:07,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:07,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:07,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:08,765 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 08:00:08,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:08,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:00:08,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:08,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:00:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:00:08,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:00:08,767 INFO L87 Difference]: Start difference. First operand 558 states and 717 transitions. Second operand 15 states. [2019-09-10 08:00:09,292 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-10 08:00:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:10,525 INFO L93 Difference]: Finished difference Result 712 states and 949 transitions. [2019-09-10 08:00:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:00:10,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-09-10 08:00:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:10,528 INFO L225 Difference]: With dead ends: 712 [2019-09-10 08:00:10,529 INFO L226 Difference]: Without dead ends: 712 [2019-09-10 08:00:10,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:00:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-10 08:00:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 499. [2019-09-10 08:00:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-10 08:00:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 642 transitions. [2019-09-10 08:00:10,536 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 642 transitions. Word has length 86 [2019-09-10 08:00:10,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:10,537 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 642 transitions. [2019-09-10 08:00:10,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:00:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 642 transitions. [2019-09-10 08:00:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:00:10,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:10,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:00:10,539 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:10,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash 679846051, now seen corresponding path program 1 times [2019-09-10 08:00:10,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:10,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:10,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:11,356 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 08:00:11,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:11,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:00:11,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:11,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:00:11,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:00:11,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:00:11,357 INFO L87 Difference]: Start difference. First operand 499 states and 642 transitions. Second operand 16 states. [2019-09-10 08:00:12,023 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:00:12,161 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:00:12,291 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:00:12,423 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 08:00:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:14,031 INFO L93 Difference]: Finished difference Result 833 states and 1058 transitions. [2019-09-10 08:00:14,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:00:14,032 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-10 08:00:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:14,034 INFO L225 Difference]: With dead ends: 833 [2019-09-10 08:00:14,034 INFO L226 Difference]: Without dead ends: 833 [2019-09-10 08:00:14,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:00:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-09-10 08:00:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 505. [2019-09-10 08:00:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 08:00:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 650 transitions. [2019-09-10 08:00:14,045 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 650 transitions. Word has length 86 [2019-09-10 08:00:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:14,045 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 650 transitions. [2019-09-10 08:00:14,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:00:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 650 transitions. [2019-09-10 08:00:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:00:14,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:14,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:00:14,047 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:14,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2034960557, now seen corresponding path program 1 times [2019-09-10 08:00:14,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:14,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:14,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:14,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:14,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:14,871 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 08:00:14,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:14,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:00:14,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:14,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:00:14,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:00:14,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:00:14,872 INFO L87 Difference]: Start difference. First operand 505 states and 650 transitions. Second operand 17 states. [2019-09-10 08:00:15,487 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:00:15,648 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:00:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:16,442 INFO L93 Difference]: Finished difference Result 659 states and 884 transitions. [2019-09-10 08:00:16,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:00:16,443 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-10 08:00:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:16,444 INFO L225 Difference]: With dead ends: 659 [2019-09-10 08:00:16,445 INFO L226 Difference]: Without dead ends: 659 [2019-09-10 08:00:16,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:00:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-09-10 08:00:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 463. [2019-09-10 08:00:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-10 08:00:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 593 transitions. [2019-09-10 08:00:16,449 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 593 transitions. Word has length 86 [2019-09-10 08:00:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:16,450 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 593 transitions. [2019-09-10 08:00:16,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:00:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 593 transitions. [2019-09-10 08:00:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:00:16,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:16,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:00:16,451 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:16,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:16,451 INFO L82 PathProgramCache]: Analyzing trace with hash 327077445, now seen corresponding path program 1 times [2019-09-10 08:00:16,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:16,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:16,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:16,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:16,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:17,398 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 08:00:17,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:17,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:00:17,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:17,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:00:17,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:00:17,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:00:17,399 INFO L87 Difference]: Start difference. First operand 463 states and 593 transitions. Second operand 17 states. [2019-09-10 08:00:18,079 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:00:18,254 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:00:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:19,955 INFO L93 Difference]: Finished difference Result 974 states and 1320 transitions. [2019-09-10 08:00:19,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:00:19,956 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-10 08:00:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:19,959 INFO L225 Difference]: With dead ends: 974 [2019-09-10 08:00:19,959 INFO L226 Difference]: Without dead ends: 974 [2019-09-10 08:00:19,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:00:19,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-10 08:00:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 443. [2019-09-10 08:00:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-09-10 08:00:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 564 transitions. [2019-09-10 08:00:19,967 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 564 transitions. Word has length 86 [2019-09-10 08:00:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:19,968 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 564 transitions. [2019-09-10 08:00:19,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:00:19,968 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 564 transitions. [2019-09-10 08:00:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:00:19,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:19,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:00:19,969 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:19,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:19,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1178808939, now seen corresponding path program 1 times [2019-09-10 08:00:19,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:19,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:19,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:20,861 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 08:00:21,953 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 08:00:21,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:21,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:00:21,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:21,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:00:21,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:00:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:00:21,955 INFO L87 Difference]: Start difference. First operand 443 states and 564 transitions. Second operand 26 states. [2019-09-10 08:00:22,128 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:00:22,786 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 08:00:22,939 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:00:23,260 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 08:00:23,516 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 08:00:23,825 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 08:00:24,234 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-10 08:00:24,487 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:00:24,730 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:00:24,990 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:00:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:27,787 INFO L93 Difference]: Finished difference Result 598 states and 762 transitions. [2019-09-10 08:00:27,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:00:27,787 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 86 [2019-09-10 08:00:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:27,789 INFO L225 Difference]: With dead ends: 598 [2019-09-10 08:00:27,790 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 08:00:27,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:00:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 08:00:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 458. [2019-09-10 08:00:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-09-10 08:00:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 585 transitions. [2019-09-10 08:00:27,797 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 585 transitions. Word has length 86 [2019-09-10 08:00:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:27,797 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 585 transitions. [2019-09-10 08:00:27,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:00:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 585 transitions. [2019-09-10 08:00:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:00:27,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:27,798 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] [2019-09-10 08:00:27,798 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:27,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1246040559, now seen corresponding path program 1 times [2019-09-10 08:00:27,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:27,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:27,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:27,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:27,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:28,280 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 08:00:28,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:28,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:00:28,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:28,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:00:28,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:00:28,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:00:28,283 INFO L87 Difference]: Start difference. First operand 458 states and 585 transitions. Second operand 12 states. [2019-09-10 08:00:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:29,558 INFO L93 Difference]: Finished difference Result 679 states and 878 transitions. [2019-09-10 08:00:29,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:00:29,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-10 08:00:29,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:29,560 INFO L225 Difference]: With dead ends: 679 [2019-09-10 08:00:29,560 INFO L226 Difference]: Without dead ends: 679 [2019-09-10 08:00:29,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:00:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-09-10 08:00:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 454. [2019-09-10 08:00:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-09-10 08:00:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 580 transitions. [2019-09-10 08:00:29,568 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 580 transitions. Word has length 87 [2019-09-10 08:00:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:29,568 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 580 transitions. [2019-09-10 08:00:29,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:00:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 580 transitions. [2019-09-10 08:00:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:00:29,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:29,569 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] [2019-09-10 08:00:29,570 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1482173800, now seen corresponding path program 1 times [2019-09-10 08:00:29,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:29,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:29,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:30,366 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 08:00:30,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:30,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:00:30,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:30,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:00:30,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:00:30,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:00:30,368 INFO L87 Difference]: Start difference. First operand 454 states and 580 transitions. Second operand 17 states. [2019-09-10 08:00:31,025 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:00:31,185 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:00:33,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:33,110 INFO L93 Difference]: Finished difference Result 967 states and 1308 transitions. [2019-09-10 08:00:33,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:00:33,111 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-10 08:00:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:33,114 INFO L225 Difference]: With dead ends: 967 [2019-09-10 08:00:33,114 INFO L226 Difference]: Without dead ends: 967 [2019-09-10 08:00:33,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:00:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-09-10 08:00:33,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 453. [2019-09-10 08:00:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-09-10 08:00:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 577 transitions. [2019-09-10 08:00:33,123 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 577 transitions. Word has length 87 [2019-09-10 08:00:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:33,123 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 577 transitions. [2019-09-10 08:00:33,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:00:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 577 transitions. [2019-09-10 08:00:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:00:33,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:33,124 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] [2019-09-10 08:00:33,125 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:33,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1059161585, now seen corresponding path program 1 times [2019-09-10 08:00:33,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:33,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:33,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:33,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:33,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:33,498 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 08:00:33,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:33,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:00:33,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:33,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:00:33,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:00:33,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:00:33,499 INFO L87 Difference]: Start difference. First operand 453 states and 577 transitions. Second operand 11 states. [2019-09-10 08:00:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:34,241 INFO L93 Difference]: Finished difference Result 1196 states and 1662 transitions. [2019-09-10 08:00:34,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:00:34,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-10 08:00:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:34,245 INFO L225 Difference]: With dead ends: 1196 [2019-09-10 08:00:34,245 INFO L226 Difference]: Without dead ends: 1196 [2019-09-10 08:00:34,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:00:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-09-10 08:00:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 429. [2019-09-10 08:00:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-09-10 08:00:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 546 transitions. [2019-09-10 08:00:34,255 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 546 transitions. Word has length 87 [2019-09-10 08:00:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:34,255 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 546 transitions. [2019-09-10 08:00:34,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:00:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 546 transitions. [2019-09-10 08:00:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:00:34,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:34,256 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] [2019-09-10 08:00:34,257 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1860216222, now seen corresponding path program 1 times [2019-09-10 08:00:34,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:34,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:34,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:34,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:34,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:00:34,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:34,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:00:34,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:34,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:00:34,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:00:34,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:00:34,780 INFO L87 Difference]: Start difference. First operand 429 states and 546 transitions. Second operand 12 states. [2019-09-10 08:00:35,280 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 08:00:35,438 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 08:00:35,665 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-10 08:00:35,892 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-09-10 08:00:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:36,314 INFO L93 Difference]: Finished difference Result 1171 states and 1619 transitions. [2019-09-10 08:00:36,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:00:36,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-10 08:00:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:36,317 INFO L225 Difference]: With dead ends: 1171 [2019-09-10 08:00:36,317 INFO L226 Difference]: Without dead ends: 1171 [2019-09-10 08:00:36,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:00:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-09-10 08:00:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 392. [2019-09-10 08:00:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-10 08:00:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 495 transitions. [2019-09-10 08:00:36,326 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 495 transitions. Word has length 87 [2019-09-10 08:00:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:36,326 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 495 transitions. [2019-09-10 08:00:36,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:00:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 495 transitions. [2019-09-10 08:00:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:00:36,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:36,327 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] [2019-09-10 08:00:36,328 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:36,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:36,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1944199773, now seen corresponding path program 1 times [2019-09-10 08:00:36,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:36,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:36,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:36,932 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 08:00:36,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:36,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:00:36,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:36,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:00:36,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:00:36,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:00:36,933 INFO L87 Difference]: Start difference. First operand 392 states and 495 transitions. Second operand 13 states. [2019-09-10 08:00:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:38,242 INFO L93 Difference]: Finished difference Result 944 states and 1261 transitions. [2019-09-10 08:00:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:00:38,242 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-09-10 08:00:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:38,244 INFO L225 Difference]: With dead ends: 944 [2019-09-10 08:00:38,244 INFO L226 Difference]: Without dead ends: 944 [2019-09-10 08:00:38,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:00:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-09-10 08:00:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 376. [2019-09-10 08:00:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-10 08:00:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 474 transitions. [2019-09-10 08:00:38,251 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 474 transitions. Word has length 87 [2019-09-10 08:00:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:38,252 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 474 transitions. [2019-09-10 08:00:38,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:00:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 474 transitions. [2019-09-10 08:00:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:00:38,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:38,253 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] [2019-09-10 08:00:38,253 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1585662154, now seen corresponding path program 1 times [2019-09-10 08:00:38,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:38,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:38,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:00:38,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:38,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:00:38,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:38,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:00:38,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:00:38,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:00:38,644 INFO L87 Difference]: Start difference. First operand 376 states and 474 transitions. Second operand 11 states. [2019-09-10 08:00:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:39,804 INFO L93 Difference]: Finished difference Result 1398 states and 1968 transitions. [2019-09-10 08:00:39,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:00:39,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-10 08:00:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:39,807 INFO L225 Difference]: With dead ends: 1398 [2019-09-10 08:00:39,807 INFO L226 Difference]: Without dead ends: 1398 [2019-09-10 08:00:39,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:00:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2019-09-10 08:00:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 342. [2019-09-10 08:00:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-10 08:00:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 432 transitions. [2019-09-10 08:00:39,814 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 432 transitions. Word has length 87 [2019-09-10 08:00:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:39,815 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 432 transitions. [2019-09-10 08:00:39,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:00:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 432 transitions. [2019-09-10 08:00:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:00:39,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:39,815 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] [2019-09-10 08:00:39,816 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1736542280, now seen corresponding path program 1 times [2019-09-10 08:00:39,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:39,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:39,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:39,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:39,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:39,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 08:00:39,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:39,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:00:39,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:39,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:00:39,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:00:39,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:00:39,940 INFO L87 Difference]: Start difference. First operand 342 states and 432 transitions. Second operand 9 states. [2019-09-10 08:00:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:41,270 INFO L93 Difference]: Finished difference Result 802 states and 1092 transitions. [2019-09-10 08:00:41,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:00:41,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:00:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:41,271 INFO L225 Difference]: With dead ends: 802 [2019-09-10 08:00:41,271 INFO L226 Difference]: Without dead ends: 802 [2019-09-10 08:00:41,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:00:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-10 08:00:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 342. [2019-09-10 08:00:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-10 08:00:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 430 transitions. [2019-09-10 08:00:41,277 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 430 transitions. Word has length 87 [2019-09-10 08:00:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:41,278 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 430 transitions. [2019-09-10 08:00:41,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:00:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 430 transitions. [2019-09-10 08:00:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:00:41,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:41,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,279 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1081579309, now seen corresponding path program 1 times [2019-09-10 08:00:41,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:41,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:41,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:00:41,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:41,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:00:41,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:41,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:00:41,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:00:41,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:00:41,414 INFO L87 Difference]: Start difference. First operand 342 states and 430 transitions. Second operand 9 states. [2019-09-10 08:00:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:42,240 INFO L93 Difference]: Finished difference Result 542 states and 701 transitions. [2019-09-10 08:00:42,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:00:42,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 08:00:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:42,242 INFO L225 Difference]: With dead ends: 542 [2019-09-10 08:00:42,242 INFO L226 Difference]: Without dead ends: 542 [2019-09-10 08:00:42,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:00:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-09-10 08:00:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 342. [2019-09-10 08:00:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-10 08:00:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 429 transitions. [2019-09-10 08:00:42,247 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 429 transitions. Word has length 88 [2019-09-10 08:00:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:42,247 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 429 transitions. [2019-09-10 08:00:42,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:00:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 429 transitions. [2019-09-10 08:00:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:00:42,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:42,248 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] [2019-09-10 08:00:42,248 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:42,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1026055433, now seen corresponding path program 1 times [2019-09-10 08:00:42,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:42,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:42,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:42,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:42,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:42,636 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 08:00:42,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:42,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:00:42,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:42,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:00:42,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:00:42,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:00:42,639 INFO L87 Difference]: Start difference. First operand 342 states and 429 transitions. Second operand 9 states. [2019-09-10 08:00:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:43,108 INFO L93 Difference]: Finished difference Result 724 states and 995 transitions. [2019-09-10 08:00:43,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:00:43,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 08:00:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:43,111 INFO L225 Difference]: With dead ends: 724 [2019-09-10 08:00:43,111 INFO L226 Difference]: Without dead ends: 724 [2019-09-10 08:00:43,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:00:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-10 08:00:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 302. [2019-09-10 08:00:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-10 08:00:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 385 transitions. [2019-09-10 08:00:43,117 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 385 transitions. Word has length 88 [2019-09-10 08:00:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:43,117 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 385 transitions. [2019-09-10 08:00:43,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:00:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 385 transitions. [2019-09-10 08:00:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:00:43,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:43,118 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] [2019-09-10 08:00:43,118 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:43,119 INFO L82 PathProgramCache]: Analyzing trace with hash 309584746, now seen corresponding path program 1 times [2019-09-10 08:00:43,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:43,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:43,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:43,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:43,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:44,022 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 08:00:44,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:44,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:00:44,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:44,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:00:44,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:00:44,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:00:44,023 INFO L87 Difference]: Start difference. First operand 302 states and 385 transitions. Second operand 16 states. [2019-09-10 08:00:44,757 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-09-10 08:00:44,895 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-10 08:00:45,026 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-10 08:00:45,191 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:00:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:46,024 INFO L93 Difference]: Finished difference Result 1002 states and 1407 transitions. [2019-09-10 08:00:46,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:00:46,024 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-10 08:00:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:46,025 INFO L225 Difference]: With dead ends: 1002 [2019-09-10 08:00:46,025 INFO L226 Difference]: Without dead ends: 1002 [2019-09-10 08:00:46,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:00:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-09-10 08:00:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 282. [2019-09-10 08:00:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-10 08:00:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 361 transitions. [2019-09-10 08:00:46,031 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 361 transitions. Word has length 88 [2019-09-10 08:00:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:46,031 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 361 transitions. [2019-09-10 08:00:46,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:00:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 361 transitions. [2019-09-10 08:00:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:00:46,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:46,032 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] [2019-09-10 08:00:46,032 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash -859860802, now seen corresponding path program 1 times [2019-09-10 08:00:46,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:46,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:46,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:46,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:46,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:46,168 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 08:00:46,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:46,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:00:46,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:46,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:00:46,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:00:46,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:00:46,170 INFO L87 Difference]: Start difference. First operand 282 states and 361 transitions. Second operand 9 states. [2019-09-10 08:00:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:46,977 INFO L93 Difference]: Finished difference Result 458 states and 605 transitions. [2019-09-10 08:00:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:00:46,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 08:00:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:46,978 INFO L225 Difference]: With dead ends: 458 [2019-09-10 08:00:46,978 INFO L226 Difference]: Without dead ends: 458 [2019-09-10 08:00:46,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:00:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-10 08:00:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 282. [2019-09-10 08:00:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-10 08:00:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 360 transitions. [2019-09-10 08:00:46,982 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 360 transitions. Word has length 88 [2019-09-10 08:00:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:46,983 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 360 transitions. [2019-09-10 08:00:46,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:00:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 360 transitions. [2019-09-10 08:00:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:00:46,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:46,983 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] [2019-09-10 08:00:46,983 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:46,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1443233902, now seen corresponding path program 1 times [2019-09-10 08:00:46,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:46,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:46,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:46,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:46,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:47,693 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 08:00:47,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:47,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:00:47,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:47,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:00:47,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:00:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:00:47,694 INFO L87 Difference]: Start difference. First operand 282 states and 360 transitions. Second operand 16 states. [2019-09-10 08:00:48,340 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:00:48,476 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:00:48,603 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:00:48,737 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-10 08:00:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:49,878 INFO L93 Difference]: Finished difference Result 983 states and 1384 transitions. [2019-09-10 08:00:49,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:00:49,879 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-09-10 08:00:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:49,880 INFO L225 Difference]: With dead ends: 983 [2019-09-10 08:00:49,880 INFO L226 Difference]: Without dead ends: 983 [2019-09-10 08:00:49,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:00:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-09-10 08:00:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 282. [2019-09-10 08:00:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-10 08:00:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 359 transitions. [2019-09-10 08:00:49,886 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 359 transitions. Word has length 89 [2019-09-10 08:00:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:49,886 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 359 transitions. [2019-09-10 08:00:49,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:00:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 359 transitions. [2019-09-10 08:00:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:00:49,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:49,887 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] [2019-09-10 08:00:49,887 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:49,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash -868794427, now seen corresponding path program 1 times [2019-09-10 08:00:49,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:49,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:49,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:49,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:49,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:50,295 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 08:00:50,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:50,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:00:50,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:50,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:00:50,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:00:50,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:00:50,297 INFO L87 Difference]: Start difference. First operand 282 states and 359 transitions. Second operand 11 states. [2019-09-10 08:00:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:51,422 INFO L93 Difference]: Finished difference Result 994 states and 1394 transitions. [2019-09-10 08:00:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:00:51,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-09-10 08:00:51,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:51,424 INFO L225 Difference]: With dead ends: 994 [2019-09-10 08:00:51,424 INFO L226 Difference]: Without dead ends: 994 [2019-09-10 08:00:51,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:00:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-09-10 08:00:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 276. [2019-09-10 08:00:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-10 08:00:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 353 transitions. [2019-09-10 08:00:51,431 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 353 transitions. Word has length 90 [2019-09-10 08:00:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:51,432 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 353 transitions. [2019-09-10 08:00:51,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:00:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 353 transitions. [2019-09-10 08:00:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:00:51,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:51,433 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] [2019-09-10 08:00:51,433 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1820672010, now seen corresponding path program 1 times [2019-09-10 08:00:51,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:51,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:51,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:51,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:52,110 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-09-10 08:00:52,262 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-10 08:00:52,433 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 08:00:52,622 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 08:00:52,816 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 08:00:53,004 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 08:00:53,166 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:00:54,142 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 08:00:54,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:54,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 08:00:54,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:54,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 08:00:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 08:00:54,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:00:54,144 INFO L87 Difference]: Start difference. First operand 276 states and 353 transitions. Second operand 28 states. [2019-09-10 08:00:54,330 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:00:55,399 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:00:55,834 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:00:56,181 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 08:00:56,592 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 08:00:57,087 WARN L188 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2019-09-10 08:00:57,349 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 08:00:57,606 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 08:00:57,832 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 08:00:58,424 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:01:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:00,486 INFO L93 Difference]: Finished difference Result 466 states and 614 transitions. [2019-09-10 08:01:00,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 08:01:00,487 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 90 [2019-09-10 08:01:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:00,487 INFO L225 Difference]: With dead ends: 466 [2019-09-10 08:01:00,488 INFO L226 Difference]: Without dead ends: 466 [2019-09-10 08:01:00,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=470, Invalid=2392, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 08:01:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-10 08:01:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 281. [2019-09-10 08:01:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-10 08:01:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 358 transitions. [2019-09-10 08:01:00,494 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 358 transitions. Word has length 90 [2019-09-10 08:01:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:00,494 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 358 transitions. [2019-09-10 08:01:00,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 08:01:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 358 transitions. [2019-09-10 08:01:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:01:00,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:00,495 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] [2019-09-10 08:01:00,495 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:00,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:00,496 INFO L82 PathProgramCache]: Analyzing trace with hash -223927789, now seen corresponding path program 1 times [2019-09-10 08:01:00,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:00,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:00,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:00,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:00,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:01,487 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 08:01:01,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:01,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:01:01,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:01,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:01:01,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:01:01,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:01:01,488 INFO L87 Difference]: Start difference. First operand 281 states and 358 transitions. Second operand 16 states. [2019-09-10 08:01:02,335 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2019-09-10 08:01:02,595 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2019-09-10 08:01:02,740 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 08:01:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:03,543 INFO L93 Difference]: Finished difference Result 693 states and 970 transitions. [2019-09-10 08:01:03,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:01:03,544 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2019-09-10 08:01:03,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:03,545 INFO L225 Difference]: With dead ends: 693 [2019-09-10 08:01:03,546 INFO L226 Difference]: Without dead ends: 693 [2019-09-10 08:01:03,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:01:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-09-10 08:01:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 252. [2019-09-10 08:01:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-10 08:01:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 327 transitions. [2019-09-10 08:01:03,551 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 327 transitions. Word has length 91 [2019-09-10 08:01:03,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:03,552 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 327 transitions. [2019-09-10 08:01:03,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:01:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 327 transitions. [2019-09-10 08:01:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:01:03,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:03,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:03,553 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:03,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:03,554 INFO L82 PathProgramCache]: Analyzing trace with hash -432709058, now seen corresponding path program 1 times [2019-09-10 08:01:03,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:03,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:03,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:03,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:03,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:03,618 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 08:01:03,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:03,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:03,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:03,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:03,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:03,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:03,620 INFO L87 Difference]: Start difference. First operand 252 states and 327 transitions. Second operand 3 states. [2019-09-10 08:01:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:03,651 INFO L93 Difference]: Finished difference Result 370 states and 499 transitions. [2019-09-10 08:01:03,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:03,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 08:01:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:03,652 INFO L225 Difference]: With dead ends: 370 [2019-09-10 08:01:03,652 INFO L226 Difference]: Without dead ends: 370 [2019-09-10 08:01:03,653 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 08:01:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-10 08:01:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 368. [2019-09-10 08:01:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-10 08:01:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 498 transitions. [2019-09-10 08:01:03,657 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 498 transitions. Word has length 116 [2019-09-10 08:01:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:03,658 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 498 transitions. [2019-09-10 08:01:03,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 498 transitions. [2019-09-10 08:01:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:01:03,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:03,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:03,659 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:03,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:03,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2103932360, now seen corresponding path program 1 times [2019-09-10 08:01:03,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:03,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:03,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:03,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:03,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:03,803 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 08:01:03,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:03,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:03,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:03,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:03,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:03,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:03,805 INFO L87 Difference]: Start difference. First operand 368 states and 498 transitions. Second operand 7 states. [2019-09-10 08:01:04,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:04,421 INFO L93 Difference]: Finished difference Result 1358 states and 1949 transitions. [2019-09-10 08:01:04,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:01:04,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-10 08:01:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:04,423 INFO L225 Difference]: With dead ends: 1358 [2019-09-10 08:01:04,423 INFO L226 Difference]: Without dead ends: 1358 [2019-09-10 08:01:04,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:01:04,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-09-10 08:01:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 648. [2019-09-10 08:01:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-10 08:01:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 914 transitions. [2019-09-10 08:01:04,431 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 914 transitions. Word has length 118 [2019-09-10 08:01:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:04,431 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 914 transitions. [2019-09-10 08:01:04,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 914 transitions. [2019-09-10 08:01:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:01:04,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:04,432 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] [2019-09-10 08:01:04,432 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:04,432 INFO L82 PathProgramCache]: Analyzing trace with hash -792007490, now seen corresponding path program 1 times [2019-09-10 08:01:04,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:04,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:04,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:04,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:04,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:04,525 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 08:01:04,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:04,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:04,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:04,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:04,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:04,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:04,526 INFO L87 Difference]: Start difference. First operand 648 states and 914 transitions. Second operand 7 states. [2019-09-10 08:01:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:05,034 INFO L93 Difference]: Finished difference Result 2582 states and 3741 transitions. [2019-09-10 08:01:05,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:01:05,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-10 08:01:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:05,037 INFO L225 Difference]: With dead ends: 2582 [2019-09-10 08:01:05,037 INFO L226 Difference]: Without dead ends: 2582 [2019-09-10 08:01:05,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:01:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2019-09-10 08:01:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 1248. [2019-09-10 08:01:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1248 states. [2019-09-10 08:01:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1802 transitions. [2019-09-10 08:01:05,050 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1802 transitions. Word has length 118 [2019-09-10 08:01:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:05,050 INFO L475 AbstractCegarLoop]: Abstraction has 1248 states and 1802 transitions. [2019-09-10 08:01:05,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1802 transitions. [2019-09-10 08:01:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:01:05,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:05,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:05,052 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:05,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:05,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1202645697, now seen corresponding path program 1 times [2019-09-10 08:01:05,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:05,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:05,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:05,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:05,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:05,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:05,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:05,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:05,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:05,118 INFO L87 Difference]: Start difference. First operand 1248 states and 1802 transitions. Second operand 3 states. [2019-09-10 08:01:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:05,152 INFO L93 Difference]: Finished difference Result 1826 states and 2647 transitions. [2019-09-10 08:01:05,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:05,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 08:01:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:05,154 INFO L225 Difference]: With dead ends: 1826 [2019-09-10 08:01:05,154 INFO L226 Difference]: Without dead ends: 1826 [2019-09-10 08:01:05,155 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 08:01:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2019-09-10 08:01:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1824. [2019-09-10 08:01:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-10 08:01:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2646 transitions. [2019-09-10 08:01:05,170 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2646 transitions. Word has length 118 [2019-09-10 08:01:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:05,170 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2646 transitions. [2019-09-10 08:01:05,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2646 transitions. [2019-09-10 08:01:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:01:05,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:05,171 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] [2019-09-10 08:01:05,171 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash 492458048, now seen corresponding path program 1 times [2019-09-10 08:01:05,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:05,233 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 08:01:05,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:05,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:05,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:05,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:05,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:05,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:05,234 INFO L87 Difference]: Start difference. First operand 1824 states and 2646 transitions. Second operand 3 states. [2019-09-10 08:01:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:05,269 INFO L93 Difference]: Finished difference Result 2682 states and 3857 transitions. [2019-09-10 08:01:05,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:05,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 08:01:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:05,272 INFO L225 Difference]: With dead ends: 2682 [2019-09-10 08:01:05,273 INFO L226 Difference]: Without dead ends: 2682 [2019-09-10 08:01:05,273 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 08:01:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-09-10 08:01:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2656. [2019-09-10 08:01:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2656 states. [2019-09-10 08:01:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 3832 transitions. [2019-09-10 08:01:05,299 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 3832 transitions. Word has length 118 [2019-09-10 08:01:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:05,300 INFO L475 AbstractCegarLoop]: Abstraction has 2656 states and 3832 transitions. [2019-09-10 08:01:05,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 3832 transitions. [2019-09-10 08:01:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:01:05,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:05,302 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] [2019-09-10 08:01:05,302 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:05,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash -208893878, now seen corresponding path program 1 times [2019-09-10 08:01:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:05,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:05,403 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 08:01:05,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:05,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:05,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:05,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:05,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:05,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:05,405 INFO L87 Difference]: Start difference. First operand 2656 states and 3832 transitions. Second operand 7 states. [2019-09-10 08:01:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:05,914 INFO L93 Difference]: Finished difference Result 10462 states and 14989 transitions. [2019-09-10 08:01:05,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:01:05,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-10 08:01:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:05,924 INFO L225 Difference]: With dead ends: 10462 [2019-09-10 08:01:05,924 INFO L226 Difference]: Without dead ends: 10462 [2019-09-10 08:01:05,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:01:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10462 states. [2019-09-10 08:01:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10462 to 5544. [2019-09-10 08:01:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5544 states. [2019-09-10 08:01:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 8030 transitions. [2019-09-10 08:01:05,990 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 8030 transitions. Word has length 118 [2019-09-10 08:01:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:05,990 INFO L475 AbstractCegarLoop]: Abstraction has 5544 states and 8030 transitions. [2019-09-10 08:01:05,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 8030 transitions. [2019-09-10 08:01:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:01:05,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:05,992 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] [2019-09-10 08:01:05,992 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:05,992 INFO L82 PathProgramCache]: Analyzing trace with hash 781686468, now seen corresponding path program 1 times [2019-09-10 08:01:05,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:05,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:05,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:06,140 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 08:01:06,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:06,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:06,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:06,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:06,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:06,142 INFO L87 Difference]: Start difference. First operand 5544 states and 8030 transitions. Second operand 7 states. [2019-09-10 08:01:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:06,699 INFO L93 Difference]: Finished difference Result 18398 states and 26409 transitions. [2019-09-10 08:01:06,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:01:06,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-10 08:01:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:06,715 INFO L225 Difference]: With dead ends: 18398 [2019-09-10 08:01:06,715 INFO L226 Difference]: Without dead ends: 18398 [2019-09-10 08:01:06,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:01:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18398 states. [2019-09-10 08:01:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18398 to 11680. [2019-09-10 08:01:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11680 states. [2019-09-10 08:01:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11680 states to 11680 states and 16930 transitions. [2019-09-10 08:01:06,838 INFO L78 Accepts]: Start accepts. Automaton has 11680 states and 16930 transitions. Word has length 118 [2019-09-10 08:01:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:06,838 INFO L475 AbstractCegarLoop]: Abstraction has 11680 states and 16930 transitions. [2019-09-10 08:01:06,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 11680 states and 16930 transitions. [2019-09-10 08:01:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:01:06,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:06,840 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 08:01:06,841 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1587754861, now seen corresponding path program 1 times [2019-09-10 08:01:06,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:06,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:06,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:06,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:06,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:06,900 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 08:01:06,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:06,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:06,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:06,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:06,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:06,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:06,901 INFO L87 Difference]: Start difference. First operand 11680 states and 16930 transitions. Second operand 3 states. [2019-09-10 08:01:06,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:06,960 INFO L93 Difference]: Finished difference Result 12866 states and 18539 transitions. [2019-09-10 08:01:06,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:06,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-10 08:01:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:06,972 INFO L225 Difference]: With dead ends: 12866 [2019-09-10 08:01:06,972 INFO L226 Difference]: Without dead ends: 12866 [2019-09-10 08:01:06,972 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 08:01:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12866 states. [2019-09-10 08:01:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12866 to 12768. [2019-09-10 08:01:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12768 states. [2019-09-10 08:01:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12768 states to 12768 states and 18426 transitions. [2019-09-10 08:01:07,082 INFO L78 Accepts]: Start accepts. Automaton has 12768 states and 18426 transitions. Word has length 119 [2019-09-10 08:01:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:07,083 INFO L475 AbstractCegarLoop]: Abstraction has 12768 states and 18426 transitions. [2019-09-10 08:01:07,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 12768 states and 18426 transitions. [2019-09-10 08:01:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:01:07,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:07,085 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 08:01:07,085 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:07,086 INFO L82 PathProgramCache]: Analyzing trace with hash 546629509, now seen corresponding path program 1 times [2019-09-10 08:01:07,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:07,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:07,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:07,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:07,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:07,189 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 08:01:07,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:07,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:07,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:07,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:07,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:07,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:07,190 INFO L87 Difference]: Start difference. First operand 12768 states and 18426 transitions. Second operand 7 states. [2019-09-10 08:01:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:07,713 INFO L93 Difference]: Finished difference Result 26854 states and 38285 transitions. [2019-09-10 08:01:07,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:01:07,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-09-10 08:01:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:07,741 INFO L225 Difference]: With dead ends: 26854 [2019-09-10 08:01:07,741 INFO L226 Difference]: Without dead ends: 26854 [2019-09-10 08:01:07,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:01:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26854 states. [2019-09-10 08:01:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26854 to 15008. [2019-09-10 08:01:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15008 states. [2019-09-10 08:01:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15008 states to 15008 states and 21418 transitions. [2019-09-10 08:01:07,911 INFO L78 Accepts]: Start accepts. Automaton has 15008 states and 21418 transitions. Word has length 119 [2019-09-10 08:01:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:07,912 INFO L475 AbstractCegarLoop]: Abstraction has 15008 states and 21418 transitions. [2019-09-10 08:01:07,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 15008 states and 21418 transitions. [2019-09-10 08:01:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:01:07,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:07,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:07,914 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:07,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:07,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1431856554, now seen corresponding path program 1 times [2019-09-10 08:01:07,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:07,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:07,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:07,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:07,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:07,994 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 08:01:07,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:07,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:01:07,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:07,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:01:07,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:01:07,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:01:07,995 INFO L87 Difference]: Start difference. First operand 15008 states and 21418 transitions. Second operand 6 states. [2019-09-10 08:01:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:08,110 INFO L93 Difference]: Finished difference Result 23946 states and 33493 transitions. [2019-09-10 08:01:08,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:01:08,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-10 08:01:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:08,130 INFO L225 Difference]: With dead ends: 23946 [2019-09-10 08:01:08,131 INFO L226 Difference]: Without dead ends: 23946 [2019-09-10 08:01:08,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23946 states. [2019-09-10 08:01:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23946 to 15200. [2019-09-10 08:01:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15200 states. [2019-09-10 08:01:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15200 states to 15200 states and 21546 transitions. [2019-09-10 08:01:08,270 INFO L78 Accepts]: Start accepts. Automaton has 15200 states and 21546 transitions. Word has length 119 [2019-09-10 08:01:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:08,270 INFO L475 AbstractCegarLoop]: Abstraction has 15200 states and 21546 transitions. [2019-09-10 08:01:08,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:01:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 15200 states and 21546 transitions. [2019-09-10 08:01:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:01:08,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:08,273 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] [2019-09-10 08:01:08,273 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:08,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1588867289, now seen corresponding path program 1 times [2019-09-10 08:01:08,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:08,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:08,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:08,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:08,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:08,345 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 08:01:08,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:08,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:08,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:08,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:08,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:08,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:08,347 INFO L87 Difference]: Start difference. First operand 15200 states and 21546 transitions. Second operand 3 states. [2019-09-10 08:01:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:08,456 INFO L93 Difference]: Finished difference Result 14418 states and 20219 transitions. [2019-09-10 08:01:08,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:08,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:01:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:08,472 INFO L225 Difference]: With dead ends: 14418 [2019-09-10 08:01:08,472 INFO L226 Difference]: Without dead ends: 14418 [2019-09-10 08:01:08,473 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 08:01:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14418 states. [2019-09-10 08:01:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14418 to 13680. [2019-09-10 08:01:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13680 states. [2019-09-10 08:01:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13680 states to 13680 states and 19338 transitions. [2019-09-10 08:01:08,600 INFO L78 Accepts]: Start accepts. Automaton has 13680 states and 19338 transitions. Word has length 120 [2019-09-10 08:01:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:08,600 INFO L475 AbstractCegarLoop]: Abstraction has 13680 states and 19338 transitions. [2019-09-10 08:01:08,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 13680 states and 19338 transitions. [2019-09-10 08:01:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:01:08,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:08,606 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:08,606 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash 97136551, now seen corresponding path program 1 times [2019-09-10 08:01:08,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:08,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:08,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:08,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:08,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:08,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:08,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:08,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:08,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:08,674 INFO L87 Difference]: Start difference. First operand 13680 states and 19338 transitions. Second operand 3 states. [2019-09-10 08:01:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:08,721 INFO L93 Difference]: Finished difference Result 12842 states and 17939 transitions. [2019-09-10 08:01:08,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:08,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-10 08:01:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:08,732 INFO L225 Difference]: With dead ends: 12842 [2019-09-10 08:01:08,733 INFO L226 Difference]: Without dead ends: 12842 [2019-09-10 08:01:08,733 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 08:01:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12842 states. [2019-09-10 08:01:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12842 to 12600. [2019-09-10 08:01:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12600 states. [2019-09-10 08:01:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12600 states to 12600 states and 17638 transitions. [2019-09-10 08:01:08,830 INFO L78 Accepts]: Start accepts. Automaton has 12600 states and 17638 transitions. Word has length 148 [2019-09-10 08:01:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:08,830 INFO L475 AbstractCegarLoop]: Abstraction has 12600 states and 17638 transitions. [2019-09-10 08:01:08,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 12600 states and 17638 transitions. [2019-09-10 08:01:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:01:08,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:08,835 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:08,835 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:08,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:08,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1930660436, now seen corresponding path program 1 times [2019-09-10 08:01:08,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:08,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:08,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:08,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:08,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:08,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:08,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:08,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:08,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:08,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:08,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:08,906 INFO L87 Difference]: Start difference. First operand 12600 states and 17638 transitions. Second operand 3 states. [2019-09-10 08:01:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:08,941 INFO L93 Difference]: Finished difference Result 11086 states and 15159 transitions. [2019-09-10 08:01:08,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:08,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-10 08:01:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:08,950 INFO L225 Difference]: With dead ends: 11086 [2019-09-10 08:01:08,950 INFO L226 Difference]: Without dead ends: 11086 [2019-09-10 08:01:08,951 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 08:01:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11086 states. [2019-09-10 08:01:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11086 to 10944. [2019-09-10 08:01:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10944 states. [2019-09-10 08:01:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10944 states to 10944 states and 14990 transitions. [2019-09-10 08:01:09,025 INFO L78 Accepts]: Start accepts. Automaton has 10944 states and 14990 transitions. Word has length 149 [2019-09-10 08:01:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:09,025 INFO L475 AbstractCegarLoop]: Abstraction has 10944 states and 14990 transitions. [2019-09-10 08:01:09,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 10944 states and 14990 transitions. [2019-09-10 08:01:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:01:09,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:09,029 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:09,029 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1187284375, now seen corresponding path program 1 times [2019-09-10 08:01:09,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:09,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:09,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:09,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:09,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:01:09,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:09,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:09,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:09,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:09,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:09,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:09,653 INFO L87 Difference]: Start difference. First operand 10944 states and 14990 transitions. Second operand 7 states. [2019-09-10 08:01:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:09,920 INFO L93 Difference]: Finished difference Result 53874 states and 73663 transitions. [2019-09-10 08:01:09,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:09,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-09-10 08:01:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:09,979 INFO L225 Difference]: With dead ends: 53874 [2019-09-10 08:01:09,979 INFO L226 Difference]: Without dead ends: 53874 [2019-09-10 08:01:09,979 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 08:01:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53874 states. [2019-09-10 08:01:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53874 to 18512. [2019-09-10 08:01:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18512 states. [2019-09-10 08:01:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18512 states to 18512 states and 25262 transitions. [2019-09-10 08:01:10,272 INFO L78 Accepts]: Start accepts. Automaton has 18512 states and 25262 transitions. Word has length 150 [2019-09-10 08:01:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:10,272 INFO L475 AbstractCegarLoop]: Abstraction has 18512 states and 25262 transitions. [2019-09-10 08:01:10,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 18512 states and 25262 transitions. [2019-09-10 08:01:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:01:10,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:10,276 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:10,276 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:10,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:10,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1795758051, now seen corresponding path program 1 times [2019-09-10 08:01:10,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:10,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:10,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:10,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:10,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:01:10,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:10,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:01:10,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:10,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:01:10,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:01:10,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:01:10,390 INFO L87 Difference]: Start difference. First operand 18512 states and 25262 transitions. Second operand 5 states. [2019-09-10 08:01:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:10,515 INFO L93 Difference]: Finished difference Result 26972 states and 36760 transitions. [2019-09-10 08:01:10,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:01:10,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 08:01:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:10,538 INFO L225 Difference]: With dead ends: 26972 [2019-09-10 08:01:10,538 INFO L226 Difference]: Without dead ends: 26972 [2019-09-10 08:01:10,538 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 08:01:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26972 states. [2019-09-10 08:01:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26972 to 22344. [2019-09-10 08:01:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22344 states. [2019-09-10 08:01:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22344 states to 22344 states and 30518 transitions. [2019-09-10 08:01:10,782 INFO L78 Accepts]: Start accepts. Automaton has 22344 states and 30518 transitions. Word has length 150 [2019-09-10 08:01:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:10,782 INFO L475 AbstractCegarLoop]: Abstraction has 22344 states and 30518 transitions. [2019-09-10 08:01:10,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:01:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 22344 states and 30518 transitions. [2019-09-10 08:01:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:01:10,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:10,786 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:10,787 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:10,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash 176034417, now seen corresponding path program 1 times [2019-09-10 08:01:10,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:10,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:10,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:10,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:10,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:10,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:10,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:10,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:10,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:10,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:10,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:10,844 INFO L87 Difference]: Start difference. First operand 22344 states and 30518 transitions. Second operand 3 states. [2019-09-10 08:01:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:10,894 INFO L93 Difference]: Finished difference Result 20570 states and 27575 transitions. [2019-09-10 08:01:10,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:10,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-10 08:01:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:10,911 INFO L225 Difference]: With dead ends: 20570 [2019-09-10 08:01:10,911 INFO L226 Difference]: Without dead ends: 20570 [2019-09-10 08:01:10,911 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 08:01:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2019-09-10 08:01:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 15666. [2019-09-10 08:01:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15666 states. [2019-09-10 08:01:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15666 states to 15666 states and 20998 transitions. [2019-09-10 08:01:11,045 INFO L78 Accepts]: Start accepts. Automaton has 15666 states and 20998 transitions. Word has length 151 [2019-09-10 08:01:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:11,045 INFO L475 AbstractCegarLoop]: Abstraction has 15666 states and 20998 transitions. [2019-09-10 08:01:11,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15666 states and 20998 transitions. [2019-09-10 08:01:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:01:11,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:11,048 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:11,048 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:11,048 INFO L82 PathProgramCache]: Analyzing trace with hash 88060660, now seen corresponding path program 1 times [2019-09-10 08:01:11,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:11,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:11,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:11,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:11,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:01:11,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:11,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:01:11,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:11,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:01:11,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:01:11,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:01:11,140 INFO L87 Difference]: Start difference. First operand 15666 states and 20998 transitions. Second operand 5 states. [2019-09-10 08:01:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:11,260 INFO L93 Difference]: Finished difference Result 21130 states and 28224 transitions. [2019-09-10 08:01:11,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:01:11,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-10 08:01:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:11,278 INFO L225 Difference]: With dead ends: 21130 [2019-09-10 08:01:11,279 INFO L226 Difference]: Without dead ends: 21130 [2019-09-10 08:01:11,279 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 08:01:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21130 states. [2019-09-10 08:01:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21130 to 18360. [2019-09-10 08:01:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18360 states. [2019-09-10 08:01:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18360 states to 18360 states and 24628 transitions. [2019-09-10 08:01:11,553 INFO L78 Accepts]: Start accepts. Automaton has 18360 states and 24628 transitions. Word has length 151 [2019-09-10 08:01:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:11,554 INFO L475 AbstractCegarLoop]: Abstraction has 18360 states and 24628 transitions. [2019-09-10 08:01:11,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:01:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 18360 states and 24628 transitions. [2019-09-10 08:01:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:01:11,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:11,557 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:11,557 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash 534792928, now seen corresponding path program 1 times [2019-09-10 08:01:11,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:11,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:11,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:11,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:11,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:01:11,972 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 153 with the following transitions: [2019-09-10 08:01:11,975 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], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [178], [180], [182], [185], [188], [191], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [234], [237], [241], [244], [247], [251], [253], [256], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [303], [308], [310], [313], [321], [323], [325], [328], [335], [337], [339], [342], [343], [345], [355], [358], [362], [371], [389], [392], [398], [401], [404], [406], [421], [423], [426], [429], [431], [446], [448], [451], [454], [456], [471], [473], [475], [478], [481], [483], [518], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:01:12,080 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:01:12,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:01:12,438 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:01:13,687 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:01:13,690 INFO L272 AbstractInterpreter]: Visited 140 different actions 574 times. Merged at 52 different actions 386 times. Widened at 19 different actions 68 times. Performed 2036 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2036 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 13 different actions. Largest state had 267 variables. [2019-09-10 08:01:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:13,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:01:13,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:13,697 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 08:01:13,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:13,727 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 08:01:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:13,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:01:13,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:01:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:01:14,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:01:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:01:14,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:01:14,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 7] total 21 [2019-09-10 08:01:14,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:14,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:14,412 INFO L87 Difference]: Start difference. First operand 18360 states and 24628 transitions. Second operand 7 states. [2019-09-10 08:01:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:15,280 INFO L93 Difference]: Finished difference Result 62210 states and 83539 transitions. [2019-09-10 08:01:15,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:15,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-09-10 08:01:15,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:15,476 INFO L225 Difference]: With dead ends: 62210 [2019-09-10 08:01:15,476 INFO L226 Difference]: Without dead ends: 62210 [2019-09-10 08:01:15,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62210 states. [2019-09-10 08:01:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62210 to 26298. [2019-09-10 08:01:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26298 states. [2019-09-10 08:01:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26298 states to 26298 states and 35158 transitions. [2019-09-10 08:01:16,309 INFO L78 Accepts]: Start accepts. Automaton has 26298 states and 35158 transitions. Word has length 152 [2019-09-10 08:01:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:16,310 INFO L475 AbstractCegarLoop]: Abstraction has 26298 states and 35158 transitions. [2019-09-10 08:01:16,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 26298 states and 35158 transitions. [2019-09-10 08:01:16,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:01:16,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:16,319 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:16,319 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:16,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:16,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1316127134, now seen corresponding path program 1 times [2019-09-10 08:01:16,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:16,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:16,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:16,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:16,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:16,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:16,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:16,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:16,461 INFO L87 Difference]: Start difference. First operand 26298 states and 35158 transitions. Second operand 3 states. [2019-09-10 08:01:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:16,572 INFO L93 Difference]: Finished difference Result 32162 states and 42399 transitions. [2019-09-10 08:01:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:16,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-10 08:01:16,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:16,638 INFO L225 Difference]: With dead ends: 32162 [2019-09-10 08:01:16,638 INFO L226 Difference]: Without dead ends: 32162 [2019-09-10 08:01:16,638 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 08:01:16,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32162 states. [2019-09-10 08:01:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32162 to 31000. [2019-09-10 08:01:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31000 states. [2019-09-10 08:01:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31000 states to 31000 states and 41006 transitions. [2019-09-10 08:01:17,411 INFO L78 Accepts]: Start accepts. Automaton has 31000 states and 41006 transitions. Word has length 152 [2019-09-10 08:01:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:17,411 INFO L475 AbstractCegarLoop]: Abstraction has 31000 states and 41006 transitions. [2019-09-10 08:01:17,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 31000 states and 41006 transitions. [2019-09-10 08:01:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:01:17,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:17,417 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] [2019-09-10 08:01:17,417 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:17,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:17,417 INFO L82 PathProgramCache]: Analyzing trace with hash -995548368, now seen corresponding path program 1 times [2019-09-10 08:01:17,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:17,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:17,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:17,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:17,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:01:17,747 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-09-10 08:01:17,749 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], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [178], [180], [182], [185], [188], [191], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [234], [237], [241], [244], [247], [251], [253], [256], [261], [264], [269], [271], [274], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [325], [328], [335], [337], [339], [342], [343], [345], [355], [358], [362], [371], [373], [376], [379], [381], [396], [398], [401], [404], [406], [421], [423], [426], [429], [431], [446], [448], [451], [454], [456], [464], [467], [473], [475], [478], [481], [483], [518], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:01:17,762 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:01:17,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:01:17,827 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:01:18,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:01:18,761 INFO L272 AbstractInterpreter]: Visited 144 different actions 819 times. Merged at 56 different actions 590 times. Widened at 23 different actions 108 times. Performed 3010 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3010 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 72 fixpoints after 17 different actions. Largest state had 268 variables. [2019-09-10 08:01:18,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:18,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:01:18,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:18,761 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:01:18,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:18,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:01:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:19,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:01:19,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:01:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:01:19,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:01:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:01:19,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:01:19,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 7] total 21 [2019-09-10 08:01:19,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:19,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:19,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:19,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:19,534 INFO L87 Difference]: Start difference. First operand 31000 states and 41006 transitions. Second operand 7 states. [2019-09-10 08:01:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:20,110 INFO L93 Difference]: Finished difference Result 76442 states and 101535 transitions. [2019-09-10 08:01:20,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:20,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-09-10 08:01:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:20,201 INFO L225 Difference]: With dead ends: 76442 [2019-09-10 08:01:20,201 INFO L226 Difference]: Without dead ends: 76442 [2019-09-10 08:01:20,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76442 states. [2019-09-10 08:01:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76442 to 37272. [2019-09-10 08:01:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37272 states. [2019-09-10 08:01:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37272 states to 37272 states and 49262 transitions. [2019-09-10 08:01:20,892 INFO L78 Accepts]: Start accepts. Automaton has 37272 states and 49262 transitions. Word has length 153 [2019-09-10 08:01:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:20,893 INFO L475 AbstractCegarLoop]: Abstraction has 37272 states and 49262 transitions. [2019-09-10 08:01:20,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 37272 states and 49262 transitions. [2019-09-10 08:01:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:01:20,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:20,897 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:20,897 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:20,898 INFO L82 PathProgramCache]: Analyzing trace with hash -590541698, now seen corresponding path program 1 times [2019-09-10 08:01:20,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:20,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:20,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:20,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:20,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:01:20,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:20,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:20,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:20,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:20,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:20,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:20,978 INFO L87 Difference]: Start difference. First operand 37272 states and 49262 transitions. Second operand 3 states. [2019-09-10 08:01:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:21,168 INFO L93 Difference]: Finished difference Result 60378 states and 79175 transitions. [2019-09-10 08:01:21,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:21,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-10 08:01:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:21,263 INFO L225 Difference]: With dead ends: 60378 [2019-09-10 08:01:21,264 INFO L226 Difference]: Without dead ends: 60378 [2019-09-10 08:01:21,264 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 08:01:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60378 states. [2019-09-10 08:01:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60378 to 56312. [2019-09-10 08:01:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56312 states. [2019-09-10 08:01:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56312 states to 56312 states and 74238 transitions. [2019-09-10 08:01:23,195 INFO L78 Accepts]: Start accepts. Automaton has 56312 states and 74238 transitions. Word has length 153 [2019-09-10 08:01:23,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:23,195 INFO L475 AbstractCegarLoop]: Abstraction has 56312 states and 74238 transitions. [2019-09-10 08:01:23,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 56312 states and 74238 transitions. [2019-09-10 08:01:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:01:23,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:23,202 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:23,202 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:23,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:23,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2143226076, now seen corresponding path program 1 times [2019-09-10 08:01:23,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:23,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:23,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:23,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:23,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:01:23,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:23,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:23,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:23,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:23,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:23,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:23,375 INFO L87 Difference]: Start difference. First operand 56312 states and 74238 transitions. Second operand 9 states. [2019-09-10 08:01:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:24,388 INFO L93 Difference]: Finished difference Result 114252 states and 150093 transitions. [2019-09-10 08:01:24,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:01:24,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 154 [2019-09-10 08:01:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:24,515 INFO L225 Difference]: With dead ends: 114252 [2019-09-10 08:01:24,516 INFO L226 Difference]: Without dead ends: 114252 [2019-09-10 08:01:24,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:01:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114252 states. [2019-09-10 08:01:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114252 to 56312. [2019-09-10 08:01:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56312 states. [2019-09-10 08:01:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56312 states to 56312 states and 74236 transitions. [2019-09-10 08:01:25,646 INFO L78 Accepts]: Start accepts. Automaton has 56312 states and 74236 transitions. Word has length 154 [2019-09-10 08:01:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:25,646 INFO L475 AbstractCegarLoop]: Abstraction has 56312 states and 74236 transitions. [2019-09-10 08:01:25,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 56312 states and 74236 transitions. [2019-09-10 08:01:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:01:25,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:25,654 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:25,654 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:25,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:25,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1374119045, now seen corresponding path program 1 times [2019-09-10 08:01:25,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:25,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:25,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:25,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:25,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:01:25,973 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 08:01:25,973 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], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [178], [180], [182], [185], [188], [191], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [241], [244], [247], [251], [253], [256], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [325], [328], [331], [335], [337], [339], [342], [343], [345], [348], [353], [355], [358], [371], [373], [376], [379], [381], [396], [398], [401], [404], [406], [421], [423], [426], [429], [431], [446], [448], [451], [454], [456], [471], [473], [475], [478], [481], [483], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:01:25,977 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:01:25,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:01:26,062 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:01:27,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:01:27,288 INFO L272 AbstractInterpreter]: Visited 146 different actions 895 times. Merged at 55 different actions 646 times. Widened at 24 different actions 107 times. Performed 3188 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3188 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 106 fixpoints after 20 different actions. Largest state had 268 variables. [2019-09-10 08:01:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:27,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:01:27,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:27,289 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 08:01:27,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:27,312 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 08:01:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:27,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 1515 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:01:27,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:01:27,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:28,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:01:28,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:28,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:30,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:30,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:01:30,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2019-09-10 08:01:30,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:01:30,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:01:30,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:01:30,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:01:30,735 INFO L87 Difference]: Start difference. First operand 56312 states and 74236 transitions. Second operand 20 states. [2019-09-10 08:01:31,020 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 08:01:31,716 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 08:01:32,274 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:01:32,797 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:01:33,258 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 08:01:33,977 WARN L188 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:01:34,314 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:01:34,672 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 08:01:35,125 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:01:35,398 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 08:01:35,728 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 08:01:36,035 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 08:01:36,543 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 08:01:36,923 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:01:37,427 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:01:37,845 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 08:01:38,105 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 08:01:38,509 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 08:01:38,970 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 08:01:39,373 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 08:01:40,116 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-10 08:01:40,524 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 08:01:40,927 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 08:01:41,271 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 08:01:41,568 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 08:01:42,079 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 08:01:42,390 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 08:01:42,779 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 08:01:43,137 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 08:01:43,673 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 08:01:44,027 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 08:01:44,565 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:01:45,540 WARN L188 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-09-10 08:01:46,156 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-09-10 08:01:46,483 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-10 08:01:46,884 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 08:01:48,126 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 08:01:48,568 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 08:01:49,053 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:01:49,387 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-09-10 08:01:50,023 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 08:01:50,477 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 08:01:50,763 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 08:01:51,447 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 08:01:51,849 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:01:52,128 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 08:01:52,502 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 08:01:53,038 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 08:01:53,353 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-10 08:01:55,331 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 08:01:55,845 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:01:56,179 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:01:56,689 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 08:01:57,005 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 08:01:57,666 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 08:01:58,135 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 08:01:58,458 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 08:01:59,179 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:01:59,790 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:02:00,299 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:02:00,671 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:02:01,042 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 08:02:01,376 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 08:02:01,704 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 08:02:02,068 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 08:02:02,403 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 08:02:02,741 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 08:02:03,211 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-09-10 08:02:03,659 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-10 08:02:04,256 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 08:02:05,108 WARN L188 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-10 08:02:05,465 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 08:02:05,901 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:02:06,371 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:02:06,910 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 08:02:07,268 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 08:02:07,712 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 08:02:08,064 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 08:02:08,452 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-10 08:02:08,879 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 08:02:09,194 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 08:02:09,527 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 08:02:09,807 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 08:02:10,196 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 08:02:10,523 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 08:02:10,880 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:02:11,231 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 08:02:11,573 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-10 08:02:12,017 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:02:12,306 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 08:02:12,695 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:02:13,033 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 08:02:13,462 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:02:13,866 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-10 08:02:14,231 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 08:02:14,701 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 08:02:15,103 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:02:15,741 WARN L188 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 08:02:16,117 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:02:16,507 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 08:02:16,909 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 08:02:17,176 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:02:17,420 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 08:02:17,964 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 08:02:18,320 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 08:02:18,686 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 08:02:19,040 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 08:02:19,382 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 08:02:19,650 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 08:02:20,003 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:02:20,292 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 08:02:20,565 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 08:02:20,894 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 08:02:21,478 WARN L188 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 08:02:21,847 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-10 08:02:22,630 WARN L188 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 08:02:22,987 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 08:02:23,362 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 08:02:23,694 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:02:24,081 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 08:02:24,345 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 08:02:24,641 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 08:02:24,958 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 08:02:25,429 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-10 08:02:25,745 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 08:02:26,111 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 08:02:26,436 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 08:02:26,940 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 08:02:27,290 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:02:27,823 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 08:02:30,323 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:02:30,764 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 08:02:31,102 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:02:31,513 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-10 08:02:31,852 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 08:02:32,315 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 08:02:32,640 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 08:02:33,044 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 08:02:33,545 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:02:33,844 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-10 08:02:34,222 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-10 08:02:34,855 WARN L188 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 08:02:35,204 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 08:02:35,471 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:02:35,920 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 08:02:36,183 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:02:36,540 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 08:02:36,815 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:02:37,242 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:02:37,502 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 08:02:37,926 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-09-10 08:02:38,483 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:02:38,837 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:02:39,223 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:02:39,678 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 08:02:40,038 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 08:02:42,593 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-10 08:02:42,999 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 08:02:43,367 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 08:02:44,035 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 08:02:44,655 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-10 08:02:45,341 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 08:02:46,062 WARN L188 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 08:02:46,646 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:02:47,006 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-10 08:02:47,336 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 08:02:47,796 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 08:02:48,195 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 08:02:48,656 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:02:49,202 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-09-10 08:02:49,667 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 08:02:49,977 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 08:02:50,489 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 08:02:50,771 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 08:02:51,264 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:02:51,628 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:02:52,054 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-09-10 08:02:52,388 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 08:02:52,723 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 08:02:53,206 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:02:53,940 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:02:54,384 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:02:54,987 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:02:55,450 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:02:56,041 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-09-10 08:02:56,343 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 08:02:56,727 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:02:57,227 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:02:57,566 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:02:57,971 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 08:02:58,543 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-10 08:02:58,907 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 08:02:59,414 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:02:59,822 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 08:03:00,165 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 08:03:00,827 WARN L188 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-09-10 08:03:01,220 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:03:01,619 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 08:03:01,981 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-09-10 08:03:02,500 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-09-10 08:03:03,011 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 08:03:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:04,941 INFO L93 Difference]: Finished difference Result 832178 states and 1077055 transitions. [2019-09-10 08:03:04,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2019-09-10 08:03:04,941 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 156 [2019-09-10 08:03:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:05,956 INFO L225 Difference]: With dead ends: 832178 [2019-09-10 08:03:05,957 INFO L226 Difference]: Without dead ends: 832178 [2019-09-10 08:03:05,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 268 SyntacticMatches, 26 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20790 ImplicationChecksByTransitivity, 83.6s TimeCoverageRelationStatistics Valid=8691, Invalid=45831, Unknown=0, NotChecked=0, Total=54522 [2019-09-10 08:03:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832178 states. [2019-09-10 08:03:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832178 to 200144. [2019-09-10 08:03:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200144 states. [2019-09-10 08:03:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200144 states to 200144 states and 261821 transitions. [2019-09-10 08:03:15,340 INFO L78 Accepts]: Start accepts. Automaton has 200144 states and 261821 transitions. Word has length 156 [2019-09-10 08:03:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:15,340 INFO L475 AbstractCegarLoop]: Abstraction has 200144 states and 261821 transitions. [2019-09-10 08:03:15,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:03:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 200144 states and 261821 transitions. [2019-09-10 08:03:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:03:15,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:15,349 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] [2019-09-10 08:03:15,349 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:15,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash 804820971, now seen corresponding path program 1 times [2019-09-10 08:03:15,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:15,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:15,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:18,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:18,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:03:18,099 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-09-10 08:03:18,099 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], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [178], [180], [182], [185], [188], [191], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [241], [244], [247], [251], [253], [256], [261], [264], [269], [271], [274], [277], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [325], [328], [335], [337], [339], [342], [343], [345], [355], [358], [362], [371], [373], [376], [379], [381], [396], [398], [401], [404], [406], [421], [423], [426], [429], [431], [439], [442], [448], [451], [454], [456], [464], [467], [473], [475], [478], [481], [483], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:03:18,104 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:03:18,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:03:18,184 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:03:19,065 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:03:19,065 INFO L272 AbstractInterpreter]: Visited 148 different actions 860 times. Merged at 58 different actions 627 times. Widened at 22 different actions 124 times. Performed 2980 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2980 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 75 fixpoints after 18 different actions. Largest state had 268 variables. [2019-09-10 08:03:19,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:19,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:03:19,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:19,066 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) [2019-09-10 08:03:19,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:19,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:03:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:19,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:03:19,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:03:19,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:19,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:19,943 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:03:20,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:20,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:22,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:22,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:03:22,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 08:03:22,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:03:22,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:03:22,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:03:22,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:03:22,539 INFO L87 Difference]: Start difference. First operand 200144 states and 261821 transitions. Second operand 20 states. [2019-09-10 08:03:22,707 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:03:23,561 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:03:23,906 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:03:24,648 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:03:24,861 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:03:25,134 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:03:25,386 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:03:25,952 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:03:26,323 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:03:26,834 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:03:27,183 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:03:27,499 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:03:28,089 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:03:28,357 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:03:28,663 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:03:28,920 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:03:29,372 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:03:29,854 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:03:30,184 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:03:31,672 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:03:31,892 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:03:32,200 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:03:32,891 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:03:33,354 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:03:33,846 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:03:34,092 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:03:34,508 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:03:34,960 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:03:35,190 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:03:35,437 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:03:35,671 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:03:35,994 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 08:03:36,309 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:03:36,719 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:03:37,762 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:03:37,983 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:03:39,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:39,491 INFO L93 Difference]: Finished difference Result 1032822 states and 1337510 transitions. [2019-09-10 08:03:39,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 08:03:39,492 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 157 [2019-09-10 08:03:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:40,755 INFO L225 Difference]: With dead ends: 1032822 [2019-09-10 08:03:40,755 INFO L226 Difference]: Without dead ends: 1032822 [2019-09-10 08:03:40,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 271 SyntacticMatches, 30 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=1175, Invalid=2985, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:03:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032822 states. [2019-09-10 08:03:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032822 to 474850. [2019-09-10 08:03:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474850 states. [2019-09-10 08:03:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474850 states to 474850 states and 620206 transitions. [2019-09-10 08:03:56,885 INFO L78 Accepts]: Start accepts. Automaton has 474850 states and 620206 transitions. Word has length 157 [2019-09-10 08:03:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:56,885 INFO L475 AbstractCegarLoop]: Abstraction has 474850 states and 620206 transitions. [2019-09-10 08:03:56,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:03:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 474850 states and 620206 transitions. [2019-09-10 08:03:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:03:56,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:56,904 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] [2019-09-10 08:03:56,904 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:56,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:56,904 INFO L82 PathProgramCache]: Analyzing trace with hash -832258675, now seen corresponding path program 1 times [2019-09-10 08:03:56,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:56,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:56,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:03:56,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:56,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:03:56,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:56,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:03:56,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:03:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:03:56,964 INFO L87 Difference]: Start difference. First operand 474850 states and 620206 transitions. Second operand 4 states. [2019-09-10 08:04:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:03,303 INFO L93 Difference]: Finished difference Result 669944 states and 871902 transitions. [2019-09-10 08:04:03,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:03,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-10 08:04:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:04,060 INFO L225 Difference]: With dead ends: 669944 [2019-09-10 08:04:04,060 INFO L226 Difference]: Without dead ends: 669944 [2019-09-10 08:04:04,061 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 08:04:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669944 states. [2019-09-10 08:04:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669944 to 473194. [2019-09-10 08:04:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473194 states. [2019-09-10 08:04:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473194 states to 473194 states and 616894 transitions. [2019-09-10 08:04:11,095 INFO L78 Accepts]: Start accepts. Automaton has 473194 states and 616894 transitions. Word has length 158 [2019-09-10 08:04:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:11,095 INFO L475 AbstractCegarLoop]: Abstraction has 473194 states and 616894 transitions. [2019-09-10 08:04:11,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:04:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 473194 states and 616894 transitions. [2019-09-10 08:04:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:04:11,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:11,113 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] [2019-09-10 08:04:11,113 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:11,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2132509112, now seen corresponding path program 1 times [2019-09-10 08:04:11,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:11,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:11,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:11,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:11,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:17,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:04:17,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:04:17,854 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-09-10 08:04:17,854 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], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [180], [182], [185], [188], [191], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [241], [244], [247], [251], [253], [256], [261], [264], [269], [271], [274], [282], [284], [287], [290], [295], [297], [300], [308], [310], [313], [321], [323], [325], [328], [335], [337], [339], [342], [343], [345], [355], [358], [362], [371], [373], [376], [379], [381], [396], [398], [401], [404], [406], [414], [417], [423], [426], [429], [431], [446], [448], [451], [454], [456], [464], [467], [473], [475], [478], [481], [483], [928], [1357], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:04:17,856 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:04:17,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:04:17,906 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:04:18,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:04:18,514 INFO L272 AbstractInterpreter]: Visited 149 different actions 735 times. Merged at 58 different actions 514 times. Widened at 21 different actions 87 times. Performed 2718 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2718 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 60 fixpoints after 15 different actions. Largest state had 268 variables. [2019-09-10 08:04:18,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:18,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:04:18,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:04:18,515 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:04:18,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:18,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:04:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:18,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 08:04:18,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:04:19,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:21,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:04:21,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:21,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:21,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:21,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:34,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:34,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:04:34,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 33 [2019-09-10 08:04:34,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:04:34,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:04:34,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:04:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:04:34,838 INFO L87 Difference]: Start difference. First operand 473194 states and 616894 transitions. Second operand 27 states. [2019-09-10 08:04:35,229 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-10 08:04:35,687 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 08:04:36,153 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:04:36,607 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 08:04:36,969 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:04:37,129 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:04:37,423 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 08:04:37,806 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 08:04:38,071 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 08:04:38,351 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-10 08:04:38,648 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 08:04:38,890 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 08:04:39,176 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-10 08:04:39,495 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 08:04:39,875 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:04:40,205 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:04:41,701 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:04:41,884 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:04:42,034 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 08:04:42,418 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 08:04:43,835 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 08:04:44,185 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 08:04:44,521 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:04:45,058 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 08:04:45,389 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 08:04:45,572 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:04:46,034 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:04:46,557 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 08:04:46,797 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:04:47,134 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 08:04:47,730 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:04:48,428 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:04:52,772 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 08:04:53,192 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 08:04:53,450 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:04:54,252 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 08:04:54,564 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 08:04:54,799 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:04:54,942 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 08:04:55,958 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-09-10 08:04:56,374 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-09-10 08:04:56,600 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 08:04:56,753 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:04:57,390 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 08:04:57,674 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 08:04:58,115 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 08:04:58,424 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 08:04:58,722 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 08:04:58,916 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 08:04:59,539 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 08:04:59,906 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 08:05:00,074 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 08:05:01,032 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 08:05:01,186 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 08:05:01,454 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 08:05:01,789 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 08:05:02,010 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:05:02,484 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:05:02,701 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 08:05:03,029 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 08:05:03,799 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 08:05:04,313 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-10 08:05:05,015 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-09-10 08:05:05,275 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 08:05:05,540 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 08:05:05,784 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 08:05:05,963 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 08:05:06,127 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:05:06,682 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:05:07,641 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 08:05:08,009 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 08:05:08,766 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 08:05:09,100 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 08:05:12,384 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 08:05:12,739 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:05:13,348 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:05:13,856 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 08:05:14,258 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 08:05:14,438 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:05:14,927 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:05:15,183 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:05:15,788 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:05:16,701 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 08:05:17,074 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 08:05:17,284 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:05:17,669 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 08:05:18,175 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 08:05:18,379 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 08:05:19,021 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 08:05:20,070 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:05:20,368 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:05:21,190 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 08:05:21,868 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 08:05:22,342 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-09-10 08:05:23,941 WARN L188 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 08:05:24,790 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:05:26,618 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:05:26,845 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:05:27,100 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 08:05:27,382 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 08:05:27,836 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 08:05:28,312 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 08:05:31,106 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:05:31,621 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:05:32,037 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:05:32,467 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:05:32,938 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:05:33,391 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 08:05:33,704 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 08:05:34,146 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 08:05:34,510 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 08:05:34,788 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 08:05:44,349 WARN L188 SmtUtils]: Spent 9.41 s on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 08:05:46,319 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 08:05:46,808 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 08:05:47,921 WARN L188 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:05:48,224 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 08:05:48,695 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 08:05:49,009 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 08:05:49,578 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-09-10 08:05:49,901 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 08:05:50,181 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 08:05:50,495 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 08:05:50,691 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 08:05:51,146 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 08:05:51,484 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 08:05:51,713 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 08:05:52,275 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 08:05:52,742 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 08:05:53,033 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 08:05:53,356 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 08:05:53,838 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-10 08:05:54,212 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 08:05:54,404 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 08:06:04,592 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-10 08:06:04,936 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-09-10 08:06:05,277 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 08:06:05,647 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 08:06:06,729 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-10 08:06:07,116 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-10 08:06:07,389 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 08:06:07,732 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-09-10 08:06:08,195 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 08:06:08,436 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-10 08:06:09,862 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-10 08:06:10,142 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 08:06:10,475 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-09-10 08:06:10,809 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 08:06:11,203 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 08:06:11,445 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 08:06:11,758 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 08:06:12,053 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-10 08:06:13,718 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 08:06:14,218 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-10 08:06:14,644 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 08:06:14,834 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:06:15,165 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 08:06:16,450 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-10 08:06:16,659 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:06:17,020 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 08:06:17,241 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 08:06:17,615 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-09-10 08:06:17,916 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:06:18,318 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-10 08:06:18,715 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-09-10 08:06:19,167 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-09-10 08:06:19,606 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-10 08:06:19,774 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:06:20,096 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 08:06:20,390 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-09-10 08:06:20,553 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 08:06:21,028 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 08:06:21,228 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 08:06:21,498 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 08:06:21,752 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 08:06:22,106 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 08:06:22,325 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 08:06:22,766 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:06:23,082 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 08:06:23,324 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 08:06:24,419 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:06:24,666 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 08:06:25,103 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 08:06:25,432 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 08:06:25,639 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 08:06:26,216 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-09-10 08:06:26,460 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 08:06:26,666 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 08:06:26,923 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 08:06:27,538 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 08:06:27,725 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 08:06:28,208 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-10 08:06:28,421 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 08:06:29,021 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-09-10 08:06:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:29,465 INFO L93 Difference]: Finished difference Result 4087088 states and 5303059 transitions. [2019-09-10 08:06:29,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 314 states. [2019-09-10 08:06:29,466 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 158 [2019-09-10 08:06:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:53,527 INFO L225 Difference]: With dead ends: 4087088 [2019-09-10 08:06:53,527 INFO L226 Difference]: Without dead ends: 4087088 [2019-09-10 08:06:53,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 225 SyntacticMatches, 76 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50324 ImplicationChecksByTransitivity, 91.4s TimeCoverageRelationStatistics Valid=12979, Invalid=105013, Unknown=0, NotChecked=0, Total=117992 [2019-09-10 08:06:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087088 states. [2019-09-10 08:07:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087088 to 520212. [2019-09-10 08:07:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520212 states. [2019-09-10 08:07:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520212 states to 520212 states and 679841 transitions. [2019-09-10 08:07:29,027 INFO L78 Accepts]: Start accepts. Automaton has 520212 states and 679841 transitions. Word has length 158 [2019-09-10 08:07:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:29,027 INFO L475 AbstractCegarLoop]: Abstraction has 520212 states and 679841 transitions. [2019-09-10 08:07:29,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:07:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 520212 states and 679841 transitions. [2019-09-10 08:07:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:07:29,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:29,047 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] [2019-09-10 08:07:29,047 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:29,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:29,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1453202470, now seen corresponding path program 1 times [2019-09-10 08:07:29,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:29,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:29,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:29,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:29,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:29,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:29,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:07:29,393 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-09-10 08:07:29,393 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], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [178], [180], [182], [185], [188], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [241], [244], [247], [251], [253], [256], [261], [264], [269], [271], [274], [277], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [325], [328], [335], [337], [339], [342], [343], [345], [355], [358], [362], [371], [373], [376], [379], [381], [396], [398], [401], [404], [406], [421], [423], [426], [429], [431], [439], [442], [448], [451], [454], [456], [464], [467], [473], [475], [478], [481], [483], [701], [923], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:07:29,397 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:07:29,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:07:29,445 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:07:30,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:07:30,055 INFO L272 AbstractInterpreter]: Visited 149 different actions 868 times. Merged at 58 different actions 634 times. Widened at 22 different actions 120 times. Performed 3085 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3085 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 75 fixpoints after 18 different actions. Largest state had 268 variables. [2019-09-10 08:07:30,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:30,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:07:30,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:30,055 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) [2019-09-10 08:07:30,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:30,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:07:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:30,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:07:30,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:07:30,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:30,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:30,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:30,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:32,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:07:32,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:32,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:32,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:32,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:32,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:33,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:07:33,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2019-09-10 08:07:33,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:07:33,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:07:33,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:07:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:07:33,614 INFO L87 Difference]: Start difference. First operand 520212 states and 679841 transitions. Second operand 21 states. [2019-09-10 08:07:40,369 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-09-10 08:07:40,684 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-10 08:07:41,700 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2019-09-10 08:07:42,271 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-10 08:07:44,575 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-09-10 08:07:45,512 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2019-09-10 08:07:48,595 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-10 08:07:49,386 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-09-10 08:07:49,937 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2019-09-10 08:07:51,038 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 08:08:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:07,292 INFO L93 Difference]: Finished difference Result 2805800 states and 3622390 transitions. [2019-09-10 08:08:07,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 08:08:07,292 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 158 [2019-09-10 08:08:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:24,475 INFO L225 Difference]: With dead ends: 2805800 [2019-09-10 08:08:24,475 INFO L226 Difference]: Without dead ends: 2805800 [2019-09-10 08:08:24,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 270 SyntacticMatches, 27 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7657 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=3792, Invalid=17964, Unknown=0, NotChecked=0, Total=21756 [2019-09-10 08:08:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805800 states. [2019-09-10 08:08:48,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805800 to 520180. [2019-09-10 08:08:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520180 states. [2019-09-10 08:08:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520180 states to 520180 states and 679806 transitions. [2019-09-10 08:08:50,012 INFO L78 Accepts]: Start accepts. Automaton has 520180 states and 679806 transitions. Word has length 158 [2019-09-10 08:08:50,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:50,012 INFO L475 AbstractCegarLoop]: Abstraction has 520180 states and 679806 transitions. [2019-09-10 08:08:50,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:08:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 520180 states and 679806 transitions. [2019-09-10 08:08:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:08:50,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:50,023 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:50,023 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:50,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:50,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1077820880, now seen corresponding path program 1 times [2019-09-10 08:08:50,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:50,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:50,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:50,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:50,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:08:50,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:50,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:08:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:08:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:08:50,082 INFO L87 Difference]: Start difference. First operand 520180 states and 679806 transitions. Second operand 3 states. [2019-09-10 08:08:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:50,580 INFO L93 Difference]: Finished difference Result 267810 states and 344209 transitions. [2019-09-10 08:08:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:08:50,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-10 08:08:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:50,844 INFO L225 Difference]: With dead ends: 267810 [2019-09-10 08:08:50,844 INFO L226 Difference]: Without dead ends: 267810 [2019-09-10 08:08:50,844 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 08:08:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267810 states. [2019-09-10 08:09:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267810 to 267808. [2019-09-10 08:09:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267808 states. [2019-09-10 08:09:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267808 states to 267808 states and 344208 transitions. [2019-09-10 08:09:01,014 INFO L78 Accepts]: Start accepts. Automaton has 267808 states and 344208 transitions. Word has length 158 [2019-09-10 08:09:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:09:01,015 INFO L475 AbstractCegarLoop]: Abstraction has 267808 states and 344208 transitions. [2019-09-10 08:09:01,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:09:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 267808 states and 344208 transitions. [2019-09-10 08:09:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:09:01,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:09:01,022 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:09:01,022 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:09:01,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:01,023 INFO L82 PathProgramCache]: Analyzing trace with hash -950117491, now seen corresponding path program 1 times [2019-09-10 08:09:01,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:09:01,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:01,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:01,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:09:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:01,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:09:01,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:09:01,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:09:01,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:09:01,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:09:01,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:09:01,099 INFO L87 Difference]: Start difference. First operand 267808 states and 344208 transitions. Second operand 3 states. [2019-09-10 08:09:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:09:02,286 INFO L93 Difference]: Finished difference Result 143034 states and 179845 transitions. [2019-09-10 08:09:02,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:09:02,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-10 08:09:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:09:02,421 INFO L225 Difference]: With dead ends: 143034 [2019-09-10 08:09:02,421 INFO L226 Difference]: Without dead ends: 143034 [2019-09-10 08:09:02,421 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 08:09:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143034 states. [2019-09-10 08:09:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143034 to 143032. [2019-09-10 08:09:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143032 states. [2019-09-10 08:09:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143032 states to 143032 states and 179844 transitions. [2019-09-10 08:09:04,361 INFO L78 Accepts]: Start accepts. Automaton has 143032 states and 179844 transitions. Word has length 158 [2019-09-10 08:09:04,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:09:04,362 INFO L475 AbstractCegarLoop]: Abstraction has 143032 states and 179844 transitions. [2019-09-10 08:09:04,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:09:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand 143032 states and 179844 transitions. [2019-09-10 08:09:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:09:04,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:09:04,368 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] [2019-09-10 08:09:04,368 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:09:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1738440077, now seen corresponding path program 1 times [2019-09-10 08:09:04,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:09:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:04,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:04,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:09:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:04,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:09:04,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:09:04,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-09-10 08:09:04,741 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], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [178], [180], [182], [185], [188], [191], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [241], [244], [247], [251], [253], [256], [261], [264], [269], [271], [274], [277], [282], [284], [287], [290], [293], [295], [297], [300], [308], [310], [313], [321], [323], [325], [328], [335], [337], [339], [342], [343], [345], [355], [358], [362], [371], [373], [376], [379], [381], [396], [398], [401], [404], [406], [423], [426], [429], [431], [439], [442], [448], [451], [454], [456], [464], [467], [473], [475], [478], [481], [483], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:09:04,744 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:09:04,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:09:04,788 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:09:05,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:09:05,484 INFO L272 AbstractInterpreter]: Visited 149 different actions 750 times. Merged at 59 different actions 530 times. Widened at 19 different actions 80 times. Performed 2684 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2684 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 62 fixpoints after 16 different actions. Largest state had 268 variables. [2019-09-10 08:09:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:05,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:09:05,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:09:05,485 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) [2019-09-10 08:09:05,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:05,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:09:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:05,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 1522 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:09:05,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:09:06,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:06,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:06,943 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:09:07,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:07,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:08,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:08,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:09:08,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 08:09:08,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:09:08,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:09:08,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:09:08,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:09:08,878 INFO L87 Difference]: Start difference. First operand 143032 states and 179844 transitions. Second operand 21 states. [2019-09-10 08:09:09,280 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:09:09,998 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:09:10,648 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:09:11,067 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 08:09:11,390 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 08:09:11,654 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 08:09:12,135 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 08:09:12,469 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 08:09:13,336 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 08:09:13,700 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-09-10 08:09:14,220 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 08:09:14,631 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-09-10 08:09:15,084 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-09-10 08:09:17,248 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2019-09-10 08:09:18,026 WARN L188 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 08:09:18,314 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:09:18,831 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-10 08:09:19,317 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 08:09:20,534 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-09-10 08:09:21,040 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 08:09:21,646 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 08:09:22,087 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:09:22,500 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:09:23,107 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:09:23,740 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 08:09:24,164 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:09:24,591 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-09-10 08:09:25,124 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-10 08:09:25,651 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:09:26,025 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 08:09:26,701 WARN L188 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 08:09:27,938 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:09:28,326 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:09:28,811 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2019-09-10 08:09:29,235 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-09-10 08:09:29,612 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 08:09:30,048 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 08:09:30,512 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:09:30,930 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 08:09:31,625 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-10 08:09:32,031 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 08:09:32,479 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 08:09:33,286 WARN L188 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-10 08:09:33,801 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 08:09:34,275 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 08:09:34,660 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 08:09:35,411 WARN L188 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 08:09:35,848 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:09:36,396 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 97 [2019-09-10 08:09:36,987 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-09-10 08:09:37,442 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 08:09:37,944 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:09:38,502 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 08:09:38,924 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:09:39,333 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 08:09:40,019 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 08:09:40,462 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-10 08:09:41,036 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 97 [2019-09-10 08:09:41,604 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 08:09:42,036 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 08:09:42,517 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:09:42,929 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:09:43,573 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2019-09-10 08:09:44,045 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-09-10 08:09:44,519 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 08:09:44,913 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 08:09:46,716 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 08:09:47,231 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:09:47,727 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:09:48,195 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:09:48,687 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2019-09-10 08:09:49,178 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 95 [2019-09-10 08:09:49,777 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 08:09:50,432 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 08:09:50,870 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 08:09:51,285 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 08:09:51,698 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 08:09:52,110 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 08:09:52,944 WARN L188 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-10 08:09:53,389 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-09-10 08:09:53,919 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 08:09:57,840 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:09:58,237 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-10 08:09:58,651 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 08:09:59,092 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-09-10 08:09:59,527 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-10 08:09:59,974 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2019-09-10 08:10:00,274 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 08:10:00,627 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:10:01,367 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 08:10:01,935 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:10:02,582 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 08:10:02,960 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 08:10:03,363 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:10:03,809 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 08:10:04,382 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 08:10:04,896 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:10:05,524 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 08:10:05,953 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 08:10:06,381 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 08:10:06,870 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-09-10 08:10:07,364 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2019-09-10 08:10:07,839 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 08:10:08,347 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-09-10 08:10:08,783 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 08:10:09,486 WARN L188 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 08:10:09,828 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 08:10:10,213 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 08:10:10,833 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:10:11,351 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 08:10:11,825 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:10:12,272 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88