java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:01:47,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:01:47,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:01:47,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:01:47,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:01:47,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:01:47,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:01:47,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:01:47,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:01:47,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:01:47,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:01:47,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:01:47,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:01:47,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:01:47,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:01:47,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:01:47,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:01:47,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:01:47,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:01:48,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:01:48,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:01:48,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:01:48,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:01:48,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:01:48,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:01:48,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:01:48,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:01:48,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:01:48,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:01:48,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:01:48,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:01:48,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:01:48,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:01:48,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:01:48,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:01:48,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:01:48,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:01:48,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:01:48,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:01:48,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:01:48,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:01:48,028 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 08:01:48,063 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:01:48,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:01:48,064 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:01:48,068 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:01:48,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:01:48,069 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:01:48,069 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:01:48,070 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:01:48,070 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:01:48,070 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:01:48,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:01:48,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:01:48,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:01:48,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:01:48,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:01:48,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:01:48,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:01:48,075 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:01:48,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:01:48,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:01:48,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:01:48,076 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:01:48,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:01:48,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:01:48,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:01:48,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:01:48,077 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:01:48,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:01:48,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:01:48,078 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:01:48,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:01:48,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:01:48,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:01:48,157 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:01:48,158 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:01:48,159 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 08:01:48,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5048298ab/8496805297cc47bf8a8a42800f796f9e/FLAG6f315cdba [2019-09-10 08:01:48,765 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:01:48,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 08:01:48,786 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5048298ab/8496805297cc47bf8a8a42800f796f9e/FLAG6f315cdba [2019-09-10 08:01:49,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5048298ab/8496805297cc47bf8a8a42800f796f9e [2019-09-10 08:01:49,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:01:49,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:01:49,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:01:49,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:01:49,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:01:49,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:01:49" (1/1) ... [2019-09-10 08:01:49,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b08670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:49, skipping insertion in model container [2019-09-10 08:01:49,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:01:49" (1/1) ... [2019-09-10 08:01:49,120 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:01:49,170 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:01:49,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:01:49,545 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:01:49,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:01:49,647 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:01:49,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:49 WrapperNode [2019-09-10 08:01:49,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:01:49,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:01:49,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:01:49,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:01:49,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:49" (1/1) ... [2019-09-10 08:01:49,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:49" (1/1) ... [2019-09-10 08:01:49,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:49" (1/1) ... [2019-09-10 08:01:49,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:49" (1/1) ... [2019-09-10 08:01:49,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:49" (1/1) ... [2019-09-10 08:01:49,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:49" (1/1) ... [2019-09-10 08:01:49,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:49" (1/1) ... [2019-09-10 08:01:49,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:01:49,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:01:49,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:01:49,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:01:49,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:49" (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 08:01:49,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:01:49,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:01:49,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:01:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:01:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:01:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:01:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:01:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:01:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:01:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:01:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:01:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:01:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:01:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:01:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:01:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:01:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:01:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:01:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:01:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:01:50,443 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:01:50,443 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:01:50,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:01:50 BoogieIcfgContainer [2019-09-10 08:01:50,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:01:50,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:01:50,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:01:50,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:01:50,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:01:49" (1/3) ... [2019-09-10 08:01:50,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc2ce42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:01:50, skipping insertion in model container [2019-09-10 08:01:50,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:49" (2/3) ... [2019-09-10 08:01:50,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc2ce42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:01:50, skipping insertion in model container [2019-09-10 08:01:50,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:01:50" (3/3) ... [2019-09-10 08:01:50,452 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 08:01:50,462 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:01:50,471 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:01:50,489 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:01:50,518 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:01:50,518 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:01:50,518 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:01:50,518 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:01:50,519 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:01:50,519 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:01:50,519 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:01:50,519 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:01:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2019-09-10 08:01:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 08:01:50,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:50,552 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:50,554 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:50,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:50,559 INFO L82 PathProgramCache]: Analyzing trace with hash -896938852, now seen corresponding path program 1 times [2019-09-10 08:01:50,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:50,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:50,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:50,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:51,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:51,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:51,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:51,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:51,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:51,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:51,039 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 3 states. [2019-09-10 08:01:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:51,114 INFO L93 Difference]: Finished difference Result 158 states and 254 transitions. [2019-09-10 08:01:51,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:51,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 08:01:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:51,128 INFO L225 Difference]: With dead ends: 158 [2019-09-10 08:01:51,129 INFO L226 Difference]: Without dead ends: 150 [2019-09-10 08:01:51,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-10 08:01:51,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-10 08:01:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-10 08:01:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 213 transitions. [2019-09-10 08:01:51,181 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 213 transitions. Word has length 63 [2019-09-10 08:01:51,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:51,182 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 213 transitions. [2019-09-10 08:01:51,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 213 transitions. [2019-09-10 08:01:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 08:01:51,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:51,185 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 08:01:51,185 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:51,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:51,186 INFO L82 PathProgramCache]: Analyzing trace with hash -196255440, now seen corresponding path program 1 times [2019-09-10 08:01:51,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:51,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:51,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:51,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:51,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:51,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:51,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:51,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:51,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:51,359 INFO L87 Difference]: Start difference. First operand 148 states and 213 transitions. Second operand 3 states. [2019-09-10 08:01:51,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:51,409 INFO L93 Difference]: Finished difference Result 242 states and 360 transitions. [2019-09-10 08:01:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:51,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 08:01:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:51,413 INFO L225 Difference]: With dead ends: 242 [2019-09-10 08:01:51,413 INFO L226 Difference]: Without dead ends: 242 [2019-09-10 08:01:51,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-10 08:01:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2019-09-10 08:01:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-10 08:01:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 359 transitions. [2019-09-10 08:01:51,435 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 359 transitions. Word has length 64 [2019-09-10 08:01:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:51,435 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 359 transitions. [2019-09-10 08:01:51,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 359 transitions. [2019-09-10 08:01:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 08:01:51,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:51,438 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 08:01:51,438 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:51,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:51,439 INFO L82 PathProgramCache]: Analyzing trace with hash -922764682, now seen corresponding path program 1 times [2019-09-10 08:01:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:51,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:51,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:51,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:51,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:51,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:51,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:51,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:51,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:51,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:51,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:51,563 INFO L87 Difference]: Start difference. First operand 240 states and 359 transitions. Second operand 3 states. [2019-09-10 08:01:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:51,607 INFO L93 Difference]: Finished difference Result 410 states and 624 transitions. [2019-09-10 08:01:51,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:51,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 08:01:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:51,612 INFO L225 Difference]: With dead ends: 410 [2019-09-10 08:01:51,612 INFO L226 Difference]: Without dead ends: 410 [2019-09-10 08:01:51,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-10 08:01:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-09-10 08:01:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-10 08:01:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-10 08:01:51,662 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 65 [2019-09-10 08:01:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:51,663 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-10 08:01:51,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-10 08:01:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 08:01:51,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:51,666 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 08:01:51,666 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:51,666 INFO L82 PathProgramCache]: Analyzing trace with hash -919872372, now seen corresponding path program 1 times [2019-09-10 08:01:51,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:51,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:51,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:51,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:51,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:51,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:51,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:51,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:51,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:51,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:51,788 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 3 states. [2019-09-10 08:01:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:51,821 INFO L93 Difference]: Finished difference Result 714 states and 1096 transitions. [2019-09-10 08:01:51,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:51,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 08:01:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:51,826 INFO L225 Difference]: With dead ends: 714 [2019-09-10 08:01:51,826 INFO L226 Difference]: Without dead ends: 714 [2019-09-10 08:01:51,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-10 08:01:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 712. [2019-09-10 08:01:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-10 08:01:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1095 transitions. [2019-09-10 08:01:51,849 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1095 transitions. Word has length 66 [2019-09-10 08:01:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:51,849 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1095 transitions. [2019-09-10 08:01:51,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1095 transitions. [2019-09-10 08:01:51,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 08:01:51,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:51,852 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 08:01:51,852 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:51,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:51,852 INFO L82 PathProgramCache]: Analyzing trace with hash -963358397, now seen corresponding path program 1 times [2019-09-10 08:01:51,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:51,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:51,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:51,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:51,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:51,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:51,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:51,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:52,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:52,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:52,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:52,002 INFO L87 Difference]: Start difference. First operand 712 states and 1095 transitions. Second operand 3 states. [2019-09-10 08:01:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:52,048 INFO L93 Difference]: Finished difference Result 1258 states and 1928 transitions. [2019-09-10 08:01:52,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:52,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 08:01:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:52,058 INFO L225 Difference]: With dead ends: 1258 [2019-09-10 08:01:52,058 INFO L226 Difference]: Without dead ends: 1258 [2019-09-10 08:01:52,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-10 08:01:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-09-10 08:01:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-10 08:01:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1927 transitions. [2019-09-10 08:01:52,112 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1927 transitions. Word has length 67 [2019-09-10 08:01:52,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:52,112 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1927 transitions. [2019-09-10 08:01:52,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1927 transitions. [2019-09-10 08:01:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:01:52,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:52,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:52,124 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash -295185019, now seen corresponding path program 1 times [2019-09-10 08:01:52,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:52,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:52,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:52,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:52,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:52,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:52,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:01:52,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:52,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:01:52,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:01:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:01:52,331 INFO L87 Difference]: Start difference. First operand 1256 states and 1927 transitions. Second operand 5 states. [2019-09-10 08:01:52,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:52,547 INFO L93 Difference]: Finished difference Result 1256 states and 1911 transitions. [2019-09-10 08:01:52,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:01:52,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 08:01:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:52,556 INFO L225 Difference]: With dead ends: 1256 [2019-09-10 08:01:52,556 INFO L226 Difference]: Without dead ends: 1256 [2019-09-10 08:01:52,557 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 08:01:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-10 08:01:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2019-09-10 08:01:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-10 08:01:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1911 transitions. [2019-09-10 08:01:52,589 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1911 transitions. Word has length 68 [2019-09-10 08:01:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:52,591 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1911 transitions. [2019-09-10 08:01:52,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:01:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1911 transitions. [2019-09-10 08:01:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:01:52,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:52,598 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] [2019-09-10 08:01:52,598 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1032200170, now seen corresponding path program 1 times [2019-09-10 08:01:52,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:52,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:52,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:52,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:52,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:01:52,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:52,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:01:52,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:01:52,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:01:52,712 INFO L87 Difference]: Start difference. First operand 1256 states and 1911 transitions. Second operand 5 states. [2019-09-10 08:01:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:52,841 INFO L93 Difference]: Finished difference Result 1256 states and 1895 transitions. [2019-09-10 08:01:52,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:01:52,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 08:01:52,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:52,848 INFO L225 Difference]: With dead ends: 1256 [2019-09-10 08:01:52,849 INFO L226 Difference]: Without dead ends: 1256 [2019-09-10 08:01:52,849 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 08:01:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-10 08:01:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2019-09-10 08:01:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-10 08:01:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1895 transitions. [2019-09-10 08:01:52,892 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1895 transitions. Word has length 68 [2019-09-10 08:01:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:52,893 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1895 transitions. [2019-09-10 08:01:52,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:01:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1895 transitions. [2019-09-10 08:01:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:01:52,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:52,894 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] [2019-09-10 08:01:52,895 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:52,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash -809830363, now seen corresponding path program 1 times [2019-09-10 08:01:52,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:52,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:52,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:52,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:52,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:52,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:52,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:01:52,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:52,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:01:52,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:01:52,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:01:52,981 INFO L87 Difference]: Start difference. First operand 1256 states and 1895 transitions. Second operand 5 states. [2019-09-10 08:01:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:53,122 INFO L93 Difference]: Finished difference Result 1256 states and 1879 transitions. [2019-09-10 08:01:53,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:01:53,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 08:01:53,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:53,130 INFO L225 Difference]: With dead ends: 1256 [2019-09-10 08:01:53,130 INFO L226 Difference]: Without dead ends: 1256 [2019-09-10 08:01:53,131 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 08:01:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-10 08:01:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2019-09-10 08:01:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-10 08:01:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1879 transitions. [2019-09-10 08:01:53,164 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1879 transitions. Word has length 68 [2019-09-10 08:01:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:53,164 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1879 transitions. [2019-09-10 08:01:53,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:01:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1879 transitions. [2019-09-10 08:01:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:01:53,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:53,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] [2019-09-10 08:01:53,167 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash 464037642, now seen corresponding path program 1 times [2019-09-10 08:01:53,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:53,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:53,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:53,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:53,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:53,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:01:53,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:53,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:01:53,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:01:53,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:01:53,266 INFO L87 Difference]: Start difference. First operand 1256 states and 1879 transitions. Second operand 5 states. [2019-09-10 08:01:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:53,410 INFO L93 Difference]: Finished difference Result 1256 states and 1863 transitions. [2019-09-10 08:01:53,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:01:53,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 08:01:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:53,418 INFO L225 Difference]: With dead ends: 1256 [2019-09-10 08:01:53,418 INFO L226 Difference]: Without dead ends: 1256 [2019-09-10 08:01:53,419 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 08:01:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-10 08:01:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2019-09-10 08:01:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-10 08:01:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1863 transitions. [2019-09-10 08:01:53,472 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1863 transitions. Word has length 68 [2019-09-10 08:01:53,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:53,472 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1863 transitions. [2019-09-10 08:01:53,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:01:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1863 transitions. [2019-09-10 08:01:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:01:53,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:53,474 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] [2019-09-10 08:01:53,474 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash -982991953, now seen corresponding path program 1 times [2019-09-10 08:01:53,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:53,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:53,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:53,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:53,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:53,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:53,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:53,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:53,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:53,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:53,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:53,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:53,608 INFO L87 Difference]: Start difference. First operand 1256 states and 1863 transitions. Second operand 7 states. [2019-09-10 08:01:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:53,845 INFO L93 Difference]: Finished difference Result 9782 states and 14446 transitions. [2019-09-10 08:01:53,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:01:53,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-10 08:01:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:53,896 INFO L225 Difference]: With dead ends: 9782 [2019-09-10 08:01:53,897 INFO L226 Difference]: Without dead ends: 9782 [2019-09-10 08:01:53,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:01:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9782 states. [2019-09-10 08:01:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9782 to 3688. [2019-09-10 08:01:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3688 states. [2019-09-10 08:01:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5447 transitions. [2019-09-10 08:01:54,117 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5447 transitions. Word has length 68 [2019-09-10 08:01:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:54,118 INFO L475 AbstractCegarLoop]: Abstraction has 3688 states and 5447 transitions. [2019-09-10 08:01:54,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5447 transitions. [2019-09-10 08:01:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 08:01:54,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:54,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:54,120 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:54,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:54,121 INFO L82 PathProgramCache]: Analyzing trace with hash -635604215, now seen corresponding path program 1 times [2019-09-10 08:01:54,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:54,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:54,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:54,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:54,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:54,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:54,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:54,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:54,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:54,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:54,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:54,444 INFO L87 Difference]: Start difference. First operand 3688 states and 5447 transitions. Second operand 7 states. [2019-09-10 08:01:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:54,622 INFO L93 Difference]: Finished difference Result 4910 states and 7242 transitions. [2019-09-10 08:01:54,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:54,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-09-10 08:01:54,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:54,647 INFO L225 Difference]: With dead ends: 4910 [2019-09-10 08:01:54,648 INFO L226 Difference]: Without dead ends: 4910 [2019-09-10 08:01:54,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:01:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4910 states. [2019-09-10 08:01:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4910 to 3688. [2019-09-10 08:01:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3688 states. [2019-09-10 08:01:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5415 transitions. [2019-09-10 08:01:54,750 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5415 transitions. Word has length 70 [2019-09-10 08:01:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:54,751 INFO L475 AbstractCegarLoop]: Abstraction has 3688 states and 5415 transitions. [2019-09-10 08:01:54,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5415 transitions. [2019-09-10 08:01:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 08:01:54,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:54,753 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] [2019-09-10 08:01:54,753 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:54,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:54,754 INFO L82 PathProgramCache]: Analyzing trace with hash -655653558, now seen corresponding path program 1 times [2019-09-10 08:01:54,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:54,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:54,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:54,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:54,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:54,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:54,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:54,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:54,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:54,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:54,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:54,846 INFO L87 Difference]: Start difference. First operand 3688 states and 5415 transitions. Second operand 3 states. [2019-09-10 08:01:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:54,896 INFO L93 Difference]: Finished difference Result 5452 states and 7890 transitions. [2019-09-10 08:01:54,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:54,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 08:01:54,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:54,924 INFO L225 Difference]: With dead ends: 5452 [2019-09-10 08:01:54,925 INFO L226 Difference]: Without dead ends: 5452 [2019-09-10 08:01:54,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-09-10 08:01:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 5450. [2019-09-10 08:01:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5450 states. [2019-09-10 08:01:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5450 states to 5450 states and 7889 transitions. [2019-09-10 08:01:55,097 INFO L78 Accepts]: Start accepts. Automaton has 5450 states and 7889 transitions. Word has length 70 [2019-09-10 08:01:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:55,098 INFO L475 AbstractCegarLoop]: Abstraction has 5450 states and 7889 transitions. [2019-09-10 08:01:55,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5450 states and 7889 transitions. [2019-09-10 08:01:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 08:01:55,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:55,100 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 08:01:55,100 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:55,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:55,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1769196458, now seen corresponding path program 1 times [2019-09-10 08:01:55,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:55,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:55,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:55,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:55,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:55,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:55,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:01:55,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:55,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:01:55,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:01:55,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:01:55,212 INFO L87 Difference]: Start difference. First operand 5450 states and 7889 transitions. Second operand 5 states. [2019-09-10 08:01:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:55,305 INFO L93 Difference]: Finished difference Result 10182 states and 14553 transitions. [2019-09-10 08:01:55,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:01:55,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 08:01:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:55,342 INFO L225 Difference]: With dead ends: 10182 [2019-09-10 08:01:55,343 INFO L226 Difference]: Without dead ends: 10182 [2019-09-10 08:01:55,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:01:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10182 states. [2019-09-10 08:01:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10182 to 5674. [2019-09-10 08:01:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5674 states. [2019-09-10 08:01:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 8097 transitions. [2019-09-10 08:01:55,580 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 8097 transitions. Word has length 71 [2019-09-10 08:01:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:55,580 INFO L475 AbstractCegarLoop]: Abstraction has 5674 states and 8097 transitions. [2019-09-10 08:01:55,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:01:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 8097 transitions. [2019-09-10 08:01:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:01:55,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:55,584 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:01:55,585 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:55,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:55,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1397736529, now seen corresponding path program 1 times [2019-09-10 08:01:55,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:55,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:55,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:55,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:55,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:01:55,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:55,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:55,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:55,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:55,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:55,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:55,731 INFO L87 Difference]: Start difference. First operand 5674 states and 8097 transitions. Second operand 7 states. [2019-09-10 08:01:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:55,924 INFO L93 Difference]: Finished difference Result 22004 states and 31398 transitions. [2019-09-10 08:01:55,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:55,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 08:01:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:55,971 INFO L225 Difference]: With dead ends: 22004 [2019-09-10 08:01:55,971 INFO L226 Difference]: Without dead ends: 22004 [2019-09-10 08:01:55,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:01:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22004 states. [2019-09-10 08:01:56,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22004 to 9450. [2019-09-10 08:01:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9450 states. [2019-09-10 08:01:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9450 states to 9450 states and 13393 transitions. [2019-09-10 08:01:56,251 INFO L78 Accepts]: Start accepts. Automaton has 9450 states and 13393 transitions. Word has length 97 [2019-09-10 08:01:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:56,251 INFO L475 AbstractCegarLoop]: Abstraction has 9450 states and 13393 transitions. [2019-09-10 08:01:56,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 9450 states and 13393 transitions. [2019-09-10 08:01:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:01:56,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:56,256 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:01:56,256 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash 887147195, now seen corresponding path program 1 times [2019-09-10 08:01:56,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:56,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:56,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:56,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:56,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:56,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:56,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:01:56,445 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 08:01:56,447 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [111], [113], [116], [124], [126], [129], [137], [139], [142], [145], [150], [152], [155], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [208], [210], [213], [216], [218], [226], [229], [235], [238], [241], [243], [258], [260], [263], [266], [268], [283], [285], [288], [291], [293], [308], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 08:01:56,499 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:01:56,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:01:56,683 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:01:57,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:01:57,612 INFO L272 AbstractInterpreter]: Visited 90 different actions 784 times. Merged at 52 different actions 598 times. Widened at 22 different actions 108 times. Performed 2877 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2877 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 75 fixpoints after 16 different actions. Largest state had 134 variables. [2019-09-10 08:01:57,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:57,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:01:57,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:57,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:01:57,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:57,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:01:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:57,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:01:57,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:01:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:01:57,943 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:01:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:01:58,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:01:58,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 7] total 13 [2019-09-10 08:01:58,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:58,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:58,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:01:58,041 INFO L87 Difference]: Start difference. First operand 9450 states and 13393 transitions. Second operand 7 states. [2019-09-10 08:01:58,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:58,342 INFO L93 Difference]: Finished difference Result 18196 states and 25830 transitions. [2019-09-10 08:01:58,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:58,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 08:01:58,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:58,393 INFO L225 Difference]: With dead ends: 18196 [2019-09-10 08:01:58,394 INFO L226 Difference]: Without dead ends: 18196 [2019-09-10 08:01:58,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:01:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18196 states. [2019-09-10 08:01:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18196 to 13178. [2019-09-10 08:01:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13178 states. [2019-09-10 08:01:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13178 states to 13178 states and 18641 transitions. [2019-09-10 08:01:58,953 INFO L78 Accepts]: Start accepts. Automaton has 13178 states and 18641 transitions. Word has length 97 [2019-09-10 08:01:58,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:58,954 INFO L475 AbstractCegarLoop]: Abstraction has 13178 states and 18641 transitions. [2019-09-10 08:01:58,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 13178 states and 18641 transitions. [2019-09-10 08:01:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:01:58,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:58,959 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:01:58,959 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash 910892417, now seen corresponding path program 1 times [2019-09-10 08:01:58,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:58,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:58,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:58,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:58,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:59,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:59,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:01:59,075 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 08:01:59,075 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [111], [113], [116], [124], [126], [129], [137], [139], [142], [150], [152], [155], [158], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [201], [204], [210], [213], [216], [218], [233], [235], [238], [241], [243], [258], [260], [263], [266], [268], [283], [285], [288], [291], [293], [308], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 08:01:59,079 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:01:59,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:01:59,103 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:01:59,464 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:01:59,465 INFO L272 AbstractInterpreter]: Visited 90 different actions 666 times. Merged at 52 different actions 499 times. Widened at 21 different actions 68 times. Performed 2474 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2474 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 63 fixpoints after 18 different actions. Largest state had 134 variables. [2019-09-10 08:01:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:59,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:01:59,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:59,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:01:59,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:59,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:01:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:59,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:01:59,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:01:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:01:59,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:01:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:01:59,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:01:59,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 7] total 13 [2019-09-10 08:01:59,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:59,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:59,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:59,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:01:59,990 INFO L87 Difference]: Start difference. First operand 13178 states and 18641 transitions. Second operand 7 states. [2019-09-10 08:02:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:00,251 INFO L93 Difference]: Finished difference Result 21922 states and 31077 transitions. [2019-09-10 08:02:00,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:02:00,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 08:02:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:00,308 INFO L225 Difference]: With dead ends: 21922 [2019-09-10 08:02:00,308 INFO L226 Difference]: Without dead ends: 21922 [2019-09-10 08:02:00,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:02:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21922 states. [2019-09-10 08:02:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21922 to 16906. [2019-09-10 08:02:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16906 states. [2019-09-10 08:02:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16906 states to 16906 states and 23889 transitions. [2019-09-10 08:02:00,707 INFO L78 Accepts]: Start accepts. Automaton has 16906 states and 23889 transitions. Word has length 97 [2019-09-10 08:02:00,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:00,708 INFO L475 AbstractCegarLoop]: Abstraction has 16906 states and 23889 transitions. [2019-09-10 08:02:00,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:02:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 16906 states and 23889 transitions. [2019-09-10 08:02:00,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:02:00,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:00,713 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:02:00,713 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:00,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:00,715 INFO L82 PathProgramCache]: Analyzing trace with hash 514621301, now seen corresponding path program 1 times [2019-09-10 08:02:00,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:00,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:00,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:02:00,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:00,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:02:00,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:00,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:02:00,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:02:00,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:02:00,946 INFO L87 Difference]: Start difference. First operand 16906 states and 23889 transitions. Second operand 7 states. [2019-09-10 08:02:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:01,177 INFO L93 Difference]: Finished difference Result 25652 states and 36326 transitions. [2019-09-10 08:02:01,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:02:01,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 08:02:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:01,226 INFO L225 Difference]: With dead ends: 25652 [2019-09-10 08:02:01,226 INFO L226 Difference]: Without dead ends: 25652 [2019-09-10 08:02:01,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:02:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25652 states. [2019-09-10 08:02:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25652 to 20634. [2019-09-10 08:02:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20634 states. [2019-09-10 08:02:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20634 states to 20634 states and 29137 transitions. [2019-09-10 08:02:02,107 INFO L78 Accepts]: Start accepts. Automaton has 20634 states and 29137 transitions. Word has length 97 [2019-09-10 08:02:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:02,107 INFO L475 AbstractCegarLoop]: Abstraction has 20634 states and 29137 transitions. [2019-09-10 08:02:02,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:02:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 20634 states and 29137 transitions. [2019-09-10 08:02:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:02:02,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:02,113 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:02:02,113 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1208876905, now seen corresponding path program 1 times [2019-09-10 08:02:02,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:02,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:02,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:02,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:02,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:02:02,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:02,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:02:02,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:02,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:02:02,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:02:02,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:02:02,281 INFO L87 Difference]: Start difference. First operand 20634 states and 29137 transitions. Second operand 7 states. [2019-09-10 08:02:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:02,536 INFO L93 Difference]: Finished difference Result 29492 states and 41958 transitions. [2019-09-10 08:02:02,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:02:02,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 08:02:02,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:02,617 INFO L225 Difference]: With dead ends: 29492 [2019-09-10 08:02:02,617 INFO L226 Difference]: Without dead ends: 29492 [2019-09-10 08:02:02,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:02:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29492 states. [2019-09-10 08:02:03,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29492 to 21914. [2019-09-10 08:02:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21914 states. [2019-09-10 08:02:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21914 states to 21914 states and 30993 transitions. [2019-09-10 08:02:03,055 INFO L78 Accepts]: Start accepts. Automaton has 21914 states and 30993 transitions. Word has length 97 [2019-09-10 08:02:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:03,055 INFO L475 AbstractCegarLoop]: Abstraction has 21914 states and 30993 transitions. [2019-09-10 08:02:03,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:02:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 21914 states and 30993 transitions. [2019-09-10 08:02:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:02:03,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:03,064 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:03,065 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:03,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:03,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2047399003, now seen corresponding path program 1 times [2019-09-10 08:02:03,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:03,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:03,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:03,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:03,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:02:03,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:03,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:02:03,332 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 08:02:03,334 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [111], [113], [116], [124], [126], [129], [137], [139], [142], [150], [152], [155], [163], [165], [168], [171], [175], [177], [180], [181], [183], [185], [190], [192], [195], [208], [210], [213], [216], [218], [233], [235], [238], [241], [243], [258], [260], [263], [266], [268], [283], [285], [288], [291], [293], [308], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 08:02:03,344 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:02:03,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:02:03,375 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:02:03,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:02:03,759 INFO L272 AbstractInterpreter]: Visited 90 different actions 762 times. Merged at 52 different actions 567 times. Widened at 24 different actions 95 times. Performed 2844 root evaluator evaluations with a maximum evaluation depth of 7. Performed 2844 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 87 fixpoints after 22 different actions. Largest state had 134 variables. [2019-09-10 08:02:03,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:03,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:02:03,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:03,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:02:03,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:03,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:02:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:03,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:02:03,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:02:03,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:04,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:02:04,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:04,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:02:04,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 20 [2019-09-10 08:02:04,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:02:04,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:02:04,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:02:04,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:02:04,557 INFO L87 Difference]: Start difference. First operand 21914 states and 30993 transitions. Second operand 12 states. [2019-09-10 08:02:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:09,810 INFO L93 Difference]: Finished difference Result 153210 states and 211799 transitions. [2019-09-10 08:02:09,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-10 08:02:09,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-10 08:02:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:10,037 INFO L225 Difference]: With dead ends: 153210 [2019-09-10 08:02:10,037 INFO L226 Difference]: Without dead ends: 153210 [2019-09-10 08:02:10,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1432, Invalid=4420, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 08:02:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153210 states. [2019-09-10 08:02:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153210 to 86214. [2019-09-10 08:02:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86214 states. [2019-09-10 08:02:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86214 states to 86214 states and 120335 transitions. [2019-09-10 08:02:12,548 INFO L78 Accepts]: Start accepts. Automaton has 86214 states and 120335 transitions. Word has length 98 [2019-09-10 08:02:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:12,548 INFO L475 AbstractCegarLoop]: Abstraction has 86214 states and 120335 transitions. [2019-09-10 08:02:12,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:02:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 86214 states and 120335 transitions. [2019-09-10 08:02:12,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:02:12,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:12,559 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:02:12,559 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:12,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:12,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2002573344, now seen corresponding path program 1 times [2019-09-10 08:02:12,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:12,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:12,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:13,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:13,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:02:13,101 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 08:02:13,101 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [111], [113], [116], [119], [124], [126], [129], [137], [139], [142], [150], [152], [155], [158], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [201], [204], [210], [213], [216], [218], [233], [235], [238], [241], [243], [258], [260], [263], [266], [268], [276], [279], [285], [288], [291], [293], [308], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 08:02:13,103 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:02:13,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:02:13,124 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:02:13,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:02:13,565 INFO L272 AbstractInterpreter]: Visited 92 different actions 765 times. Merged at 54 different actions 585 times. Widened at 20 different actions 97 times. Performed 2804 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2804 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 70 fixpoints after 15 different actions. Largest state had 134 variables. [2019-09-10 08:02:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:13,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:02:13,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:13,566 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 08:02:13,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:13,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:02:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:13,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:02:13,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:02:13,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:14,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:02:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:14,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:02:14,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-10 08:02:14,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:02:14,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:02:14,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:02:14,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:02:14,287 INFO L87 Difference]: Start difference. First operand 86214 states and 120335 transitions. Second operand 17 states. [2019-09-10 08:02:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:18,599 INFO L93 Difference]: Finished difference Result 389124 states and 536366 transitions. [2019-09-10 08:02:18,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:02:18,600 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2019-09-10 08:02:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:19,161 INFO L225 Difference]: With dead ends: 389124 [2019-09-10 08:02:19,161 INFO L226 Difference]: Without dead ends: 389124 [2019-09-10 08:02:19,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=616, Invalid=1736, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 08:02:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389124 states. [2019-09-10 08:02:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389124 to 180606. [2019-09-10 08:02:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180606 states. [2019-09-10 08:02:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180606 states to 180606 states and 251189 transitions. [2019-09-10 08:02:24,408 INFO L78 Accepts]: Start accepts. Automaton has 180606 states and 251189 transitions. Word has length 99 [2019-09-10 08:02:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:24,408 INFO L475 AbstractCegarLoop]: Abstraction has 180606 states and 251189 transitions. [2019-09-10 08:02:24,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:02:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 180606 states and 251189 transitions. [2019-09-10 08:02:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:02:24,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:24,416 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:02:24,416 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:24,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1012996838, now seen corresponding path program 1 times [2019-09-10 08:02:24,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:24,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:24,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:24,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:24,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:24,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:24,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:02:24,623 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 08:02:24,624 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [111], [113], [116], [124], [126], [129], [137], [139], [142], [150], [152], [155], [158], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [201], [204], [210], [213], [216], [218], [233], [235], [238], [241], [243], [258], [260], [263], [266], [268], [283], [285], [288], [291], [293], [301], [304], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 08:02:24,627 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:02:24,627 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:02:24,648 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:02:25,001 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:02:25,003 INFO L272 AbstractInterpreter]: Visited 92 different actions 704 times. Merged at 54 different actions 534 times. Widened at 19 different actions 89 times. Performed 2554 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2554 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 67 fixpoints after 18 different actions. Largest state had 134 variables. [2019-09-10 08:02:25,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:25,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:02:25,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:25,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:02:25,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:25,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:02:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:25,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 08:02:25,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:02:25,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:25,552 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:02:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:26,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:02:26,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 08:02:26,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:02:26,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:02:26,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:02:26,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:02:26,131 INFO L87 Difference]: Start difference. First operand 180606 states and 251189 transitions. Second operand 20 states. [2019-09-10 08:02:29,683 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-10 08:02:31,814 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 08:02:32,199 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 08:02:32,610 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-10 08:02:33,152 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 08:02:33,655 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 08:02:33,939 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:02:35,605 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 08:02:36,442 WARN L188 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 08:02:39,403 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-10 08:02:40,525 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-10 08:02:40,752 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 08:02:41,634 WARN L188 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 08:02:43,160 WARN L188 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-10 08:02:44,783 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:02:44,945 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-09-10 08:02:46,031 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-09-10 08:02:46,205 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 08:02:46,381 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 08:02:46,571 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:02:46,746 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:02:49,188 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 08:02:49,611 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-10 08:02:50,291 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:02:50,448 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 08:02:50,729 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 08:02:50,918 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 08:02:52,107 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:02:52,260 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:02:54,086 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-10 08:02:54,687 WARN L188 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-10 08:02:55,151 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 08:02:55,310 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:02:55,598 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 08:02:55,849 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-09-10 08:02:57,016 WARN L188 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-10 08:02:58,637 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:03:04,810 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 08:03:05,492 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 08:03:08,280 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-10 08:03:08,558 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 08:03:10,915 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-10 08:03:12,053 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-10 08:03:12,595 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-10 08:03:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:18,633 INFO L93 Difference]: Finished difference Result 1473812 states and 2004687 transitions. [2019-09-10 08:03:18,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2019-09-10 08:03:18,634 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2019-09-10 08:03:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:28,502 INFO L225 Difference]: With dead ends: 1473812 [2019-09-10 08:03:28,503 INFO L226 Difference]: Without dead ends: 1473812 [2019-09-10 08:03:28,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24048 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=8671, Invalid=51599, Unknown=0, NotChecked=0, Total=60270 [2019-09-10 08:03:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473812 states. [2019-09-10 08:03:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473812 to 397996. [2019-09-10 08:03:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397996 states. [2019-09-10 08:03:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397996 states to 397996 states and 551089 transitions. [2019-09-10 08:03:47,343 INFO L78 Accepts]: Start accepts. Automaton has 397996 states and 551089 transitions. Word has length 99 [2019-09-10 08:03:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:47,343 INFO L475 AbstractCegarLoop]: Abstraction has 397996 states and 551089 transitions. [2019-09-10 08:03:47,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:03:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 397996 states and 551089 transitions. [2019-09-10 08:03:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:03:47,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:47,357 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] [2019-09-10 08:03:47,358 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:47,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash -764347023, now seen corresponding path program 1 times [2019-09-10 08:03:47,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:47,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:47,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:47,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:47,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:47,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:47,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:47,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:47,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:47,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:47,428 INFO L87 Difference]: Start difference. First operand 397996 states and 551089 transitions. Second operand 3 states. [2019-09-10 08:03:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:48,080 INFO L93 Difference]: Finished difference Result 227065 states and 311210 transitions. [2019-09-10 08:03:48,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:48,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 08:03:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:48,452 INFO L225 Difference]: With dead ends: 227065 [2019-09-10 08:03:48,453 INFO L226 Difference]: Without dead ends: 227065 [2019-09-10 08:03:48,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:48,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227065 states. [2019-09-10 08:03:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227065 to 217035. [2019-09-10 08:03:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217035 states. [2019-09-10 08:03:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217035 states to 217035 states and 299893 transitions. [2019-09-10 08:03:56,583 INFO L78 Accepts]: Start accepts. Automaton has 217035 states and 299893 transitions. Word has length 100 [2019-09-10 08:03:56,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:56,583 INFO L475 AbstractCegarLoop]: Abstraction has 217035 states and 299893 transitions. [2019-09-10 08:03:56,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 217035 states and 299893 transitions. [2019-09-10 08:03:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:03:56,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:56,589 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:03:56,589 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash -628391631, now seen corresponding path program 1 times [2019-09-10 08:03:56,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:56,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:56,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:56,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:56,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:56,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:56,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:03:56,816 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 08:03:56,816 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [109], [111], [113], [116], [119], [124], [126], [129], [137], [139], [142], [150], [152], [155], [158], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [201], [204], [210], [213], [216], [218], [233], [235], [238], [241], [243], [258], [260], [263], [266], [268], [276], [279], [285], [288], [291], [293], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 08:03:56,818 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:03:56,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:03:56,838 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:03:57,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:03:57,211 INFO L272 AbstractInterpreter]: Visited 93 different actions 756 times. Merged at 55 different actions 581 times. Widened at 16 different actions 68 times. Performed 2714 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2714 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 69 fixpoints after 19 different actions. Largest state had 134 variables. [2019-09-10 08:03:57,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:57,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:03:57,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:57,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:03:57,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:57,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:03:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:57,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:03:57,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:03:57,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:57,617 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:03:57,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:57,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:03:57,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-09-10 08:03:57,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:03:57,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:03:57,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:03:57,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:03:57,911 INFO L87 Difference]: Start difference. First operand 217035 states and 299893 transitions. Second operand 17 states. [2019-09-10 08:04:15,831 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 08:04:17,790 WARN L188 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 08:04:25,435 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-10 08:04:26,359 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:04:27,195 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:05:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:12,441 INFO L93 Difference]: Finished difference Result 5148513 states and 6950648 transitions. [2019-09-10 08:05:12,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 295 states. [2019-09-10 08:05:12,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 100 [2019-09-10 08:05:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:33,187 INFO L225 Difference]: With dead ends: 5148513 [2019-09-10 08:05:33,188 INFO L226 Difference]: Without dead ends: 5148513 [2019-09-10 08:05:33,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43697 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=11638, Invalid=87272, Unknown=0, NotChecked=0, Total=98910 [2019-09-10 08:05:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5148513 states. [2019-09-10 08:06:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5148513 to 1190534. [2019-09-10 08:06:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190534 states. [2019-09-10 08:06:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190534 states to 1190534 states and 1629239 transitions. [2019-09-10 08:06:39,975 INFO L78 Accepts]: Start accepts. Automaton has 1190534 states and 1629239 transitions. Word has length 100 [2019-09-10 08:06:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:39,975 INFO L475 AbstractCegarLoop]: Abstraction has 1190534 states and 1629239 transitions. [2019-09-10 08:06:39,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:06:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1190534 states and 1629239 transitions. [2019-09-10 08:06:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:06:39,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:39,990 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:06:39,990 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:39,990 INFO L82 PathProgramCache]: Analyzing trace with hash -393733614, now seen corresponding path program 1 times [2019-09-10 08:06:39,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:39,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:39,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:39,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:39,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:06:40,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:40,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:06:40,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:40,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:06:40,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:06:40,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:06:40,040 INFO L87 Difference]: Start difference. First operand 1190534 states and 1629239 transitions. Second operand 3 states. [2019-09-10 08:06:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:52,119 INFO L93 Difference]: Finished difference Result 1005790 states and 1372076 transitions. [2019-09-10 08:06:52,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:06:52,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 08:06:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:54,433 INFO L225 Difference]: With dead ends: 1005790 [2019-09-10 08:06:54,433 INFO L226 Difference]: Without dead ends: 1005790 [2019-09-10 08:06:54,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:06:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005790 states. [2019-09-10 08:07:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005790 to 1005790. [2019-09-10 08:07:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005790 states. [2019-09-10 08:07:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005790 states to 1005790 states and 1372076 transitions. [2019-09-10 08:07:28,469 INFO L78 Accepts]: Start accepts. Automaton has 1005790 states and 1372076 transitions. Word has length 102 [2019-09-10 08:07:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:28,469 INFO L475 AbstractCegarLoop]: Abstraction has 1005790 states and 1372076 transitions. [2019-09-10 08:07:28,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1005790 states and 1372076 transitions. [2019-09-10 08:07:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:07:28,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:28,483 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] [2019-09-10 08:07:28,483 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:28,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2060407966, now seen corresponding path program 1 times [2019-09-10 08:07:28,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:28,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:28,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:28,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:28,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:28,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:28,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:28,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:28,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:28,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:28,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:28,552 INFO L87 Difference]: Start difference. First operand 1005790 states and 1372076 transitions. Second operand 3 states. [2019-09-10 08:07:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:32,061 INFO L93 Difference]: Finished difference Result 517412 states and 694714 transitions. [2019-09-10 08:07:32,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:32,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 08:07:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:32,707 INFO L225 Difference]: With dead ends: 517412 [2019-09-10 08:07:32,707 INFO L226 Difference]: Without dead ends: 517412 [2019-09-10 08:07:32,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517412 states. [2019-09-10 08:07:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517412 to 510030. [2019-09-10 08:07:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510030 states. [2019-09-10 08:07:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510030 states to 510030 states and 687333 transitions. [2019-09-10 08:07:46,921 INFO L78 Accepts]: Start accepts. Automaton has 510030 states and 687333 transitions. Word has length 102 [2019-09-10 08:07:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:46,921 INFO L475 AbstractCegarLoop]: Abstraction has 510030 states and 687333 transitions. [2019-09-10 08:07:46,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 510030 states and 687333 transitions. [2019-09-10 08:07:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:07:46,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:46,934 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] [2019-09-10 08:07:46,934 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:46,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:46,934 INFO L82 PathProgramCache]: Analyzing trace with hash 831999611, now seen corresponding path program 1 times [2019-09-10 08:07:46,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:46,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:46,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:46,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:46,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:46,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:46,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:46,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:46,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:46,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:46,997 INFO L87 Difference]: Start difference. First operand 510030 states and 687333 transitions. Second operand 3 states. [2019-09-10 08:07:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:53,704 INFO L93 Difference]: Finished difference Result 314071 states and 415580 transitions. [2019-09-10 08:07:53,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:53,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 08:07:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:54,133 INFO L225 Difference]: With dead ends: 314071 [2019-09-10 08:07:54,133 INFO L226 Difference]: Without dead ends: 314071 [2019-09-10 08:07:54,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:54,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314071 states. [2019-09-10 08:07:56,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314071 to 314069. [2019-09-10 08:07:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314069 states. [2019-09-10 08:07:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314069 states to 314069 states and 415579 transitions. [2019-09-10 08:07:57,456 INFO L78 Accepts]: Start accepts. Automaton has 314069 states and 415579 transitions. Word has length 102 [2019-09-10 08:07:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:57,456 INFO L475 AbstractCegarLoop]: Abstraction has 314069 states and 415579 transitions. [2019-09-10 08:07:57,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 314069 states and 415579 transitions. [2019-09-10 08:07:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:07:57,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:57,465 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:07:57,465 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:57,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:57,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1244761147, now seen corresponding path program 1 times [2019-09-10 08:07:57,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:57,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:57,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:57,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:57,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:58,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:58,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:07:58,437 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2019-09-10 08:07:58,437 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [109], [111], [113], [116], [119], [124], [126], [129], [132], [135], [137], [139], [142], [145], [150], [152], [155], [158], [161], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [210], [213], [216], [218], [226], [229], [235], [238], [241], [243], [260], [263], [266], [268], [276], [279], [285], [288], [291], [293], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 08:07:58,441 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:07:58,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:07:58,463 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:07:58,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:07:58,882 INFO L272 AbstractInterpreter]: Visited 95 different actions 779 times. Merged at 57 different actions 605 times. Widened at 16 different actions 85 times. Performed 2837 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2837 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 69 fixpoints after 18 different actions. Largest state had 134 variables. [2019-09-10 08:07:58,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:58,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:07:58,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:58,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:07:58,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:58,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:07:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:59,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 08:07:59,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:00,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:00,515 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:01,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:08:01,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 39 [2019-09-10 08:08:01,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:08:01,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 08:08:01,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 08:08:01,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:08:01,073 INFO L87 Difference]: Start difference. First operand 314069 states and 415579 transitions. Second operand 29 states. [2019-09-10 08:08:07,247 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2019-09-10 08:08:07,495 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-09-10 08:08:07,831 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 79 [2019-09-10 08:08:08,118 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-10 08:08:08,307 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 08:08:09,458 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 08:08:09,639 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-09-10 08:08:10,116 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-10 08:08:10,303 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 08:08:10,632 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-09-10 08:08:10,884 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 08:08:11,489 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-09-10 08:08:14,958 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 64 [2019-09-10 08:08:15,494 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-09-10 08:08:16,864 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:08:17,199 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-09-10 08:08:17,487 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-09-10 08:08:18,526 WARN L188 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-09-10 08:08:19,152 WARN L188 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-09-10 08:08:21,429 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-09-10 08:08:21,762 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-09-10 08:08:22,151 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 08:08:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:24,285 INFO L93 Difference]: Finished difference Result 709721 states and 934148 transitions. [2019-09-10 08:08:24,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-10 08:08:24,285 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 102 [2019-09-10 08:08:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:25,182 INFO L225 Difference]: With dead ends: 709721 [2019-09-10 08:08:25,183 INFO L226 Difference]: Without dead ends: 709721 [2019-09-10 08:08:25,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2120 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1554, Invalid=6818, Unknown=0, NotChecked=0, Total=8372 [2019-09-10 08:08:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709721 states. [2019-09-10 08:08:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709721 to 466193. [2019-09-10 08:08:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466193 states. [2019-09-10 08:08:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466193 states to 466193 states and 616573 transitions. [2019-09-10 08:08:41,805 INFO L78 Accepts]: Start accepts. Automaton has 466193 states and 616573 transitions. Word has length 102 [2019-09-10 08:08:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:41,806 INFO L475 AbstractCegarLoop]: Abstraction has 466193 states and 616573 transitions. [2019-09-10 08:08:41,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 08:08:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 466193 states and 616573 transitions. [2019-09-10 08:08:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:08:41,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:41,812 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:08:41,812 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:41,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:41,813 INFO L82 PathProgramCache]: Analyzing trace with hash -259424194, now seen corresponding path program 1 times [2019-09-10 08:08:41,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:41,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:41,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:41,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:41,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:43,578 WARN L188 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:08:43,865 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:08:44,426 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 08:08:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:45,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:45,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:08:45,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2019-09-10 08:08:45,467 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [109], [111], [113], [116], [119], [122], [124], [126], [129], [132], [135], [137], [139], [142], [145], [150], [152], [155], [158], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [201], [204], [210], [213], [216], [218], [226], [229], [235], [238], [241], [243], [260], [263], [266], [268], [285], [288], [291], [293], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 08:08:45,468 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:08:45,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:08:45,484 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:08:46,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:08:46,017 INFO L272 AbstractInterpreter]: Visited 95 different actions 993 times. Merged at 57 different actions 797 times. Widened at 18 different actions 122 times. Performed 3412 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3412 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 95 fixpoints after 18 different actions. Largest state had 134 variables. [2019-09-10 08:08:46,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:46,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:08:46,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:46,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:08:46,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:46,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:08:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:46,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:08:46,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:46,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:47,976 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:49,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:08:49,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11, 11] total 49 [2019-09-10 08:08:49,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:08:49,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 08:08:49,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 08:08:49,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2213, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 08:08:49,178 INFO L87 Difference]: Start difference. First operand 466193 states and 616573 transitions. Second operand 40 states. [2019-09-10 08:08:49,421 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 08:08:50,771 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-09-10 08:08:50,986 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 08:08:51,506 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:08:51,787 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:08:52,180 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:08:52,597 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 80 [2019-09-10 08:08:53,168 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-09-10 08:08:53,780 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 103 [2019-09-10 08:08:54,460 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 110 [2019-09-10 08:08:55,245 WARN L188 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 124 [2019-09-10 08:08:55,683 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-09-10 08:08:56,744 WARN L188 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 101 [2019-09-10 08:08:57,729 WARN L188 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 140 [2019-09-10 08:08:58,836 WARN L188 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 158 [2019-09-10 08:08:59,546 WARN L188 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 119 [2019-09-10 08:09:00,433 WARN L188 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 137 [2019-09-10 08:09:01,710 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 223 DAG size of output: 177 [2019-09-10 08:09:03,364 WARN L188 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 233 DAG size of output: 184 [2019-09-10 08:09:04,324 WARN L188 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 156 [2019-09-10 08:09:05,357 WARN L188 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 111 [2019-09-10 08:09:06,953 WARN L188 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 213 DAG size of output: 166 [2019-09-10 08:09:08,301 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 213 DAG size of output: 163 [2019-09-10 08:09:08,734 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2019-09-10 08:09:09,097 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-10 08:09:10,292 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2019-09-10 08:09:10,871 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 111 [2019-09-10 08:09:11,274 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-10 08:09:11,656 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 08:09:12,045 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:09:12,280 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:09:12,782 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 106 [2019-09-10 08:09:12,969 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 08:09:13,859 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 08:09:14,278 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-10 08:09:14,649 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:09:14,941 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 08:09:15,785 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 106 [2019-09-10 08:09:16,509 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-10 08:09:16,905 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 08:09:17,070 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 08:09:17,468 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 08:09:18,107 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 111 [2019-09-10 08:09:18,538 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 08:09:19,045 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2019-09-10 08:09:19,357 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:09:20,085 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-09-10 08:09:20,759 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-09-10 08:09:21,315 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 106 [2019-09-10 08:09:21,657 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 08:09:21,950 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-09-10 08:09:23,065 WARN L188 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2019-09-10 08:09:23,286 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 08:09:23,988 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 121 [2019-09-10 08:09:24,498 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 106 [2019-09-10 08:09:24,919 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-09-10 08:09:25,241 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 08:09:25,650 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-10 08:09:26,178 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2019-09-10 08:09:28,788 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2019-09-10 08:09:29,281 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-10 08:09:29,543 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-09-10 08:09:29,810 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-10 08:09:30,179 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2019-09-10 08:09:30,540 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-09-10 08:09:31,223 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 104 [2019-09-10 08:09:31,451 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 08:09:32,005 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-09-10 08:09:32,312 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-09-10 08:09:32,829 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2019-09-10 08:09:33,194 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 08:09:33,645 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:09:34,871 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 121 [2019-09-10 08:09:35,529 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 116 [2019-09-10 08:09:35,909 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2019-09-10 08:09:36,356 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:09:36,761 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-09-10 08:09:37,087 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-09-10 08:09:37,532 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:09:37,983 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-09-10 08:09:38,521 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2019-09-10 08:09:38,796 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 08:09:39,010 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 08:09:39,224 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 08:09:39,652 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 08:09:40,244 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2019-09-10 08:09:40,927 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 109 [2019-09-10 08:09:41,586 WARN L188 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 116 [2019-09-10 08:09:42,049 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-10 08:09:42,477 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-09-10 08:09:42,973 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2019-09-10 08:09:43,900 WARN L188 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 08:09:44,525 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-09-10 08:09:44,878 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-09-10 08:09:45,486 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-09-10 08:09:45,828 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-09-10 08:09:46,234 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-09-10 08:09:46,608 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 08:09:47,047 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 08:09:47,742 WARN L188 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 08:09:48,406 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 122 [2019-09-10 08:09:48,896 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 96 [2019-09-10 08:09:49,575 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 116 [2019-09-10 08:09:49,849 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:09:50,435 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2019-09-10 08:09:50,905 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-09-10 08:09:51,363 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-09-10 08:09:51,648 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:09:52,222 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-09-10 08:09:52,557 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-09-10 08:09:52,841 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 08:09:53,105 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 08:09:53,778 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2019-09-10 08:09:54,503 WARN L188 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 08:09:55,114 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-09-10 08:09:55,481 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-09-10 08:09:56,145 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 112 [2019-09-10 08:09:56,597 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:09:57,298 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 116 [2019-09-10 08:09:57,792 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 104 [2019-09-10 08:09:58,234 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-10 08:09:58,549 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 08:09:58,830 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 08:09:59,259 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2019-09-10 08:09:59,451 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 08:09:59,942 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-09-10 08:10:00,192 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:00,741 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 104 [2019-09-10 08:10:01,427 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 117 [2019-09-10 08:10:01,873 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:10:02,169 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-09-10 08:10:02,391 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 08:10:04,005 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 117 [2019-09-10 08:10:05,050 WARN L188 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:10:05,552 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 107 [2019-09-10 08:10:05,844 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-10 08:10:06,968 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 08:10:07,661 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 107 [2019-09-10 08:10:08,106 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-10 08:10:09,296 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 08:10:09,772 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-10 08:10:11,125 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 08:10:12,735 WARN L188 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-10 08:10:13,271 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:10:14,072 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-10 08:10:14,394 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 08:10:14,911 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-10 08:10:15,558 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 08:10:15,760 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 08:10:16,085 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-09-10 08:10:16,782 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 08:10:17,852 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2019-09-10 08:10:18,406 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-09-10 08:10:18,914 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 08:10:19,631 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2019-09-10 08:10:20,428 WARN L188 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 08:10:20,719 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 08:10:21,146 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 08:10:21,334 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 08:10:21,724 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-09-10 08:10:22,258 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 98 [2019-09-10 08:10:22,683 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 08:10:22,993 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-09-10 08:10:23,445 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 08:10:23,886 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 98 [2019-09-10 08:10:24,151 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 08:10:24,648 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-10 08:10:25,286 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2019-09-10 08:10:25,659 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 08:10:26,175 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2019-09-10 08:10:26,830 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2019-09-10 08:10:27,532 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 107 [2019-09-10 08:10:28,658 WARN L188 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-10 08:10:28,905 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:10:29,229 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-10 08:10:29,676 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 08:10:30,240 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 08:10:30,505 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:10:30,744 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 08:10:31,632 WARN L188 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 08:10:32,218 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 08:10:32,686 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-09-10 08:10:33,289 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 08:10:33,682 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-10 08:10:34,771 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 109 [2019-09-10 08:10:35,317 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-09-10 08:10:35,664 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-09-10 08:10:36,527 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 108 [2019-09-10 08:10:37,221 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 104 [2019-09-10 08:10:38,093 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 118 [2019-09-10 08:10:38,529 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2019-09-10 08:10:39,542 WARN L188 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 86 [2019-09-10 08:10:40,151 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 114 [2019-09-10 08:10:40,835 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 110 [2019-09-10 08:10:41,505 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 115 [2019-09-10 08:10:42,495 WARN L188 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 124 [2019-09-10 08:10:43,042 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 109 [2019-09-10 08:10:44,323 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 115 [2019-09-10 08:10:46,325 WARN L188 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 121 [2019-09-10 08:10:47,229 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-09-10 08:10:48,139 WARN L188 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 120 [2019-09-10 08:10:49,763 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 121 [2019-09-10 08:10:51,478 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 168 DAG size of output: 132 [2019-09-10 08:10:52,703 WARN L188 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 130 [2019-09-10 08:10:53,559 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 101 [2019-09-10 08:10:54,169 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-09-10 08:10:54,838 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 98 [2019-09-10 08:10:55,693 WARN L188 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 131 [2019-09-10 08:10:56,537 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 126 [2019-09-10 08:10:57,379 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 08:10:57,589 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 08:10:58,352 WARN L188 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 132 [2019-09-10 08:10:59,183 WARN L188 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 127 [2019-09-10 08:10:59,398 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:11:00,472 WARN L188 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 127 [2019-09-10 08:11:02,267 WARN L188 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 179 DAG size of output: 141 [2019-09-10 08:11:03,545 WARN L188 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 136 [2019-09-10 08:11:03,887 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 08:11:04,676 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 121 [2019-09-10 08:11:04,882 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 08:11:05,537 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 107 [2019-09-10 08:11:06,279 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 109 [2019-09-10 08:11:06,836 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 108 [2019-09-10 08:11:07,810 WARN L188 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 137 [2019-09-10 08:11:08,356 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 08:11:08,578 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 08:11:09,101 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 104 [2019-09-10 08:11:10,015 WARN L188 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 138 [2019-09-10 08:11:10,607 WARN L188 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:11:11,362 WARN L188 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 132 [2019-09-10 08:11:12,416 WARN L188 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 138 [2019-09-10 08:11:13,170 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 118 [2019-09-10 08:11:15,162 WARN L188 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 147 [2019-09-10 08:11:15,621 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 08:11:16,418 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 127 [2019-09-10 08:11:17,232 WARN L188 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 131 [2019-09-10 08:11:17,789 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 114 [2019-09-10 08:11:18,389 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 08:11:18,904 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 08:11:19,222 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 08:11:19,958 WARN L188 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 132 [2019-09-10 08:11:20,459 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 110 [2019-09-10 08:11:21,679 WARN L188 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 141 [2019-09-10 08:11:22,469 WARN L188 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 124 [2019-09-10 08:11:22,832 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-09-10 08:11:23,814 WARN L188 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 138 [2019-09-10 08:11:24,637 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 103 [2019-09-10 08:11:25,604 WARN L188 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 137 [2019-09-10 08:11:26,369 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 08:11:26,690 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:11:27,206 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:11:27,534 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:11:28,336 WARN L188 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 138 [2019-09-10 08:11:29,155 WARN L188 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 119 [2019-09-10 08:11:29,487 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 08:11:30,297 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 113 [2019-09-10 08:11:31,607 WARN L188 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 147 [2019-09-10 08:11:32,238 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 78 [2019-09-10 08:11:32,616 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 08:11:33,000 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 08:11:33,537 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 93 [2019-09-10 08:11:34,361 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 118 [2019-09-10 08:11:35,196 WARN L188 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 131 [2019-09-10 08:11:35,886 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 109 [2019-09-10 08:11:36,763 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:11:37,216 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 08:11:38,583 WARN L188 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 142 [2019-09-10 08:11:39,960 WARN L188 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 128 [2019-09-10 08:11:40,962 WARN L188 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 141 [2019-09-10 08:11:41,820 WARN L188 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-09-10 08:11:42,172 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:11:42,540 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-09-10 08:11:43,232 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 86 [2019-09-10 08:11:43,559 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-10 08:11:44,302 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 107 [2019-09-10 08:11:45,012 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 116 [2019-09-10 08:11:46,112 WARN L188 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 141 [2019-09-10 08:11:46,998 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 124 [2019-09-10 08:11:47,802 WARN L188 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 137 [2019-09-10 08:11:48,260 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 08:11:48,601 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2019-09-10 08:11:49,579 WARN L188 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 125 [2019-09-10 08:11:49,918 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-10 08:11:51,327 WARN L188 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 151 [2019-09-10 08:11:52,607 WARN L188 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 134 [2019-09-10 08:11:53,752 WARN L188 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 147 [2019-09-10 08:11:54,444 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-10 08:11:54,694 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:11:55,094 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:11:55,460 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-09-10 08:11:55,687 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-10 08:11:56,620 WARN L188 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 130 [2019-09-10 08:11:57,861 WARN L188 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 147 [2019-09-10 08:11:58,231 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 08:11:59,575 WARN L188 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 148 [2019-09-10 08:11:59,774 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-09-10 08:12:01,616 WARN L188 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 157 [2019-09-10 08:12:01,974 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-09-10 08:12:04,330 WARN L188 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 147 [2019-09-10 08:12:05,040 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 117 [2019-09-10 08:12:06,076 WARN L188 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 147 [2019-09-10 08:12:07,171 WARN L188 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 157 [2019-09-10 08:12:08,619 WARN L188 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 165 [2019-09-10 08:12:09,670 WARN L188 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 153 [2019-09-10 08:12:10,467 WARN L188 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 135 [2019-09-10 08:12:11,195 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 123 [2019-09-10 08:12:12,369 WARN L188 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 146 [2019-09-10 08:12:13,398 WARN L188 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 165 [2019-09-10 08:12:14,745 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 221 DAG size of output: 175 [2019-09-10 08:12:15,592 WARN L188 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 147 [2019-09-10 08:12:16,609 WARN L188 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 153 [2019-09-10 08:12:17,917 WARN L188 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 163 [2019-09-10 08:12:19,249 WARN L188 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 171 [2019-09-10 08:12:20,033 WARN L188 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 125 [2019-09-10 08:12:20,885 WARN L188 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 141 [2019-09-10 08:12:22,109 WARN L188 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 164 [2019-09-10 08:12:23,263 WARN L188 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 165 [2019-09-10 08:12:24,429 WARN L188 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 171 [2019-09-10 08:12:25,931 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 227 DAG size of output: 181 [2019-09-10 08:12:26,949 WARN L188 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 153 [2019-09-10 08:12:28,136 WARN L188 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 143 [2019-09-10 08:12:29,391 WARN L188 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 171 [2019-09-10 08:12:31,013 WARN L188 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 184 [2019-09-10 08:12:31,891 WARN L188 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 154 [2019-09-10 08:12:33,112 WARN L188 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 184 [2019-09-10 08:12:34,689 WARN L188 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 242 DAG size of output: 194 [2019-09-10 08:12:35,207 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-10 08:12:36,934 WARN L188 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 240 DAG size of output: 191 [2019-09-10 08:12:38,267 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 203 DAG size of output: 161 [2019-09-10 08:12:38,635 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 08:12:40,416 WARN L188 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 233 DAG size of output: 191 [2019-09-10 08:12:42,560 WARN L188 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 252 DAG size of output: 201