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.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:47:36,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:47:36,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:47:36,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:47:36,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:47:36,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:47:36,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:47:36,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:47:36,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:47:36,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:47:36,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:47:36,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:47:36,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:47:36,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:47:36,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:47:36,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:47:36,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:47:36,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:47:36,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:47:36,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:47:36,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:47:36,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:47:36,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:47:36,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:47:36,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:47:36,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:47:36,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:47:36,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:47:36,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:47:36,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:47:36,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:47:36,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:47:36,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:47:36,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:47:36,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:47:36,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:47:36,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:47:36,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:47:36,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:47:36,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:47:36,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:47:36,478 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:47:36,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:47:36,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:47:36,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:47:36,502 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:47:36,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:47:36,503 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:47:36,503 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:47:36,504 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:47:36,504 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:47:36,504 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:47:36,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:47:36,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:47:36,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:47:36,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:47:36,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:47:36,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:47:36,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:47:36,508 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:47:36,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:47:36,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:47:36,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:47:36,509 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:47:36,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:47:36,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:47:36,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:47:36,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:47:36,510 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:47:36,510 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:47:36,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:47:36,510 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:47:36,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:47:36,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:47:36,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:47:36,561 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:47:36,562 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:47:36,562 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.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 07:47:36,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50990cf1c/919ff0d84bf64fbc8e94db6590953fa0/FLAGd28544da1 [2019-09-10 07:47:37,277 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:47:37,279 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 07:47:37,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50990cf1c/919ff0d84bf64fbc8e94db6590953fa0/FLAGd28544da1 [2019-09-10 07:47:37,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50990cf1c/919ff0d84bf64fbc8e94db6590953fa0 [2019-09-10 07:47:37,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:47:37,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:47:37,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:47:37,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:47:37,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:47:37,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:47:37" (1/1) ... [2019-09-10 07:47:37,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13acec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:37, skipping insertion in model container [2019-09-10 07:47:37,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:47:37" (1/1) ... [2019-09-10 07:47:37,518 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:47:37,610 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:47:38,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:47:38,307 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:47:38,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:47:38,714 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:47:38,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:38 WrapperNode [2019-09-10 07:47:38,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:47:38,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:47:38,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:47:38,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:47:38,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:38" (1/1) ... [2019-09-10 07:47:38,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:38" (1/1) ... [2019-09-10 07:47:38,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:38" (1/1) ... [2019-09-10 07:47:38,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:38" (1/1) ... [2019-09-10 07:47:38,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:38" (1/1) ... [2019-09-10 07:47:38,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:38" (1/1) ... [2019-09-10 07:47:38,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:38" (1/1) ... [2019-09-10 07:47:38,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:47:38,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:47:38,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:47:38,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:47:38,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:47:38,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:47:38,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:47:38,937 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:47:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:47:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:47:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:47:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:47:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:47:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:47:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:47:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:47:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:47:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:47:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:47:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:47:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:47:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:47:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:47:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:47:40,818 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:47:40,818 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:47:40,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:47:40 BoogieIcfgContainer [2019-09-10 07:47:40,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:47:40,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:47:40,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:47:40,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:47:40,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:47:37" (1/3) ... [2019-09-10 07:47:40,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27539ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:47:40, skipping insertion in model container [2019-09-10 07:47:40,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:38" (2/3) ... [2019-09-10 07:47:40,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27539ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:47:40, skipping insertion in model container [2019-09-10 07:47:40,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:47:40" (3/3) ... [2019-09-10 07:47:40,838 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 07:47:40,851 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:47:40,873 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-10 07:47:40,893 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-10 07:47:40,922 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:47:40,922 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:47:40,922 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:47:40,922 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:47:40,923 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:47:40,923 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:47:40,923 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:47:40,923 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:47:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states. [2019-09-10 07:47:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 07:47:40,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:40,981 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:47:40,983 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:40,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2051434743, now seen corresponding path program 1 times [2019-09-10 07:47:40,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:41,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:41,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:41,548 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:47:41,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:41,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:47:41,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:41,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:47:41,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:47:41,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:47:41,576 INFO L87 Difference]: Start difference. First operand 363 states. Second operand 5 states. [2019-09-10 07:47:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:41,992 INFO L93 Difference]: Finished difference Result 310 states and 512 transitions. [2019-09-10 07:47:41,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:47:41,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-10 07:47:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:42,010 INFO L225 Difference]: With dead ends: 310 [2019-09-10 07:47:42,011 INFO L226 Difference]: Without dead ends: 298 [2019-09-10 07:47:42,012 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:47:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-10 07:47:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-09-10 07:47:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-10 07:47:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 371 transitions. [2019-09-10 07:47:42,072 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 371 transitions. Word has length 63 [2019-09-10 07:47:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:42,072 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 371 transitions. [2019-09-10 07:47:42,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:47:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 371 transitions. [2019-09-10 07:47:42,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:47:42,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:42,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:42,077 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:42,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:42,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1195165915, now seen corresponding path program 1 times [2019-09-10 07:47:42,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:42,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:42,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:42,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:42,272 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:47:42,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:42,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:47:42,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:42,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:47:42,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:47:42,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:47:42,277 INFO L87 Difference]: Start difference. First operand 298 states and 371 transitions. Second operand 5 states. [2019-09-10 07:47:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:42,573 INFO L93 Difference]: Finished difference Result 272 states and 340 transitions. [2019-09-10 07:47:42,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:47:42,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 07:47:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:42,576 INFO L225 Difference]: With dead ends: 272 [2019-09-10 07:47:42,576 INFO L226 Difference]: Without dead ends: 272 [2019-09-10 07:47:42,577 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:47:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-10 07:47:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-10 07:47:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-10 07:47:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 340 transitions. [2019-09-10 07:47:42,593 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 340 transitions. Word has length 64 [2019-09-10 07:47:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:42,593 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 340 transitions. [2019-09-10 07:47:42,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:47:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 340 transitions. [2019-09-10 07:47:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:47:42,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:42,596 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:47:42,597 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:42,598 INFO L82 PathProgramCache]: Analyzing trace with hash -477481019, now seen corresponding path program 1 times [2019-09-10 07:47:42,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:42,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:42,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:42,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:42,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:42,767 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:47:42,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:42,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:47:42,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:42,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:47:42,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:47:42,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:47:42,769 INFO L87 Difference]: Start difference. First operand 272 states and 340 transitions. Second operand 6 states. [2019-09-10 07:47:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:43,032 INFO L93 Difference]: Finished difference Result 367 states and 453 transitions. [2019-09-10 07:47:43,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:47:43,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-10 07:47:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:43,039 INFO L225 Difference]: With dead ends: 367 [2019-09-10 07:47:43,039 INFO L226 Difference]: Without dead ends: 367 [2019-09-10 07:47:43,040 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:47:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-09-10 07:47:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 327. [2019-09-10 07:47:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-10 07:47:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 420 transitions. [2019-09-10 07:47:43,073 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 420 transitions. Word has length 65 [2019-09-10 07:47:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:43,074 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 420 transitions. [2019-09-10 07:47:43,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:47:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 420 transitions. [2019-09-10 07:47:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:47:43,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:43,078 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:47:43,078 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:43,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1802107193, now seen corresponding path program 1 times [2019-09-10 07:47:43,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:43,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:43,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:43,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:43,243 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:47:43,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:43,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:47:43,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:43,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:47:43,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:47:43,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:47:43,244 INFO L87 Difference]: Start difference. First operand 327 states and 420 transitions. Second operand 5 states. [2019-09-10 07:47:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:43,455 INFO L93 Difference]: Finished difference Result 316 states and 406 transitions. [2019-09-10 07:47:43,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:47:43,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-10 07:47:43,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:43,458 INFO L225 Difference]: With dead ends: 316 [2019-09-10 07:47:43,458 INFO L226 Difference]: Without dead ends: 316 [2019-09-10 07:47:43,459 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:47:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-10 07:47:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2019-09-10 07:47:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:47:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 406 transitions. [2019-09-10 07:47:43,469 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 406 transitions. Word has length 66 [2019-09-10 07:47:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:43,470 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 406 transitions. [2019-09-10 07:47:43,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:47:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 406 transitions. [2019-09-10 07:47:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:47:43,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:43,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:43,473 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:43,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:43,474 INFO L82 PathProgramCache]: Analyzing trace with hash -350473883, now seen corresponding path program 1 times [2019-09-10 07:47:43,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:43,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:43,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:43,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:43,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:43,724 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:47:43,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:43,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:47:43,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:43,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:47:43,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:47:43,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:47:43,726 INFO L87 Difference]: Start difference. First operand 316 states and 406 transitions. Second operand 8 states. [2019-09-10 07:47:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:44,191 INFO L93 Difference]: Finished difference Result 511 states and 670 transitions. [2019-09-10 07:47:44,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:47:44,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-09-10 07:47:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:44,195 INFO L225 Difference]: With dead ends: 511 [2019-09-10 07:47:44,195 INFO L226 Difference]: Without dead ends: 511 [2019-09-10 07:47:44,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:47:44,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-10 07:47:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 316. [2019-09-10 07:47:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:47:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 405 transitions. [2019-09-10 07:47:44,206 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 405 transitions. Word has length 67 [2019-09-10 07:47:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:44,206 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 405 transitions. [2019-09-10 07:47:44,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:47:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 405 transitions. [2019-09-10 07:47:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:47:44,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:44,208 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:44,208 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash 282133846, now seen corresponding path program 1 times [2019-09-10 07:47:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:44,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:44,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:44,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:44,368 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:47:44,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:44,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:44,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:44,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:44,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:44,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:44,370 INFO L87 Difference]: Start difference. First operand 316 states and 405 transitions. Second operand 9 states. [2019-09-10 07:47:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:45,527 INFO L93 Difference]: Finished difference Result 726 states and 983 transitions. [2019-09-10 07:47:45,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:47:45,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:47:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:45,532 INFO L225 Difference]: With dead ends: 726 [2019-09-10 07:47:45,532 INFO L226 Difference]: Without dead ends: 726 [2019-09-10 07:47:45,533 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:47:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-10 07:47:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 316. [2019-09-10 07:47:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:47:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 404 transitions. [2019-09-10 07:47:45,547 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 404 transitions. Word has length 67 [2019-09-10 07:47:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:45,547 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 404 transitions. [2019-09-10 07:47:45,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 404 transitions. [2019-09-10 07:47:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:47:45,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:45,549 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:47:45,550 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:45,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1203066546, now seen corresponding path program 1 times [2019-09-10 07:47:45,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:45,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:45,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:45,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:45,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:45,717 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:47:45,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:45,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:45,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:45,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:45,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:45,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:45,719 INFO L87 Difference]: Start difference. First operand 316 states and 404 transitions. Second operand 9 states. [2019-09-10 07:47:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:46,731 INFO L93 Difference]: Finished difference Result 726 states and 982 transitions. [2019-09-10 07:47:46,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:47:46,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:47:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:46,735 INFO L225 Difference]: With dead ends: 726 [2019-09-10 07:47:46,735 INFO L226 Difference]: Without dead ends: 726 [2019-09-10 07:47:46,736 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:47:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-10 07:47:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 316. [2019-09-10 07:47:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:47:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 403 transitions. [2019-09-10 07:47:46,748 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 403 transitions. Word has length 67 [2019-09-10 07:47:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:46,749 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 403 transitions. [2019-09-10 07:47:46,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 403 transitions. [2019-09-10 07:47:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:47:46,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:46,750 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:47:46,751 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:46,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1166947524, now seen corresponding path program 1 times [2019-09-10 07:47:46,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:46,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:46,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:46,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:46,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:46,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:46,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:46,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:46,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:46,914 INFO L87 Difference]: Start difference. First operand 316 states and 403 transitions. Second operand 9 states. [2019-09-10 07:47:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:47,975 INFO L93 Difference]: Finished difference Result 726 states and 980 transitions. [2019-09-10 07:47:47,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:47:47,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:47:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:47,981 INFO L225 Difference]: With dead ends: 726 [2019-09-10 07:47:47,981 INFO L226 Difference]: Without dead ends: 726 [2019-09-10 07:47:47,982 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:47:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-10 07:47:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 316. [2019-09-10 07:47:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:47:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 402 transitions. [2019-09-10 07:47:48,001 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 402 transitions. Word has length 69 [2019-09-10 07:47:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:48,002 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 402 transitions. [2019-09-10 07:47:48,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 402 transitions. [2019-09-10 07:47:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:47:48,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:48,004 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:47:48,005 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:48,006 INFO L82 PathProgramCache]: Analyzing trace with hash 77892723, now seen corresponding path program 1 times [2019-09-10 07:47:48,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:48,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:48,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:48,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:48,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:48,239 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:47:48,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:48,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:48,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:48,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:48,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:48,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:48,241 INFO L87 Difference]: Start difference. First operand 316 states and 402 transitions. Second operand 9 states. [2019-09-10 07:47:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:49,243 INFO L93 Difference]: Finished difference Result 714 states and 959 transitions. [2019-09-10 07:47:49,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:47:49,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:47:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:49,248 INFO L225 Difference]: With dead ends: 714 [2019-09-10 07:47:49,249 INFO L226 Difference]: Without dead ends: 714 [2019-09-10 07:47:49,249 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:47:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-10 07:47:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 316. [2019-09-10 07:47:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:47:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 401 transitions. [2019-09-10 07:47:49,261 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 401 transitions. Word has length 69 [2019-09-10 07:47:49,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:49,261 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 401 transitions. [2019-09-10 07:47:49,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 401 transitions. [2019-09-10 07:47:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:47:49,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:49,262 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:47:49,263 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:49,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:49,263 INFO L82 PathProgramCache]: Analyzing trace with hash -307155438, now seen corresponding path program 1 times [2019-09-10 07:47:49,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:49,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:49,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:49,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:49,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:49,408 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:47:49,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:49,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:49,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:49,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:49,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:49,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:49,410 INFO L87 Difference]: Start difference. First operand 316 states and 401 transitions. Second operand 9 states. [2019-09-10 07:47:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:50,601 INFO L93 Difference]: Finished difference Result 726 states and 979 transitions. [2019-09-10 07:47:50,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:47:50,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:47:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:50,608 INFO L225 Difference]: With dead ends: 726 [2019-09-10 07:47:50,608 INFO L226 Difference]: Without dead ends: 726 [2019-09-10 07:47:50,609 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:47:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-10 07:47:50,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 316. [2019-09-10 07:47:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:47:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 400 transitions. [2019-09-10 07:47:50,620 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 400 transitions. Word has length 69 [2019-09-10 07:47:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:50,620 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 400 transitions. [2019-09-10 07:47:50,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 400 transitions. [2019-09-10 07:47:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:47:50,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:50,622 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:47:50,622 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2116702936, now seen corresponding path program 1 times [2019-09-10 07:47:50,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:50,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:50,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:50,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:50,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:50,779 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:47:50,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:50,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:50,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:50,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:50,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:50,781 INFO L87 Difference]: Start difference. First operand 316 states and 400 transitions. Second operand 9 states. [2019-09-10 07:47:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:51,852 INFO L93 Difference]: Finished difference Result 726 states and 977 transitions. [2019-09-10 07:47:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:47:51,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:47:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:51,856 INFO L225 Difference]: With dead ends: 726 [2019-09-10 07:47:51,856 INFO L226 Difference]: Without dead ends: 726 [2019-09-10 07:47:51,857 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:47:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-10 07:47:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 316. [2019-09-10 07:47:51,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:47:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 399 transitions. [2019-09-10 07:47:51,867 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 399 transitions. Word has length 69 [2019-09-10 07:47:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:51,867 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 399 transitions. [2019-09-10 07:47:51,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 399 transitions. [2019-09-10 07:47:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:47:51,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:51,868 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:47:51,869 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash 249107848, now seen corresponding path program 1 times [2019-09-10 07:47:51,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:51,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:51,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:51,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:51,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:52,019 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:47:52,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:52,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:52,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:52,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:52,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:52,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:52,020 INFO L87 Difference]: Start difference. First operand 316 states and 399 transitions. Second operand 9 states. [2019-09-10 07:47:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:52,879 INFO L93 Difference]: Finished difference Result 714 states and 956 transitions. [2019-09-10 07:47:52,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:47:52,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:47:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:52,885 INFO L225 Difference]: With dead ends: 714 [2019-09-10 07:47:52,885 INFO L226 Difference]: Without dead ends: 714 [2019-09-10 07:47:52,885 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:47:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-10 07:47:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 316. [2019-09-10 07:47:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:47:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 398 transitions. [2019-09-10 07:47:52,895 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 398 transitions. Word has length 69 [2019-09-10 07:47:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:52,896 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 398 transitions. [2019-09-10 07:47:52,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:52,896 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 398 transitions. [2019-09-10 07:47:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:47:52,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:52,897 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:47:52,897 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:52,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:52,898 INFO L82 PathProgramCache]: Analyzing trace with hash -913030277, now seen corresponding path program 1 times [2019-09-10 07:47:52,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:52,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:52,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:52,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:52,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:53,024 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:47:53,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:53,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:53,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:53,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:53,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:53,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:53,026 INFO L87 Difference]: Start difference. First operand 316 states and 398 transitions. Second operand 9 states. [2019-09-10 07:47:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:54,149 INFO L93 Difference]: Finished difference Result 714 states and 954 transitions. [2019-09-10 07:47:54,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:47:54,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:47:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:54,154 INFO L225 Difference]: With dead ends: 714 [2019-09-10 07:47:54,154 INFO L226 Difference]: Without dead ends: 714 [2019-09-10 07:47:54,155 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:47:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-10 07:47:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 316. [2019-09-10 07:47:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:47:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 397 transitions. [2019-09-10 07:47:54,163 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 397 transitions. Word has length 69 [2019-09-10 07:47:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:54,164 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 397 transitions. [2019-09-10 07:47:54,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 397 transitions. [2019-09-10 07:47:54,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:47:54,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:54,165 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:47:54,166 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:54,166 INFO L82 PathProgramCache]: Analyzing trace with hash 360843612, now seen corresponding path program 1 times [2019-09-10 07:47:54,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:54,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:54,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:54,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:54,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:54,291 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:47:54,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:54,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:54,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:54,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:54,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:54,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:54,292 INFO L87 Difference]: Start difference. First operand 316 states and 397 transitions. Second operand 9 states. [2019-09-10 07:47:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:55,091 INFO L93 Difference]: Finished difference Result 714 states and 953 transitions. [2019-09-10 07:47:55,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:47:55,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:47:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:55,095 INFO L225 Difference]: With dead ends: 714 [2019-09-10 07:47:55,095 INFO L226 Difference]: Without dead ends: 714 [2019-09-10 07:47:55,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:47:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-10 07:47:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 316. [2019-09-10 07:47:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:47:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 396 transitions. [2019-09-10 07:47:55,105 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 396 transitions. Word has length 69 [2019-09-10 07:47:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:55,105 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 396 transitions. [2019-09-10 07:47:55,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:55,106 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 396 transitions. [2019-09-10 07:47:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:47:55,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:55,107 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:47:55,107 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:55,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2098110889, now seen corresponding path program 1 times [2019-09-10 07:47:55,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:55,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:55,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:55,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:55,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:55,904 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:47:55,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:55,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:47:55,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:55,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:47:55,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:47:55,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:47:55,905 INFO L87 Difference]: Start difference. First operand 316 states and 396 transitions. Second operand 16 states. [2019-09-10 07:47:56,594 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:47:56,971 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:47:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:58,149 INFO L93 Difference]: Finished difference Result 754 states and 965 transitions. [2019-09-10 07:47:58,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:47:58,150 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-10 07:47:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:58,154 INFO L225 Difference]: With dead ends: 754 [2019-09-10 07:47:58,154 INFO L226 Difference]: Without dead ends: 754 [2019-09-10 07:47:58,155 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:47:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-10 07:47:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 330. [2019-09-10 07:47:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-10 07:47:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 415 transitions. [2019-09-10 07:47:58,164 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 415 transitions. Word has length 71 [2019-09-10 07:47:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:58,164 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 415 transitions. [2019-09-10 07:47:58,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:47:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 415 transitions. [2019-09-10 07:47:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:47:58,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:58,166 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:47:58,166 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:58,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1752408440, now seen corresponding path program 1 times [2019-09-10 07:47:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:58,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:58,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:59,374 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:47:59,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:59,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:47:59,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:59,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:47:59,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:47:59,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:47:59,376 INFO L87 Difference]: Start difference. First operand 330 states and 415 transitions. Second operand 21 states. [2019-09-10 07:48:00,068 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:48:00,205 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:48:00,377 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:48:00,611 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 07:48:00,955 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-10 07:48:01,152 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:48:01,361 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:48:01,526 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:48:01,800 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:48:02,054 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:48:02,245 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:48:02,501 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:48:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:04,184 INFO L93 Difference]: Finished difference Result 649 states and 817 transitions. [2019-09-10 07:48:04,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:48:04,184 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-09-10 07:48:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:04,186 INFO L225 Difference]: With dead ends: 649 [2019-09-10 07:48:04,187 INFO L226 Difference]: Without dead ends: 649 [2019-09-10 07:48:04,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:48:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-10 07:48:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 330. [2019-09-10 07:48:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-10 07:48:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 414 transitions. [2019-09-10 07:48:04,195 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 414 transitions. Word has length 71 [2019-09-10 07:48:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:04,195 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 414 transitions. [2019-09-10 07:48:04,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:48:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 414 transitions. [2019-09-10 07:48:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:48:04,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:04,197 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:48:04,197 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:04,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:04,198 INFO L82 PathProgramCache]: Analyzing trace with hash 841585007, now seen corresponding path program 1 times [2019-09-10 07:48:04,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:04,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:04,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:04,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:04,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:04,861 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:48:04,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:04,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:48:04,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:04,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:48:04,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:48:04,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:48:04,862 INFO L87 Difference]: Start difference. First operand 330 states and 414 transitions. Second operand 17 states. [2019-09-10 07:48:05,432 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:48:05,588 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 07:48:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:06,726 INFO L93 Difference]: Finished difference Result 528 states and 673 transitions. [2019-09-10 07:48:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:48:06,727 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2019-09-10 07:48:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:06,730 INFO L225 Difference]: With dead ends: 528 [2019-09-10 07:48:06,730 INFO L226 Difference]: Without dead ends: 528 [2019-09-10 07:48:06,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:48:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-10 07:48:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 305. [2019-09-10 07:48:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-10 07:48:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 382 transitions. [2019-09-10 07:48:06,738 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 382 transitions. Word has length 71 [2019-09-10 07:48:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:06,738 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 382 transitions. [2019-09-10 07:48:06,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:48:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 382 transitions. [2019-09-10 07:48:06,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:48:06,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:06,739 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:48:06,740 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:06,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash 176129943, now seen corresponding path program 1 times [2019-09-10 07:48:06,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:06,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:06,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:06,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:06,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:08,004 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:48:08,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:08,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:48:08,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:08,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:48:08,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:48:08,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:08,006 INFO L87 Difference]: Start difference. First operand 305 states and 382 transitions. Second operand 21 states. [2019-09-10 07:48:08,149 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:48:08,929 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:48:09,123 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 07:48:09,410 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 07:48:09,597 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:48:09,780 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:48:10,001 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:48:10,729 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:48:11,305 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:48:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:12,073 INFO L93 Difference]: Finished difference Result 634 states and 797 transitions. [2019-09-10 07:48:12,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:48:12,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-09-10 07:48:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:12,075 INFO L225 Difference]: With dead ends: 634 [2019-09-10 07:48:12,075 INFO L226 Difference]: Without dead ends: 634 [2019-09-10 07:48:12,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:48:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-09-10 07:48:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 320. [2019-09-10 07:48:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-10 07:48:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 403 transitions. [2019-09-10 07:48:12,084 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 403 transitions. Word has length 71 [2019-09-10 07:48:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:12,084 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 403 transitions. [2019-09-10 07:48:12,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:48:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 403 transitions. [2019-09-10 07:48:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:48:12,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:12,086 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:48:12,086 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:12,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2101080436, now seen corresponding path program 1 times [2019-09-10 07:48:12,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:12,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:12,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:12,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:12,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:12,632 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:48:12,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:12,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:48:12,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:12,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:48:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:48:12,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:48:12,634 INFO L87 Difference]: Start difference. First operand 320 states and 403 transitions. Second operand 14 states. [2019-09-10 07:48:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:14,175 INFO L93 Difference]: Finished difference Result 580 states and 764 transitions. [2019-09-10 07:48:14,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:48:14,179 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-09-10 07:48:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:14,181 INFO L225 Difference]: With dead ends: 580 [2019-09-10 07:48:14,181 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 07:48:14,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:48:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 07:48:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 293. [2019-09-10 07:48:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-10 07:48:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 369 transitions. [2019-09-10 07:48:14,190 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 369 transitions. Word has length 71 [2019-09-10 07:48:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:14,190 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 369 transitions. [2019-09-10 07:48:14,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:48:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 369 transitions. [2019-09-10 07:48:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:48:14,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:14,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:14,192 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:14,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:14,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1738970789, now seen corresponding path program 1 times [2019-09-10 07:48:14,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:14,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:14,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:14,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:14,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:14,567 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:48:14,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:14,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:48:14,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:14,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:48:14,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:48:14,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:48:14,569 INFO L87 Difference]: Start difference. First operand 293 states and 369 transitions. Second operand 11 states. [2019-09-10 07:48:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:15,304 INFO L93 Difference]: Finished difference Result 1197 states and 1683 transitions. [2019-09-10 07:48:15,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:48:15,304 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-10 07:48:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:15,309 INFO L225 Difference]: With dead ends: 1197 [2019-09-10 07:48:15,310 INFO L226 Difference]: Without dead ends: 1197 [2019-09-10 07:48:15,310 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:48:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-09-10 07:48:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 262. [2019-09-10 07:48:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-10 07:48:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 329 transitions. [2019-09-10 07:48:15,318 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 329 transitions. Word has length 72 [2019-09-10 07:48:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:15,318 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 329 transitions. [2019-09-10 07:48:15,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:48:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 329 transitions. [2019-09-10 07:48:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:48:15,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:15,320 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:48:15,320 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1749461620, now seen corresponding path program 1 times [2019-09-10 07:48:15,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:15,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:15,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:15,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:15,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:15,751 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:48:15,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:15,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:48:15,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:15,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:48:15,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:48:15,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:48:15,753 INFO L87 Difference]: Start difference. First operand 262 states and 329 transitions. Second operand 13 states. [2019-09-10 07:48:16,407 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-09-10 07:48:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:17,379 INFO L93 Difference]: Finished difference Result 1287 states and 1824 transitions. [2019-09-10 07:48:17,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:48:17,379 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-09-10 07:48:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:17,386 INFO L225 Difference]: With dead ends: 1287 [2019-09-10 07:48:17,386 INFO L226 Difference]: Without dead ends: 1287 [2019-09-10 07:48:17,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:48:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-09-10 07:48:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 240. [2019-09-10 07:48:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-10 07:48:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 305 transitions. [2019-09-10 07:48:17,406 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 305 transitions. Word has length 72 [2019-09-10 07:48:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:17,406 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 305 transitions. [2019-09-10 07:48:17,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:48:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 305 transitions. [2019-09-10 07:48:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:48:17,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:17,407 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:48:17,408 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:17,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:17,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1380903087, now seen corresponding path program 1 times [2019-09-10 07:48:17,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:17,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:17,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:17,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:17,534 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:48:17,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:17,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:17,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:17,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:17,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:17,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:17,537 INFO L87 Difference]: Start difference. First operand 240 states and 305 transitions. Second operand 9 states. [2019-09-10 07:48:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:18,201 INFO L93 Difference]: Finished difference Result 595 states and 815 transitions. [2019-09-10 07:48:18,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:48:18,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 07:48:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:18,205 INFO L225 Difference]: With dead ends: 595 [2019-09-10 07:48:18,205 INFO L226 Difference]: Without dead ends: 595 [2019-09-10 07:48:18,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-10 07:48:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 240. [2019-09-10 07:48:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-10 07:48:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 304 transitions. [2019-09-10 07:48:18,211 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 304 transitions. Word has length 72 [2019-09-10 07:48:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:18,211 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 304 transitions. [2019-09-10 07:48:18,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 304 transitions. [2019-09-10 07:48:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:48:18,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:18,212 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:48:18,213 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:18,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:18,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1779169883, now seen corresponding path program 1 times [2019-09-10 07:48:18,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:18,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:18,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:18,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:18,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:18,499 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:48:18,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:18,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:48:18,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:18,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:48:18,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:48:18,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:48:18,501 INFO L87 Difference]: Start difference. First operand 240 states and 304 transitions. Second operand 11 states. [2019-09-10 07:48:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:19,083 INFO L93 Difference]: Finished difference Result 1115 states and 1588 transitions. [2019-09-10 07:48:19,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:48:19,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-10 07:48:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:19,089 INFO L225 Difference]: With dead ends: 1115 [2019-09-10 07:48:19,089 INFO L226 Difference]: Without dead ends: 1115 [2019-09-10 07:48:19,089 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:48:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2019-09-10 07:48:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 225. [2019-09-10 07:48:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-10 07:48:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 285 transitions. [2019-09-10 07:48:19,096 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 285 transitions. Word has length 72 [2019-09-10 07:48:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:19,096 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 285 transitions. [2019-09-10 07:48:19,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:48:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 285 transitions. [2019-09-10 07:48:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:48:19,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:19,097 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:48:19,098 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash 949044476, now seen corresponding path program 1 times [2019-09-10 07:48:19,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:19,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:19,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:19,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:19,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:19,449 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:48:19,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:19,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:48:19,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:19,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:48:19,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:48:19,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:48:19,451 INFO L87 Difference]: Start difference. First operand 225 states and 285 transitions. Second operand 12 states. [2019-09-10 07:48:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:20,376 INFO L93 Difference]: Finished difference Result 382 states and 493 transitions. [2019-09-10 07:48:20,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:48:20,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-09-10 07:48:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:20,379 INFO L225 Difference]: With dead ends: 382 [2019-09-10 07:48:20,379 INFO L226 Difference]: Without dead ends: 382 [2019-09-10 07:48:20,379 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:48:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-09-10 07:48:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 221. [2019-09-10 07:48:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 07:48:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 280 transitions. [2019-09-10 07:48:20,393 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 280 transitions. Word has length 72 [2019-09-10 07:48:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:20,394 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 280 transitions. [2019-09-10 07:48:20,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:48:20,394 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 280 transitions. [2019-09-10 07:48:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:48:20,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:20,395 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:48:20,396 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:20,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1698523617, now seen corresponding path program 1 times [2019-09-10 07:48:20,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:20,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:20,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:20,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:20,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:20,539 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:48:20,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:20,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:20,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:20,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:20,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:20,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:20,542 INFO L87 Difference]: Start difference. First operand 221 states and 280 transitions. Second operand 9 states. [2019-09-10 07:48:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:21,164 INFO L93 Difference]: Finished difference Result 370 states and 481 transitions. [2019-09-10 07:48:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:48:21,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 07:48:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:21,168 INFO L225 Difference]: With dead ends: 370 [2019-09-10 07:48:21,168 INFO L226 Difference]: Without dead ends: 370 [2019-09-10 07:48:21,168 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:48:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-10 07:48:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 221. [2019-09-10 07:48:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 07:48:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 279 transitions. [2019-09-10 07:48:21,174 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 279 transitions. Word has length 73 [2019-09-10 07:48:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:21,174 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 279 transitions. [2019-09-10 07:48:21,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 279 transitions. [2019-09-10 07:48:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:48:21,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:21,175 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:48:21,176 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1821871537, now seen corresponding path program 1 times [2019-09-10 07:48:21,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:21,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:21,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:21,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:21,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:22,217 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:48:22,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:22,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:48:22,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:22,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:48:22,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:48:22,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:22,218 INFO L87 Difference]: Start difference. First operand 221 states and 279 transitions. Second operand 21 states. [2019-09-10 07:48:22,351 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 07:48:23,098 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:48:23,262 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:48:23,498 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:48:23,693 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:48:23,874 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:48:24,117 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:48:24,661 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:48:25,048 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:48:26,591 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:48:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:27,052 INFO L93 Difference]: Finished difference Result 1294 states and 1820 transitions. [2019-09-10 07:48:27,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:48:27,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2019-09-10 07:48:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:27,057 INFO L225 Difference]: With dead ends: 1294 [2019-09-10 07:48:27,057 INFO L226 Difference]: Without dead ends: 1294 [2019-09-10 07:48:27,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=329, Invalid=1311, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:48:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-09-10 07:48:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 238. [2019-09-10 07:48:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-10 07:48:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 300 transitions. [2019-09-10 07:48:27,066 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 300 transitions. Word has length 74 [2019-09-10 07:48:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:27,067 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 300 transitions. [2019-09-10 07:48:27,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:48:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 300 transitions. [2019-09-10 07:48:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:48:27,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:27,068 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:48:27,068 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:27,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:27,068 INFO L82 PathProgramCache]: Analyzing trace with hash -242218485, now seen corresponding path program 1 times [2019-09-10 07:48:27,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:27,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:27,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:27,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:27,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:48:27,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:27,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:48:27,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:27,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:48:27,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:48:27,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:48:27,865 INFO L87 Difference]: Start difference. First operand 238 states and 300 transitions. Second operand 16 states. [2019-09-10 07:48:28,550 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:48:28,812 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:48:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:30,146 INFO L93 Difference]: Finished difference Result 1017 states and 1417 transitions. [2019-09-10 07:48:30,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:48:30,147 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-09-10 07:48:30,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:30,151 INFO L225 Difference]: With dead ends: 1017 [2019-09-10 07:48:30,152 INFO L226 Difference]: Without dead ends: 1017 [2019-09-10 07:48:30,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:48:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-09-10 07:48:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 239. [2019-09-10 07:48:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-10 07:48:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 301 transitions. [2019-09-10 07:48:30,160 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 301 transitions. Word has length 75 [2019-09-10 07:48:30,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:30,160 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 301 transitions. [2019-09-10 07:48:30,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:48:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 301 transitions. [2019-09-10 07:48:30,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:48:30,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:30,161 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:48:30,162 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:30,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:30,162 INFO L82 PathProgramCache]: Analyzing trace with hash 322835229, now seen corresponding path program 1 times [2019-09-10 07:48:30,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:30,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:30,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:30,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:30,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:30,510 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:48:30,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:30,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:48:30,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:30,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:48:30,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:48:30,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:48:30,512 INFO L87 Difference]: Start difference. First operand 239 states and 301 transitions. Second operand 12 states. [2019-09-10 07:48:30,922 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 07:48:31,043 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 07:48:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:31,694 INFO L93 Difference]: Finished difference Result 600 states and 819 transitions. [2019-09-10 07:48:31,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:48:31,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2019-09-10 07:48:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:31,696 INFO L225 Difference]: With dead ends: 600 [2019-09-10 07:48:31,696 INFO L226 Difference]: Without dead ends: 600 [2019-09-10 07:48:31,697 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:48:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-09-10 07:48:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 215. [2019-09-10 07:48:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-10 07:48:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 273 transitions. [2019-09-10 07:48:31,701 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 273 transitions. Word has length 75 [2019-09-10 07:48:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:31,701 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 273 transitions. [2019-09-10 07:48:31,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:48:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 273 transitions. [2019-09-10 07:48:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:48:31,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:31,702 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:48:31,702 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:31,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1485666102, now seen corresponding path program 1 times [2019-09-10 07:48:31,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:31,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:31,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:31,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:31,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:33,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:33,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 07:48:33,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:33,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:48:33,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:48:33,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:48:33,130 INFO L87 Difference]: Start difference. First operand 215 states and 273 transitions. Second operand 23 states. [2019-09-10 07:48:34,224 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:48:34,455 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:48:34,629 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:48:34,796 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:48:34,970 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:48:35,123 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 07:48:35,462 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:48:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:38,320 INFO L93 Difference]: Finished difference Result 1059 states and 1482 transitions. [2019-09-10 07:48:38,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:48:38,321 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2019-09-10 07:48:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:38,326 INFO L225 Difference]: With dead ends: 1059 [2019-09-10 07:48:38,326 INFO L226 Difference]: Without dead ends: 1059 [2019-09-10 07:48:38,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:48:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2019-09-10 07:48:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 220. [2019-09-10 07:48:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-10 07:48:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 278 transitions. [2019-09-10 07:48:38,336 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 278 transitions. Word has length 75 [2019-09-10 07:48:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:38,336 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 278 transitions. [2019-09-10 07:48:38,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:48:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 278 transitions. [2019-09-10 07:48:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:48:38,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:38,337 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:48:38,338 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:38,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:38,338 INFO L82 PathProgramCache]: Analyzing trace with hash -333093647, now seen corresponding path program 1 times [2019-09-10 07:48:38,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:38,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:38,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:38,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:38,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:39,740 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:48:39,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:39,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:48:39,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:39,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:48:39,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:48:39,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:39,742 INFO L87 Difference]: Start difference. First operand 220 states and 278 transitions. Second operand 21 states. [2019-09-10 07:48:40,002 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:48:40,282 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 07:48:40,418 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-10 07:48:40,546 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-09-10 07:48:40,730 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:48:40,978 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 07:48:41,280 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:48:41,608 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:48:41,921 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:48:42,261 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 07:48:42,607 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 07:48:42,933 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:48:43,316 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 07:48:43,603 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:48:43,938 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:48:44,241 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:48:44,566 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:48:44,882 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:48:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:46,009 INFO L93 Difference]: Finished difference Result 537 states and 727 transitions. [2019-09-10 07:48:46,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:48:46,009 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-10 07:48:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:46,012 INFO L225 Difference]: With dead ends: 537 [2019-09-10 07:48:46,012 INFO L226 Difference]: Without dead ends: 536 [2019-09-10 07:48:46,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=351, Invalid=1209, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:48:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-10 07:48:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 214. [2019-09-10 07:48:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-10 07:48:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 270 transitions. [2019-09-10 07:48:46,017 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 270 transitions. Word has length 76 [2019-09-10 07:48:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:46,017 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 270 transitions. [2019-09-10 07:48:46,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:48:46,018 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 270 transitions. [2019-09-10 07:48:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:48:46,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:46,018 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:48:46,019 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:46,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:46,019 INFO L82 PathProgramCache]: Analyzing trace with hash 936148827, now seen corresponding path program 1 times [2019-09-10 07:48:46,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:46,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:46,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:46,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:46,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:46,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:46,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:48:46,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:46,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:48:46,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:48:46,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:48:46,620 INFO L87 Difference]: Start difference. First operand 214 states and 270 transitions. Second operand 15 states. [2019-09-10 07:48:47,561 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:48:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:47,980 INFO L93 Difference]: Finished difference Result 402 states and 538 transitions. [2019-09-10 07:48:47,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:48:47,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2019-09-10 07:48:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:47,983 INFO L225 Difference]: With dead ends: 402 [2019-09-10 07:48:47,983 INFO L226 Difference]: Without dead ends: 388 [2019-09-10 07:48:47,984 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:48:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-10 07:48:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 191. [2019-09-10 07:48:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-10 07:48:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2019-09-10 07:48:47,988 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 76 [2019-09-10 07:48:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:47,988 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2019-09-10 07:48:47,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:48:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2019-09-10 07:48:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:48:47,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:47,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:47,989 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:47,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:47,990 INFO L82 PathProgramCache]: Analyzing trace with hash -785407461, now seen corresponding path program 1 times [2019-09-10 07:48:47,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:47,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:47,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:47,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:47,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:48,077 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:48:48,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:48,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:48:48,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:48,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:48:48,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:48:48,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:48:48,078 INFO L87 Difference]: Start difference. First operand 191 states and 247 transitions. Second operand 3 states. [2019-09-10 07:48:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:48,109 INFO L93 Difference]: Finished difference Result 288 states and 385 transitions. [2019-09-10 07:48:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:48:48,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 07:48:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:48,111 INFO L225 Difference]: With dead ends: 288 [2019-09-10 07:48:48,111 INFO L226 Difference]: Without dead ends: 288 [2019-09-10 07:48:48,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:48:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-10 07:48:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2019-09-10 07:48:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-10 07:48:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 384 transitions. [2019-09-10 07:48:48,116 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 384 transitions. Word has length 97 [2019-09-10 07:48:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:48,116 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 384 transitions. [2019-09-10 07:48:48,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:48:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 384 transitions. [2019-09-10 07:48:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:48:48,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:48,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:48,118 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1930087174, now seen corresponding path program 1 times [2019-09-10 07:48:48,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:48,179 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:48:48,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:48,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:48:48,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:48,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:48:48,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:48:48,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:48:48,181 INFO L87 Difference]: Start difference. First operand 286 states and 384 transitions. Second operand 5 states. [2019-09-10 07:48:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:48,384 INFO L93 Difference]: Finished difference Result 1034 states and 1451 transitions. [2019-09-10 07:48:48,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:48:48,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 07:48:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:48,389 INFO L225 Difference]: With dead ends: 1034 [2019-09-10 07:48:48,389 INFO L226 Difference]: Without dead ends: 1034 [2019-09-10 07:48:48,389 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:48:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-09-10 07:48:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 500. [2019-09-10 07:48:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 07:48:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 692 transitions. [2019-09-10 07:48:48,397 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 692 transitions. Word has length 99 [2019-09-10 07:48:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:48,397 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 692 transitions. [2019-09-10 07:48:48,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:48:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 692 transitions. [2019-09-10 07:48:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:48:48,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:48,399 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:48:48,399 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:48,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:48,399 INFO L82 PathProgramCache]: Analyzing trace with hash -943241466, now seen corresponding path program 1 times [2019-09-10 07:48:48,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:48,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:48,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:48,467 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:48:48,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:48,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:48:48,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:48,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:48:48,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:48:48,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:48:48,469 INFO L87 Difference]: Start difference. First operand 500 states and 692 transitions. Second operand 5 states. [2019-09-10 07:48:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:48,659 INFO L93 Difference]: Finished difference Result 1726 states and 2399 transitions. [2019-09-10 07:48:48,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:48:48,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 07:48:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:48,666 INFO L225 Difference]: With dead ends: 1726 [2019-09-10 07:48:48,666 INFO L226 Difference]: Without dead ends: 1726 [2019-09-10 07:48:48,666 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:48:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-10 07:48:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 944. [2019-09-10 07:48:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-09-10 07:48:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1324 transitions. [2019-09-10 07:48:48,683 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1324 transitions. Word has length 99 [2019-09-10 07:48:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:48,683 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1324 transitions. [2019-09-10 07:48:48,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:48:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1324 transitions. [2019-09-10 07:48:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:48:48,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:48,685 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:48:48,686 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash 703943869, now seen corresponding path program 1 times [2019-09-10 07:48:48,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:48,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:48,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:48,748 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:48:48,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:48,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:48:48,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:48,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:48:48,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:48:48,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:48:48,749 INFO L87 Difference]: Start difference. First operand 944 states and 1324 transitions. Second operand 3 states. [2019-09-10 07:48:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:48,785 INFO L93 Difference]: Finished difference Result 1390 states and 1953 transitions. [2019-09-10 07:48:48,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:48:48,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:48:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:48,792 INFO L225 Difference]: With dead ends: 1390 [2019-09-10 07:48:48,792 INFO L226 Difference]: Without dead ends: 1390 [2019-09-10 07:48:48,793 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:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-09-10 07:48:48,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1388. [2019-09-10 07:48:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-09-10 07:48:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1952 transitions. [2019-09-10 07:48:48,813 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1952 transitions. Word has length 99 [2019-09-10 07:48:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:48,814 INFO L475 AbstractCegarLoop]: Abstraction has 1388 states and 1952 transitions. [2019-09-10 07:48:48,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:48:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1952 transitions. [2019-09-10 07:48:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:48:48,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:48,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:48,816 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash -35796452, now seen corresponding path program 1 times [2019-09-10 07:48:48,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:48,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:48,867 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:48:48,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:48,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:48:48,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:48,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:48:48,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:48:48,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:48:48,868 INFO L87 Difference]: Start difference. First operand 1388 states and 1952 transitions. Second operand 3 states. [2019-09-10 07:48:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:48,895 INFO L93 Difference]: Finished difference Result 2044 states and 2831 transitions. [2019-09-10 07:48:48,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:48:48,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:48:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:48,903 INFO L225 Difference]: With dead ends: 2044 [2019-09-10 07:48:48,903 INFO L226 Difference]: Without dead ends: 2044 [2019-09-10 07:48:48,904 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:48,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2019-09-10 07:48:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2042. [2019-09-10 07:48:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-09-10 07:48:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2830 transitions. [2019-09-10 07:48:48,931 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2830 transitions. Word has length 99 [2019-09-10 07:48:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:48,931 INFO L475 AbstractCegarLoop]: Abstraction has 2042 states and 2830 transitions. [2019-09-10 07:48:48,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:48:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2830 transitions. [2019-09-10 07:48:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:48:48,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:48,933 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:48:48,933 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:48,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2062661056, now seen corresponding path program 1 times [2019-09-10 07:48:48,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:48,999 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:48:49,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:49,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:48:49,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:49,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:48:49,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:48:49,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:48:49,001 INFO L87 Difference]: Start difference. First operand 2042 states and 2830 transitions. Second operand 5 states. [2019-09-10 07:48:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:49,208 INFO L93 Difference]: Finished difference Result 6586 states and 8975 transitions. [2019-09-10 07:48:49,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:48:49,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 07:48:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:49,222 INFO L225 Difference]: With dead ends: 6586 [2019-09-10 07:48:49,222 INFO L226 Difference]: Without dead ends: 6586 [2019-09-10 07:48:49,222 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:48:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6586 states. [2019-09-10 07:48:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6586 to 4140. [2019-09-10 07:48:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2019-09-10 07:48:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5712 transitions. [2019-09-10 07:48:49,289 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 5712 transitions. Word has length 99 [2019-09-10 07:48:49,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:49,292 INFO L475 AbstractCegarLoop]: Abstraction has 4140 states and 5712 transitions. [2019-09-10 07:48:49,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:48:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 5712 transitions. [2019-09-10 07:48:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:48:49,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:49,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] [2019-09-10 07:48:49,294 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:49,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:49,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1021442252, now seen corresponding path program 1 times [2019-09-10 07:48:49,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:49,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:49,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:49,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:49,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:49,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:49,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:48:49,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:49,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:48:49,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:48:49,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:48:49,353 INFO L87 Difference]: Start difference. First operand 4140 states and 5712 transitions. Second operand 5 states. [2019-09-10 07:48:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:49,549 INFO L93 Difference]: Finished difference Result 8894 states and 11991 transitions. [2019-09-10 07:48:49,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:48:49,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 07:48:49,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:49,567 INFO L225 Difference]: With dead ends: 8894 [2019-09-10 07:48:49,568 INFO L226 Difference]: Without dead ends: 8894 [2019-09-10 07:48:49,568 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:48:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8894 states. [2019-09-10 07:48:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8894 to 5144. [2019-09-10 07:48:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5144 states. [2019-09-10 07:48:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5144 states to 5144 states and 6960 transitions. [2019-09-10 07:48:49,657 INFO L78 Accepts]: Start accepts. Automaton has 5144 states and 6960 transitions. Word has length 99 [2019-09-10 07:48:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:49,657 INFO L475 AbstractCegarLoop]: Abstraction has 5144 states and 6960 transitions. [2019-09-10 07:48:49,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:48:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5144 states and 6960 transitions. [2019-09-10 07:48:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:48:49,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:49,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:49,660 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:49,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:49,660 INFO L82 PathProgramCache]: Analyzing trace with hash 288255902, now seen corresponding path program 1 times [2019-09-10 07:48:49,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:49,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:49,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:49,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:49,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:49,751 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:48:49,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:49,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:48:49,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:49,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:48:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:48:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:48:49,753 INFO L87 Difference]: Start difference. First operand 5144 states and 6960 transitions. Second operand 6 states. [2019-09-10 07:48:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:49,843 INFO L93 Difference]: Finished difference Result 8492 states and 11292 transitions. [2019-09-10 07:48:49,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:48:49,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-10 07:48:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:49,862 INFO L225 Difference]: With dead ends: 8492 [2019-09-10 07:48:49,862 INFO L226 Difference]: Without dead ends: 8492 [2019-09-10 07:48:49,863 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:48:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8492 states. [2019-09-10 07:48:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8492 to 5240. [2019-09-10 07:48:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5240 states. [2019-09-10 07:48:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 7024 transitions. [2019-09-10 07:48:50,007 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 7024 transitions. Word has length 100 [2019-09-10 07:48:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:50,008 INFO L475 AbstractCegarLoop]: Abstraction has 5240 states and 7024 transitions. [2019-09-10 07:48:50,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:48:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 7024 transitions. [2019-09-10 07:48:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:48:50,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:50,011 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:48:50,011 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash -693244254, now seen corresponding path program 1 times [2019-09-10 07:48:50,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:50,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:50,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:50,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:50,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:50,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:50,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:48:50,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:50,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:48:50,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:48:50,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:48:50,101 INFO L87 Difference]: Start difference. First operand 5240 states and 7024 transitions. Second operand 3 states. [2019-09-10 07:48:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:50,150 INFO L93 Difference]: Finished difference Result 7762 states and 10293 transitions. [2019-09-10 07:48:50,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:48:50,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:48:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:50,170 INFO L225 Difference]: With dead ends: 7762 [2019-09-10 07:48:50,170 INFO L226 Difference]: Without dead ends: 7762 [2019-09-10 07:48:50,171 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:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2019-09-10 07:48:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 5668. [2019-09-10 07:48:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5668 states. [2019-09-10 07:48:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5668 states to 5668 states and 7568 transitions. [2019-09-10 07:48:50,271 INFO L78 Accepts]: Start accepts. Automaton has 5668 states and 7568 transitions. Word has length 100 [2019-09-10 07:48:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:50,271 INFO L475 AbstractCegarLoop]: Abstraction has 5668 states and 7568 transitions. [2019-09-10 07:48:50,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:48:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5668 states and 7568 transitions. [2019-09-10 07:48:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:48:50,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:50,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:50,273 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:50,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:50,274 INFO L82 PathProgramCache]: Analyzing trace with hash -212803225, now seen corresponding path program 1 times [2019-09-10 07:48:50,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:50,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:50,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:50,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:50,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:50,343 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:48:50,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:50,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:48:50,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:50,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:48:50,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:48:50,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:48:50,345 INFO L87 Difference]: Start difference. First operand 5668 states and 7568 transitions. Second operand 3 states. [2019-09-10 07:48:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:50,378 INFO L93 Difference]: Finished difference Result 6934 states and 9033 transitions. [2019-09-10 07:48:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:48:50,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:48:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:50,391 INFO L225 Difference]: With dead ends: 6934 [2019-09-10 07:48:50,392 INFO L226 Difference]: Without dead ends: 6934 [2019-09-10 07:48:50,392 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:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6934 states. [2019-09-10 07:48:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6934 to 5158. [2019-09-10 07:48:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5158 states. [2019-09-10 07:48:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5158 states to 5158 states and 6725 transitions. [2019-09-10 07:48:50,470 INFO L78 Accepts]: Start accepts. Automaton has 5158 states and 6725 transitions. Word has length 101 [2019-09-10 07:48:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:50,470 INFO L475 AbstractCegarLoop]: Abstraction has 5158 states and 6725 transitions. [2019-09-10 07:48:50,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:48:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5158 states and 6725 transitions. [2019-09-10 07:48:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:48:50,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:50,472 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:48:50,472 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1682826315, now seen corresponding path program 1 times [2019-09-10 07:48:50,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:50,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:50,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:50,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:50,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:50,535 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:48:50,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:50,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:48:50,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:50,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:48:50,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:48:50,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:48:50,537 INFO L87 Difference]: Start difference. First operand 5158 states and 6725 transitions. Second operand 3 states. [2019-09-10 07:48:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:50,564 INFO L93 Difference]: Finished difference Result 4944 states and 6360 transitions. [2019-09-10 07:48:50,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:48:50,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:48:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:50,574 INFO L225 Difference]: With dead ends: 4944 [2019-09-10 07:48:50,574 INFO L226 Difference]: Without dead ends: 4944 [2019-09-10 07:48:50,574 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:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2019-09-10 07:48:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4942. [2019-09-10 07:48:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4942 states. [2019-09-10 07:48:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4942 states to 4942 states and 6359 transitions. [2019-09-10 07:48:50,628 INFO L78 Accepts]: Start accepts. Automaton has 4942 states and 6359 transitions. Word has length 102 [2019-09-10 07:48:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:50,629 INFO L475 AbstractCegarLoop]: Abstraction has 4942 states and 6359 transitions. [2019-09-10 07:48:50,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:48:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 4942 states and 6359 transitions. [2019-09-10 07:48:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:48:50,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:50,630 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:48:50,630 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:50,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:50,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1305322077, now seen corresponding path program 1 times [2019-09-10 07:48:50,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:50,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:50,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:50,692 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:48:50,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:50,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:48:50,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:50,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:48:50,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:48:50,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:48:50,696 INFO L87 Difference]: Start difference. First operand 4942 states and 6359 transitions. Second operand 3 states. [2019-09-10 07:48:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:50,727 INFO L93 Difference]: Finished difference Result 5402 states and 6925 transitions. [2019-09-10 07:48:50,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:48:50,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 07:48:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:50,737 INFO L225 Difference]: With dead ends: 5402 [2019-09-10 07:48:50,737 INFO L226 Difference]: Without dead ends: 5402 [2019-09-10 07:48:50,739 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:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-09-10 07:48:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5400. [2019-09-10 07:48:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5400 states. [2019-09-10 07:48:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5400 states to 5400 states and 6924 transitions. [2019-09-10 07:48:50,802 INFO L78 Accepts]: Start accepts. Automaton has 5400 states and 6924 transitions. Word has length 103 [2019-09-10 07:48:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:50,802 INFO L475 AbstractCegarLoop]: Abstraction has 5400 states and 6924 transitions. [2019-09-10 07:48:50,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:48:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 5400 states and 6924 transitions. [2019-09-10 07:48:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:48:50,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:50,805 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:48:50,805 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:50,806 INFO L82 PathProgramCache]: Analyzing trace with hash -297824867, now seen corresponding path program 1 times [2019-09-10 07:48:50,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:50,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:50,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:50,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:50,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:50,921 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:48:50,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:50,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:50,922 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 07:48:50,926 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:48:50,980 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:50,980 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:51,163 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:51,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:51,841 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:48:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:51,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:51,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:51,847 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:48:51,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:51,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:48:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:52,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:48:52,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:52,241 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:48:52,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:48:52,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:48:52,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:48:52,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:52,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:48:52,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:48:52,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:48:52,333 INFO L87 Difference]: Start difference. First operand 5400 states and 6924 transitions. Second operand 6 states. [2019-09-10 07:48:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:52,475 INFO L93 Difference]: Finished difference Result 21618 states and 27639 transitions. [2019-09-10 07:48:52,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:48:52,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-10 07:48:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:52,511 INFO L225 Difference]: With dead ends: 21618 [2019-09-10 07:48:52,512 INFO L226 Difference]: Without dead ends: 21618 [2019-09-10 07:48:52,512 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:48:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21618 states. [2019-09-10 07:48:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21618 to 8844. [2019-09-10 07:48:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2019-09-10 07:48:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 11286 transitions. [2019-09-10 07:48:52,697 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 11286 transitions. Word has length 129 [2019-09-10 07:48:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:52,697 INFO L475 AbstractCegarLoop]: Abstraction has 8844 states and 11286 transitions. [2019-09-10 07:48:52,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:48:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 11286 transitions. [2019-09-10 07:48:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:48:52,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:52,702 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:48:52,702 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:52,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:52,702 INFO L82 PathProgramCache]: Analyzing trace with hash 689020841, now seen corresponding path program 1 times [2019-09-10 07:48:52,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:52,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:52,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:52,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:52,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:52,847 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:48:52,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:52,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:48:52,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:52,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:48:52,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:48:52,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:48:52,848 INFO L87 Difference]: Start difference. First operand 8844 states and 11286 transitions. Second operand 6 states. [2019-09-10 07:48:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:53,018 INFO L93 Difference]: Finished difference Result 24690 states and 31509 transitions. [2019-09-10 07:48:53,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:48:53,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-10 07:48:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:53,052 INFO L225 Difference]: With dead ends: 24690 [2019-09-10 07:48:53,052 INFO L226 Difference]: Without dead ends: 24690 [2019-09-10 07:48:53,053 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:48:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24690 states. [2019-09-10 07:48:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24690 to 13986. [2019-09-10 07:48:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13986 states. [2019-09-10 07:48:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13986 states to 13986 states and 17769 transitions. [2019-09-10 07:48:53,275 INFO L78 Accepts]: Start accepts. Automaton has 13986 states and 17769 transitions. Word has length 129 [2019-09-10 07:48:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:53,275 INFO L475 AbstractCegarLoop]: Abstraction has 13986 states and 17769 transitions. [2019-09-10 07:48:53,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:48:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 13986 states and 17769 transitions. [2019-09-10 07:48:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:48:53,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:53,279 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:48:53,279 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:53,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:53,280 INFO L82 PathProgramCache]: Analyzing trace with hash 610820055, now seen corresponding path program 1 times [2019-09-10 07:48:53,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:53,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:53,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:53,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:53,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:53,422 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:48:53,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:53,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:53,423 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 07:48:53,423 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:48:53,428 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:53,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:53,483 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:54,064 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:54,065 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:48:54,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:54,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:54,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:54,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:54,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:54,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:48:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:54,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:48:54,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:54,348 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:48:54,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream Closed [2019-09-10 07:48:54,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:48:54,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:48:54,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:54,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:48:54,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:48:54,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:48:54,427 INFO L87 Difference]: Start difference. First operand 13986 states and 17769 transitions. Second operand 6 states. [2019-09-10 07:48:54,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:54,555 INFO L93 Difference]: Finished difference Result 28282 states and 36088 transitions. [2019-09-10 07:48:54,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:48:54,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-10 07:48:54,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:54,600 INFO L225 Difference]: With dead ends: 28282 [2019-09-10 07:48:54,600 INFO L226 Difference]: Without dead ends: 28282 [2019-09-10 07:48:54,600 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:48:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28282 states. [2019-09-10 07:48:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28282 to 17430. [2019-09-10 07:48:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17430 states. [2019-09-10 07:48:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17430 states to 17430 states and 22131 transitions. [2019-09-10 07:48:54,855 INFO L78 Accepts]: Start accepts. Automaton has 17430 states and 22131 transitions. Word has length 129 [2019-09-10 07:48:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:54,855 INFO L475 AbstractCegarLoop]: Abstraction has 17430 states and 22131 transitions. [2019-09-10 07:48:54,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:48:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 17430 states and 22131 transitions. [2019-09-10 07:48:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:48:54,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:54,860 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:48:54,862 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:54,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:54,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1632720289, now seen corresponding path program 1 times [2019-09-10 07:48:54,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:54,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:54,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:54,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:54,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:48:54,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:54,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:48:54,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:54,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:48:54,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:48:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:48:54,937 INFO L87 Difference]: Start difference. First operand 17430 states and 22131 transitions. Second operand 3 states. [2019-09-10 07:48:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:54,994 INFO L93 Difference]: Finished difference Result 21118 states and 26157 transitions. [2019-09-10 07:48:54,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:48:54,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-09-10 07:48:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:55,025 INFO L225 Difference]: With dead ends: 21118 [2019-09-10 07:48:55,025 INFO L226 Difference]: Without dead ends: 21118 [2019-09-10 07:48:55,026 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:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21118 states. [2019-09-10 07:48:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21118 to 19984. [2019-09-10 07:48:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19984 states. [2019-09-10 07:48:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19984 states to 19984 states and 25024 transitions. [2019-09-10 07:48:55,257 INFO L78 Accepts]: Start accepts. Automaton has 19984 states and 25024 transitions. Word has length 130 [2019-09-10 07:48:55,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:55,258 INFO L475 AbstractCegarLoop]: Abstraction has 19984 states and 25024 transitions. [2019-09-10 07:48:55,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:48:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 19984 states and 25024 transitions. [2019-09-10 07:48:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:48:55,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:55,262 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:48:55,262 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:55,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2016651098, now seen corresponding path program 1 times [2019-09-10 07:48:55,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:55,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:55,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:55,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:55,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:55,971 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:48:55,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:55,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:55,972 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-09-10 07:48:55,974 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:48:55,983 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:55,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:56,017 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:56,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:56,508 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:48:56,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:56,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:56,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:56,509 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:48:56,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:56,524 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:48:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:56,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:48:56,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:56,785 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:48:56,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:48:56,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:48:56,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:48:56,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:56,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:48:56,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:48:56,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:48:56,869 INFO L87 Difference]: Start difference. First operand 19984 states and 25024 transitions. Second operand 6 states. [2019-09-10 07:48:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:57,000 INFO L93 Difference]: Finished difference Result 36364 states and 45718 transitions. [2019-09-10 07:48:57,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:48:57,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-10 07:48:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:57,051 INFO L225 Difference]: With dead ends: 36364 [2019-09-10 07:48:57,052 INFO L226 Difference]: Without dead ends: 36364 [2019-09-10 07:48:57,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 253 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:48:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36364 states. [2019-09-10 07:48:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36364 to 23936. [2019-09-10 07:48:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23936 states. [2019-09-10 07:48:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23936 states to 23936 states and 29960 transitions. [2019-09-10 07:48:57,376 INFO L78 Accepts]: Start accepts. Automaton has 23936 states and 29960 transitions. Word has length 130 [2019-09-10 07:48:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:57,376 INFO L475 AbstractCegarLoop]: Abstraction has 23936 states and 29960 transitions. [2019-09-10 07:48:57,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:48:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 23936 states and 29960 transitions. [2019-09-10 07:48:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:48:57,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:57,381 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:48:57,381 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash 733064444, now seen corresponding path program 1 times [2019-09-10 07:48:57,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:57,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:57,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:57,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:57,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:57,526 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:48:57,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:57,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:57,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:57,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:57,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:57,528 INFO L87 Difference]: Start difference. First operand 23936 states and 29960 transitions. Second operand 9 states. [2019-09-10 07:48:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:58,135 INFO L93 Difference]: Finished difference Result 47806 states and 59849 transitions. [2019-09-10 07:48:58,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:48:58,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-10 07:48:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:58,175 INFO L225 Difference]: With dead ends: 47806 [2019-09-10 07:48:58,175 INFO L226 Difference]: Without dead ends: 47806 [2019-09-10 07:48:58,176 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:48:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47806 states. [2019-09-10 07:48:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47806 to 23936. [2019-09-10 07:48:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23936 states. [2019-09-10 07:48:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23936 states to 23936 states and 29959 transitions. [2019-09-10 07:48:58,507 INFO L78 Accepts]: Start accepts. Automaton has 23936 states and 29959 transitions. Word has length 131 [2019-09-10 07:48:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:58,507 INFO L475 AbstractCegarLoop]: Abstraction has 23936 states and 29959 transitions. [2019-09-10 07:48:58,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 23936 states and 29959 transitions. [2019-09-10 07:48:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:48:58,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:58,512 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:48:58,512 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash 104610750, now seen corresponding path program 1 times [2019-09-10 07:48:58,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:58,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:58,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:58,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:58,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:58,573 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:48:58,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:58,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:48:58,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:58,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:48:58,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:48:58,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:48:58,574 INFO L87 Difference]: Start difference. First operand 23936 states and 29959 transitions. Second operand 4 states. [2019-09-10 07:48:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:58,743 INFO L93 Difference]: Finished difference Result 23957 states and 29979 transitions. [2019-09-10 07:48:58,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:48:58,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 07:48:58,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:58,768 INFO L225 Difference]: With dead ends: 23957 [2019-09-10 07:48:58,768 INFO L226 Difference]: Without dead ends: 23957 [2019-09-10 07:48:58,769 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:48:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23957 states. [2019-09-10 07:48:58,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23957 to 23929. [2019-09-10 07:48:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23929 states. [2019-09-10 07:48:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23929 states to 23929 states and 29952 transitions. [2019-09-10 07:48:58,977 INFO L78 Accepts]: Start accepts. Automaton has 23929 states and 29952 transitions. Word has length 133 [2019-09-10 07:48:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:58,977 INFO L475 AbstractCegarLoop]: Abstraction has 23929 states and 29952 transitions. [2019-09-10 07:48:58,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:48:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 23929 states and 29952 transitions. [2019-09-10 07:48:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:48:58,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:58,981 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:48:58,981 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:58,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:58,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1846733149, now seen corresponding path program 1 times [2019-09-10 07:48:58,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:58,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:58,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:58,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:58,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:59,398 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:48:59,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:59,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:59,399 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:48:59,399 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:48:59,406 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:59,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:59,446 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:59,944 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:59,944 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:48:59,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:59,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:59,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:59,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:59,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:59,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:49:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:00,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 07:49:00,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:00,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,851 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:49:00,851 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:01,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:03,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:03,226 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:49:03,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:49:03,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2019-09-10 07:49:03,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:49:03,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:49:03,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:49:03,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:49:03,232 INFO L87 Difference]: Start difference. First operand 23929 states and 29952 transitions. Second operand 20 states. [2019-09-10 07:49:03,396 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:49:04,526 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:49:04,769 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:49:05,033 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 07:49:05,309 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 07:49:05,775 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 07:49:06,165 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 07:49:06,549 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:49:06,920 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:49:07,079 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:49:07,233 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 07:49:07,498 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:49:07,956 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:49:08,448 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:49:08,641 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:49:08,922 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 07:49:09,178 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:49:09,362 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:49:09,717 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:49:10,188 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:49:10,582 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:49:10,996 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:49:11,230 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-10 07:49:11,643 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-10 07:49:11,836 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:49:12,178 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 07:49:12,495 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-10 07:49:12,919 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 07:49:13,270 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:49:13,520 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:49:13,816 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:49:14,200 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-10 07:49:14,465 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 07:49:14,783 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 07:49:15,056 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:49:15,346 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:49:15,700 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-10 07:49:16,111 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:49:16,516 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 07:49:16,864 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 07:49:17,203 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-10 07:49:17,475 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:49:17,815 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:49:18,259 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 07:49:18,554 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 07:49:19,007 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:49:19,283 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:49:19,559 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:49:19,986 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 07:49:20,296 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:49:20,655 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 07:49:21,068 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-10 07:49:21,583 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 07:49:22,070 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:49:22,349 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-10 07:49:22,655 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 07:49:22,922 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:49:23,423 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-10 07:49:23,895 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 07:49:24,380 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:49:24,610 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 07:49:25,258 WARN L188 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 07:49:25,619 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:49:25,889 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 07:49:27,354 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 07:49:27,615 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:49:27,832 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:49:28,279 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:49:28,642 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:49:29,041 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-09-10 07:49:29,359 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:49:29,765 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:49:30,124 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:49:30,385 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:49:30,875 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-10 07:49:35,061 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:49:35,447 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:49:35,726 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:49:36,020 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:49:36,302 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:49:36,773 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:49:37,005 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 07:49:37,544 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:49:37,977 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:49:38,270 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:49:38,585 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:49:38,942 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 07:49:39,207 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-10 07:49:39,502 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:49:39,795 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:49:40,046 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:49:40,288 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:49:40,520 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:49:40,714 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 07:49:41,132 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:49:41,389 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 07:49:41,800 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:49:42,147 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:49:42,584 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:49:42,853 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:49:43,236 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:49:43,527 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:49:44,000 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:49:44,238 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:49:44,714 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:49:45,158 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:49:45,438 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:49:45,859 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:49:46,122 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 07:49:46,488 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-10 07:49:46,770 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:49:47,109 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:49:47,336 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:49:48,255 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:49:48,594 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:49:48,877 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:49:49,364 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:49:49,732 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:49:50,072 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:49:50,467 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 07:49:50,839 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:49:51,035 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:49:51,352 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:49:51,692 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:49:52,017 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:49:52,280 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 07:49:52,616 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:49:52,914 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 07:49:53,238 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 07:49:53,559 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:49:53,819 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-09-10 07:49:54,134 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:49:54,458 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-10 07:49:54,744 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:49:54,967 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:49:55,318 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 07:49:55,671 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 07:49:56,063 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-10 07:49:56,350 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:49:56,723 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-10 07:49:57,005 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:49:57,257 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-10 07:49:57,535 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:49:57,770 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:49:58,206 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:49:58,408 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 07:49:58,818 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:49:59,202 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 07:49:59,460 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 07:49:59,769 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:50:00,040 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:50:00,255 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:50:00,534 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:50:00,855 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 07:50:01,169 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:50:01,429 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:50:01,745 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-09-10 07:50:02,048 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 07:50:02,327 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:50:02,854 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:50:03,319 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:50:03,773 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 07:50:04,196 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:50:04,534 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 07:50:04,829 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:50:05,078 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:50:05,487 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-09-10 07:50:05,877 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:50:06,277 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:50:06,491 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:50:06,679 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:50:07,014 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 07:50:07,406 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:50:07,808 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:50:08,131 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 07:50:08,403 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 07:50:08,843 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:50:09,090 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:50:09,366 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:50:10,249 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 07:50:10,522 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:50:10,952 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:50:11,343 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-10 07:50:11,928 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:50:12,350 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-10 07:50:12,595 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:50:12,893 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-10 07:50:13,232 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 07:50:13,483 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:50:13,853 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:50:14,346 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:50:14,532 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:50:14,857 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:50:15,158 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 07:50:15,497 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:50:16,352 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 07:50:16,618 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:50:17,084 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 07:50:17,321 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-10 07:50:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:17,561 INFO L93 Difference]: Finished difference Result 215661 states and 262291 transitions. [2019-09-10 07:50:17,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2019-09-10 07:50:17,562 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 133 [2019-09-10 07:50:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:17,770 INFO L225 Difference]: With dead ends: 215661 [2019-09-10 07:50:17,770 INFO L226 Difference]: Without dead ends: 215661 [2019-09-10 07:50:17,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 215 SyntacticMatches, 35 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20536 ImplicationChecksByTransitivity, 65.4s TimeCoverageRelationStatistics Valid=8226, Invalid=45366, Unknown=0, NotChecked=0, Total=53592 [2019-09-10 07:50:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215661 states. [2019-09-10 07:50:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215661 to 97296. [2019-09-10 07:50:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97296 states. [2019-09-10 07:50:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97296 states to 97296 states and 120886 transitions. [2019-09-10 07:50:20,703 INFO L78 Accepts]: Start accepts. Automaton has 97296 states and 120886 transitions. Word has length 133 [2019-09-10 07:50:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:20,703 INFO L475 AbstractCegarLoop]: Abstraction has 97296 states and 120886 transitions. [2019-09-10 07:50:20,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:50:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 97296 states and 120886 transitions. [2019-09-10 07:50:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:50:20,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:20,713 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:50:20,713 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:20,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:20,714 INFO L82 PathProgramCache]: Analyzing trace with hash 308312446, now seen corresponding path program 1 times [2019-09-10 07:50:20,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:20,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:20,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:21,032 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:50:21,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:21,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:50:21,032 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:50:21,033 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:50:21,035 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:50:21,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:50:21,067 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:50:21,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:50:21,570 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:50:21,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:21,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:50:21,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:21,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:50:21,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:21,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:50:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:22,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:50:22,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:50:22,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:22,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:22,909 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:50:22,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:50:23,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:24,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:24,341 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:50:24,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:50:24,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:50:24,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:50:24,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:50:24,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:50:24,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:50:24,356 INFO L87 Difference]: Start difference. First operand 97296 states and 120886 transitions. Second operand 21 states. [2019-09-10 07:50:24,823 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:50:25,368 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:50:26,334 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 07:50:26,977 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 07:50:27,268 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:50:27,613 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:50:28,056 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:50:28,447 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 07:50:29,238 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 07:50:29,693 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 07:50:30,068 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 07:50:30,874 WARN L188 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 07:50:31,345 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:50:31,643 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:50:32,173 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:50:32,736 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:50:33,155 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:50:33,517 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:50:33,957 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 07:50:34,601 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:50:34,964 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:50:35,885 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 07:50:36,322 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 07:50:36,712 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 07:50:37,371 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:50:37,882 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:50:38,252 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-09-10 07:50:39,004 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 07:50:39,586 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 07:50:39,942 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-10 07:50:40,564 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:50:41,103 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 07:50:41,695 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:50:42,296 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 07:50:42,698 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 07:50:43,067 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-09-10 07:50:43,449 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 07:50:43,848 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 07:50:44,418 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 07:50:44,801 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-09-10 07:50:45,204 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 07:50:45,819 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 07:50:46,251 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 07:50:46,660 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 07:50:47,192 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 07:50:47,744 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:50:48,090 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:50:48,928 WARN L188 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 07:50:49,309 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 07:50:49,751 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 07:50:50,152 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 07:50:50,900 WARN L188 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 07:50:51,375 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:50:51,809 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:50:52,290 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:50:52,720 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:50:53,183 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:50:53,505 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:50:53,947 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 07:50:54,405 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 07:50:54,866 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-09-10 07:50:55,323 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 97 [2019-09-10 07:50:56,029 WARN L188 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-09-10 07:50:56,520 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 97 [2019-09-10 07:50:56,911 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 07:50:57,305 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 07:50:57,730 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:50:58,198 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 07:50:58,621 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 07:50:59,040 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 07:50:59,513 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 07:50:59,898 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 07:51:00,287 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-10 07:51:00,717 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 07:51:01,112 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:51:01,759 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-09-10 07:51:02,085 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 07:51:02,432 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:51:02,777 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:51:03,369 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 07:51:03,858 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:51:04,349 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:51:04,800 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 07:51:05,152 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:51:05,870 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:51:06,394 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 07:51:07,511 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 07:51:07,835 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 07:51:08,236 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 07:51:08,627 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 07:51:09,010 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 07:51:09,499 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 07:51:10,006 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 07:51:10,550 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:51:11,053 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 07:51:11,738 WARN L188 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:51:12,347 WARN L188 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 07:51:12,876 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:51:13,566 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:51:14,030 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 07:51:14,466 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:51:14,921 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-10 07:51:15,409 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:51:15,767 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 07:51:16,164 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 07:51:17,189 WARN L188 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 07:51:17,663 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 07:51:18,232 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:51:18,766 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-09-10 07:51:19,172 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 07:51:19,591 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 07:51:20,098 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-10 07:51:20,659 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-10 07:51:21,466 WARN L188 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-09-10 07:51:21,854 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:51:22,440 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-09-10 07:51:22,988 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 07:51:23,544 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:51:24,043 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 07:51:24,520 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 07:51:25,151 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:51:25,621 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 07:51:26,148 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 07:51:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:26,596 INFO L93 Difference]: Finished difference Result 534422 states and 646197 transitions. [2019-09-10 07:51:26,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-10 07:51:26,596 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 134 [2019-09-10 07:51:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:27,170 INFO L225 Difference]: With dead ends: 534422 [2019-09-10 07:51:27,170 INFO L226 Difference]: Without dead ends: 534422 [2019-09-10 07:51:27,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 230 SyntacticMatches, 20 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7876 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=4985, Invalid=19507, Unknown=0, NotChecked=0, Total=24492 [2019-09-10 07:51:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534422 states. [2019-09-10 07:51:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534422 to 295260. [2019-09-10 07:51:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295260 states. [2019-09-10 07:51:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295260 states to 295260 states and 364150 transitions. [2019-09-10 07:51:34,211 INFO L78 Accepts]: Start accepts. Automaton has 295260 states and 364150 transitions. Word has length 134 [2019-09-10 07:51:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:34,211 INFO L475 AbstractCegarLoop]: Abstraction has 295260 states and 364150 transitions. [2019-09-10 07:51:34,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:51:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 295260 states and 364150 transitions. [2019-09-10 07:51:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:51:34,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:34,235 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:51:34,235 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477459, now seen corresponding path program 1 times [2019-09-10 07:51:34,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:34,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:34,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:34,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:34,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:34,453 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:51:34,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:34,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:34,453 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-09-10 07:51:34,454 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:51:34,456 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:34,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:34,487 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:51:38,345 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:51:38,347 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:51:38,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:38,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:51:38,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:38,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:51:38,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:38,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:51:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:38,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:51:38,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:51:38,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:38,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:38,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:38,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:38,986 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:51:38,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:39,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:39,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:39,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:39,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:39,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:40,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:40,248 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:51:40,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:51:40,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:51:40,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:51:40,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:51:40,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:51:40,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:51:40,254 INFO L87 Difference]: Start difference. First operand 295260 states and 364150 transitions. Second operand 20 states. [2019-09-10 07:51:45,414 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 07:51:49,501 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:51:50,213 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:51:50,603 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:51:51,552 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 07:51:54,762 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:51:56,108 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:51:58,460 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-10 07:51:58,974 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-10 07:52:01,320 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:52:01,649 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:52:02,767 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 07:52:02,943 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 07:52:03,627 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:52:03,816 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:52:03,977 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 07:52:04,616 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-10 07:52:06,306 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:52:06,561 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 07:52:06,917 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 07:52:07,086 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:52:08,730 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:52:08,903 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:52:10,054 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-09-10 07:52:10,371 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:52:10,544 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:52:11,131 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:52:11,883 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 07:52:12,225 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 07:52:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:16,816 INFO L93 Difference]: Finished difference Result 1314403 states and 1588173 transitions. [2019-09-10 07:52:16,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2019-09-10 07:52:16,817 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 136 [2019-09-10 07:52:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:18,257 INFO L225 Difference]: With dead ends: 1314403 [2019-09-10 07:52:18,257 INFO L226 Difference]: Without dead ends: 1314403 [2019-09-10 07:52:18,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 234 SyntacticMatches, 19 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24034 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=8924, Invalid=55846, Unknown=0, NotChecked=0, Total=64770 [2019-09-10 07:52:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314403 states. [2019-09-10 07:52:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314403 to 219938. [2019-09-10 07:52:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219938 states. [2019-09-10 07:52:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219938 states to 219938 states and 270796 transitions. [2019-09-10 07:52:40,064 INFO L78 Accepts]: Start accepts. Automaton has 219938 states and 270796 transitions. Word has length 136 [2019-09-10 07:52:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:40,064 INFO L475 AbstractCegarLoop]: Abstraction has 219938 states and 270796 transitions. [2019-09-10 07:52:40,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:52:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 219938 states and 270796 transitions. [2019-09-10 07:52:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:52:40,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:40,077 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:52:40,077 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:40,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:40,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1291832888, now seen corresponding path program 1 times [2019-09-10 07:52:40,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:40,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:40,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:40,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:40,364 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:52:40,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:40,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:52:40,365 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-09-10 07:52:40,365 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:52:40,367 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:52:40,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:52:40,394 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:52:41,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:52:41,048 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:52:41,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:41,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:52:41,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:41,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:52:41,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:41,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:52:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:41,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:52:41,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:52:41,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:41,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:41,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:43,563 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:52:43,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:52:43,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:43,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:43,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:43,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:43,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:44,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:45,018 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:52:45,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:52:45,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2019-09-10 07:52:45,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:52:45,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:52:45,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:52:45,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=701, Unknown=1, NotChecked=0, Total=812 [2019-09-10 07:52:45,024 INFO L87 Difference]: Start difference. First operand 219938 states and 270796 transitions. Second operand 20 states. [2019-09-10 07:52:47,949 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2019-09-10 07:52:48,204 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2019-09-10 07:52:52,526 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-09-10 07:52:53,803 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2019-09-10 07:52:57,861 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2019-09-10 07:52:58,122 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2019-09-10 07:52:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:58,971 INFO L93 Difference]: Finished difference Result 494068 states and 603865 transitions. [2019-09-10 07:52:58,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 07:52:58,971 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 136 [2019-09-10 07:52:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:59,559 INFO L225 Difference]: With dead ends: 494068 [2019-09-10 07:52:59,560 INFO L226 Difference]: Without dead ends: 494068 [2019-09-10 07:52:59,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 222 SyntacticMatches, 34 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=850, Invalid=3181, Unknown=1, NotChecked=0, Total=4032 [2019-09-10 07:52:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494068 states. [2019-09-10 07:53:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494068 to 219931. [2019-09-10 07:53:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219931 states. [2019-09-10 07:53:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219931 states to 219931 states and 270789 transitions. [2019-09-10 07:53:04,572 INFO L78 Accepts]: Start accepts. Automaton has 219931 states and 270789 transitions. Word has length 136 [2019-09-10 07:53:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:04,572 INFO L475 AbstractCegarLoop]: Abstraction has 219931 states and 270789 transitions. [2019-09-10 07:53:04,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:53:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 219931 states and 270789 transitions. [2019-09-10 07:53:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:53:04,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:04,584 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:53:04,584 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:04,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1744856412, now seen corresponding path program 1 times [2019-09-10 07:53:04,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:04,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:04,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:04,663 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:53:04,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:04,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:04,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:04,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:04,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:04,664 INFO L87 Difference]: Start difference. First operand 219931 states and 270789 transitions. Second operand 3 states. [2019-09-10 07:53:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:05,051 INFO L93 Difference]: Finished difference Result 199149 states and 238426 transitions. [2019-09-10 07:53:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:05,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 07:53:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:05,241 INFO L225 Difference]: With dead ends: 199149 [2019-09-10 07:53:05,242 INFO L226 Difference]: Without dead ends: 199149 [2019-09-10 07:53:05,242 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:53:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199149 states. [2019-09-10 07:53:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199149 to 189139. [2019-09-10 07:53:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189139 states. [2019-09-10 07:53:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189139 states to 189139 states and 227481 transitions. [2019-09-10 07:53:12,442 INFO L78 Accepts]: Start accepts. Automaton has 189139 states and 227481 transitions. Word has length 136 [2019-09-10 07:53:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:12,442 INFO L475 AbstractCegarLoop]: Abstraction has 189139 states and 227481 transitions. [2019-09-10 07:53:12,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 189139 states and 227481 transitions. [2019-09-10 07:53:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:53:12,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:12,449 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:53:12,449 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:12,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:12,449 INFO L82 PathProgramCache]: Analyzing trace with hash -98733668, now seen corresponding path program 1 times [2019-09-10 07:53:12,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:12,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:12,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:12,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:12,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:13,344 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:53:13,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:13,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:53:13,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-09-10 07:53:13,344 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:53:13,348 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:53:13,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:53:13,369 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:53:13,721 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:53:13,721 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:53:13,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:13,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:53:13,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:13,722 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) [2019-09-10 07:53:13,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:13,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:53:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:13,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-10 07:53:13,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:53:15,275 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:53:15,276 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:53:16,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:16,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:16,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:16,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:16,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:16,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:16,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:16,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:16,889 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:53:17,132 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:53:17,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:53:17,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 20] total 54 [2019-09-10 07:53:17,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:53:17,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 07:53:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 07:53:17,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2588, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:53:17,139 INFO L87 Difference]: Start difference. First operand 189139 states and 227481 transitions. Second operand 39 states. [2019-09-10 07:53:19,027 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:53:19,577 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:53:21,449 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:53:21,764 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 07:53:22,138 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 07:53:22,396 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:53:22,837 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 07:53:23,068 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 07:53:23,348 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:53:23,599 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:53:23,844 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:53:24,104 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:53:24,327 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:53:24,612 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 07:53:24,884 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:53:25,180 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:53:25,494 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 07:53:25,893 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:53:26,272 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:53:26,594 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 07:53:26,834 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:53:27,133 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 07:53:27,411 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:53:27,623 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-10 07:53:27,888 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:53:28,187 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-09-10 07:53:28,538 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:53:28,758 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 07:53:28,989 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:53:29,337 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-09-10 07:53:29,598 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 07:53:30,091 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 07:53:30,318 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:53:30,472 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:53:30,687 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:53:30,916 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:53:31,545 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:53:31,741 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:53:31,938 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-09-10 07:53:32,108 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-09-10 07:53:32,279 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:53:32,548 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:53:32,822 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:53:33,255 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:53:33,547 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:53:34,243 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 07:53:34,618 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:53:34,926 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 07:53:35,188 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:53:35,410 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:53:35,679 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 07:53:35,922 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:53:36,249 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:53:36,469 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 07:53:36,866 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-10 07:53:37,095 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 07:53:37,388 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:53:37,868 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-09-10 07:53:38,053 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-10 07:53:38,394 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:53:38,672 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:53:38,999 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:53:39,361 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-09-10 07:53:39,694 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2019-09-10 07:53:39,900 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-09-10 07:53:40,246 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 07:53:40,450 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:53:40,839 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 07:53:41,058 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:53:41,322 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:53:41,629 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:53:41,839 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:53:42,130 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:53:42,389 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 07:53:42,698 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:53:42,965 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 07:53:43,287 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 07:53:43,571 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-10 07:53:43,890 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-10 07:53:44,073 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 07:53:44,412 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:53:44,720 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:53:44,987 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:53:45,186 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:53:45,445 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:53:45,623 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:53:45,881 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:53:46,200 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 07:53:46,415 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:53:46,738 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 07:53:46,986 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:53:47,332 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 07:53:47,574 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:53:47,879 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 07:53:48,220 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 07:53:48,540 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:53:48,767 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:53:49,091 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:53:49,294 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:53:49,561 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:53:49,839 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:53:50,078 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:53:50,353 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:53:50,657 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:53:50,986 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:53:51,234 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:53:51,586 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 07:53:51,914 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 07:53:52,266 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:53:52,501 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:53:52,779 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 07:53:53,152 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:53:53,412 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:53:53,605 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:53:53,896 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:53:54,071 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:53:54,316 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:53:54,629 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:53:54,859 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:53:55,220 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:53:55,478 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:53:55,625 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 07:53:55,924 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 07:53:56,167 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:53:56,487 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 07:53:56,904 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 07:53:57,240 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:53:57,596 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:53:57,907 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:53:58,210 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:53:58,412 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:53:58,688 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:53:58,954 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:53:59,178 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:53:59,394 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:53:59,667 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 07:53:59,955 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:54:00,255 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:54:00,619 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:54:00,936 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 07:54:01,263 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 07:54:01,524 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 07:54:01,848 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:54:02,096 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:54:02,434 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:54:02,786 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:54:03,100 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:54:03,332 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:54:03,600 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:54:03,787 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:54:04,060 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:54:04,336 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:54:04,510 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 07:54:04,739 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:54:04,974 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:54:05,416 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 07:54:05,618 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:54:05,909 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:54:06,257 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:54:06,588 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 07:54:06,785 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:54:07,075 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 07:54:07,369 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 07:54:07,690 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:54:07,979 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:54:08,269 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:54:08,547 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:54:08,743 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:54:08,984 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:54:09,303 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-09-10 07:54:09,660 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 07:54:10,032 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 07:54:10,357 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 07:54:10,635 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:54:10,968 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:54:11,156 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:54:11,420 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:54:11,764 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:54:12,100 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:54:12,535 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:54:12,734 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:54:12,915 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:54:13,109 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:54:13,323 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:54:13,543 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:54:13,787 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:54:14,045 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:54:14,316 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 07:54:14,606 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 07:54:14,830 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:54:15,094 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:54:15,341 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:54:15,532 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:54:15,742 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:54:15,976 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:54:16,244 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:54:16,503 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:54:16,776 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 07:54:16,972 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:54:17,236 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:54:17,539 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 07:54:17,879 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:54:18,144 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:54:18,633 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 07:54:18,907 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:54:19,138 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:54:19,421 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:54:19,682 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:54:19,941 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:54:20,152 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:54:20,491 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:54:20,774 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 07:54:21,186 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:54:21,475 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:54:21,740 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:54:22,045 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 07:54:22,264 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:54:22,492 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:54:22,759 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:54:23,134 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 07:54:23,420 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 07:54:23,761 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 07:54:24,001 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:54:24,367 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:54:24,643 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:54:25,069 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-10 07:54:25,342 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:54:25,632 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 07:54:26,282 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 07:54:27,616 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 07:54:27,879 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:54:28,083 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:54:28,783 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:54:29,015 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:54:29,245 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:54:29,578 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 07:54:29,786 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:54:30,220 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:54:30,409 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:54:30,599 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:54:30,812 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:54:31,069 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:54:31,285 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 07:54:31,786 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:54:31,970 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:54:32,420 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:54:32,763 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:54:33,004 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:54:33,347 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:54:33,657 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 07:54:33,971 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 07:54:34,277 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:54:34,492 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:54:34,786 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:54:35,245 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 07:54:35,431 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:54:35,769 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 07:54:35,983 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:54:36,171 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:54:36,422 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:54:36,632 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:54:36,946 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 07:54:37,197 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-10 07:54:37,402 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 07:54:37,636 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:54:37,854 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:54:38,139 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 07:54:38,412 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 07:54:38,702 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:54:38,923 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:54:39,221 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 07:54:39,518 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:54:39,934 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 07:54:40,390 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:54:40,563 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:54:40,780 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:54:41,031 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-10 07:54:41,292 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:54:41,575 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:54:41,797 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:54:42,051 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:54:42,380 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 07:54:42,839 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 07:54:43,066 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 07:54:43,323 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:54:43,586 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:54:43,879 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:54:44,203 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:54:44,647 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:54:44,854 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:54:45,169 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 07:54:45,449 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:54:45,756 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 07:54:46,117 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-09-10 07:54:46,509 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 07:54:46,686 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 07:54:46,879 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:54:47,098 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:54:47,327 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:54:47,608 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:54:48,072 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:54:48,456 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:54:48,814 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:54:49,076 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 07:54:49,321 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:54:49,572 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:54:49,884 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:54:50,188 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 07:54:50,544 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 07:54:50,835 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:54:51,367 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 07:54:51,774 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:54:52,107 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:54:52,499 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:54:52,747 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:54:53,191 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:54:53,501 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 07:54:53,823 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:54:54,061 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:54:54,384 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-10 07:54:54,666 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:54:55,002 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:54:55,417 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:54:55,825 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 07:54:56,536 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 07:54:56,797 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:54:57,025 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:54:57,598 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 07:54:58,049 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:54:58,317 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:54:59,087 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-10 07:54:59,600 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-10 07:54:59,862 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 07:55:00,525 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 07:55:00,869 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:55:01,034 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:55:01,217 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:55:01,495 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 07:55:01,879 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 07:55:02,489 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-10 07:55:02,916 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 07:55:03,190 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:55:04,277 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 07:55:04,591 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-10 07:55:04,978 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 07:55:05,220 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:55:05,450 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:55:05,670 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 07:55:06,625 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-10 07:55:06,793 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:55:07,135 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:55:07,416 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:55:08,293 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:55:08,522 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 07:55:08,770 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 07:55:09,184 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:55:09,422 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 07:55:09,856 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:55:10,107 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:55:10,366 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:55:10,617 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:55:10,915 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:55:11,433 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:55:11,736 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 07:55:12,103 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 07:55:12,298 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 07:55:12,577 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 07:55:12,876 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:55:13,203 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:55:13,458 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:55:13,743 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:55:13,995 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 07:55:14,397 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:55:14,746 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:55:15,041 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:55:15,252 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:55:15,431 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 07:55:15,839 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-10 07:55:16,141 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 07:55:16,403 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-09-10 07:55:16,752 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:55:17,199 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 07:55:17,606 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 07:55:17,975 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 07:55:18,319 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 07:55:18,511 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 07:55:18,780 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 07:55:19,288 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 07:55:19,743 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-09-10 07:55:20,003 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:55:20,408 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:55:20,688 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:55:21,072 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 07:55:21,341 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 07:55:21,753 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-09-10 07:55:21,999 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:55:22,536 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 07:55:23,201 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:55:23,481 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:55:23,755 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:55:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:25,371 INFO L93 Difference]: Finished difference Result 1002088 states and 1176391 transitions. [2019-09-10 07:55:25,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 501 states. [2019-09-10 07:55:25,371 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 136 [2019-09-10 07:55:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:26,616 INFO L225 Difference]: With dead ends: 1002088 [2019-09-10 07:55:26,617 INFO L226 Difference]: Without dead ends: 1002088 [2019-09-10 07:55:26,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 233 SyntacticMatches, 4 SemanticMatches, 545 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124856 ImplicationChecksByTransitivity, 107.3s TimeCoverageRelationStatistics Valid=37637, Invalid=261025, Unknown=0, NotChecked=0, Total=298662 [2019-09-10 07:55:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002088 states. [2019-09-10 07:55:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002088 to 269463. [2019-09-10 07:55:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269463 states. [2019-09-10 07:55:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269463 states to 269463 states and 322793 transitions. [2019-09-10 07:55:35,953 INFO L78 Accepts]: Start accepts. Automaton has 269463 states and 322793 transitions. Word has length 136 [2019-09-10 07:55:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:35,954 INFO L475 AbstractCegarLoop]: Abstraction has 269463 states and 322793 transitions. [2019-09-10 07:55:35,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 07:55:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 269463 states and 322793 transitions. [2019-09-10 07:55:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:55:35,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:35,961 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:55:35,961 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:35,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:35,962 INFO L82 PathProgramCache]: Analyzing trace with hash 52015420, now seen corresponding path program 1 times [2019-09-10 07:55:35,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:35,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:35,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:35,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:35,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:36,036 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:55:36,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:36,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:55:36,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:36,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:55:36,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:55:36,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:55:36,038 INFO L87 Difference]: Start difference. First operand 269463 states and 322793 transitions. Second operand 3 states. [2019-09-10 07:55:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:36,366 INFO L93 Difference]: Finished difference Result 133247 states and 157275 transitions. [2019-09-10 07:55:36,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:55:36,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 07:55:36,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:36,489 INFO L225 Difference]: With dead ends: 133247 [2019-09-10 07:55:36,489 INFO L226 Difference]: Without dead ends: 133247 [2019-09-10 07:55:36,489 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:55:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133247 states. [2019-09-10 07:55:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133247 to 133245. [2019-09-10 07:55:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133245 states. [2019-09-10 07:55:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133245 states to 133245 states and 157274 transitions. [2019-09-10 07:55:38,734 INFO L78 Accepts]: Start accepts. Automaton has 133245 states and 157274 transitions. Word has length 136 [2019-09-10 07:55:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:38,734 INFO L475 AbstractCegarLoop]: Abstraction has 133245 states and 157274 transitions. [2019-09-10 07:55:38,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:55:38,734 INFO L276 IsEmpty]: Start isEmpty. Operand 133245 states and 157274 transitions. [2019-09-10 07:55:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 07:55:38,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:38,741 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:55:38,741 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:38,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1042612348, now seen corresponding path program 1 times [2019-09-10 07:55:38,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:38,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:38,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:38,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:38,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:39,903 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:55:39,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:39,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:55:39,904 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-09-10 07:55:39,905 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:55:39,907 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:55:39,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:55:39,948 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:55:40,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:55:40,588 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:55:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:40,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:55:40,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:40,589 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:55:40,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:40,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:55:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:40,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 07:55:40,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:55:45,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:45,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:46,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:46,546 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-09-10 07:55:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:48,492 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:55:48,493 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:55:49,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:49,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:49,626 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-09-10 07:55:51,092 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-09-10 07:55:51,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:51,371 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:55:51,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:55:51,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 18] total 60 [2019-09-10 07:55:51,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:55:51,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 07:55:51,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 07:55:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3298, Unknown=2, NotChecked=0, Total=3540 [2019-09-10 07:55:51,377 INFO L87 Difference]: Start difference. First operand 133245 states and 157274 transitions. Second operand 44 states. [2019-09-10 07:55:51,761 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 07:55:54,767 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-10 07:55:55,157 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:55:55,532 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 07:55:56,118 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:55:56,480 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:55:56,816 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:55:57,161 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:55:57,528 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:55:57,851 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:55:58,193 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 07:55:58,497 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 07:55:58,977 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 07:55:59,364 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 07:55:59,694 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:56:02,247 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:56:04,533 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:56:05,712 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:56:11,940 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 07:56:12,357 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:56:15,299 WARN L188 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-10 07:56:15,725 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:56:16,732 WARN L188 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-10 07:56:17,746 WARN L188 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:56:20,303 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-10 07:56:20,967 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:56:21,634 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:56:21,968 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 07:56:22,529 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:56:27,625 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 07:56:41,404 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 07:56:41,741 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:56:42,831 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:56:44,144 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:56:47,211 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:56:51,225 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:56:51,474 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:56:51,831 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:56:53,880 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 07:56:56,117 WARN L188 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:56:56,548 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 07:56:58,238 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:56:58,797 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 07:56:59,116 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 07:57:00,902 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-10 07:57:01,300 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 07:57:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:07,273 INFO L93 Difference]: Finished difference Result 752255 states and 889610 transitions. [2019-09-10 07:57:07,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-10 07:57:07,274 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 136 [2019-09-10 07:57:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:08,171 INFO L225 Difference]: With dead ends: 752255 [2019-09-10 07:57:08,171 INFO L226 Difference]: Without dead ends: 752255 [2019-09-10 07:57:08,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 15 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4105 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=2153, Invalid=15935, Unknown=2, NotChecked=0, Total=18090 [2019-09-10 07:57:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752255 states. [2019-09-10 07:57:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752255 to 171839. [2019-09-10 07:57:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171839 states. [2019-09-10 07:57:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171839 states to 171839 states and 201980 transitions. [2019-09-10 07:57:17,750 INFO L78 Accepts]: Start accepts. Automaton has 171839 states and 201980 transitions. Word has length 136 [2019-09-10 07:57:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:17,750 INFO L475 AbstractCegarLoop]: Abstraction has 171839 states and 201980 transitions. [2019-09-10 07:57:17,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 07:57:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 171839 states and 201980 transitions. [2019-09-10 07:57:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 07:57:17,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:17,756 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:57:17,756 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:17,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1583904813, now seen corresponding path program 1 times [2019-09-10 07:57:17,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:17,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:17,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:17,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:17,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:18,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:57:18,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:57:18,679 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2019-09-10 07:57:18,680 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:57:18,681 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:57:18,682 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:57:18,705 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:57:19,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:57:19,184 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:57:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:19,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:57:19,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:57:19,185 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:57:19,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:19,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:57:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:19,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:57:19,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:57:19,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:19,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:19,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:20,243 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:57:20,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:20,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:57:20,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 38 [2019-09-10 07:57:20,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:57:20,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:57:20,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:57:20,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:57:20,699 INFO L87 Difference]: Start difference. First operand 171839 states and 201980 transitions. Second operand 32 states. [2019-09-10 07:57:20,853 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-09-10 07:57:24,062 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-10 07:57:24,226 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 07:57:24,428 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-09-10 07:57:24,839 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-10 07:57:25,085 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 07:57:25,248 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 07:57:25,455 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:57:27,728 WARN L188 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 07:57:28,483 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 07:57:28,715 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 07:57:29,151 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:57:29,417 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2019-09-10 07:57:29,713 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 07:57:29,901 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 07:57:30,235 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-09-10 07:57:30,575 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 07:57:30,867 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2019-09-10 07:57:31,041 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:57:31,236 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-09-10 07:57:31,565 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-10 07:57:32,201 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 07:57:32,608 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:57:32,786 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 07:57:33,015 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 07:57:33,338 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 07:57:33,552 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-09-10 07:57:33,775 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:57:33,939 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:57:34,716 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-10 07:57:34,926 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 07:57:35,128 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-09-10 07:57:36,382 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 07:57:36,636 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:57:37,053 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 07:57:37,304 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-09-10 07:57:37,627 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 07:57:37,812 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:57:37,979 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-09-10 07:57:38,515 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-09-10 07:57:38,755 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:57:39,154 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:57:39,617 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:57:40,115 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-09-10 07:57:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:41,027 INFO L93 Difference]: Finished difference Result 355054 states and 415048 transitions. [2019-09-10 07:57:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-10 07:57:41,028 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 137 [2019-09-10 07:57:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:41,375 INFO L225 Difference]: With dead ends: 355054 [2019-09-10 07:57:41,376 INFO L226 Difference]: Without dead ends: 355054 [2019-09-10 07:57:41,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 256 SyntacticMatches, 4 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5060 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=3140, Invalid=14682, Unknown=0, NotChecked=0, Total=17822 [2019-09-10 07:57:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355054 states. [2019-09-10 07:57:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355054 to 144724. [2019-09-10 07:57:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144724 states. [2019-09-10 07:57:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144724 states to 144724 states and 169871 transitions. [2019-09-10 07:57:43,533 INFO L78 Accepts]: Start accepts. Automaton has 144724 states and 169871 transitions. Word has length 137 [2019-09-10 07:57:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:43,533 INFO L475 AbstractCegarLoop]: Abstraction has 144724 states and 169871 transitions. [2019-09-10 07:57:43,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 07:57:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 144724 states and 169871 transitions. [2019-09-10 07:57:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 07:57:43,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:43,539 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:57:43,539 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:43,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:43,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1179212656, now seen corresponding path program 1 times [2019-09-10 07:57:43,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:43,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:43,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:43,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:43,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:44,279 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:57:44,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:57:44,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:57:44,279 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2019-09-10 07:57:44,280 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:57:44,281 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:57:44,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:57:44,308 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:57:44,636 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:57:44,637 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:57:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:44,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:57:44,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:57:44,637 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:57:45,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:45,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:57:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:45,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 07:57:45,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:57:45,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:46,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:46,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:47,374 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:57:47,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:57:47,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:47,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:47,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:48,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:48,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:48,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:48,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:48,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:48,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:48,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:49,200 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:57:51,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:57:53,923 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:57:53,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:57:53,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 16] total 54 [2019-09-10 07:57:53,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:57:53,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 07:57:53,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 07:57:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2699, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:57:53,931 INFO L87 Difference]: Start difference. First operand 144724 states and 169871 transitions. Second operand 40 states. [2019-09-10 07:57:54,296 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-09-10 07:57:55,989 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:57:56,255 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 07:57:56,517 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 07:57:56,850 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:58:05,212 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-10 07:58:32,249 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-10 07:58:39,371 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-10 07:59:08,618 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-09-10 07:59:12,561 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-10 07:59:15,754 WARN L188 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:59:16,573 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-10 07:59:17,016 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 07:59:19,745 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-09-10 07:59:23,519 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-10 07:59:34,873 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-10 07:59:35,630 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-09-10 07:59:51,181 WARN L188 SmtUtils]: Spent 934.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-10 07:59:51,782 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 07:59:52,478 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-10 08:00:04,622 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-10 08:00:08,967 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 57