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.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:39:06,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:39:06,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:39:06,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:39:06,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:39:06,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:39:06,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:39:06,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:39:06,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:39:06,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:39:06,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:39:06,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:39:06,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:39:06,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:39:06,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:39:06,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:39:06,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:39:06,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:39:06,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:39:06,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:39:06,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:39:06,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:39:06,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:39:06,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:39:06,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:39:06,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:39:06,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:39:06,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:39:06,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:39:06,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:39:06,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:39:06,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:39:06,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:39:06,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:39:06,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:39:06,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:39:06,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:39:06,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:39:06,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:39:06,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:39:06,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:39:06,071 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:39:06,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:39:06,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:39:06,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:39:06,088 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:39:06,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:39:06,089 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:39:06,090 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:39:06,090 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:39:06,090 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:39:06,090 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:39:06,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:39:06,092 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:39:06,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:39:06,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:39:06,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:39:06,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:39:06,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:39:06,093 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:39:06,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:39:06,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:39:06,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:39:06,095 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:39:06,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:39:06,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:39:06,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:39:06,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:39:06,096 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:39:06,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:39:06,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:39:06,096 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:39:06,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:39:06,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:39:06,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:39:06,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:39:06,166 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:39:06,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 07:39:06,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e531bb2a2/495a19d41e5c40ac9a894e107aa6f4dd/FLAG17c7c3ad8 [2019-09-10 07:39:06,903 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:39:06,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 07:39:06,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e531bb2a2/495a19d41e5c40ac9a894e107aa6f4dd/FLAG17c7c3ad8 [2019-09-10 07:39:07,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e531bb2a2/495a19d41e5c40ac9a894e107aa6f4dd [2019-09-10 07:39:07,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:39:07,132 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:39:07,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:39:07,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:39:07,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:39:07,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:39:07" (1/1) ... [2019-09-10 07:39:07,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b15ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:07, skipping insertion in model container [2019-09-10 07:39:07,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:39:07" (1/1) ... [2019-09-10 07:39:07,149 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:39:07,245 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:39:08,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:39:08,076 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:39:08,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:39:08,553 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:39:08,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:08 WrapperNode [2019-09-10 07:39:08,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:39:08,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:39:08,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:39:08,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:39:08,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:08" (1/1) ... [2019-09-10 07:39:08,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:08" (1/1) ... [2019-09-10 07:39:08,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:08" (1/1) ... [2019-09-10 07:39:08,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:08" (1/1) ... [2019-09-10 07:39:08,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:08" (1/1) ... [2019-09-10 07:39:08,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:08" (1/1) ... [2019-09-10 07:39:08,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:08" (1/1) ... [2019-09-10 07:39:08,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:39:08,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:39:08,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:39:08,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:39:08,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:08" (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:39:08,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:39:08,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:39:08,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:39:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:39:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:39:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:39:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:39:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:39:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:39:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:39:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:39:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:39:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:39:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:39:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:39:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:39:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:39:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:39:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:39:10,578 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:39:10,578 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:39:10,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:39:10 BoogieIcfgContainer [2019-09-10 07:39:10,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:39:10,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:39:10,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:39:10,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:39:10,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:39:07" (1/3) ... [2019-09-10 07:39:10,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d9e9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:39:10, skipping insertion in model container [2019-09-10 07:39:10,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:39:08" (2/3) ... [2019-09-10 07:39:10,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d9e9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:39:10, skipping insertion in model container [2019-09-10 07:39:10,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:39:10" (3/3) ... [2019-09-10 07:39:10,588 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 07:39:10,599 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:39:10,621 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-10 07:39:10,642 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-10 07:39:10,679 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:39:10,679 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:39:10,679 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:39:10,679 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:39:10,680 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:39:10,680 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:39:10,680 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:39:10,680 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:39:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states. [2019-09-10 07:39:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 07:39:10,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:10,758 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] [2019-09-10 07:39:10,761 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2051434743, now seen corresponding path program 1 times [2019-09-10 07:39:10,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:10,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:10,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:10,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:11,314 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:39:11,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:11,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:11,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:11,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:11,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:11,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:11,381 INFO L87 Difference]: Start difference. First operand 363 states. Second operand 5 states. [2019-09-10 07:39:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:11,952 INFO L93 Difference]: Finished difference Result 444 states and 722 transitions. [2019-09-10 07:39:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:11,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-10 07:39:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:11,973 INFO L225 Difference]: With dead ends: 444 [2019-09-10 07:39:11,974 INFO L226 Difference]: Without dead ends: 432 [2019-09-10 07:39:11,976 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:39:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-10 07:39:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 390. [2019-09-10 07:39:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-09-10 07:39:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 512 transitions. [2019-09-10 07:39:12,048 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 512 transitions. Word has length 63 [2019-09-10 07:39:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:12,049 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 512 transitions. [2019-09-10 07:39:12,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 512 transitions. [2019-09-10 07:39:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:39:12,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:12,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] [2019-09-10 07:39:12,053 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:12,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:12,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1195165915, now seen corresponding path program 1 times [2019-09-10 07:39:12,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:12,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:12,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:12,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:12,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:12,253 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:39:12,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:12,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:12,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:12,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:12,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:12,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:12,262 INFO L87 Difference]: Start difference. First operand 390 states and 512 transitions. Second operand 5 states. [2019-09-10 07:39:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:12,547 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2019-09-10 07:39:12,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:12,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 07:39:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:12,551 INFO L225 Difference]: With dead ends: 364 [2019-09-10 07:39:12,552 INFO L226 Difference]: Without dead ends: 364 [2019-09-10 07:39:12,554 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:39:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-09-10 07:39:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2019-09-10 07:39:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-10 07:39:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2019-09-10 07:39:12,596 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 64 [2019-09-10 07:39:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:12,597 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2019-09-10 07:39:12,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2019-09-10 07:39:12,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:39:12,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:12,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:12,602 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash -477481019, now seen corresponding path program 1 times [2019-09-10 07:39:12,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:12,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:12,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:12,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:12,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:12,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 07:39:12,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:12,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:39:12,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:12,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:39:12,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:39:12,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:39:12,806 INFO L87 Difference]: Start difference. First operand 364 states and 480 transitions. Second operand 6 states. [2019-09-10 07:39:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:13,087 INFO L93 Difference]: Finished difference Result 517 states and 678 transitions. [2019-09-10 07:39:13,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:13,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-10 07:39:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:13,099 INFO L225 Difference]: With dead ends: 517 [2019-09-10 07:39:13,099 INFO L226 Difference]: Without dead ends: 517 [2019-09-10 07:39:13,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:39:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-10 07:39:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 477. [2019-09-10 07:39:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-10 07:39:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 645 transitions. [2019-09-10 07:39:13,127 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 645 transitions. Word has length 65 [2019-09-10 07:39:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:13,130 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 645 transitions. [2019-09-10 07:39:13,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:39:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 645 transitions. [2019-09-10 07:39:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:39:13,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:13,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:13,136 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1802107193, now seen corresponding path program 1 times [2019-09-10 07:39:13,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:13,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:13,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:13,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:13,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:13,276 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:39:13,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:13,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:13,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:13,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:13,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:13,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:13,278 INFO L87 Difference]: Start difference. First operand 477 states and 645 transitions. Second operand 5 states. [2019-09-10 07:39:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:13,531 INFO L93 Difference]: Finished difference Result 466 states and 629 transitions. [2019-09-10 07:39:13,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:13,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-10 07:39:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:13,536 INFO L225 Difference]: With dead ends: 466 [2019-09-10 07:39:13,536 INFO L226 Difference]: Without dead ends: 466 [2019-09-10 07:39:13,537 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:39:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-10 07:39:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-09-10 07:39:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-10 07:39:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 629 transitions. [2019-09-10 07:39:13,556 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 629 transitions. Word has length 66 [2019-09-10 07:39:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:13,557 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 629 transitions. [2019-09-10 07:39:13,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 629 transitions. [2019-09-10 07:39:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:39:13,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:13,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:13,560 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:13,560 INFO L82 PathProgramCache]: Analyzing trace with hash -350473883, now seen corresponding path program 1 times [2019-09-10 07:39:13,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:13,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:13,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:13,903 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:39:13,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:13,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:39:13,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:13,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:39:13,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:39:13,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:39:13,907 INFO L87 Difference]: Start difference. First operand 466 states and 629 transitions. Second operand 8 states. [2019-09-10 07:39:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:14,430 INFO L93 Difference]: Finished difference Result 814 states and 1127 transitions. [2019-09-10 07:39:14,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:39:14,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-09-10 07:39:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:14,435 INFO L225 Difference]: With dead ends: 814 [2019-09-10 07:39:14,436 INFO L226 Difference]: Without dead ends: 814 [2019-09-10 07:39:14,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:39:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-09-10 07:39:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 466. [2019-09-10 07:39:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-10 07:39:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 628 transitions. [2019-09-10 07:39:14,453 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 628 transitions. Word has length 67 [2019-09-10 07:39:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:14,453 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 628 transitions. [2019-09-10 07:39:14,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:39:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 628 transitions. [2019-09-10 07:39:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:39:14,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:14,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] [2019-09-10 07:39:14,456 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash 282133846, now seen corresponding path program 1 times [2019-09-10 07:39:14,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:14,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:14,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:14,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:14,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:14,674 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:39:14,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:14,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:14,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:14,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:14,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:14,677 INFO L87 Difference]: Start difference. First operand 466 states and 628 transitions. Second operand 9 states. [2019-09-10 07:39:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:15,928 INFO L93 Difference]: Finished difference Result 1007 states and 1430 transitions. [2019-09-10 07:39:15,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:39:15,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:39:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:15,936 INFO L225 Difference]: With dead ends: 1007 [2019-09-10 07:39:15,936 INFO L226 Difference]: Without dead ends: 1007 [2019-09-10 07:39:15,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:39:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-09-10 07:39:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 466. [2019-09-10 07:39:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-10 07:39:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 627 transitions. [2019-09-10 07:39:15,959 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 627 transitions. Word has length 67 [2019-09-10 07:39:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:15,961 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 627 transitions. [2019-09-10 07:39:15,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 627 transitions. [2019-09-10 07:39:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:39:15,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:15,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:15,968 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:15,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:15,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1203066546, now seen corresponding path program 1 times [2019-09-10 07:39:15,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:15,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:15,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:16,155 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:39:16,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:16,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:16,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:16,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:16,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:16,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:16,158 INFO L87 Difference]: Start difference. First operand 466 states and 627 transitions. Second operand 9 states. [2019-09-10 07:39:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:17,385 INFO L93 Difference]: Finished difference Result 1225 states and 1726 transitions. [2019-09-10 07:39:17,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:17,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:39:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:17,392 INFO L225 Difference]: With dead ends: 1225 [2019-09-10 07:39:17,392 INFO L226 Difference]: Without dead ends: 1225 [2019-09-10 07:39:17,393 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:39:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-10 07:39:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 466. [2019-09-10 07:39:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-10 07:39:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 626 transitions. [2019-09-10 07:39:17,414 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 626 transitions. Word has length 67 [2019-09-10 07:39:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:17,414 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 626 transitions. [2019-09-10 07:39:17,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 626 transitions. [2019-09-10 07:39:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:39:17,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:17,418 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] [2019-09-10 07:39:17,419 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:17,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:17,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1166947524, now seen corresponding path program 1 times [2019-09-10 07:39:17,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:17,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:17,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:17,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:17,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:17,591 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:39:17,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:17,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:17,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:17,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:17,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:17,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:17,595 INFO L87 Difference]: Start difference. First operand 466 states and 626 transitions. Second operand 9 states. [2019-09-10 07:39:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:18,780 INFO L93 Difference]: Finished difference Result 1007 states and 1427 transitions. [2019-09-10 07:39:18,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:39:18,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:39:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:18,786 INFO L225 Difference]: With dead ends: 1007 [2019-09-10 07:39:18,786 INFO L226 Difference]: Without dead ends: 1007 [2019-09-10 07:39:18,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:39:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-09-10 07:39:18,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 466. [2019-09-10 07:39:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-10 07:39:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 624 transitions. [2019-09-10 07:39:18,806 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 624 transitions. Word has length 69 [2019-09-10 07:39:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:18,806 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 624 transitions. [2019-09-10 07:39:18,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 624 transitions. [2019-09-10 07:39:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:39:18,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:18,808 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] [2019-09-10 07:39:18,808 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:18,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash 77892723, now seen corresponding path program 1 times [2019-09-10 07:39:18,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:18,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:18,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:18,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:18,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:18,966 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:39:18,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:18,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:18,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:18,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:18,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:18,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:18,967 INFO L87 Difference]: Start difference. First operand 466 states and 624 transitions. Second operand 9 states. [2019-09-10 07:39:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:20,036 INFO L93 Difference]: Finished difference Result 1201 states and 1682 transitions. [2019-09-10 07:39:20,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:20,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:39:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:20,041 INFO L225 Difference]: With dead ends: 1201 [2019-09-10 07:39:20,041 INFO L226 Difference]: Without dead ends: 1201 [2019-09-10 07:39:20,041 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:39:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-10 07:39:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 466. [2019-09-10 07:39:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-10 07:39:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 622 transitions. [2019-09-10 07:39:20,063 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 622 transitions. Word has length 69 [2019-09-10 07:39:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:20,063 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 622 transitions. [2019-09-10 07:39:20,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 622 transitions. [2019-09-10 07:39:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:39:20,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:20,065 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] [2019-09-10 07:39:20,065 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:20,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:20,065 INFO L82 PathProgramCache]: Analyzing trace with hash -307155438, now seen corresponding path program 1 times [2019-09-10 07:39:20,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:20,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:20,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:20,215 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:39:20,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:20,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:20,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:20,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:20,217 INFO L87 Difference]: Start difference. First operand 466 states and 622 transitions. Second operand 9 states. [2019-09-10 07:39:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:21,256 INFO L93 Difference]: Finished difference Result 1225 states and 1720 transitions. [2019-09-10 07:39:21,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:21,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:39:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:21,265 INFO L225 Difference]: With dead ends: 1225 [2019-09-10 07:39:21,265 INFO L226 Difference]: Without dead ends: 1225 [2019-09-10 07:39:21,266 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:39:21,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-10 07:39:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 466. [2019-09-10 07:39:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-10 07:39:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 620 transitions. [2019-09-10 07:39:21,287 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 620 transitions. Word has length 69 [2019-09-10 07:39:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:21,287 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 620 transitions. [2019-09-10 07:39:21,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 620 transitions. [2019-09-10 07:39:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:39:21,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:21,290 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] [2019-09-10 07:39:21,290 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:21,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2116702936, now seen corresponding path program 1 times [2019-09-10 07:39:21,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:21,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:21,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:21,438 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:39:21,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:21,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:21,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:21,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:21,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:21,440 INFO L87 Difference]: Start difference. First operand 466 states and 620 transitions. Second operand 9 states. [2019-09-10 07:39:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:22,554 INFO L93 Difference]: Finished difference Result 1225 states and 1718 transitions. [2019-09-10 07:39:22,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:22,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:39:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:22,562 INFO L225 Difference]: With dead ends: 1225 [2019-09-10 07:39:22,562 INFO L226 Difference]: Without dead ends: 1225 [2019-09-10 07:39:22,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:39:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-10 07:39:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 466. [2019-09-10 07:39:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-10 07:39:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 619 transitions. [2019-09-10 07:39:22,584 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 619 transitions. Word has length 69 [2019-09-10 07:39:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:22,584 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 619 transitions. [2019-09-10 07:39:22,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 619 transitions. [2019-09-10 07:39:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:39:22,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:22,585 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:22,586 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:22,587 INFO L82 PathProgramCache]: Analyzing trace with hash 249107848, now seen corresponding path program 1 times [2019-09-10 07:39:22,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:22,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:22,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:22,756 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:39:22,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:22,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:22,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:22,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:22,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:22,759 INFO L87 Difference]: Start difference. First operand 466 states and 619 transitions. Second operand 9 states. [2019-09-10 07:39:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:23,632 INFO L93 Difference]: Finished difference Result 1201 states and 1678 transitions. [2019-09-10 07:39:23,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:23,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:39:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:23,639 INFO L225 Difference]: With dead ends: 1201 [2019-09-10 07:39:23,639 INFO L226 Difference]: Without dead ends: 1201 [2019-09-10 07:39:23,640 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:39:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-10 07:39:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 466. [2019-09-10 07:39:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-10 07:39:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 618 transitions. [2019-09-10 07:39:23,658 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 618 transitions. Word has length 69 [2019-09-10 07:39:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:23,658 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 618 transitions. [2019-09-10 07:39:23,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 618 transitions. [2019-09-10 07:39:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:39:23,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:23,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] [2019-09-10 07:39:23,660 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:23,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:23,660 INFO L82 PathProgramCache]: Analyzing trace with hash -913030277, now seen corresponding path program 1 times [2019-09-10 07:39:23,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:23,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:23,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:23,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:23,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:23,786 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:39:23,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:23,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:23,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:23,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:23,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:23,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:23,788 INFO L87 Difference]: Start difference. First operand 466 states and 618 transitions. Second operand 9 states. [2019-09-10 07:39:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:24,855 INFO L93 Difference]: Finished difference Result 1201 states and 1676 transitions. [2019-09-10 07:39:24,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:24,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:39:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:24,863 INFO L225 Difference]: With dead ends: 1201 [2019-09-10 07:39:24,863 INFO L226 Difference]: Without dead ends: 1201 [2019-09-10 07:39:24,863 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:39:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-10 07:39:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 466. [2019-09-10 07:39:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-10 07:39:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 617 transitions. [2019-09-10 07:39:24,880 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 617 transitions. Word has length 69 [2019-09-10 07:39:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:24,880 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 617 transitions. [2019-09-10 07:39:24,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 617 transitions. [2019-09-10 07:39:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:39:24,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:24,881 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] [2019-09-10 07:39:24,882 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:24,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:24,882 INFO L82 PathProgramCache]: Analyzing trace with hash 360843612, now seen corresponding path program 1 times [2019-09-10 07:39:24,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:24,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:24,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:24,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:24,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:25,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:25,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:25,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:25,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:25,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:25,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:25,002 INFO L87 Difference]: Start difference. First operand 466 states and 617 transitions. Second operand 9 states. [2019-09-10 07:39:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:25,851 INFO L93 Difference]: Finished difference Result 1201 states and 1675 transitions. [2019-09-10 07:39:25,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:25,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:39:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:25,858 INFO L225 Difference]: With dead ends: 1201 [2019-09-10 07:39:25,859 INFO L226 Difference]: Without dead ends: 1201 [2019-09-10 07:39:25,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:39:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-10 07:39:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 466. [2019-09-10 07:39:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-10 07:39:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 616 transitions. [2019-09-10 07:39:25,875 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 616 transitions. Word has length 69 [2019-09-10 07:39:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:25,875 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 616 transitions. [2019-09-10 07:39:25,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 616 transitions. [2019-09-10 07:39:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:39:25,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:25,877 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] [2019-09-10 07:39:25,877 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:25,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:25,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2098110889, now seen corresponding path program 1 times [2019-09-10 07:39:25,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:25,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:25,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:25,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:25,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:26,689 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:39:26,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:26,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:39:26,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:26,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:39:26,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:39:26,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:39:26,691 INFO L87 Difference]: Start difference. First operand 466 states and 616 transitions. Second operand 16 states. [2019-09-10 07:39:27,385 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:39:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:28,918 INFO L93 Difference]: Finished difference Result 1154 states and 1564 transitions. [2019-09-10 07:39:28,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:39:28,919 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-10 07:39:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:28,924 INFO L225 Difference]: With dead ends: 1154 [2019-09-10 07:39:28,924 INFO L226 Difference]: Without dead ends: 1154 [2019-09-10 07:39:28,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:39:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-09-10 07:39:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 465. [2019-09-10 07:39:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:39:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 614 transitions. [2019-09-10 07:39:28,965 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 614 transitions. Word has length 71 [2019-09-10 07:39:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:28,966 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 614 transitions. [2019-09-10 07:39:28,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:39:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 614 transitions. [2019-09-10 07:39:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:39:28,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:28,967 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] [2019-09-10 07:39:28,967 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:28,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:28,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1752408440, now seen corresponding path program 1 times [2019-09-10 07:39:28,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:28,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:28,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:28,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:28,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:30,196 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:39:30,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:30,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:39:30,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:30,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:39:30,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:39:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:39:30,198 INFO L87 Difference]: Start difference. First operand 465 states and 614 transitions. Second operand 21 states. [2019-09-10 07:39:30,673 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-09-10 07:39:30,927 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:39:31,067 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:39:31,235 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:39:31,477 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 07:39:31,844 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-10 07:39:32,031 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:39:32,207 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:39:32,378 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:39:32,653 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:39:32,909 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:39:33,109 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:39:33,384 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:39:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:35,125 INFO L93 Difference]: Finished difference Result 958 states and 1281 transitions. [2019-09-10 07:39:35,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:39:35,125 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-09-10 07:39:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:35,129 INFO L225 Difference]: With dead ends: 958 [2019-09-10 07:39:35,129 INFO L226 Difference]: Without dead ends: 958 [2019-09-10 07:39:35,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:39:35,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2019-09-10 07:39:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 465. [2019-09-10 07:39:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:39:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 613 transitions. [2019-09-10 07:39:35,141 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 613 transitions. Word has length 71 [2019-09-10 07:39:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:35,141 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 613 transitions. [2019-09-10 07:39:35,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:39:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 613 transitions. [2019-09-10 07:39:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:39:35,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:35,142 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] [2019-09-10 07:39:35,143 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash 841585007, now seen corresponding path program 1 times [2019-09-10 07:39:35,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:35,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:35,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:35,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:35,801 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:39:35,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:35,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:39:35,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:35,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:39:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:39:35,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:39:35,802 INFO L87 Difference]: Start difference. First operand 465 states and 613 transitions. Second operand 17 states. [2019-09-10 07:39:36,369 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:39:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:37,177 INFO L93 Difference]: Finished difference Result 600 states and 801 transitions. [2019-09-10 07:39:37,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:39:37,177 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2019-09-10 07:39:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:37,180 INFO L225 Difference]: With dead ends: 600 [2019-09-10 07:39:37,181 INFO L226 Difference]: Without dead ends: 600 [2019-09-10 07:39:37,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:39:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-09-10 07:39:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 446. [2019-09-10 07:39:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-10 07:39:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 589 transitions. [2019-09-10 07:39:37,190 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 589 transitions. Word has length 71 [2019-09-10 07:39:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:37,190 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 589 transitions. [2019-09-10 07:39:37,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:39:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 589 transitions. [2019-09-10 07:39:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:39:37,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:37,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:37,192 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:37,192 INFO L82 PathProgramCache]: Analyzing trace with hash 176129943, now seen corresponding path program 1 times [2019-09-10 07:39:37,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:37,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:37,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:37,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:37,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:38,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:38,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:39:38,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:38,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:39:38,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:39:38,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:39:38,533 INFO L87 Difference]: Start difference. First operand 446 states and 589 transitions. Second operand 21 states. [2019-09-10 07:39:38,663 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:39:39,454 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:39:39,651 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 07:39:39,928 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 07:39:40,116 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:39:40,306 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:39:40,537 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:39:41,227 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:39:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:42,424 INFO L93 Difference]: Finished difference Result 806 states and 1080 transitions. [2019-09-10 07:39:42,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:39:42,425 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-09-10 07:39:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:42,429 INFO L225 Difference]: With dead ends: 806 [2019-09-10 07:39:42,429 INFO L226 Difference]: Without dead ends: 806 [2019-09-10 07:39:42,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:39:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-09-10 07:39:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 456. [2019-09-10 07:39:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-10 07:39:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 604 transitions. [2019-09-10 07:39:42,438 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 604 transitions. Word has length 71 [2019-09-10 07:39:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:42,439 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 604 transitions. [2019-09-10 07:39:42,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:39:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 604 transitions. [2019-09-10 07:39:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:39:42,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:42,440 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] [2019-09-10 07:39:42,441 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2101080436, now seen corresponding path program 1 times [2019-09-10 07:39:42,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:42,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:42,948 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:39:42,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:42,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:39:42,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:42,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:39:42,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:39:42,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:39:42,950 INFO L87 Difference]: Start difference. First operand 456 states and 604 transitions. Second operand 14 states. [2019-09-10 07:39:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:44,346 INFO L93 Difference]: Finished difference Result 701 states and 970 transitions. [2019-09-10 07:39:44,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:39:44,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-09-10 07:39:44,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:44,351 INFO L225 Difference]: With dead ends: 701 [2019-09-10 07:39:44,351 INFO L226 Difference]: Without dead ends: 701 [2019-09-10 07:39:44,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:39:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-09-10 07:39:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 429. [2019-09-10 07:39:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-09-10 07:39:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 570 transitions. [2019-09-10 07:39:44,361 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 570 transitions. Word has length 71 [2019-09-10 07:39:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:44,361 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 570 transitions. [2019-09-10 07:39:44,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:39:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 570 transitions. [2019-09-10 07:39:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:39:44,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:44,363 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] [2019-09-10 07:39:44,363 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:44,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1738970789, now seen corresponding path program 1 times [2019-09-10 07:39:44,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:44,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:44,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:44,753 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:39:44,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:44,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:39:44,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:44,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:39:44,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:39:44,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:39:44,755 INFO L87 Difference]: Start difference. First operand 429 states and 570 transitions. Second operand 11 states. [2019-09-10 07:39:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:45,498 INFO L93 Difference]: Finished difference Result 2211 states and 3198 transitions. [2019-09-10 07:39:45,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:45,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-10 07:39:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:45,511 INFO L225 Difference]: With dead ends: 2211 [2019-09-10 07:39:45,512 INFO L226 Difference]: Without dead ends: 2211 [2019-09-10 07:39:45,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:39:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2019-09-10 07:39:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 397. [2019-09-10 07:39:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 07:39:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 525 transitions. [2019-09-10 07:39:45,527 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 525 transitions. Word has length 72 [2019-09-10 07:39:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:45,527 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 525 transitions. [2019-09-10 07:39:45,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:39:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 525 transitions. [2019-09-10 07:39:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:39:45,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:45,528 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] [2019-09-10 07:39:45,529 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:45,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1749461620, now seen corresponding path program 1 times [2019-09-10 07:39:45,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:45,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:45,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:45,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:45,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:45,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:45,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:39:45,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:45,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:39:45,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:39:45,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:39:45,944 INFO L87 Difference]: Start difference. First operand 397 states and 525 transitions. Second operand 13 states. [2019-09-10 07:39:46,594 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-09-10 07:39:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:47,121 INFO L93 Difference]: Finished difference Result 1475 states and 2131 transitions. [2019-09-10 07:39:47,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:39:47,121 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-09-10 07:39:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:47,127 INFO L225 Difference]: With dead ends: 1475 [2019-09-10 07:39:47,128 INFO L226 Difference]: Without dead ends: 1475 [2019-09-10 07:39:47,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:39:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-09-10 07:39:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 375. [2019-09-10 07:39:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-10 07:39:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 500 transitions. [2019-09-10 07:39:47,139 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 500 transitions. Word has length 72 [2019-09-10 07:39:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:47,139 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 500 transitions. [2019-09-10 07:39:47,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:39:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 500 transitions. [2019-09-10 07:39:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:39:47,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:47,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] [2019-09-10 07:39:47,141 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1380903087, now seen corresponding path program 1 times [2019-09-10 07:39:47,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:47,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:47,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:47,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:47,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:47,281 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:39:47,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:47,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:47,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:47,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:47,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:47,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:47,284 INFO L87 Difference]: Start difference. First operand 375 states and 500 transitions. Second operand 9 states. [2019-09-10 07:39:47,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:47,980 INFO L93 Difference]: Finished difference Result 1073 states and 1518 transitions. [2019-09-10 07:39:47,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:47,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 07:39:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:47,985 INFO L225 Difference]: With dead ends: 1073 [2019-09-10 07:39:47,985 INFO L226 Difference]: Without dead ends: 1073 [2019-09-10 07:39:47,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:39:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2019-09-10 07:39:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 375. [2019-09-10 07:39:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-10 07:39:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2019-09-10 07:39:47,994 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 72 [2019-09-10 07:39:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:47,994 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2019-09-10 07:39:47,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2019-09-10 07:39:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:39:47,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:47,995 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] [2019-09-10 07:39:47,996 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:47,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1779169883, now seen corresponding path program 1 times [2019-09-10 07:39:47,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:47,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:47,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:47,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:47,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:48,311 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:39:48,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:48,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:39:48,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:48,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:39:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:39:48,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:39:48,313 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 11 states. [2019-09-10 07:39:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:48,886 INFO L93 Difference]: Finished difference Result 2100 states and 3068 transitions. [2019-09-10 07:39:48,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:48,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-10 07:39:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:48,894 INFO L225 Difference]: With dead ends: 2100 [2019-09-10 07:39:48,894 INFO L226 Difference]: Without dead ends: 2100 [2019-09-10 07:39:48,895 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 07:39:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-09-10 07:39:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 360. [2019-09-10 07:39:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-10 07:39:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 479 transitions. [2019-09-10 07:39:48,907 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 479 transitions. Word has length 72 [2019-09-10 07:39:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:48,908 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 479 transitions. [2019-09-10 07:39:48,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:39:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 479 transitions. [2019-09-10 07:39:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:39:48,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:48,909 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] [2019-09-10 07:39:48,910 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash 949044476, now seen corresponding path program 1 times [2019-09-10 07:39:48,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:48,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:48,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:48,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:48,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:49,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:49,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:39:49,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:49,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:39:49,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:39:49,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:39:49,271 INFO L87 Difference]: Start difference. First operand 360 states and 479 transitions. Second operand 12 states. [2019-09-10 07:39:49,658 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 07:39:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:50,238 INFO L93 Difference]: Finished difference Result 640 states and 867 transitions. [2019-09-10 07:39:50,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:39:50,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-09-10 07:39:50,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:50,242 INFO L225 Difference]: With dead ends: 640 [2019-09-10 07:39:50,242 INFO L226 Difference]: Without dead ends: 640 [2019-09-10 07:39:50,243 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 07:39:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-10 07:39:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 356. [2019-09-10 07:39:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-10 07:39:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 474 transitions. [2019-09-10 07:39:50,254 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 474 transitions. Word has length 72 [2019-09-10 07:39:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:50,255 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 474 transitions. [2019-09-10 07:39:50,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:39:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 474 transitions. [2019-09-10 07:39:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:39:50,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:50,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:50,257 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:50,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:50,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1698523617, now seen corresponding path program 1 times [2019-09-10 07:39:50,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:50,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:50,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:50,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:50,444 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:39:50,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:50,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:50,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:50,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:50,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:50,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:50,446 INFO L87 Difference]: Start difference. First operand 356 states and 474 transitions. Second operand 9 states. [2019-09-10 07:39:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:51,049 INFO L93 Difference]: Finished difference Result 632 states and 859 transitions. [2019-09-10 07:39:51,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:39:51,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 07:39:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:51,055 INFO L225 Difference]: With dead ends: 632 [2019-09-10 07:39:51,055 INFO L226 Difference]: Without dead ends: 632 [2019-09-10 07:39:51,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:39:51,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-10 07:39:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 356. [2019-09-10 07:39:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-10 07:39:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 473 transitions. [2019-09-10 07:39:51,063 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 473 transitions. Word has length 73 [2019-09-10 07:39:51,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:51,063 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 473 transitions. [2019-09-10 07:39:51,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 473 transitions. [2019-09-10 07:39:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:39:51,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:51,064 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] [2019-09-10 07:39:51,064 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1821871537, now seen corresponding path program 1 times [2019-09-10 07:39:51,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:51,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:51,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:51,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:51,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:52,119 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:39:52,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:52,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:39:52,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:52,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:39:52,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:39:52,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:39:52,120 INFO L87 Difference]: Start difference. First operand 356 states and 473 transitions. Second operand 21 states. [2019-09-10 07:39:52,261 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 07:39:52,702 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 07:39:52,845 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-10 07:39:53,040 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:39:53,207 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:39:53,425 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:39:53,614 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:39:53,798 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:39:54,079 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:39:54,577 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:39:55,979 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 07:39:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:56,389 INFO L93 Difference]: Finished difference Result 2130 states and 3096 transitions. [2019-09-10 07:39:56,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:39:56,390 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2019-09-10 07:39:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:56,395 INFO L225 Difference]: With dead ends: 2130 [2019-09-10 07:39:56,396 INFO L226 Difference]: Without dead ends: 2130 [2019-09-10 07:39:56,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:39:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-09-10 07:39:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 368. [2019-09-10 07:39:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-10 07:39:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 488 transitions. [2019-09-10 07:39:56,412 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 488 transitions. Word has length 74 [2019-09-10 07:39:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:56,412 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 488 transitions. [2019-09-10 07:39:56,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:39:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 488 transitions. [2019-09-10 07:39:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:39:56,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:56,413 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:56,414 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:56,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:56,414 INFO L82 PathProgramCache]: Analyzing trace with hash -242218485, now seen corresponding path program 1 times [2019-09-10 07:39:56,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:56,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:56,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:56,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:56,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:57,144 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:39:57,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:57,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:39:57,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:57,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:39:57,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:39:57,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:39:57,146 INFO L87 Difference]: Start difference. First operand 368 states and 488 transitions. Second operand 16 states. [2019-09-10 07:39:57,802 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:39:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:59,319 INFO L93 Difference]: Finished difference Result 1810 states and 2615 transitions. [2019-09-10 07:39:59,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:39:59,323 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-09-10 07:39:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:59,327 INFO L225 Difference]: With dead ends: 1810 [2019-09-10 07:39:59,328 INFO L226 Difference]: Without dead ends: 1810 [2019-09-10 07:39:59,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:39:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2019-09-10 07:39:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 356. [2019-09-10 07:39:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-10 07:39:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 472 transitions. [2019-09-10 07:39:59,341 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 472 transitions. Word has length 75 [2019-09-10 07:39:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:59,342 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 472 transitions. [2019-09-10 07:39:59,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:39:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 472 transitions. [2019-09-10 07:39:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:39:59,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:59,343 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:39:59,343 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash 322835229, now seen corresponding path program 1 times [2019-09-10 07:39:59,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:59,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:59,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:59,698 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:39:59,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:59,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:39:59,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:59,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:39:59,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:39:59,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:39:59,699 INFO L87 Difference]: Start difference. First operand 356 states and 472 transitions. Second operand 12 states. [2019-09-10 07:40:00,103 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 07:40:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:00,807 INFO L93 Difference]: Finished difference Result 1052 states and 1487 transitions. [2019-09-10 07:40:00,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:40:00,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2019-09-10 07:40:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:00,809 INFO L225 Difference]: With dead ends: 1052 [2019-09-10 07:40:00,809 INFO L226 Difference]: Without dead ends: 1052 [2019-09-10 07:40:00,810 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 07:40:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-09-10 07:40:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 350. [2019-09-10 07:40:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-09-10 07:40:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 466 transitions. [2019-09-10 07:40:00,819 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 466 transitions. Word has length 75 [2019-09-10 07:40:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:00,820 INFO L475 AbstractCegarLoop]: Abstraction has 350 states and 466 transitions. [2019-09-10 07:40:00,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:40:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 466 transitions. [2019-09-10 07:40:00,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:40:00,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:00,828 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:40:00,828 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:00,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1485666102, now seen corresponding path program 1 times [2019-09-10 07:40:00,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:00,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:00,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:02,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 07:40:02,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:02,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 07:40:02,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:02,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:40:02,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:40:02,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:40:02,143 INFO L87 Difference]: Start difference. First operand 350 states and 466 transitions. Second operand 23 states. [2019-09-10 07:40:03,186 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:40:03,410 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:40:03,573 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:40:03,734 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:40:03,893 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:40:04,050 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 07:40:04,192 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:40:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:05,467 INFO L93 Difference]: Finished difference Result 788 states and 1112 transitions. [2019-09-10 07:40:05,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:40:05,468 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2019-09-10 07:40:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:05,470 INFO L225 Difference]: With dead ends: 788 [2019-09-10 07:40:05,470 INFO L226 Difference]: Without dead ends: 788 [2019-09-10 07:40:05,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:40:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-10 07:40:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 355. [2019-09-10 07:40:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-10 07:40:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 471 transitions. [2019-09-10 07:40:05,478 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 471 transitions. Word has length 75 [2019-09-10 07:40:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:05,479 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 471 transitions. [2019-09-10 07:40:05,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:40:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 471 transitions. [2019-09-10 07:40:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:40:05,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:05,480 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:40:05,480 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:05,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash -333093647, now seen corresponding path program 1 times [2019-09-10 07:40:05,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:05,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:05,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:06,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:06,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:40:06,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:06,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:40:06,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:40:06,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:40:06,833 INFO L87 Difference]: Start difference. First operand 355 states and 471 transitions. Second operand 21 states. [2019-09-10 07:40:07,094 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:40:07,365 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 07:40:07,496 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-10 07:40:07,630 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-09-10 07:40:07,822 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:40:08,063 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 07:40:08,324 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:40:08,637 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:40:08,933 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:40:09,270 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 07:40:09,619 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 07:40:09,906 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:40:10,286 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 07:40:10,565 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:40:10,877 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:40:11,172 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:40:11,468 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:40:11,770 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:40:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:12,093 INFO L93 Difference]: Finished difference Result 350 states and 464 transitions. [2019-09-10 07:40:12,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:40:12,094 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-10 07:40:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:12,095 INFO L225 Difference]: With dead ends: 350 [2019-09-10 07:40:12,095 INFO L226 Difference]: Without dead ends: 349 [2019-09-10 07:40:12,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=351, Invalid=1209, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:40:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-10 07:40:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2019-09-10 07:40:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-10 07:40:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 463 transitions. [2019-09-10 07:40:12,101 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 463 transitions. Word has length 76 [2019-09-10 07:40:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:12,101 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 463 transitions. [2019-09-10 07:40:12,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:40:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 463 transitions. [2019-09-10 07:40:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:40:12,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:12,102 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:40:12,103 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash 936148827, now seen corresponding path program 1 times [2019-09-10 07:40:12,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:12,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:12,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:12,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:12,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:12,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 07:40:12,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:12,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:40:12,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:12,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:40:12,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:40:12,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:40:12,696 INFO L87 Difference]: Start difference. First operand 349 states and 463 transitions. Second operand 15 states. [2019-09-10 07:40:13,606 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:40:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:14,004 INFO L93 Difference]: Finished difference Result 694 states and 969 transitions. [2019-09-10 07:40:14,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:40:14,004 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2019-09-10 07:40:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:14,006 INFO L225 Difference]: With dead ends: 694 [2019-09-10 07:40:14,006 INFO L226 Difference]: Without dead ends: 680 [2019-09-10 07:40:14,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:40:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-10 07:40:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 326. [2019-09-10 07:40:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-10 07:40:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 440 transitions. [2019-09-10 07:40:14,012 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 440 transitions. Word has length 76 [2019-09-10 07:40:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:14,013 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 440 transitions. [2019-09-10 07:40:14,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:40:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 440 transitions. [2019-09-10 07:40:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:40:14,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:14,014 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] [2019-09-10 07:40:14,015 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash -785407461, now seen corresponding path program 1 times [2019-09-10 07:40:14,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:14,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:14,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:14,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:14,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:14,078 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:40:14,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:14,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:14,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:14,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:14,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:14,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:14,080 INFO L87 Difference]: Start difference. First operand 326 states and 440 transitions. Second operand 3 states. [2019-09-10 07:40:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:14,109 INFO L93 Difference]: Finished difference Result 518 states and 717 transitions. [2019-09-10 07:40:14,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:14,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 07:40:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:14,111 INFO L225 Difference]: With dead ends: 518 [2019-09-10 07:40:14,111 INFO L226 Difference]: Without dead ends: 518 [2019-09-10 07:40:14,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-09-10 07:40:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 516. [2019-09-10 07:40:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-10 07:40:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 716 transitions. [2019-09-10 07:40:14,119 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 716 transitions. Word has length 97 [2019-09-10 07:40:14,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:14,120 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 716 transitions. [2019-09-10 07:40:14,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 716 transitions. [2019-09-10 07:40:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:40:14,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:14,122 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] [2019-09-10 07:40:14,122 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1930087174, now seen corresponding path program 1 times [2019-09-10 07:40:14,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:14,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:14,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:14,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:14,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:14,184 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:40:14,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:14,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:40:14,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:14,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:40:14,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:40:14,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:40:14,188 INFO L87 Difference]: Start difference. First operand 516 states and 716 transitions. Second operand 5 states. [2019-09-10 07:40:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:14,412 INFO L93 Difference]: Finished difference Result 2022 states and 2875 transitions. [2019-09-10 07:40:14,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:40:14,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 07:40:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:14,416 INFO L225 Difference]: With dead ends: 2022 [2019-09-10 07:40:14,416 INFO L226 Difference]: Without dead ends: 2022 [2019-09-10 07:40:14,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2019-09-10 07:40:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 952. [2019-09-10 07:40:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-09-10 07:40:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1344 transitions. [2019-09-10 07:40:14,435 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1344 transitions. Word has length 99 [2019-09-10 07:40:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:14,435 INFO L475 AbstractCegarLoop]: Abstraction has 952 states and 1344 transitions. [2019-09-10 07:40:14,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:40:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1344 transitions. [2019-09-10 07:40:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:40:14,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:14,437 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] [2019-09-10 07:40:14,438 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash -943241466, now seen corresponding path program 1 times [2019-09-10 07:40:14,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:14,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:14,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:14,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:14,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:40:14,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:14,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:40:14,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:40:14,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:40:14,504 INFO L87 Difference]: Start difference. First operand 952 states and 1344 transitions. Second operand 5 states. [2019-09-10 07:40:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:14,732 INFO L93 Difference]: Finished difference Result 3422 states and 4803 transitions. [2019-09-10 07:40:14,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:40:14,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 07:40:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:14,739 INFO L225 Difference]: With dead ends: 3422 [2019-09-10 07:40:14,739 INFO L226 Difference]: Without dead ends: 3422 [2019-09-10 07:40:14,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2019-09-10 07:40:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 1848. [2019-09-10 07:40:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-09-10 07:40:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2624 transitions. [2019-09-10 07:40:14,797 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2624 transitions. Word has length 99 [2019-09-10 07:40:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:14,797 INFO L475 AbstractCegarLoop]: Abstraction has 1848 states and 2624 transitions. [2019-09-10 07:40:14,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:40:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2624 transitions. [2019-09-10 07:40:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:40:14,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:14,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:14,807 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash 703943869, now seen corresponding path program 1 times [2019-09-10 07:40:14,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:14,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:14,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:14,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:14,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:14,869 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:40:14,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:14,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:14,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:14,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:14,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:14,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:14,870 INFO L87 Difference]: Start difference. First operand 1848 states and 2624 transitions. Second operand 3 states. [2019-09-10 07:40:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:14,905 INFO L93 Difference]: Finished difference Result 2746 states and 3897 transitions. [2019-09-10 07:40:14,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:14,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:40:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:14,911 INFO L225 Difference]: With dead ends: 2746 [2019-09-10 07:40:14,911 INFO L226 Difference]: Without dead ends: 2746 [2019-09-10 07:40:14,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2019-09-10 07:40:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2744. [2019-09-10 07:40:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2019-09-10 07:40:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 3896 transitions. [2019-09-10 07:40:14,946 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 3896 transitions. Word has length 99 [2019-09-10 07:40:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:14,946 INFO L475 AbstractCegarLoop]: Abstraction has 2744 states and 3896 transitions. [2019-09-10 07:40:14,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3896 transitions. [2019-09-10 07:40:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:40:14,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:14,949 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] [2019-09-10 07:40:14,949 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:14,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash -35796452, now seen corresponding path program 1 times [2019-09-10 07:40:14,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:14,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:14,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:14,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:15,001 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:40:15,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:15,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:15,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:15,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:15,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:15,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:15,003 INFO L87 Difference]: Start difference. First operand 2744 states and 3896 transitions. Second operand 3 states. [2019-09-10 07:40:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:15,033 INFO L93 Difference]: Finished difference Result 4074 states and 5693 transitions. [2019-09-10 07:40:15,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:15,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:40:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:15,041 INFO L225 Difference]: With dead ends: 4074 [2019-09-10 07:40:15,042 INFO L226 Difference]: Without dead ends: 4074 [2019-09-10 07:40:15,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4074 states. [2019-09-10 07:40:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4074 to 4072. [2019-09-10 07:40:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4072 states. [2019-09-10 07:40:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 5692 transitions. [2019-09-10 07:40:15,089 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 5692 transitions. Word has length 99 [2019-09-10 07:40:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:15,090 INFO L475 AbstractCegarLoop]: Abstraction has 4072 states and 5692 transitions. [2019-09-10 07:40:15,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 5692 transitions. [2019-09-10 07:40:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:40:15,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:15,092 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] [2019-09-10 07:40:15,092 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:15,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:15,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2062661056, now seen corresponding path program 1 times [2019-09-10 07:40:15,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:15,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:15,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:15,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:15,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:15,152 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:40:15,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:15,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:40:15,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:15,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:40:15,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:40:15,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:40:15,156 INFO L87 Difference]: Start difference. First operand 4072 states and 5692 transitions. Second operand 5 states. [2019-09-10 07:40:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:15,391 INFO L93 Difference]: Finished difference Result 13242 states and 18155 transitions. [2019-09-10 07:40:15,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:40:15,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 07:40:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:15,415 INFO L225 Difference]: With dead ends: 13242 [2019-09-10 07:40:15,416 INFO L226 Difference]: Without dead ends: 13242 [2019-09-10 07:40:15,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13242 states. [2019-09-10 07:40:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13242 to 8312. [2019-09-10 07:40:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8312 states. [2019-09-10 07:40:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8312 states to 8312 states and 11544 transitions. [2019-09-10 07:40:15,567 INFO L78 Accepts]: Start accepts. Automaton has 8312 states and 11544 transitions. Word has length 99 [2019-09-10 07:40:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:15,569 INFO L475 AbstractCegarLoop]: Abstraction has 8312 states and 11544 transitions. [2019-09-10 07:40:15,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:40:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8312 states and 11544 transitions. [2019-09-10 07:40:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:40:15,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:15,573 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] [2019-09-10 07:40:15,573 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:15,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1021442252, now seen corresponding path program 1 times [2019-09-10 07:40:15,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:15,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:15,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:15,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:15,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:15,634 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:40:15,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:15,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:40:15,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:15,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:40:15,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:40:15,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:40:15,635 INFO L87 Difference]: Start difference. First operand 8312 states and 11544 transitions. Second operand 5 states. [2019-09-10 07:40:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:15,834 INFO L93 Difference]: Finished difference Result 17902 states and 24275 transitions. [2019-09-10 07:40:15,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:40:15,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 07:40:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:15,860 INFO L225 Difference]: With dead ends: 17902 [2019-09-10 07:40:15,860 INFO L226 Difference]: Without dead ends: 17902 [2019-09-10 07:40:15,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17902 states. [2019-09-10 07:40:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17902 to 10320. [2019-09-10 07:40:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10320 states. [2019-09-10 07:40:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10320 states to 10320 states and 14040 transitions. [2019-09-10 07:40:16,036 INFO L78 Accepts]: Start accepts. Automaton has 10320 states and 14040 transitions. Word has length 99 [2019-09-10 07:40:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:16,036 INFO L475 AbstractCegarLoop]: Abstraction has 10320 states and 14040 transitions. [2019-09-10 07:40:16,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:40:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 10320 states and 14040 transitions. [2019-09-10 07:40:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:40:16,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:16,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:16,040 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:16,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:16,040 INFO L82 PathProgramCache]: Analyzing trace with hash 288255902, now seen corresponding path program 1 times [2019-09-10 07:40:16,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:16,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:16,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:16,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:16,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:16,136 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:40:16,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:16,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:40:16,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:16,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:40:16,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:40:16,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:40:16,138 INFO L87 Difference]: Start difference. First operand 10320 states and 14040 transitions. Second operand 6 states. [2019-09-10 07:40:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:16,255 INFO L93 Difference]: Finished difference Result 17034 states and 22740 transitions. [2019-09-10 07:40:16,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:40:16,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-10 07:40:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:16,277 INFO L225 Difference]: With dead ends: 17034 [2019-09-10 07:40:16,278 INFO L226 Difference]: Without dead ends: 17034 [2019-09-10 07:40:16,278 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 07:40:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17034 states. [2019-09-10 07:40:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17034 to 10512. [2019-09-10 07:40:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10512 states. [2019-09-10 07:40:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10512 states to 10512 states and 14168 transitions. [2019-09-10 07:40:16,518 INFO L78 Accepts]: Start accepts. Automaton has 10512 states and 14168 transitions. Word has length 100 [2019-09-10 07:40:16,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:16,519 INFO L475 AbstractCegarLoop]: Abstraction has 10512 states and 14168 transitions. [2019-09-10 07:40:16,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:40:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 10512 states and 14168 transitions. [2019-09-10 07:40:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:40:16,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:16,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:16,522 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash -693244254, now seen corresponding path program 1 times [2019-09-10 07:40:16,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:16,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:16,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:16,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:16,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:16,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:16,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:16,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:16,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:16,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:16,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:16,583 INFO L87 Difference]: Start difference. First operand 10512 states and 14168 transitions. Second operand 3 states. [2019-09-10 07:40:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:16,637 INFO L93 Difference]: Finished difference Result 15642 states and 20881 transitions. [2019-09-10 07:40:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:16,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:40:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:16,655 INFO L225 Difference]: With dead ends: 15642 [2019-09-10 07:40:16,655 INFO L226 Difference]: Without dead ends: 15642 [2019-09-10 07:40:16,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15642 states. [2019-09-10 07:40:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15642 to 11412. [2019-09-10 07:40:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11412 states. [2019-09-10 07:40:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11412 states to 11412 states and 15344 transitions. [2019-09-10 07:40:16,802 INFO L78 Accepts]: Start accepts. Automaton has 11412 states and 15344 transitions. Word has length 100 [2019-09-10 07:40:16,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:16,803 INFO L475 AbstractCegarLoop]: Abstraction has 11412 states and 15344 transitions. [2019-09-10 07:40:16,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 11412 states and 15344 transitions. [2019-09-10 07:40:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:40:16,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:16,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:16,805 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:16,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:16,805 INFO L82 PathProgramCache]: Analyzing trace with hash -212803225, now seen corresponding path program 1 times [2019-09-10 07:40:16,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:16,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:16,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:16,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:16,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:16,864 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:40:16,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:16,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:16,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:16,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:16,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:16,865 INFO L87 Difference]: Start difference. First operand 11412 states and 15344 transitions. Second operand 3 states. [2019-09-10 07:40:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:16,912 INFO L93 Difference]: Finished difference Result 13986 states and 18361 transitions. [2019-09-10 07:40:16,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:16,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:40:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:16,928 INFO L225 Difference]: With dead ends: 13986 [2019-09-10 07:40:16,928 INFO L226 Difference]: Without dead ends: 13986 [2019-09-10 07:40:16,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13986 states. [2019-09-10 07:40:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13986 to 10392. [2019-09-10 07:40:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10392 states. [2019-09-10 07:40:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10392 states to 10392 states and 13658 transitions. [2019-09-10 07:40:17,066 INFO L78 Accepts]: Start accepts. Automaton has 10392 states and 13658 transitions. Word has length 101 [2019-09-10 07:40:17,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:17,066 INFO L475 AbstractCegarLoop]: Abstraction has 10392 states and 13658 transitions. [2019-09-10 07:40:17,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 10392 states and 13658 transitions. [2019-09-10 07:40:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:40:17,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:17,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:17,070 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:17,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:17,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1682826315, now seen corresponding path program 1 times [2019-09-10 07:40:17,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:17,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:17,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:17,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:17,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:17,137 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:40:17,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:17,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:17,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:17,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:17,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:17,139 INFO L87 Difference]: Start difference. First operand 10392 states and 13658 transitions. Second operand 3 states. [2019-09-10 07:40:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:17,177 INFO L93 Difference]: Finished difference Result 9962 states and 12927 transitions. [2019-09-10 07:40:17,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:17,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:40:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:17,188 INFO L225 Difference]: With dead ends: 9962 [2019-09-10 07:40:17,188 INFO L226 Difference]: Without dead ends: 9962 [2019-09-10 07:40:17,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9962 states. [2019-09-10 07:40:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9962 to 9960. [2019-09-10 07:40:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9960 states. [2019-09-10 07:40:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9960 states to 9960 states and 12926 transitions. [2019-09-10 07:40:17,292 INFO L78 Accepts]: Start accepts. Automaton has 9960 states and 12926 transitions. Word has length 102 [2019-09-10 07:40:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:17,293 INFO L475 AbstractCegarLoop]: Abstraction has 9960 states and 12926 transitions. [2019-09-10 07:40:17,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 9960 states and 12926 transitions. [2019-09-10 07:40:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:40:17,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:17,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:17,294 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1305322077, now seen corresponding path program 1 times [2019-09-10 07:40:17,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:17,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:17,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:17,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:17,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:17,350 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:40:17,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:17,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:17,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:17,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:17,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:17,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:17,353 INFO L87 Difference]: Start difference. First operand 9960 states and 12926 transitions. Second operand 3 states. [2019-09-10 07:40:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:17,409 INFO L93 Difference]: Finished difference Result 10890 states and 14081 transitions. [2019-09-10 07:40:17,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:17,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 07:40:17,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:17,422 INFO L225 Difference]: With dead ends: 10890 [2019-09-10 07:40:17,422 INFO L226 Difference]: Without dead ends: 10890 [2019-09-10 07:40:17,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2019-09-10 07:40:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 10888. [2019-09-10 07:40:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10888 states. [2019-09-10 07:40:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10888 states to 10888 states and 14080 transitions. [2019-09-10 07:40:17,606 INFO L78 Accepts]: Start accepts. Automaton has 10888 states and 14080 transitions. Word has length 103 [2019-09-10 07:40:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:17,607 INFO L475 AbstractCegarLoop]: Abstraction has 10888 states and 14080 transitions. [2019-09-10 07:40:17,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 10888 states and 14080 transitions. [2019-09-10 07:40:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:40:17,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:17,611 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:40:17,612 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:17,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:17,612 INFO L82 PathProgramCache]: Analyzing trace with hash -297824867, now seen corresponding path program 1 times [2019-09-10 07:40:17,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:17,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:17,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:17,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:17,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:17,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:40:17,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:40:17,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 07:40:17,735 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], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [134], [137], [140], [143], [146], [148], [150], [153], [156], [159], [161], [163], [166], [169], [172], [174], [176], [179], [189], [192], [196], [199], [202], [206], [208], [211], [214], [222], [224], [227], [230], [235], [237], [240], [248], [250], [253], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [287], [296], [299], [303], [312], [314], [317], [320], [322], [337], [339], [342], [345], [347], [355], [358], [362], [387], [389], [392], [395], [397], [433], [1328], [1329], [1333], [1334], [1335] [2019-09-10 07:40:17,817 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:40:17,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:40:18,038 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:40:18,774 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:40:18,776 INFO L272 AbstractInterpreter]: Visited 118 different actions 522 times. Merged at 45 different actions 350 times. Widened at 18 different actions 54 times. Performed 2071 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2071 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 13 different actions. Largest state had 203 variables. [2019-09-10 07:40:18,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:18,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:40:18,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:40:18,783 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:40:18,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:18,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:40:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:18,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:40:19,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:40:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:40:19,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:40:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:40:19,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:40:19,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:40:19,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:19,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:40:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:40:19,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:40:19,243 INFO L87 Difference]: Start difference. First operand 10888 states and 14080 transitions. Second operand 6 states. [2019-09-10 07:40:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:19,399 INFO L93 Difference]: Finished difference Result 43748 states and 56370 transitions. [2019-09-10 07:40:19,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:40:19,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-10 07:40:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:19,481 INFO L225 Difference]: With dead ends: 43748 [2019-09-10 07:40:19,482 INFO L226 Difference]: Without dead ends: 43748 [2019-09-10 07:40:19,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 251 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:40:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43748 states. [2019-09-10 07:40:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43748 to 17872. [2019-09-10 07:40:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17872 states. [2019-09-10 07:40:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17872 states to 17872 states and 22996 transitions. [2019-09-10 07:40:20,912 INFO L78 Accepts]: Start accepts. Automaton has 17872 states and 22996 transitions. Word has length 129 [2019-09-10 07:40:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:20,913 INFO L475 AbstractCegarLoop]: Abstraction has 17872 states and 22996 transitions. [2019-09-10 07:40:20,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:40:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 17872 states and 22996 transitions. [2019-09-10 07:40:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:40:20,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:20,922 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] [2019-09-10 07:40:20,922 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:20,923 INFO L82 PathProgramCache]: Analyzing trace with hash 689020841, now seen corresponding path program 1 times [2019-09-10 07:40:20,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:20,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:20,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:20,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:40:21,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:21,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:40:21,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:21,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:40:21,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:40:21,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:40:21,150 INFO L87 Difference]: Start difference. First operand 17872 states and 22996 transitions. Second operand 6 states. [2019-09-10 07:40:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:21,370 INFO L93 Difference]: Finished difference Result 49988 states and 64302 transitions. [2019-09-10 07:40:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:40:21,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-10 07:40:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:21,465 INFO L225 Difference]: With dead ends: 49988 [2019-09-10 07:40:21,465 INFO L226 Difference]: Without dead ends: 49988 [2019-09-10 07:40:21,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:40:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49988 states. [2019-09-10 07:40:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49988 to 28300. [2019-09-10 07:40:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28300 states. [2019-09-10 07:40:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28300 states to 28300 states and 36250 transitions. [2019-09-10 07:40:21,961 INFO L78 Accepts]: Start accepts. Automaton has 28300 states and 36250 transitions. Word has length 129 [2019-09-10 07:40:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:21,961 INFO L475 AbstractCegarLoop]: Abstraction has 28300 states and 36250 transitions. [2019-09-10 07:40:21,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:40:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 28300 states and 36250 transitions. [2019-09-10 07:40:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:40:21,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:21,966 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] [2019-09-10 07:40:21,967 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:21,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:21,967 INFO L82 PathProgramCache]: Analyzing trace with hash 610820055, now seen corresponding path program 1 times [2019-09-10 07:40:21,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:21,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:21,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:22,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:40:22,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:40:22,081 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 07:40:22,081 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], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [134], [137], [140], [143], [146], [148], [150], [153], [156], [159], [161], [163], [166], [169], [172], [174], [176], [179], [189], [192], [196], [199], [202], [206], [208], [211], [214], [217], [222], [224], [227], [235], [237], [240], [248], [250], [253], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [287], [296], [299], [303], [312], [314], [317], [320], [322], [337], [339], [342], [345], [347], [362], [380], [383], [389], [392], [395], [397], [433], [1328], [1329], [1333], [1334], [1335] [2019-09-10 07:40:22,097 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:40:22,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:40:22,156 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:40:22,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:40:22,628 INFO L272 AbstractInterpreter]: Visited 117 different actions 558 times. Merged at 44 different actions 395 times. Widened at 18 different actions 61 times. Performed 2249 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2249 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 38 fixpoints after 11 different actions. Largest state had 203 variables. [2019-09-10 07:40:22,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:22,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:40:22,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:40:22,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:40:22,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:22,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:40:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:22,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:40:22,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:40:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:40:23,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:40:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:40:23,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:40:23,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:40:23,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:23,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:40:23,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:40:23,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:40:23,138 INFO L87 Difference]: Start difference. First operand 28300 states and 36250 transitions. Second operand 6 states. [2019-09-10 07:40:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:23,360 INFO L93 Difference]: Finished difference Result 57268 states and 73652 transitions. [2019-09-10 07:40:23,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:40:23,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-10 07:40:23,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:23,431 INFO L225 Difference]: With dead ends: 57268 [2019-09-10 07:40:23,432 INFO L226 Difference]: Without dead ends: 57268 [2019-09-10 07:40:23,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 251 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:40:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57268 states. [2019-09-10 07:40:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57268 to 35284. [2019-09-10 07:40:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35284 states. [2019-09-10 07:40:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35284 states to 35284 states and 45166 transitions. [2019-09-10 07:40:23,945 INFO L78 Accepts]: Start accepts. Automaton has 35284 states and 45166 transitions. Word has length 129 [2019-09-10 07:40:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:23,945 INFO L475 AbstractCegarLoop]: Abstraction has 35284 states and 45166 transitions. [2019-09-10 07:40:23,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:40:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 35284 states and 45166 transitions. [2019-09-10 07:40:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:40:23,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:23,952 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] [2019-09-10 07:40:23,954 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:23,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:23,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1632720289, now seen corresponding path program 1 times [2019-09-10 07:40:23,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:23,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:23,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:23,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:23,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:24,020 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 07:40:24,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:24,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:40:24,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:24,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:40:24,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:40:24,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:24,022 INFO L87 Difference]: Start difference. First operand 35284 states and 45166 transitions. Second operand 3 states. [2019-09-10 07:40:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:24,126 INFO L93 Difference]: Finished difference Result 42818 states and 53537 transitions. [2019-09-10 07:40:24,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:40:24,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-09-10 07:40:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:24,190 INFO L225 Difference]: With dead ends: 42818 [2019-09-10 07:40:24,191 INFO L226 Difference]: Without dead ends: 42818 [2019-09-10 07:40:24,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:40:24,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42818 states. [2019-09-10 07:40:24,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42818 to 40400. [2019-09-10 07:40:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40400 states. [2019-09-10 07:40:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40400 states to 40400 states and 50968 transitions. [2019-09-10 07:40:24,894 INFO L78 Accepts]: Start accepts. Automaton has 40400 states and 50968 transitions. Word has length 130 [2019-09-10 07:40:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:24,894 INFO L475 AbstractCegarLoop]: Abstraction has 40400 states and 50968 transitions. [2019-09-10 07:40:24,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:40:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 40400 states and 50968 transitions. [2019-09-10 07:40:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:40:24,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:24,900 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] [2019-09-10 07:40:24,901 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:24,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2016651098, now seen corresponding path program 1 times [2019-09-10 07:40:24,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:24,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:24,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:24,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:25,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:40:25,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:40:25,028 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-09-10 07:40:25,032 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], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [134], [137], [140], [143], [146], [148], [150], [153], [156], [159], [161], [163], [166], [169], [172], [174], [176], [179], [189], [192], [196], [199], [202], [206], [208], [211], [214], [222], [224], [227], [235], [237], [240], [243], [248], [250], [253], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [287], [296], [299], [303], [312], [314], [317], [320], [322], [330], [333], [339], [342], [345], [347], [362], [364], [367], [370], [372], [387], [389], [392], [395], [397], [433], [1328], [1329], [1333], [1334], [1335] [2019-09-10 07:40:25,047 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:40:25,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:40:25,099 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:40:25,501 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:40:25,502 INFO L272 AbstractInterpreter]: Visited 121 different actions 574 times. Merged at 48 different actions 396 times. Widened at 20 different actions 63 times. Performed 2272 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2272 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 13 different actions. Largest state had 204 variables. [2019-09-10 07:40:25,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:25,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:40:25,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:40:25,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:40:25,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:25,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:40:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:25,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:40:25,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:40:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:40:25,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:40:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:40:25,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:40:25,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:40:25,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:25,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:40:25,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:40:25,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:40:25,877 INFO L87 Difference]: Start difference. First operand 40400 states and 50968 transitions. Second operand 6 states. [2019-09-10 07:40:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:26,082 INFO L93 Difference]: Finished difference Result 73552 states and 93152 transitions. [2019-09-10 07:40:26,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:40:26,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-10 07:40:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:27,143 INFO L225 Difference]: With dead ends: 73552 [2019-09-10 07:40:27,143 INFO L226 Difference]: Without dead ends: 73552 [2019-09-10 07:40:27,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:40:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73552 states. [2019-09-10 07:40:27,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73552 to 48400. [2019-09-10 07:40:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48400 states. [2019-09-10 07:40:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48400 states to 48400 states and 61032 transitions. [2019-09-10 07:40:27,653 INFO L78 Accepts]: Start accepts. Automaton has 48400 states and 61032 transitions. Word has length 130 [2019-09-10 07:40:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:27,653 INFO L475 AbstractCegarLoop]: Abstraction has 48400 states and 61032 transitions. [2019-09-10 07:40:27,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:40:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 48400 states and 61032 transitions. [2019-09-10 07:40:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:40:27,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:27,660 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] [2019-09-10 07:40:27,660 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:27,661 INFO L82 PathProgramCache]: Analyzing trace with hash 733064444, now seen corresponding path program 1 times [2019-09-10 07:40:27,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:27,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:27,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:27,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:27,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 07:40:27,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:27,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:40:27,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:27,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:40:27,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:40:27,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:27,803 INFO L87 Difference]: Start difference. First operand 48400 states and 61032 transitions. Second operand 9 states. [2019-09-10 07:40:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:28,513 INFO L93 Difference]: Finished difference Result 96722 states and 121977 transitions. [2019-09-10 07:40:28,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:40:28,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-10 07:40:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:28,628 INFO L225 Difference]: With dead ends: 96722 [2019-09-10 07:40:28,629 INFO L226 Difference]: Without dead ends: 96722 [2019-09-10 07:40:28,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:40:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96722 states. [2019-09-10 07:40:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96722 to 48400. [2019-09-10 07:40:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48400 states. [2019-09-10 07:40:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48400 states to 48400 states and 61030 transitions. [2019-09-10 07:40:29,694 INFO L78 Accepts]: Start accepts. Automaton has 48400 states and 61030 transitions. Word has length 131 [2019-09-10 07:40:29,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:29,694 INFO L475 AbstractCegarLoop]: Abstraction has 48400 states and 61030 transitions. [2019-09-10 07:40:29,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:40:29,694 INFO L276 IsEmpty]: Start isEmpty. Operand 48400 states and 61030 transitions. [2019-09-10 07:40:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:40:29,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:29,700 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] [2019-09-10 07:40:29,700 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:29,701 INFO L82 PathProgramCache]: Analyzing trace with hash 104610750, now seen corresponding path program 1 times [2019-09-10 07:40:29,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:29,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:29,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:29,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:29,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:40:29,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:29,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:40:29,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:29,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:40:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:40:29,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:40:29,763 INFO L87 Difference]: Start difference. First operand 48400 states and 61030 transitions. Second operand 4 states. [2019-09-10 07:40:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:30,042 INFO L93 Difference]: Finished difference Result 48441 states and 61071 transitions. [2019-09-10 07:40:30,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:40:30,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 07:40:30,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:30,114 INFO L225 Difference]: With dead ends: 48441 [2019-09-10 07:40:30,115 INFO L226 Difference]: Without dead ends: 48441 [2019-09-10 07:40:30,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:40:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48441 states. [2019-09-10 07:40:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48441 to 48386. [2019-09-10 07:40:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48386 states. [2019-09-10 07:40:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48386 states to 48386 states and 61016 transitions. [2019-09-10 07:40:30,959 INFO L78 Accepts]: Start accepts. Automaton has 48386 states and 61016 transitions. Word has length 133 [2019-09-10 07:40:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:30,959 INFO L475 AbstractCegarLoop]: Abstraction has 48386 states and 61016 transitions. [2019-09-10 07:40:30,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:40:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 48386 states and 61016 transitions. [2019-09-10 07:40:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:40:30,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:30,964 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] [2019-09-10 07:40:30,964 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1846733149, now seen corresponding path program 1 times [2019-09-10 07:40:30,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:30,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:30,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:31,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:40:31,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:40:31,242 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:40:31,243 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], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [134], [137], [140], [143], [146], [148], [150], [153], [156], [159], [161], [163], [166], [169], [172], [174], [176], [179], [182], [185], [187], [189], [192], [196], [199], [202], [206], [208], [211], [214], [222], [224], [227], [235], [237], [240], [248], [250], [253], [261], [263], [265], [268], [271], [275], [277], [279], [282], [283], [285], [287], [289], [294], [296], [299], [312], [314], [317], [320], [322], [337], [339], [342], [345], [347], [362], [364], [367], [370], [372], [387], [389], [392], [395], [397], [1328], [1329], [1333], [1334], [1335] [2019-09-10 07:40:31,249 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:40:31,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:40:31,291 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:40:31,786 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:40:31,787 INFO L272 AbstractInterpreter]: Visited 123 different actions 628 times. Merged at 48 different actions 437 times. Widened at 22 different actions 79 times. Performed 2402 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2402 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 71 fixpoints after 18 different actions. Largest state had 204 variables. [2019-09-10 07:40:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:31,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:40:31,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:40:31,788 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 07:40:31,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:31,802 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 07:40:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:31,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 07:40:31,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:40:32,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:32,695 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:40:32,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:32,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:34,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:40:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:40:35,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:40:35,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2019-09-10 07:40:35,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:40:35,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:40:35,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:40:35,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:40:35,177 INFO L87 Difference]: Start difference. First operand 48386 states and 61016 transitions. Second operand 20 states. [2019-09-10 07:40:35,344 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:40:36,294 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:40:36,632 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:40:37,031 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 07:40:37,428 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 07:40:38,036 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 07:40:38,322 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 07:40:38,774 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:40:38,999 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:40:39,157 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:40:39,303 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 07:40:39,624 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:40:40,003 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:40:40,354 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:40:40,828 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:40:41,112 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 07:40:41,366 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:40:41,754 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:40:42,001 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:40:42,364 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:40:42,635 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:40:43,099 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:40:43,336 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-10 07:40:43,644 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-10 07:40:43,969 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:40:44,294 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 07:40:44,756 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-10 07:40:45,071 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 07:40:45,586 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:40:46,011 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:40:46,342 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:40:46,716 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-10 07:40:47,176 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 07:40:47,548 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 07:40:47,788 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 07:40:48,122 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:40:48,462 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-10 07:40:48,682 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:40:49,061 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 07:40:49,473 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 07:40:49,737 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-10 07:40:50,016 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:40:50,410 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:40:50,810 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 07:40:51,155 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 07:40:51,527 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:40:51,817 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:40:52,076 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:40:52,385 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 07:40:52,835 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:40:53,203 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 07:40:54,622 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-10 07:40:54,952 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 07:40:55,380 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:40:55,640 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-10 07:40:55,938 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 07:40:56,182 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:40:56,552 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-10 07:40:56,816 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 07:40:57,200 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:40:57,426 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 07:40:57,869 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 07:40:58,193 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:40:58,536 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 07:40:59,489 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 07:40:59,884 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:41:00,386 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:41:00,817 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:41:01,304 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:41:01,661 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-09-10 07:41:01,959 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:41:02,261 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:41:04,587 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:41:04,985 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:41:05,344 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-10 07:41:07,183 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:41:07,546 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:41:07,814 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:41:08,065 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:41:08,331 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:41:08,610 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:41:08,991 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 07:41:09,311 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:41:09,663 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:41:09,875 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:41:10,188 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:41:10,470 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 07:41:10,730 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-10 07:41:10,987 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:41:11,235 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:41:11,484 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:41:11,813 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:41:12,124 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:41:12,464 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 07:41:12,825 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:41:13,178 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 07:41:13,429 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:41:13,772 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:41:14,084 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:41:14,339 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:41:14,564 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:41:14,916 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:41:15,219 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:41:15,519 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:41:15,823 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:41:16,190 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:41:16,527 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:41:16,942 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:41:17,187 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 07:41:17,530 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-10 07:41:18,123 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:41:18,486 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:41:18,734 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:41:18,951 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:41:19,139 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:41:19,523 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:41:19,784 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:41:20,074 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:41:20,265 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:41:20,649 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 07:41:20,960 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:41:21,179 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:41:21,566 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:41:21,915 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:41:22,238 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:41:22,489 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 07:41:22,924 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:41:23,146 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 07:41:23,565 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 07:41:23,928 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:41:24,394 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-09-10 07:41:24,648 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:41:25,156 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-10 07:41:25,415 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:41:25,638 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:41:26,144 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 07:41:26,519 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 07:41:27,003 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-10 07:41:27,280 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:41:27,612 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-10 07:41:27,890 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:41:28,146 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-10 07:41:28,457 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:41:28,688 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:41:28,988 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:41:29,490 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 07:41:29,762 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:41:29,976 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 07:41:30,632 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 07:41:31,013 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:41:31,381 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:41:31,735 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:41:32,058 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:41:32,414 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 07:41:32,707 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:41:35,544 WARN L188 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:41:35,930 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-09-10 07:41:36,232 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 07:41:36,497 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:41:36,967 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:41:37,285 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:41:37,554 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 07:41:37,843 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:41:38,148 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 07:41:38,452 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:41:38,851 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:41:39,286 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-09-10 07:41:39,574 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:41:39,911 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:41:40,289 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:41:40,478 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:41:40,834 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 07:41:41,122 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:41:41,549 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:41:41,877 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 07:41:42,164 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 07:41:42,397 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:41:42,651 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:41:43,269 WARN L188 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:41:43,706 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 07:41:44,059 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:41:44,366 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:41:44,862 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-10 07:41:45,531 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:41:45,843 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-10 07:41:46,102 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:41:46,399 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-10 07:41:46,861 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 07:41:47,212 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:41:47,572 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:41:48,058 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:41:48,525 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:41:48,834 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-09-10 07:41:49,123 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 07:41:49,462 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:41:50,310 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 07:41:50,577 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:41:50,937 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 07:41:51,357 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-10 07:41:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:51,774 INFO L93 Difference]: Finished difference Result 321814 states and 393895 transitions. [2019-09-10 07:41:51,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2019-09-10 07:41:51,775 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 133 [2019-09-10 07:41:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:52,173 INFO L225 Difference]: With dead ends: 321814 [2019-09-10 07:41:52,173 INFO L226 Difference]: Without dead ends: 321814 [2019-09-10 07:41:52,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 215 SyntacticMatches, 35 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20536 ImplicationChecksByTransitivity, 68.0s TimeCoverageRelationStatistics Valid=8226, Invalid=45366, Unknown=0, NotChecked=0, Total=53592 [2019-09-10 07:41:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321814 states. [2019-09-10 07:41:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321814 to 147328. [2019-09-10 07:41:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147328 states. [2019-09-10 07:41:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147328 states to 147328 states and 184218 transitions. [2019-09-10 07:41:56,759 INFO L78 Accepts]: Start accepts. Automaton has 147328 states and 184218 transitions. Word has length 133 [2019-09-10 07:41:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:56,760 INFO L475 AbstractCegarLoop]: Abstraction has 147328 states and 184218 transitions. [2019-09-10 07:41:56,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:41:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 147328 states and 184218 transitions. [2019-09-10 07:41:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:41:56,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:56,769 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] [2019-09-10 07:41:56,769 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:56,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:56,769 INFO L82 PathProgramCache]: Analyzing trace with hash 308312446, now seen corresponding path program 1 times [2019-09-10 07:41:56,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:56,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:56,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:56,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:56,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:57,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:57,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:57,028 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:41:57,028 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], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [134], [137], [140], [143], [146], [148], [150], [153], [156], [159], [161], [163], [166], [169], [172], [174], [176], [179], [182], [185], [187], [189], [192], [196], [199], [202], [206], [208], [211], [214], [222], [224], [227], [230], [235], [237], [240], [243], [248], [250], [253], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [287], [296], [299], [303], [312], [314], [317], [320], [322], [330], [333], [339], [342], [345], [347], [355], [358], [364], [367], [370], [372], [387], [389], [392], [395], [397], [1328], [1329], [1333], [1334], [1335] [2019-09-10 07:41:57,032 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:57,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:57,069 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:57,679 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:57,680 INFO L272 AbstractInterpreter]: Visited 125 different actions 680 times. Merged at 50 different actions 492 times. Widened at 20 different actions 51 times. Performed 2566 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2566 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 54 fixpoints after 13 different actions. Largest state had 204 variables. [2019-09-10 07:41:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:57,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:57,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:57,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:41:57,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:57,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:41:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:57,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:41:57,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:58,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:58,436 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:58,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:58,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:00,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:00,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:42:00,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:42:00,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:42:00,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:42:00,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:42:00,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:42:00,499 INFO L87 Difference]: Start difference. First operand 147328 states and 184218 transitions. Second operand 21 states. [2019-09-10 07:42:01,033 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:42:01,504 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:42:02,312 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 07:42:02,607 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 07:42:03,018 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:42:03,295 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:42:03,685 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:42:03,978 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 07:42:04,630 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 07:42:05,107 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 07:42:05,403 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 07:42:05,853 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 07:42:06,281 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:42:06,580 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:42:07,032 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:42:07,529 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:42:07,951 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:42:08,295 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:42:08,619 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 07:42:09,071 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:42:09,446 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:42:10,434 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 07:42:10,847 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 07:42:11,225 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 07:42:12,162 WARN L188 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:42:12,605 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:42:13,023 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-09-10 07:42:13,520 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 07:42:13,970 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 07:42:14,421 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-10 07:42:14,900 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:42:15,313 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 07:42:15,694 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:42:16,130 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 07:42:16,664 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 07:42:17,169 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-09-10 07:42:17,558 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 07:42:17,935 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 07:42:18,372 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 07:42:18,728 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-09-10 07:42:19,134 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 07:42:19,523 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 07:42:19,962 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 07:42:20,278 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 07:42:20,816 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 07:42:21,336 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:42:21,701 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:42:22,353 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 07:42:22,728 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 07:42:23,110 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 07:42:23,876 WARN L188 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 07:42:26,317 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 07:42:26,710 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:42:27,159 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:42:27,544 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:42:28,057 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:42:28,428 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:42:28,749 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:42:29,181 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 07:42:30,001 WARN L188 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 07:42:30,479 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-09-10 07:42:30,957 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 97 [2019-09-10 07:42:31,426 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-09-10 07:42:32,001 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 97 [2019-09-10 07:42:32,518 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 07:42:32,893 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 07:42:33,479 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:42:33,867 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 07:42:34,302 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 07:42:34,796 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 07:42:35,267 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 07:42:35,746 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 07:42:36,136 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-10 07:42:36,681 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 07:42:37,084 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:42:37,472 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-09-10 07:42:37,816 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 07:42:38,336 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:42:38,703 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 07:42:39,122 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 07:42:39,483 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:42:39,899 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:42:40,344 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 07:42:40,687 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:42:41,307 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:42:41,815 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 07:42:43,163 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 07:42:43,480 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 07:42:44,325 WARN L188 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 07:42:44,682 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 07:42:45,188 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 07:42:47,421 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 07:42:47,894 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 07:42:48,306 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:42:48,757 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 07:42:49,221 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:42:49,649 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 07:42:50,183 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:42:52,373 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:42:53,026 WARN L188 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 07:42:53,445 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:42:53,778 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-10 07:42:54,338 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:42:54,691 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 07:42:55,087 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 07:42:55,617 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 07:42:56,187 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 07:42:56,569 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:42:56,966 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-09-10 07:42:57,326 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 07:42:57,859 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 07:42:58,266 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-10 07:42:58,665 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-10 07:42:59,140 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-09-10 07:42:59,497 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:43:00,048 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-09-10 07:43:00,438 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:43:01,066 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:43:01,556 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 07:43:01,995 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 07:43:02,516 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:43:02,978 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 07:43:05,892 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 07:43:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:06,756 INFO L93 Difference]: Finished difference Result 787532 states and 959545 transitions. [2019-09-10 07:43:06,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-10 07:43:06,756 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 134 [2019-09-10 07:43:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:07,772 INFO L225 Difference]: With dead ends: 787532 [2019-09-10 07:43:07,772 INFO L226 Difference]: Without dead ends: 787532 [2019-09-10 07:43:07,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 230 SyntacticMatches, 20 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7876 ImplicationChecksByTransitivity, 57.3s TimeCoverageRelationStatistics Valid=4985, Invalid=19507, Unknown=0, NotChecked=0, Total=24492 [2019-09-10 07:43:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787532 states. [2019-09-10 07:43:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787532 to 439480. [2019-09-10 07:43:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439480 states. [2019-09-10 07:43:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439480 states to 439480 states and 545498 transitions. [2019-09-10 07:43:22,213 INFO L78 Accepts]: Start accepts. Automaton has 439480 states and 545498 transitions. Word has length 134 [2019-09-10 07:43:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:22,213 INFO L475 AbstractCegarLoop]: Abstraction has 439480 states and 545498 transitions. [2019-09-10 07:43:22,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:43:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 439480 states and 545498 transitions. [2019-09-10 07:43:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:43:22,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:22,244 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] [2019-09-10 07:43:22,244 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:22,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477459, now seen corresponding path program 1 times [2019-09-10 07:43:22,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:22,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:22,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:22,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:22,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:22,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:43:22,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:43:22,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-09-10 07:43:22,460 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], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [134], [137], [140], [143], [146], [148], [150], [153], [156], [161], [163], [166], [169], [174], [176], [179], [182], [185], [187], [189], [192], [196], [199], [202], [206], [208], [211], [214], [217], [222], [224], [227], [230], [235], [237], [240], [248], [250], [253], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [287], [296], [299], [303], [312], [314], [317], [320], [322], [337], [339], [342], [345], [347], [355], [358], [364], [367], [370], [372], [380], [383], [389], [392], [395], [397], [436], [491], [496], [609], [1328], [1329], [1333], [1334], [1335] [2019-09-10 07:43:22,463 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:43:22,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:43:22,498 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:43:22,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:43:22,922 INFO L272 AbstractInterpreter]: Visited 127 different actions 623 times. Merged at 50 different actions 439 times. Widened at 15 different actions 60 times. Performed 2434 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2434 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 49 fixpoints after 10 different actions. Largest state had 204 variables. [2019-09-10 07:43:22,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:22,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:43:22,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:43:22,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:43:22,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:22,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:43:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:23,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:43:23,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:43:23,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:23,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:23,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:23,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:23,465 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:43:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:23,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:23,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:23,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:23,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:24,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:24,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:43:24,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:43:24,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:43:24,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:43:24,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:43:24,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:43:24,830 INFO L87 Difference]: Start difference. First operand 439480 states and 545498 transitions. Second operand 20 states. [2019-09-10 07:43:38,072 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:43:38,744 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:43:39,115 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:43:40,031 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 07:43:43,129 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:43:44,429 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:43:49,961 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:43:51,833 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:43:52,018 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:43:52,175 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 07:43:52,783 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-10 07:43:55,160 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:43:56,701 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:43:58,310 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:44:00,032 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 07:44:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:05,776 INFO L93 Difference]: Finished difference Result 2108423 states and 2567950 transitions. [2019-09-10 07:44:05,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2019-09-10 07:44:05,776 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 136 [2019-09-10 07:44:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:19,298 INFO L225 Difference]: With dead ends: 2108423 [2019-09-10 07:44:19,299 INFO L226 Difference]: Without dead ends: 2108423 [2019-09-10 07:44:19,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 234 SyntacticMatches, 19 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24034 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=8924, Invalid=55846, Unknown=0, NotChecked=0, Total=64770 [2019-09-10 07:44:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108423 states. [2019-09-10 07:44:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108423 to 367013. [2019-09-10 07:44:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367013 states. [2019-09-10 07:44:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367013 states to 367013 states and 455527 transitions. [2019-09-10 07:44:41,957 INFO L78 Accepts]: Start accepts. Automaton has 367013 states and 455527 transitions. Word has length 136 [2019-09-10 07:44:41,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:41,957 INFO L475 AbstractCegarLoop]: Abstraction has 367013 states and 455527 transitions. [2019-09-10 07:44:41,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:44:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 367013 states and 455527 transitions. [2019-09-10 07:44:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:44:41,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:41,968 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] [2019-09-10 07:44:41,969 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:41,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:41,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1291832888, now seen corresponding path program 1 times [2019-09-10 07:44:41,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:41,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:41,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:42,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:42,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:44:42,256 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-09-10 07:44:42,256 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], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [134], [137], [140], [143], [146], [148], [150], [153], [156], [159], [161], [163], [166], [169], [174], [176], [179], [182], [187], [189], [192], [196], [199], [202], [206], [208], [211], [214], [222], [224], [227], [230], [235], [237], [240], [243], [248], [250], [253], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [287], [296], [299], [303], [312], [314], [317], [320], [322], [330], [333], [339], [342], [345], [347], [355], [358], [364], [367], [370], [372], [387], [389], [392], [395], [397], [409], [431], [436], [491], [1328], [1329], [1333], [1334], [1335] [2019-09-10 07:44:42,260 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:44:42,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:44:42,292 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:42,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:42,845 INFO L272 AbstractInterpreter]: Visited 127 different actions 747 times. Merged at 50 different actions 550 times. Widened at 20 different actions 78 times. Performed 2832 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2832 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 61 fixpoints after 18 different actions. Largest state had 204 variables. [2019-09-10 07:44:42,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:42,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:42,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:42,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:44:42,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:42,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:44:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:43,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:44:43,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:43,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:43,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:43,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:45,400 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:44:45,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:47,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:47,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:44:47,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2019-09-10 07:44:47,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:44:47,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:44:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:44:47,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=701, Unknown=1, NotChecked=0, Total=812 [2019-09-10 07:44:47,980 INFO L87 Difference]: Start difference. First operand 367013 states and 455527 transitions. Second operand 20 states. [2019-09-10 07:44:48,578 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-09-10 07:44:48,817 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2019-09-10 07:44:52,560 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-09-10 07:44:54,134 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 31 [2019-09-10 07:44:54,479 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2019-09-10 07:44:54,994 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2019-09-10 07:44:56,937 WARN L188 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2019-09-10 07:44:57,126 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2019-09-10 07:45:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:02,563 INFO L93 Difference]: Finished difference Result 754245 states and 928892 transitions. [2019-09-10 07:45:02,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 07:45:02,563 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 136 [2019-09-10 07:45:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:03,463 INFO L225 Difference]: With dead ends: 754245 [2019-09-10 07:45:03,463 INFO L226 Difference]: Without dead ends: 754245 [2019-09-10 07:45:03,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 222 SyntacticMatches, 34 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=850, Invalid=3181, Unknown=1, NotChecked=0, Total=4032 [2019-09-10 07:45:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754245 states. [2019-09-10 07:45:16,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754245 to 367009. [2019-09-10 07:45:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367009 states. [2019-09-10 07:45:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367009 states to 367009 states and 455523 transitions. [2019-09-10 07:45:16,542 INFO L78 Accepts]: Start accepts. Automaton has 367009 states and 455523 transitions. Word has length 136 [2019-09-10 07:45:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:16,542 INFO L475 AbstractCegarLoop]: Abstraction has 367009 states and 455523 transitions. [2019-09-10 07:45:16,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:45:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 367009 states and 455523 transitions. [2019-09-10 07:45:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:45:16,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:16,552 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] [2019-09-10 07:45:16,552 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:16,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1744856412, now seen corresponding path program 1 times [2019-09-10 07:45:16,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:16,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:16,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:16,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:16,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:16,629 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 07:45:16,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:16,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:45:16,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:16,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:45:16,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:45:16,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:45:16,631 INFO L87 Difference]: Start difference. First operand 367009 states and 455523 transitions. Second operand 3 states. [2019-09-10 07:45:18,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:18,116 INFO L93 Difference]: Finished difference Result 293423 states and 353898 transitions. [2019-09-10 07:45:18,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:45:18,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 07:45:18,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:18,400 INFO L225 Difference]: With dead ends: 293423 [2019-09-10 07:45:18,400 INFO L226 Difference]: Without dead ends: 293423 [2019-09-10 07:45:18,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:45:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293423 states. [2019-09-10 07:45:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293423 to 278517. [2019-09-10 07:45:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278517 states. [2019-09-10 07:45:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278517 states to 278517 states and 337577 transitions. [2019-09-10 07:45:27,598 INFO L78 Accepts]: Start accepts. Automaton has 278517 states and 337577 transitions. Word has length 136 [2019-09-10 07:45:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:27,598 INFO L475 AbstractCegarLoop]: Abstraction has 278517 states and 337577 transitions. [2019-09-10 07:45:27,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:45:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 278517 states and 337577 transitions. [2019-09-10 07:45:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:45:27,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:27,606 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] [2019-09-10 07:45:27,607 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash -98733668, now seen corresponding path program 1 times [2019-09-10 07:45:27,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:27,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:27,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:27,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:27,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:28,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:28,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:28,544 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-09-10 07:45:28,544 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], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [134], [137], [140], [143], [146], [148], [150], [153], [156], [159], [161], [163], [166], [169], [172], [174], [176], [179], [182], [185], [187], [189], [192], [196], [199], [202], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [235], [237], [240], [243], [246], [248], [250], [253], [256], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [287], [296], [299], [303], [305], [308], [314], [317], [320], [322], [339], [342], [345], [347], [355], [358], [364], [367], [370], [372], [389], [392], [395], [397], [1328], [1329], [1333], [1334], [1335] [2019-09-10 07:45:28,550 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:28,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:28,587 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:28,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:28,928 INFO L272 AbstractInterpreter]: Visited 127 different actions 534 times. Merged at 52 different actions 364 times. Widened at 15 different actions 35 times. Performed 2038 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2038 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 38 fixpoints after 12 different actions. Largest state had 204 variables. [2019-09-10 07:45:28,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:28,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:28,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:28,929 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:28,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:28,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:45:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:29,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-10 07:45:29,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:30,837 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:31,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:31,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:31,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:31,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:31,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:31,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:32,189 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:45:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:32,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:32,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 20] total 54 [2019-09-10 07:45:32,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:32,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 07:45:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 07:45:32,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2588, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:45:32,433 INFO L87 Difference]: Start difference. First operand 278517 states and 337577 transitions. Second operand 39 states. [2019-09-10 07:45:34,436 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:45:34,975 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 07:45:37,108 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:45:37,276 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 07:45:37,665 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 07:45:37,928 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:45:38,357 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 07:45:38,590 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 07:45:38,888 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:45:39,149 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:45:39,401 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 07:45:39,663 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:45:39,934 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:45:40,209 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 07:45:40,524 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:45:40,820 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:45:41,141 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 07:45:41,574 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:45:41,958 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:45:42,298 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 07:45:42,557 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:45:42,870 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 07:45:43,160 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:45:43,386 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:45:43,668 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:45:43,984 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-09-10 07:45:44,350 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:45:44,579 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 07:45:44,859 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:45:45,192 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 07:45:45,479 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 07:45:46,023 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 07:45:46,255 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:45:46,408 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:45:46,629 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:45:46,859 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:45:47,506 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:45:47,696 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:45:47,896 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-09-10 07:45:48,232 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:45:48,512 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:45:48,803 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:45:49,247 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:45:49,533 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:45:49,897 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 07:45:50,267 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 07:45:50,679 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:45:51,010 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 07:45:51,240 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:45:51,493 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:45:51,778 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 07:45:52,034 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:45:52,372 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:45:52,598 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-09-10 07:45:53,015 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-10 07:45:53,260 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 07:45:53,568 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:45:54,069 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:45:54,262 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-10 07:45:54,628 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:45:54,916 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:45:55,244 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:45:55,622 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-09-10 07:45:55,968 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-09-10 07:45:56,174 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-09-10 07:45:56,543 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 07:45:56,751 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:45:57,169 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 07:45:57,392 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:45:57,669 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:45:57,966 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:45:58,181 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:45:58,477 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:45:58,752 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 07:45:59,060 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:45:59,319 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 07:45:59,638 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 07:45:59,949 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-09-10 07:46:00,290 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 07:46:00,486 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 07:46:00,835 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:46:01,168 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:46:01,438 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:46:01,649 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:46:01,906 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:46:02,094 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:46:02,349 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:46:02,656 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 07:46:02,868 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:46:03,178 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 07:46:03,424 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:46:03,774 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 07:46:04,010 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:46:04,307 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 07:46:04,656 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 07:46:04,989 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 07:46:05,228 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:46:05,549 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:46:05,761 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:46:06,032 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:46:06,319 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:46:06,552 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:46:06,838 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:46:07,141 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:46:07,462 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:46:07,701 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:46:08,046 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 07:46:08,389 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 07:46:08,736 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:46:08,975 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:46:09,260 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 07:46:09,637 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:46:09,897 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:46:10,094 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:46:10,384 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:46:10,562 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:46:10,800 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:46:11,110 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-09-10 07:46:11,346 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:46:11,704 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 07:46:11,958 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:46:12,393 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 07:46:12,628 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:46:12,948 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 07:46:13,377 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 07:46:13,684 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:46:14,048 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:46:14,364 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:46:14,667 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:46:14,862 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:46:15,152 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:46:15,428 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:46:15,663 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:46:15,878 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:46:16,148 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 07:46:16,460 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:46:16,755 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:46:17,116 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:46:17,448 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 07:46:17,798 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 07:46:18,064 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 07:46:18,418 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:46:18,708 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:46:19,071 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:46:19,428 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:46:19,750 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:46:20,003 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:46:20,279 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:46:20,463 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:46:20,749 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:46:21,030 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:46:21,197 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 07:46:21,432 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:46:21,675 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:46:22,128 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 07:46:22,335 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:46:22,641 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:46:22,993 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:46:23,329 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 07:46:23,521 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:46:23,804 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 07:46:24,117 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 07:46:24,436 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:46:24,748 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:46:25,070 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:46:25,344 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:46:25,548 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:46:25,797 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:46:26,099 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-09-10 07:46:26,449 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 07:46:26,827 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 07:46:27,149 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 07:46:27,444 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:46:27,785 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 07:46:27,968 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:46:28,260 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:46:28,545 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:46:28,887 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:46:29,306 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:46:29,507 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:46:29,688 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:46:29,884 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:46:30,106 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:46:30,333 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:46:30,587 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:46:30,847 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:46:31,118 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 07:46:31,419 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 07:46:31,644 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:46:31,890 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:46:32,146 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:46:32,342 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:46:32,561 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:46:32,856 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:46:33,149 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:46:33,408 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:46:33,693 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 07:46:33,899 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:46:34,171 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:46:34,490 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 07:46:34,852 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:46:35,142 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:46:35,636 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 07:46:35,923 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:46:36,160 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:46:36,479 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:46:36,733 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:46:37,004 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:46:37,226 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:46:37,638 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:46:37,920 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 07:46:38,355 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:46:38,698 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:46:38,964 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:46:39,275 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 07:46:39,487 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:46:39,713 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:46:39,973 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:46:40,395 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 07:46:40,666 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 07:46:41,002 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 07:46:41,234 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:46:41,681 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:46:41,936 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:46:42,358 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-10 07:46:42,637 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:46:42,919 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 07:46:43,463 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 07:46:45,137 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:46:45,324 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:46:45,994 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:46:46,219 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:46:46,445 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:46:46,774 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 07:46:46,978 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:46:47,572 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:46:47,751 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:46:47,950 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:46:48,192 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:46:48,383 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 07:46:49,023 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:46:49,882 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:46:50,109 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:46:50,454 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-10 07:46:50,664 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 07:46:50,968 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 07:46:51,265 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:46:51,463 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:46:51,756 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:46:52,364 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:46:52,888 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:46:53,075 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:46:53,330 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:46:53,546 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:46:53,870 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 07:46:54,108 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-10 07:46:54,306 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 07:46:54,550 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:46:54,773 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:46:55,061 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 07:46:55,342 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 07:46:55,626 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:46:55,857 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:46:56,165 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 07:46:56,475 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:46:56,916 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 07:46:57,358 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 07:46:57,531 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:46:57,817 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:46:58,218 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:46:58,453 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:46:58,682 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:46:58,973 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:46:59,403 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 07:46:59,844 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 07:47:00,060 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 07:47:00,307 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:47:00,575 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:47:00,882 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:47:01,207 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 07:47:01,663 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:47:01,871 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:47:02,189 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 07:47:02,474 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 07:47:02,776 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 07:47:03,120 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-09-10 07:47:03,524 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 07:47:03,884 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:47:04,099 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:47:04,328 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:47:04,626 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:47:05,111 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:47:05,502 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:47:05,773 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:47:06,045 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 07:47:06,394 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:47:06,657 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:47:06,976 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:47:07,268 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 07:47:07,618 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 07:47:07,892 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:47:08,444 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 07:47:08,856 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:47:09,197 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:47:09,593 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:47:09,827 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:47:10,270 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:47:10,591 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 07:47:10,894 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:47:11,133 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:47:11,429 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-10 07:47:11,695 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:47:12,011 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:47:12,452 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:47:12,872 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:47:13,423 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:47:13,677 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:47:13,900 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:47:14,696 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 07:47:15,152 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:47:15,444 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:47:16,212 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-10 07:47:16,726 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:47:17,003 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 07:47:17,679 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 07:47:18,048 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:47:18,219 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:47:18,409 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:47:18,700 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:47:19,100 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 07:47:19,738 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-10 07:47:20,181 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 07:47:20,455 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:47:21,365 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 07:47:21,694 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-10 07:47:22,146 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 07:47:22,405 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:47:22,648 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:47:22,890 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:47:24,119 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-10 07:47:24,296 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:47:24,667 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 07:47:24,953 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:47:25,871 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:47:26,112 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 07:47:26,371 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 07:47:26,803 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:47:27,051 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:47:27,509 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:47:27,778 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:47:28,041 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:47:28,304 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:47:28,633 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:47:28,962 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:47:29,285 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 07:47:29,674 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 07:47:29,859 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 07:47:30,149 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 07:47:30,446 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:47:30,768 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:47:31,044 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:47:31,315 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:47:31,792 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:47:32,178 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:47:32,532 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:47:32,823 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:47:33,024 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:47:33,211 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 07:47:33,616 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-10 07:47:33,897 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 07:47:34,161 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 07:47:34,518 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:47:34,969 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 07:47:35,375 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 07:47:35,720 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 07:47:36,066 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 07:47:36,258 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 07:47:36,532 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-09-10 07:47:36,842 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 07:47:37,278 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-09-10 07:47:37,545 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:47:37,948 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:47:38,237 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:47:38,615 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:47:38,896 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:47:39,339 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-09-10 07:47:39,635 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:47:40,187 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 07:47:41,296 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:47:41,591 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:47:41,877 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:47:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:44,460 INFO L93 Difference]: Finished difference Result 1344965 states and 1591382 transitions. [2019-09-10 07:47:44,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 501 states. [2019-09-10 07:47:44,461 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 136 [2019-09-10 07:47:44,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:45,941 INFO L225 Difference]: With dead ends: 1344965 [2019-09-10 07:47:45,941 INFO L226 Difference]: Without dead ends: 1344965 [2019-09-10 07:47:45,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 233 SyntacticMatches, 4 SemanticMatches, 545 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124856 ImplicationChecksByTransitivity, 107.4s TimeCoverageRelationStatistics Valid=37637, Invalid=261025, Unknown=0, NotChecked=0, Total=298662 [2019-09-10 07:47:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344965 states. [2019-09-10 07:48:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344965 to 398912. [2019-09-10 07:48:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398912 states. [2019-09-10 07:48:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398912 states to 398912 states and 481584 transitions. [2019-09-10 07:48:08,644 INFO L78 Accepts]: Start accepts. Automaton has 398912 states and 481584 transitions. Word has length 136 [2019-09-10 07:48:08,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:08,644 INFO L475 AbstractCegarLoop]: Abstraction has 398912 states and 481584 transitions. [2019-09-10 07:48:08,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 07:48:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 398912 states and 481584 transitions. [2019-09-10 07:48:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:48:08,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:08,653 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] [2019-09-10 07:48:08,653 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash 52015420, now seen corresponding path program 1 times [2019-09-10 07:48:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:08,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:08,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:08,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:08,734 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 07:48:08,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:08,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:48:08,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:08,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:48:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:48:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:48:08,736 INFO L87 Difference]: Start difference. First operand 398912 states and 481584 transitions. Second operand 3 states. [2019-09-10 07:48:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:09,096 INFO L93 Difference]: Finished difference Result 195886 states and 233070 transitions. [2019-09-10 07:48:09,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:48:09,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 07:48:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:09,279 INFO L225 Difference]: With dead ends: 195886 [2019-09-10 07:48:09,280 INFO L226 Difference]: Without dead ends: 195886 [2019-09-10 07:48:09,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:48:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195886 states. [2019-09-10 07:48:11,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195886 to 195884. [2019-09-10 07:48:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195884 states. [2019-09-10 07:48:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195884 states to 195884 states and 233069 transitions. [2019-09-10 07:48:12,122 INFO L78 Accepts]: Start accepts. Automaton has 195884 states and 233069 transitions. Word has length 136 [2019-09-10 07:48:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:12,123 INFO L475 AbstractCegarLoop]: Abstraction has 195884 states and 233069 transitions. [2019-09-10 07:48:12,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:48:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 195884 states and 233069 transitions. [2019-09-10 07:48:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:48:12,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:12,132 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] [2019-09-10 07:48:12,132 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:12,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1042612348, now seen corresponding path program 1 times [2019-09-10 07:48:12,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:12,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:12,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:12,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:12,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:12,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:12,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:12,987 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-09-10 07:48:12,987 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], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [134], [137], [140], [143], [146], [148], [150], [153], [156], [159], [161], [163], [166], [169], [172], [174], [176], [179], [182], [185], [187], [189], [192], [196], [199], [202], [206], [208], [211], [214], [217], [222], [224], [227], [230], [233], [235], [237], [240], [243], [248], [250], [253], [256], [259], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [287], [296], [299], [303], [314], [317], [320], [322], [330], [333], [339], [342], [345], [347], [364], [367], [370], [372], [380], [383], [389], [392], [395], [397], [1328], [1329], [1333], [1334], [1335] [2019-09-10 07:48:12,990 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:12,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:13,022 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:13,332 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:13,332 INFO L272 AbstractInterpreter]: Visited 127 different actions 578 times. Merged at 52 different actions 400 times. Widened at 15 different actions 49 times. Performed 2308 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2308 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 44 fixpoints after 13 different actions. Largest state had 204 variables. [2019-09-10 07:48:13,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:13,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:13,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:13,333 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:13,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:13,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:48:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:13,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 07:48:13,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:14,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:14,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:14,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:14,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:16,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:17,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:17,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:17,957 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-09-10 07:48:19,392 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-09-10 07:48:19,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:19,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:48:19,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 18] total 60 [2019-09-10 07:48:19,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:48:19,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 07:48:19,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 07:48:19,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3300, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 07:48:19,686 INFO L87 Difference]: Start difference. First operand 195884 states and 233069 transitions. Second operand 44 states. [2019-09-10 07:48:20,050 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 07:48:25,966 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:48:26,478 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 07:48:27,507 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:48:27,897 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:48:28,287 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:48:28,617 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:48:28,919 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:48:29,465 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:48:29,836 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 07:48:30,357 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 07:48:32,243 WARN L188 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-10 07:48:32,833 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:48:33,151 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:48:35,296 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 07:48:35,684 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:48:38,780 WARN L188 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-10 07:48:40,255 WARN L188 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:48:42,467 WARN L188 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-10 07:48:44,044 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:48:46,218 WARN L188 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-10 07:48:46,597 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:48:48,723 WARN L188 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:48:49,605 WARN L188 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 07:48:51,792 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:48:52,620 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 07:49:03,753 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 07:49:05,109 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:49:06,933 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:49:07,990 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:49:10,414 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:49:10,647 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:49:11,064 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:49:16,553 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 07:49:18,637 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:49:18,947 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 07:49:19,468 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:49:19,722 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 07:49:22,360 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 07:49:23,675 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 07:49:24,549 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-10 07:49:24,941 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:49:32,202 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-10 07:49:32,556 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-10 07:49:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:38,479 INFO L93 Difference]: Finished difference Result 998924 states and 1192770 transitions. [2019-09-10 07:49:38,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-10 07:49:38,479 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 136 [2019-09-10 07:49:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:39,620 INFO L225 Difference]: With dead ends: 998924 [2019-09-10 07:49:39,620 INFO L226 Difference]: Without dead ends: 998924 [2019-09-10 07:49:39,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 225 SyntacticMatches, 15 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 46.3s TimeCoverageRelationStatistics Valid=2113, Invalid=15709, Unknown=0, NotChecked=0, Total=17822 [2019-09-10 07:49:40,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998924 states. [2019-09-10 07:49:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998924 to 233807. [2019-09-10 07:49:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233807 states. [2019-09-10 07:49:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233807 states to 233807 states and 277543 transitions. [2019-09-10 07:49:46,673 INFO L78 Accepts]: Start accepts. Automaton has 233807 states and 277543 transitions. Word has length 136 [2019-09-10 07:49:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:46,673 INFO L475 AbstractCegarLoop]: Abstraction has 233807 states and 277543 transitions. [2019-09-10 07:49:46,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 07:49:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 233807 states and 277543 transitions. [2019-09-10 07:49:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 07:49:46,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:46,683 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] [2019-09-10 07:49:46,684 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:46,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:46,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1583904813, now seen corresponding path program 1 times [2019-09-10 07:49:46,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:46,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:46,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:46,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:46,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:47,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:47,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:49:47,446 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2019-09-10 07:49:47,446 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], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [134], [137], [140], [143], [146], [148], [150], [153], [156], [159], [161], [163], [166], [169], [174], [176], [179], [182], [185], [187], [189], [192], [196], [199], [202], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [235], [237], [240], [243], [246], [248], [250], [253], [256], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [287], [296], [299], [303], [305], [308], [314], [317], [320], [322], [339], [342], [345], [347], [355], [358], [364], [367], [370], [372], [389], [392], [395], [397], [436], [491], [1328], [1329], [1333], [1334], [1335] [2019-09-10 07:49:47,449 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:49:47,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:49:47,471 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:49:47,905 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:49:47,905 INFO L272 AbstractInterpreter]: Visited 128 different actions 595 times. Merged at 52 different actions 418 times. Widened at 15 different actions 49 times. Performed 2225 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2225 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 44 fixpoints after 13 different actions. Largest state had 204 variables. [2019-09-10 07:49:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:47,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:49:47,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:47,906 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:49:47,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:47,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:49:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:48,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:49:48,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:48,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:48,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:48,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:48,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:48,595 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:51,663 WARN L188 SmtUtils]: Spent 2.84 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-10 07:49:51,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:51,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:51,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:51,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:51,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:51,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:51,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:51,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:51,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:51,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:51,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:49:51,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 38 [2019-09-10 07:49:51,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:49:51,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:49:51,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:49:51,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:49:51,840 INFO L87 Difference]: Start difference. First operand 233807 states and 277543 transitions. Second operand 32 states. [2019-09-10 07:49:51,987 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-09-10 07:49:54,792 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-10 07:49:54,942 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 07:49:55,131 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-09-10 07:49:55,502 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-10 07:49:55,736 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 07:49:55,883 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 07:49:56,085 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-09-10 07:49:57,528 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 07:49:57,723 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 07:49:58,102 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-09-10 07:49:58,339 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2019-09-10 07:49:58,608 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 07:49:58,790 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 07:49:59,100 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-09-10 07:49:59,396 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 07:49:59,662 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2019-09-10 07:49:59,818 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 07:50:00,012 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-09-10 07:50:00,311 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-10 07:50:00,847 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 07:50:01,228 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:50:01,393 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 07:50:01,622 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 07:50:01,973 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 07:50:02,187 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-09-10 07:50:02,407 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-09-10 07:50:02,573 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:50:03,343 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-10 07:50:03,509 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 07:50:04,932 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 07:50:05,174 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:50:05,580 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 07:50:05,840 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-09-10 07:50:06,208 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 07:50:06,408 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:50:06,580 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-09-10 07:50:06,893 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-09-10 07:50:07,122 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:50:07,504 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-10 07:50:07,942 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:50:08,440 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-09-10 07:50:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:09,246 INFO L93 Difference]: Finished difference Result 478699 states and 565037 transitions. [2019-09-10 07:50:09,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-10 07:50:09,246 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 137 [2019-09-10 07:50:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:09,777 INFO L225 Difference]: With dead ends: 478699 [2019-09-10 07:50:09,777 INFO L226 Difference]: Without dead ends: 478699 [2019-09-10 07:50:09,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 256 SyntacticMatches, 4 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5060 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=3140, Invalid=14682, Unknown=0, NotChecked=0, Total=17822 [2019-09-10 07:50:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478699 states. [2019-09-10 07:50:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478699 to 194933. [2019-09-10 07:50:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194933 states. [2019-09-10 07:50:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194933 states to 194933 states and 231134 transitions. [2019-09-10 07:50:13,044 INFO L78 Accepts]: Start accepts. Automaton has 194933 states and 231134 transitions. Word has length 137 [2019-09-10 07:50:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:13,044 INFO L475 AbstractCegarLoop]: Abstraction has 194933 states and 231134 transitions. [2019-09-10 07:50:13,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 07:50:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 194933 states and 231134 transitions. [2019-09-10 07:50:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 07:50:13,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:13,051 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] [2019-09-10 07:50:13,051 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:13,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:13,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1179212656, now seen corresponding path program 1 times [2019-09-10 07:50:13,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:13,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:13,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:13,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:13,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:14,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:14,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:50:14,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2019-09-10 07:50:14,572 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], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [134], [137], [140], [143], [146], [148], [150], [153], [156], [159], [161], [163], [166], [169], [174], [176], [179], [182], [185], [187], [189], [192], [196], [199], [202], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [235], [237], [240], [243], [248], [250], [253], [256], [259], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [287], [296], [299], [303], [314], [317], [320], [322], [330], [333], [339], [342], [345], [347], [355], [358], [364], [367], [370], [372], [389], [392], [395], [397], [436], [491], [1328], [1329], [1333], [1334], [1335] [2019-09-10 07:50:14,575 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:50:14,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:50:14,604 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:50:14,965 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:50:14,965 INFO L272 AbstractInterpreter]: Visited 128 different actions 545 times. Merged at 52 different actions 372 times. Widened at 13 different actions 38 times. Performed 2109 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2109 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 9 different actions. Largest state had 204 variables. [2019-09-10 07:50:14,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:14,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:50:14,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:14,966 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:50:14,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:14,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:50:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:15,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 07:50:15,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:50:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:15,749 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2019-09-10 07:50:16,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:16,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:16,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:17,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:50:17,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:17,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:17,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:18,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:18,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:18,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:18,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:18,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:18,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:18,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:22,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:50:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:22,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:50:22,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 16] total 54 [2019-09-10 07:50:22,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:50:22,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 07:50:22,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 07:50:22,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2699, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:50:22,730 INFO L87 Difference]: Start difference. First operand 194933 states and 231134 transitions. Second operand 40 states. [2019-09-10 07:50:23,071 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-09-10 07:50:24,738 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:50:25,011 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 07:50:25,267 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 07:50:25,583 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:50:40,978 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 07:50:56,818 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 54