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/pals_lcr.4.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:27:12,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:27:12,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:27:12,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:27:12,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:27:12,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:27:12,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:27:12,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:27:12,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:27:12,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:27:12,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:27:12,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:27:12,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:27:12,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:27:12,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:27:12,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:27:12,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:27:12,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:27:12,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:27:12,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:27:12,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:27:12,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:27:12,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:27:12,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:27:12,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:27:12,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:27:12,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:27:12,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:27:12,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:27:12,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:27:12,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:27:12,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:27:12,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:27:12,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:27:12,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:27:12,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:27:12,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:27:12,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:27:12,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:27:12,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:27:12,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:27:12,813 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 04:27:12,834 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:27:12,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:27:12,834 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:27:12,835 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:27:12,835 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:27:12,835 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:27:12,836 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:27:12,836 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:27:12,836 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:27:12,836 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:27:12,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:27:12,837 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:27:12,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:27:12,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:27:12,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:27:12,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:27:12,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:27:12,839 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:27:12,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:27:12,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:27:12,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:27:12,839 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:27:12,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:27:12,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:27:12,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:27:12,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:27:12,840 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:27:12,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:27:12,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:27:12,841 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:27:12,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:27:12,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:27:12,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:27:12,911 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:27:12,911 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:27:12,912 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:27:12,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3f07d9de/9642a76692804a9dbbff95d9f9264f2d/FLAGda91d2c25 [2019-09-10 04:27:13,501 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:27:13,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:27:13,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3f07d9de/9642a76692804a9dbbff95d9f9264f2d/FLAGda91d2c25 [2019-09-10 04:27:13,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3f07d9de/9642a76692804a9dbbff95d9f9264f2d [2019-09-10 04:27:13,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:27:13,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:27:13,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:27:13,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:27:13,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:27:13,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:27:13" (1/1) ... [2019-09-10 04:27:13,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff21a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:13, skipping insertion in model container [2019-09-10 04:27:13,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:27:13" (1/1) ... [2019-09-10 04:27:13,823 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:27:13,866 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:27:14,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:27:14,201 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:27:14,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:27:14,269 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:27:14,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:14 WrapperNode [2019-09-10 04:27:14,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:27:14,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:27:14,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:27:14,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:27:14,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:14" (1/1) ... [2019-09-10 04:27:14,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:14" (1/1) ... [2019-09-10 04:27:14,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:14" (1/1) ... [2019-09-10 04:27:14,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:14" (1/1) ... [2019-09-10 04:27:14,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:14" (1/1) ... [2019-09-10 04:27:14,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:14" (1/1) ... [2019-09-10 04:27:14,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:14" (1/1) ... [2019-09-10 04:27:14,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:27:14,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:27:14,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:27:14,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:27:14,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:14" (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 04:27:14,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:27:14,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:27:14,383 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:27:14,384 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:27:14,384 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:27:14,384 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:27:14,384 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:27:14,384 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:27:14,384 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:27:14,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:27:14,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:27:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:27:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:27:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:27:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:27:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:27:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:27:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:27:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:27:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:27:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:27:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:27:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:27:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:27:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:27:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:27:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:27:15,067 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:27:15,068 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:27:15,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:27:15 BoogieIcfgContainer [2019-09-10 04:27:15,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:27:15,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:27:15,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:27:15,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:27:15,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:27:13" (1/3) ... [2019-09-10 04:27:15,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@945e7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:27:15, skipping insertion in model container [2019-09-10 04:27:15,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:14" (2/3) ... [2019-09-10 04:27:15,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@945e7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:27:15, skipping insertion in model container [2019-09-10 04:27:15,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:27:15" (3/3) ... [2019-09-10 04:27:15,077 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:27:15,087 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:27:15,095 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:27:15,112 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:27:15,139 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:27:15,140 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:27:15,140 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:27:15,140 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:27:15,141 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:27:15,141 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:27:15,141 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:27:15,141 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:27:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-09-10 04:27:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 04:27:15,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:15,171 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:15,173 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:15,178 INFO L82 PathProgramCache]: Analyzing trace with hash -40511920, now seen corresponding path program 1 times [2019-09-10 04:27:15,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:15,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:15,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:15,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:15,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:15,516 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 04:27:15,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:15,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:27:15,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:15,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:27:15,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:27:15,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:27:15,543 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 5 states. [2019-09-10 04:27:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:15,644 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions. [2019-09-10 04:27:15,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:27:15,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-10 04:27:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:15,662 INFO L225 Difference]: With dead ends: 105 [2019-09-10 04:27:15,663 INFO L226 Difference]: Without dead ends: 101 [2019-09-10 04:27:15,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 04:27:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-10 04:27:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-09-10 04:27:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-10 04:27:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2019-09-10 04:27:15,719 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 54 [2019-09-10 04:27:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:15,720 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2019-09-10 04:27:15,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:27:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2019-09-10 04:27:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 04:27:15,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:15,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:15,724 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:15,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1067510165, now seen corresponding path program 1 times [2019-09-10 04:27:15,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:15,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:15,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:15,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:15,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:16,154 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 04:27:16,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:16,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:27:16,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:16,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:27:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:27:16,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:27:16,160 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand 11 states. [2019-09-10 04:27:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:18,952 INFO L93 Difference]: Finished difference Result 694 states and 993 transitions. [2019-09-10 04:27:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 04:27:18,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2019-09-10 04:27:18,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:18,966 INFO L225 Difference]: With dead ends: 694 [2019-09-10 04:27:18,966 INFO L226 Difference]: Without dead ends: 694 [2019-09-10 04:27:18,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 04:27:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-10 04:27:19,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 499. [2019-09-10 04:27:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-10 04:27:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 700 transitions. [2019-09-10 04:27:19,059 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 700 transitions. Word has length 76 [2019-09-10 04:27:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:19,060 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 700 transitions. [2019-09-10 04:27:19,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:27:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 700 transitions. [2019-09-10 04:27:19,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:27:19,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:19,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:19,065 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:19,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:19,065 INFO L82 PathProgramCache]: Analyzing trace with hash -933077243, now seen corresponding path program 1 times [2019-09-10 04:27:19,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:19,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:19,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:19,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:19,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:27:19,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:19,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:27:19,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:19,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:27:19,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:27:19,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:27:19,183 INFO L87 Difference]: Start difference. First operand 499 states and 700 transitions. Second operand 3 states. [2019-09-10 04:27:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:19,218 INFO L93 Difference]: Finished difference Result 919 states and 1290 transitions. [2019-09-10 04:27:19,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:27:19,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 04:27:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:19,225 INFO L225 Difference]: With dead ends: 919 [2019-09-10 04:27:19,226 INFO L226 Difference]: Without dead ends: 919 [2019-09-10 04:27:19,226 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 04:27:19,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-10 04:27:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 903. [2019-09-10 04:27:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-09-10 04:27:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1268 transitions. [2019-09-10 04:27:19,307 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1268 transitions. Word has length 78 [2019-09-10 04:27:19,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:19,308 INFO L475 AbstractCegarLoop]: Abstraction has 903 states and 1268 transitions. [2019-09-10 04:27:19,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:27:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1268 transitions. [2019-09-10 04:27:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:27:19,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:19,315 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:19,316 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2074187597, now seen corresponding path program 1 times [2019-09-10 04:27:19,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:19,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:19,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:19,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:19,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:19,435 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 04:27:19,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:19,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:27:19,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:19,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:27:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:27:19,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:27:19,437 INFO L87 Difference]: Start difference. First operand 903 states and 1268 transitions. Second operand 5 states. [2019-09-10 04:27:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:19,826 INFO L93 Difference]: Finished difference Result 1675 states and 2341 transitions. [2019-09-10 04:27:19,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:27:19,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 04:27:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:19,839 INFO L225 Difference]: With dead ends: 1675 [2019-09-10 04:27:19,839 INFO L226 Difference]: Without dead ends: 1675 [2019-09-10 04:27:19,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:27:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2019-09-10 04:27:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1673. [2019-09-10 04:27:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1673 states. [2019-09-10 04:27:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2340 transitions. [2019-09-10 04:27:19,902 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2340 transitions. Word has length 78 [2019-09-10 04:27:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:19,903 INFO L475 AbstractCegarLoop]: Abstraction has 1673 states and 2340 transitions. [2019-09-10 04:27:19,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:27:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2340 transitions. [2019-09-10 04:27:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:27:19,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:19,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:19,906 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash -973270845, now seen corresponding path program 1 times [2019-09-10 04:27:19,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:19,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:19,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:19,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:19,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:20,042 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 04:27:20,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:20,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:27:20,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:20,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:27:20,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:27:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:27:20,045 INFO L87 Difference]: Start difference. First operand 1673 states and 2340 transitions. Second operand 5 states. [2019-09-10 04:27:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:20,570 INFO L93 Difference]: Finished difference Result 3131 states and 4337 transitions. [2019-09-10 04:27:20,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:27:20,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 04:27:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:20,595 INFO L225 Difference]: With dead ends: 3131 [2019-09-10 04:27:20,596 INFO L226 Difference]: Without dead ends: 3131 [2019-09-10 04:27:20,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:27:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2019-09-10 04:27:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3129. [2019-09-10 04:27:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-09-10 04:27:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4336 transitions. [2019-09-10 04:27:20,740 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4336 transitions. Word has length 78 [2019-09-10 04:27:20,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:20,741 INFO L475 AbstractCegarLoop]: Abstraction has 3129 states and 4336 transitions. [2019-09-10 04:27:20,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:27:20,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4336 transitions. [2019-09-10 04:27:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:27:20,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:20,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:20,743 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:20,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:20,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1683468301, now seen corresponding path program 1 times [2019-09-10 04:27:20,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:20,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:20,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:20,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:20,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:20,930 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 04:27:20,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:20,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:27:20,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:20,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:27:20,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:27:20,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:27:20,934 INFO L87 Difference]: Start difference. First operand 3129 states and 4336 transitions. Second operand 5 states. [2019-09-10 04:27:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:21,357 INFO L93 Difference]: Finished difference Result 5839 states and 8005 transitions. [2019-09-10 04:27:21,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:27:21,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 04:27:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:21,392 INFO L225 Difference]: With dead ends: 5839 [2019-09-10 04:27:21,392 INFO L226 Difference]: Without dead ends: 5839 [2019-09-10 04:27:21,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:27:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5839 states. [2019-09-10 04:27:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5839 to 5837. [2019-09-10 04:27:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-09-10 04:27:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 8004 transitions. [2019-09-10 04:27:21,626 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 8004 transitions. Word has length 78 [2019-09-10 04:27:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:21,626 INFO L475 AbstractCegarLoop]: Abstraction has 5837 states and 8004 transitions. [2019-09-10 04:27:21,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:27:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 8004 transitions. [2019-09-10 04:27:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:27:21,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:21,628 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:21,628 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1415753725, now seen corresponding path program 1 times [2019-09-10 04:27:21,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:21,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:21,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:21,858 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 04:27:21,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:21,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:27:21,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:21,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:27:21,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:27:21,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:27:21,862 INFO L87 Difference]: Start difference. First operand 5837 states and 8004 transitions. Second operand 11 states. [2019-09-10 04:27:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:24,480 INFO L93 Difference]: Finished difference Result 8201 states and 11778 transitions. [2019-09-10 04:27:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 04:27:24,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2019-09-10 04:27:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:24,529 INFO L225 Difference]: With dead ends: 8201 [2019-09-10 04:27:24,530 INFO L226 Difference]: Without dead ends: 8201 [2019-09-10 04:27:24,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 04:27:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8201 states. [2019-09-10 04:27:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8201 to 5861. [2019-09-10 04:27:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5861 states. [2019-09-10 04:27:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5861 states to 5861 states and 7988 transitions. [2019-09-10 04:27:24,786 INFO L78 Accepts]: Start accepts. Automaton has 5861 states and 7988 transitions. Word has length 78 [2019-09-10 04:27:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:24,788 INFO L475 AbstractCegarLoop]: Abstraction has 5861 states and 7988 transitions. [2019-09-10 04:27:24,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:27:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 5861 states and 7988 transitions. [2019-09-10 04:27:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 04:27:24,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:24,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:24,790 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:24,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:24,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1035416937, now seen corresponding path program 1 times [2019-09-10 04:27:24,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:24,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:24,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:24,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:24,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:24,908 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 04:27:24,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:24,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:27:24,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:24,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:27:24,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:27:24,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:27:24,911 INFO L87 Difference]: Start difference. First operand 5861 states and 7988 transitions. Second operand 5 states. [2019-09-10 04:27:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:25,390 INFO L93 Difference]: Finished difference Result 8585 states and 11550 transitions. [2019-09-10 04:27:25,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:27:25,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 04:27:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:25,444 INFO L225 Difference]: With dead ends: 8585 [2019-09-10 04:27:25,444 INFO L226 Difference]: Without dead ends: 8585 [2019-09-10 04:27:25,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:27:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8585 states. [2019-09-10 04:27:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8585 to 8365. [2019-09-10 04:27:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8365 states. [2019-09-10 04:27:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8365 states to 8365 states and 11276 transitions. [2019-09-10 04:27:25,698 INFO L78 Accepts]: Start accepts. Automaton has 8365 states and 11276 transitions. Word has length 79 [2019-09-10 04:27:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:25,698 INFO L475 AbstractCegarLoop]: Abstraction has 8365 states and 11276 transitions. [2019-09-10 04:27:25,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:27:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 8365 states and 11276 transitions. [2019-09-10 04:27:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 04:27:25,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:25,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:25,700 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash 612008024, now seen corresponding path program 1 times [2019-09-10 04:27:25,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:25,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:25,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:25,815 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 04:27:25,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:25,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:27:25,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:25,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:27:25,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:27:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:27:25,817 INFO L87 Difference]: Start difference. First operand 8365 states and 11276 transitions. Second operand 8 states. [2019-09-10 04:27:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:25,928 INFO L93 Difference]: Finished difference Result 10237 states and 14435 transitions. [2019-09-10 04:27:25,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:27:25,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-09-10 04:27:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:25,987 INFO L225 Difference]: With dead ends: 10237 [2019-09-10 04:27:25,987 INFO L226 Difference]: Without dead ends: 10237 [2019-09-10 04:27:25,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:27:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10237 states. [2019-09-10 04:27:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10237 to 9229. [2019-09-10 04:27:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9229 states. [2019-09-10 04:27:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9229 states to 9229 states and 12164 transitions. [2019-09-10 04:27:26,268 INFO L78 Accepts]: Start accepts. Automaton has 9229 states and 12164 transitions. Word has length 79 [2019-09-10 04:27:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:26,268 INFO L475 AbstractCegarLoop]: Abstraction has 9229 states and 12164 transitions. [2019-09-10 04:27:26,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:27:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9229 states and 12164 transitions. [2019-09-10 04:27:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 04:27:26,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:26,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:26,270 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:26,270 INFO L82 PathProgramCache]: Analyzing trace with hash 902213724, now seen corresponding path program 1 times [2019-09-10 04:27:26,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:26,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:26,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:26,381 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 04:27:26,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:26,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:27:26,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:26,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:27:26,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:27:26,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:27:26,385 INFO L87 Difference]: Start difference. First operand 9229 states and 12164 transitions. Second operand 9 states. [2019-09-10 04:27:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:27,083 INFO L93 Difference]: Finished difference Result 10901 states and 14490 transitions. [2019-09-10 04:27:27,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:27:27,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 04:27:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:27,122 INFO L225 Difference]: With dead ends: 10901 [2019-09-10 04:27:27,122 INFO L226 Difference]: Without dead ends: 10901 [2019-09-10 04:27:27,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:27:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10901 states. [2019-09-10 04:27:27,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10901 to 9261. [2019-09-10 04:27:27,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9261 states. [2019-09-10 04:27:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9261 states to 9261 states and 12204 transitions. [2019-09-10 04:27:27,370 INFO L78 Accepts]: Start accepts. Automaton has 9261 states and 12204 transitions. Word has length 80 [2019-09-10 04:27:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:27,371 INFO L475 AbstractCegarLoop]: Abstraction has 9261 states and 12204 transitions. [2019-09-10 04:27:27,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:27:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 9261 states and 12204 transitions. [2019-09-10 04:27:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 04:27:27,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:27,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:27,372 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:27,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:27,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1065134300, now seen corresponding path program 1 times [2019-09-10 04:27:27,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:27,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:27,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:27,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:27,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:27,505 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 04:27:27,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:27,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:27:27,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:27,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:27:27,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:27:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:27:27,506 INFO L87 Difference]: Start difference. First operand 9261 states and 12204 transitions. Second operand 5 states. [2019-09-10 04:27:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:27,951 INFO L93 Difference]: Finished difference Result 13135 states and 17035 transitions. [2019-09-10 04:27:27,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:27:27,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 04:27:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:28,000 INFO L225 Difference]: With dead ends: 13135 [2019-09-10 04:27:28,001 INFO L226 Difference]: Without dead ends: 13135 [2019-09-10 04:27:28,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:27:28,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13135 states. [2019-09-10 04:27:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13135 to 13130. [2019-09-10 04:27:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13130 states. [2019-09-10 04:27:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13130 states to 13130 states and 17029 transitions. [2019-09-10 04:27:28,377 INFO L78 Accepts]: Start accepts. Automaton has 13130 states and 17029 transitions. Word has length 81 [2019-09-10 04:27:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:28,378 INFO L475 AbstractCegarLoop]: Abstraction has 13130 states and 17029 transitions. [2019-09-10 04:27:28,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:27:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 13130 states and 17029 transitions. [2019-09-10 04:27:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 04:27:28,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:28,386 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:27:28,387 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash 400882303, now seen corresponding path program 1 times [2019-09-10 04:27:28,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:28,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:28,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:28,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:27:28,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:27:28,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:27:28,522 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2019-09-10 04:27:28,525 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [228], [231], [235], [237], [238], [241], [244], [249], [252], [259], [261], [264], [268], [270], [271], [274], [290], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:27:28,603 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:27:28,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:27:28,707 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:27:29,518 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:27:29,529 INFO L272 AbstractInterpreter]: Visited 93 different actions 519 times. Merged at 15 different actions 105 times. Widened at 1 different actions 1 times. Performed 5046 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5046 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 5 different actions. Largest state had 93 variables. [2019-09-10 04:27:29,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:29,533 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:27:30,037 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 91.96% of their original sizes. [2019-09-10 04:27:30,038 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:27:36,904 INFO L420 sIntCurrentIteration]: We unified 122 AI predicates to 122 [2019-09-10 04:27:36,904 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:27:36,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:27:36,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [68] imperfect sequences [5] total 71 [2019-09-10 04:27:36,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:36,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 04:27:36,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 04:27:36,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=4117, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 04:27:36,909 INFO L87 Difference]: Start difference. First operand 13130 states and 17029 transitions. Second operand 68 states. [2019-09-10 04:28:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:28:18,530 INFO L93 Difference]: Finished difference Result 10860 states and 14961 transitions. [2019-09-10 04:28:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-10 04:28:18,530 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 123 [2019-09-10 04:28:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:28:18,571 INFO L225 Difference]: With dead ends: 10860 [2019-09-10 04:28:18,571 INFO L226 Difference]: Without dead ends: 10860 [2019-09-10 04:28:18,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3973 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=780, Invalid=9932, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 04:28:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2019-09-10 04:28:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 9618. [2019-09-10 04:28:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9618 states. [2019-09-10 04:28:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9618 states to 9618 states and 12355 transitions. [2019-09-10 04:28:19,010 INFO L78 Accepts]: Start accepts. Automaton has 9618 states and 12355 transitions. Word has length 123 [2019-09-10 04:28:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:28:19,011 INFO L475 AbstractCegarLoop]: Abstraction has 9618 states and 12355 transitions. [2019-09-10 04:28:19,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 04:28:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 9618 states and 12355 transitions. [2019-09-10 04:28:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:28:19,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:28:19,017 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:28:19,017 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:28:19,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:19,018 INFO L82 PathProgramCache]: Analyzing trace with hash 735244934, now seen corresponding path program 1 times [2019-09-10 04:28:19,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:28:19,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:19,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:28:19,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:19,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:28:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:28:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:28:19,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:28:19,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:28:19,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:28:19,383 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [224], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [290], [292], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:28:19,392 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:28:19,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:28:19,406 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:28:19,876 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:28:19,876 INFO L272 AbstractInterpreter]: Visited 98 different actions 692 times. Merged at 17 different actions 146 times. Widened at 1 different actions 1 times. Performed 6668 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6668 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:28:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:19,877 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:28:20,096 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 88.82% of their original sizes. [2019-09-10 04:28:20,097 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:28:27,582 INFO L420 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2019-09-10 04:28:27,582 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:28:27,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:28:27,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [71] imperfect sequences [14] total 83 [2019-09-10 04:28:27,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:28:27,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 04:28:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 04:28:27,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=4442, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 04:28:27,586 INFO L87 Difference]: Start difference. First operand 9618 states and 12355 transitions. Second operand 71 states. [2019-09-10 04:29:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:29:59,911 INFO L93 Difference]: Finished difference Result 17443 states and 23656 transitions. [2019-09-10 04:29:59,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2019-09-10 04:29:59,911 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 125 [2019-09-10 04:29:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:29:59,966 INFO L225 Difference]: With dead ends: 17443 [2019-09-10 04:29:59,966 INFO L226 Difference]: Without dead ends: 17443 [2019-09-10 04:29:59,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14902 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=2662, Invalid=37138, Unknown=0, NotChecked=0, Total=39800 [2019-09-10 04:29:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17443 states. [2019-09-10 04:30:00,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17443 to 15152. [2019-09-10 04:30:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15152 states. [2019-09-10 04:30:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15152 states to 15152 states and 19456 transitions. [2019-09-10 04:30:00,319 INFO L78 Accepts]: Start accepts. Automaton has 15152 states and 19456 transitions. Word has length 125 [2019-09-10 04:30:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:30:00,320 INFO L475 AbstractCegarLoop]: Abstraction has 15152 states and 19456 transitions. [2019-09-10 04:30:00,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 04:30:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 15152 states and 19456 transitions. [2019-09-10 04:30:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:30:00,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:30:00,327 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:30:00,327 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:30:00,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:30:00,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1971017990, now seen corresponding path program 1 times [2019-09-10 04:30:00,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:30:00,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:30:00,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:30:00,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:30:00,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:30:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:30:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 04:30:00,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:30:00,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:30:00,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:30:00,561 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [224], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:30:00,567 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:30:00,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:30:00,576 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:30:01,091 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:30:01,091 INFO L272 AbstractInterpreter]: Visited 98 different actions 658 times. Merged at 17 different actions 145 times. Widened at 1 different actions 1 times. Performed 6063 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6063 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:30:01,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:30:01,092 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:30:01,233 INFO L227 lantSequenceWeakener]: Weakened 98 states. On average, predicates are now at 78.08% of their original sizes. [2019-09-10 04:30:01,233 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:30:03,748 INFO L420 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2019-09-10 04:30:03,748 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:30:03,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:30:03,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [13] total 71 [2019-09-10 04:30:03,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:30:03,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 04:30:03,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 04:30:03,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=3215, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 04:30:03,752 INFO L87 Difference]: Start difference. First operand 15152 states and 19456 transitions. Second operand 60 states. [2019-09-10 04:31:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:31:39,480 INFO L93 Difference]: Finished difference Result 23159 states and 31400 transitions. [2019-09-10 04:31:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2019-09-10 04:31:39,481 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 125 [2019-09-10 04:31:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:31:39,552 INFO L225 Difference]: With dead ends: 23159 [2019-09-10 04:31:39,552 INFO L226 Difference]: Without dead ends: 23159 [2019-09-10 04:31:39,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25218 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=6254, Invalid=62652, Unknown=0, NotChecked=0, Total=68906 [2019-09-10 04:31:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23159 states. [2019-09-10 04:31:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23159 to 20721. [2019-09-10 04:31:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20721 states. [2019-09-10 04:31:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20721 states to 20721 states and 26640 transitions. [2019-09-10 04:31:40,058 INFO L78 Accepts]: Start accepts. Automaton has 20721 states and 26640 transitions. Word has length 125 [2019-09-10 04:31:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:31:40,059 INFO L475 AbstractCegarLoop]: Abstraction has 20721 states and 26640 transitions. [2019-09-10 04:31:40,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 04:31:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 20721 states and 26640 transitions. [2019-09-10 04:31:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:31:40,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:31:40,066 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:31:40,066 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:31:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash 741491750, now seen corresponding path program 1 times [2019-09-10 04:31:40,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:31:40,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:40,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:31:40,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:40,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:31:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:31:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:31:40,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:31:40,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:31:40,404 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:31:40,405 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [216], [219], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [290], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:31:40,411 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:31:40,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:31:40,430 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:31:41,155 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:31:41,156 INFO L272 AbstractInterpreter]: Visited 98 different actions 841 times. Merged at 17 different actions 191 times. Widened at 1 different actions 1 times. Performed 7715 root evaluator evaluations with a maximum evaluation depth of 5. Performed 7715 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 49 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:31:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:41,156 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:31:41,347 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 84.64% of their original sizes. [2019-09-10 04:31:41,347 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:31:48,152 INFO L420 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2019-09-10 04:31:48,152 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:31:48,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:31:48,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [73] imperfect sequences [14] total 85 [2019-09-10 04:31:48,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:31:48,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-10 04:31:48,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-10 04:31:48,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=4592, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 04:31:48,155 INFO L87 Difference]: Start difference. First operand 20721 states and 26640 transitions. Second operand 73 states. [2019-09-10 04:33:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:33:05,964 INFO L93 Difference]: Finished difference Result 31331 states and 41985 transitions. [2019-09-10 04:33:05,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-09-10 04:33:05,964 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 125 [2019-09-10 04:33:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:33:06,054 INFO L225 Difference]: With dead ends: 31331 [2019-09-10 04:33:06,054 INFO L226 Difference]: Without dead ends: 31331 [2019-09-10 04:33:06,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12468 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=3183, Invalid=31973, Unknown=0, NotChecked=0, Total=35156 [2019-09-10 04:33:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31331 states. [2019-09-10 04:33:06,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31331 to 28293. [2019-09-10 04:33:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28293 states. [2019-09-10 04:33:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28293 states to 28293 states and 36334 transitions. [2019-09-10 04:33:06,757 INFO L78 Accepts]: Start accepts. Automaton has 28293 states and 36334 transitions. Word has length 125 [2019-09-10 04:33:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:33:06,758 INFO L475 AbstractCegarLoop]: Abstraction has 28293 states and 36334 transitions. [2019-09-10 04:33:06,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-10 04:33:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 28293 states and 36334 transitions. [2019-09-10 04:33:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:33:06,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:33:06,767 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:33:06,768 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:33:06,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:33:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash -721975086, now seen corresponding path program 1 times [2019-09-10 04:33:06,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:33:06,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:06,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:33:06,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:06,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:33:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:33:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:33:07,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:33:07,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:33:07,127 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 04:33:07,128 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [172], [174], [177], [181], [183], [188], [196], [197], [198], [201], [206], [208], [224], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [290], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:33:07,130 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:33:07,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:33:07,141 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:33:07,617 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:33:07,617 INFO L272 AbstractInterpreter]: Visited 99 different actions 904 times. Merged at 20 different actions 231 times. Widened at 1 different actions 1 times. Performed 7816 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7816 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 70 fixpoints after 9 different actions. Largest state had 93 variables. [2019-09-10 04:33:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:33:07,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:33:07,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:33:07,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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:33:07,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:33:07,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:33:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:33:07,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 04:33:07,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:33:08,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:33:08,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:33:09,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:33:09,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:33:09,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 41 [2019-09-10 04:33:09,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:33:09,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 04:33:09,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 04:33:09,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 04:33:09,253 INFO L87 Difference]: Start difference. First operand 28293 states and 36334 transitions. Second operand 31 states. [2019-09-10 04:33:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:33:14,392 INFO L93 Difference]: Finished difference Result 45147 states and 57903 transitions. [2019-09-10 04:33:14,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 04:33:14,392 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 126 [2019-09-10 04:33:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:33:14,506 INFO L225 Difference]: With dead ends: 45147 [2019-09-10 04:33:14,506 INFO L226 Difference]: Without dead ends: 45096 [2019-09-10 04:33:14,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1475, Invalid=6007, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 04:33:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45096 states. [2019-09-10 04:33:15,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45096 to 42722. [2019-09-10 04:33:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42722 states. [2019-09-10 04:33:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42722 states to 42722 states and 54846 transitions. [2019-09-10 04:33:15,508 INFO L78 Accepts]: Start accepts. Automaton has 42722 states and 54846 transitions. Word has length 126 [2019-09-10 04:33:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:33:15,509 INFO L475 AbstractCegarLoop]: Abstraction has 42722 states and 54846 transitions. [2019-09-10 04:33:15,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 04:33:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 42722 states and 54846 transitions. [2019-09-10 04:33:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:33:15,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:33:15,523 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:33:15,523 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:33:15,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:33:15,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1550432093, now seen corresponding path program 1 times [2019-09-10 04:33:15,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:33:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:15,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:33:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:15,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:33:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:33:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 04:33:15,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:33:15,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:33:15,919 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:33:15,919 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [172], [174], [177], [181], [183], [188], [196], [197], [198], [201], [206], [208], [211], [214], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [290], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:33:15,921 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:33:15,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:33:15,931 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:33:16,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:33:16,799 INFO L272 AbstractInterpreter]: Visited 100 different actions 1359 times. Merged at 20 different actions 348 times. Widened at 1 different actions 3 times. Performed 11973 root evaluator evaluations with a maximum evaluation depth of 6. Performed 11973 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 103 fixpoints after 9 different actions. Largest state had 93 variables. [2019-09-10 04:33:16,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:33:16,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:33:16,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:33:16,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:33:16,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:33:16,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:33:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:33:16,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 04:33:16,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:33:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 04:33:17,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:33:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:33:17,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:33:17,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 7] total 28 [2019-09-10 04:33:17,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:33:17,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 04:33:17,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 04:33:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2019-09-10 04:33:17,405 INFO L87 Difference]: Start difference. First operand 42722 states and 54846 transitions. Second operand 23 states. [2019-09-10 04:33:24,089 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-10 04:33:34,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:33:34,296 INFO L93 Difference]: Finished difference Result 144640 states and 189107 transitions. [2019-09-10 04:33:34,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2019-09-10 04:33:34,296 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2019-09-10 04:33:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:33:34,582 INFO L225 Difference]: With dead ends: 144640 [2019-09-10 04:33:34,582 INFO L226 Difference]: Without dead ends: 144619 [2019-09-10 04:33:34,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15994 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=5395, Invalid=35611, Unknown=0, NotChecked=0, Total=41006 [2019-09-10 04:33:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144619 states. [2019-09-10 04:33:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144619 to 133653. [2019-09-10 04:33:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133653 states. [2019-09-10 04:33:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133653 states to 133653 states and 175417 transitions. [2019-09-10 04:33:38,847 INFO L78 Accepts]: Start accepts. Automaton has 133653 states and 175417 transitions. Word has length 127 [2019-09-10 04:33:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:33:38,847 INFO L475 AbstractCegarLoop]: Abstraction has 133653 states and 175417 transitions. [2019-09-10 04:33:38,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 04:33:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 133653 states and 175417 transitions. [2019-09-10 04:33:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:33:38,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:33:38,856 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:33:38,856 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:33:38,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:33:38,857 INFO L82 PathProgramCache]: Analyzing trace with hash 75160112, now seen corresponding path program 1 times [2019-09-10 04:33:38,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:33:38,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:38,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:33:38,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:38,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:33:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:33:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:33:39,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:33:39,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:33:39,229 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:33:39,230 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [216], [219], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:33:39,232 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:33:39,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:33:39,243 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:33:39,600 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:33:39,601 INFO L272 AbstractInterpreter]: Visited 101 different actions 742 times. Merged at 20 different actions 165 times. Widened at 1 different actions 1 times. Performed 7108 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7108 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 41 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:33:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:33:39,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:33:39,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:33:39,602 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 04:33:39,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:33:39,617 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 04:33:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:33:39,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 04:33:39,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:33:42,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:42,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:42,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:42,635 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-09-10 04:33:42,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:43,258 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2019-09-10 04:33:43,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:43,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 04:33:43,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 04:33:43,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 04:33:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:33:44,300 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:33:45,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:45,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:45,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:45,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:45,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:45,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:45,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:45,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:45,511 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-09-10 04:33:46,088 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 04:33:46,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:46,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:46,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:46,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:46,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:46,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:46,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:46,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:46,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:46,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:46,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:33:46,096 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-09-10 04:33:46,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 04:33:46,664 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2019-09-10 04:33:47,086 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2019-09-10 04:33:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 04:33:48,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:33:48,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 21] total 55 [2019-09-10 04:33:48,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:33:48,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 04:33:48,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 04:33:48,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2710, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 04:33:48,749 INFO L87 Difference]: Start difference. First operand 133653 states and 175417 transitions. Second operand 38 states. [2019-09-10 04:33:49,148 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-09-10 04:33:49,624 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 63 [2019-09-10 04:33:51,501 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 04:33:52,336 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 04:33:52,593 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 46 [2019-09-10 04:33:52,814 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-10 04:33:53,254 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 47 [2019-09-10 04:33:53,503 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 45 [2019-09-10 04:33:53,880 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-09-10 04:33:54,188 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2019-09-10 04:33:55,058 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-09-10 04:33:55,479 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-09-10 04:33:55,840 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 04:33:56,158 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-09-10 04:33:56,675 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 71 [2019-09-10 04:33:57,126 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-09-10 04:33:57,573 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2019-09-10 04:33:57,844 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-09-10 04:33:58,293 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 04:33:58,719 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2019-09-10 04:33:59,153 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 55 [2019-09-10 04:33:59,422 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 04:33:59,713 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 04:34:00,168 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 04:34:00,584 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2019-09-10 04:34:01,208 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 64 [2019-09-10 04:34:01,465 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 04:34:01,984 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 62 [2019-09-10 04:34:02,360 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 04:34:02,647 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2019-09-10 04:34:02,997 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 04:34:03,283 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-09-10 04:34:03,553 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 43 [2019-09-10 04:34:04,283 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-10 04:34:04,768 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-09-10 04:34:05,897 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-09-10 04:34:06,472 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-09-10 04:34:06,732 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-09-10 04:34:07,581 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-09-10 04:34:07,878 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2019-09-10 04:34:08,185 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-09-10 04:34:08,561 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-09-10 04:34:08,721 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 04:34:09,019 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 04:34:09,651 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-09-10 04:34:10,276 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 46 [2019-09-10 04:34:10,451 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 04:34:10,702 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 47 [2019-09-10 04:34:11,564 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 60 [2019-09-10 04:34:11,857 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-10 04:34:13,094 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2019-09-10 04:34:13,317 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 04:34:13,498 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 04:34:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:15,756 INFO L93 Difference]: Finished difference Result 398665 states and 523745 transitions. [2019-09-10 04:34:15,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-10 04:34:15,757 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 127 [2019-09-10 04:34:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:16,583 INFO L225 Difference]: With dead ends: 398665 [2019-09-10 04:34:16,583 INFO L226 Difference]: Without dead ends: 398422 [2019-09-10 04:34:16,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 238 SyntacticMatches, 27 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5025 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=3380, Invalid=15252, Unknown=0, NotChecked=0, Total=18632 [2019-09-10 04:34:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398422 states. [2019-09-10 04:34:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398422 to 362983. [2019-09-10 04:34:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362983 states. [2019-09-10 04:34:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362983 states to 362983 states and 477597 transitions. [2019-09-10 04:34:28,418 INFO L78 Accepts]: Start accepts. Automaton has 362983 states and 477597 transitions. Word has length 127 [2019-09-10 04:34:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:28,418 INFO L475 AbstractCegarLoop]: Abstraction has 362983 states and 477597 transitions. [2019-09-10 04:34:28,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 04:34:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 362983 states and 477597 transitions. [2019-09-10 04:34:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:34:28,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:28,428 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:34:28,428 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1990771706, now seen corresponding path program 1 times [2019-09-10 04:34:28,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:28,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:28,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:28,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:28,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:34:28,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:34:28,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:34:28,520 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:34:28,520 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [216], [219], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:34:28,522 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:34:28,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:34:28,531 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:34:28,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:34:28,719 INFO L272 AbstractInterpreter]: Visited 98 different actions 410 times. Merged at 18 different actions 73 times. Never widened. Performed 3784 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3784 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 15 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:34:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:28,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:34:28,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:34:28,719 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 04:34:28,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:28,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:34:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:28,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:34:28,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:34:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:34:28,960 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:34:29,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:34:29,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:34:29,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:34:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:34:29,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:34:29,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:34:29,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:34:29,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:34:29,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:34:29,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:34:29,132 INFO L87 Difference]: Start difference. First operand 362983 states and 477597 transitions. Second operand 13 states. [2019-09-10 04:34:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:38,180 INFO L93 Difference]: Finished difference Result 370422 states and 500914 transitions. [2019-09-10 04:34:38,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:34:38,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 127 [2019-09-10 04:34:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:38,994 INFO L225 Difference]: With dead ends: 370422 [2019-09-10 04:34:38,994 INFO L226 Difference]: Without dead ends: 370410 [2019-09-10 04:34:38,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:34:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370410 states. [2019-09-10 04:34:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370410 to 346837. [2019-09-10 04:34:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346837 states. [2019-09-10 04:34:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346837 states to 346837 states and 451700 transitions. [2019-09-10 04:34:46,111 INFO L78 Accepts]: Start accepts. Automaton has 346837 states and 451700 transitions. Word has length 127 [2019-09-10 04:34:46,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:46,111 INFO L475 AbstractCegarLoop]: Abstraction has 346837 states and 451700 transitions. [2019-09-10 04:34:46,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:34:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 346837 states and 451700 transitions. [2019-09-10 04:34:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:34:46,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:46,118 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:34:46,118 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:46,119 INFO L82 PathProgramCache]: Analyzing trace with hash -266035406, now seen corresponding path program 1 times [2019-09-10 04:34:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:46,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:46,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:34:46,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:34:46,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:34:46,186 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:34:46,187 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [216], [219], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:34:46,189 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:34:46,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:34:46,198 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:34:46,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:34:46,374 INFO L272 AbstractInterpreter]: Visited 98 different actions 410 times. Merged at 18 different actions 73 times. Never widened. Performed 3887 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3887 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 15 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:34:46,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:46,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:34:46,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:34:46,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:34:46,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:46,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:34:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:46,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:34:46,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:34:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:34:46,579 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:34:46,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:34:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:34:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:34:46,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:34:46,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:34:46,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:34:46,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:34:46,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:34:46,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:34:46,739 INFO L87 Difference]: Start difference. First operand 346837 states and 451700 transitions. Second operand 13 states. [2019-09-10 04:34:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:49,360 INFO L93 Difference]: Finished difference Result 173932 states and 232399 transitions. [2019-09-10 04:34:49,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:34:49,361 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 127 [2019-09-10 04:34:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:49,698 INFO L225 Difference]: With dead ends: 173932 [2019-09-10 04:34:49,698 INFO L226 Difference]: Without dead ends: 173932 [2019-09-10 04:34:49,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:34:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173932 states. [2019-09-10 04:34:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173932 to 168454. [2019-09-10 04:34:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168454 states. [2019-09-10 04:34:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168454 states to 168454 states and 217072 transitions. [2019-09-10 04:34:54,849 INFO L78 Accepts]: Start accepts. Automaton has 168454 states and 217072 transitions. Word has length 127 [2019-09-10 04:34:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:54,849 INFO L475 AbstractCegarLoop]: Abstraction has 168454 states and 217072 transitions. [2019-09-10 04:34:54,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:34:54,849 INFO L276 IsEmpty]: Start isEmpty. Operand 168454 states and 217072 transitions. [2019-09-10 04:34:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 04:34:54,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:54,855 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:34:54,855 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:54,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:54,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1102619169, now seen corresponding path program 1 times [2019-09-10 04:34:54,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:54,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:54,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:54,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:54,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 04:34:55,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:34:55,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:34:55,243 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 04:34:55,243 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [214], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:34:55,244 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:34:55,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:34:55,253 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:34:55,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:34:55,525 INFO L272 AbstractInterpreter]: Visited 102 different actions 533 times. Merged at 20 different actions 107 times. Never widened. Performed 4859 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4859 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 26 fixpoints after 7 different actions. Largest state had 93 variables. [2019-09-10 04:34:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:55,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:34:55,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:34:55,526 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 04:34:55,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:55,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:34:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:55,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 04:34:55,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:34:55,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:34:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:34:56,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:34:56,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:34:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:34:56,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:34:56,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 15] total 44 [2019-09-10 04:34:56,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:34:56,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 04:34:56,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 04:34:56,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1713, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 04:34:56,903 INFO L87 Difference]: Start difference. First operand 168454 states and 217072 transitions. Second operand 34 states. [2019-09-10 04:35:00,651 WARN L188 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-09-10 04:35:01,391 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-10 04:35:06,669 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-10 04:35:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:07,805 INFO L93 Difference]: Finished difference Result 458460 states and 593311 transitions. [2019-09-10 04:35:07,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 04:35:07,805 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 128 [2019-09-10 04:35:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:09,542 INFO L225 Difference]: With dead ends: 458460 [2019-09-10 04:35:09,542 INFO L226 Difference]: Without dead ends: 458175 [2019-09-10 04:35:09,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2311, Invalid=9899, Unknown=0, NotChecked=0, Total=12210 [2019-09-10 04:35:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458175 states. [2019-09-10 04:35:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458175 to 432929. [2019-09-10 04:35:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432929 states. [2019-09-10 04:35:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432929 states to 432929 states and 563280 transitions. [2019-09-10 04:35:30,237 INFO L78 Accepts]: Start accepts. Automaton has 432929 states and 563280 transitions. Word has length 128 [2019-09-10 04:35:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:30,238 INFO L475 AbstractCegarLoop]: Abstraction has 432929 states and 563280 transitions. [2019-09-10 04:35:30,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 04:35:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 432929 states and 563280 transitions. [2019-09-10 04:35:30,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 04:35:30,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:30,241 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:35:30,242 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:30,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:30,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1598063445, now seen corresponding path program 1 times [2019-09-10 04:35:30,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:30,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:30,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:30,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:30,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:35:30,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:35:30,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:35:30,340 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 04:35:30,340 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [214], [226], [228], [231], [235], [237], [238], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:35:30,342 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:35:30,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:35:30,351 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:35:30,588 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:35:30,588 INFO L272 AbstractInterpreter]: Visited 99 different actions 417 times. Merged at 18 different actions 78 times. Never widened. Performed 4066 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4066 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 17 fixpoints after 5 different actions. Largest state had 93 variables. [2019-09-10 04:35:30,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:30,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:35:30,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:35:30,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:35:30,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:30,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:35:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:30,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:35:30,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:35:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:35:30,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:35:30,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:30,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:30,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:35:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:35:31,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:35:31,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:35:31,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:35:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:35:31,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:35:31,003 INFO L87 Difference]: Start difference. First operand 432929 states and 563280 transitions. Second operand 13 states. [2019-09-10 04:35:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:32,820 INFO L93 Difference]: Finished difference Result 232484 states and 326502 transitions. [2019-09-10 04:35:32,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:35:32,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 128 [2019-09-10 04:35:32,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:34,419 INFO L225 Difference]: With dead ends: 232484 [2019-09-10 04:35:34,419 INFO L226 Difference]: Without dead ends: 232484 [2019-09-10 04:35:34,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:35:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232484 states. [2019-09-10 04:35:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232484 to 219798. [2019-09-10 04:35:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219798 states. [2019-09-10 04:35:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219798 states to 219798 states and 284629 transitions. [2019-09-10 04:35:43,089 INFO L78 Accepts]: Start accepts. Automaton has 219798 states and 284629 transitions. Word has length 128 [2019-09-10 04:35:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:43,090 INFO L475 AbstractCegarLoop]: Abstraction has 219798 states and 284629 transitions. [2019-09-10 04:35:43,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:35:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 219798 states and 284629 transitions. [2019-09-10 04:35:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 04:35:43,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:43,094 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:35:43,095 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:43,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:43,095 INFO L82 PathProgramCache]: Analyzing trace with hash 777724142, now seen corresponding path program 1 times [2019-09-10 04:35:43,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:43,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:43,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:43,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:43,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:35:44,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:35:44,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:35:44,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 04:35:44,579 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [214], [226], [228], [231], [235], [237], [238], [241], [244], [249], [252], [259], [261], [264], [268], [270], [271], [274], [277], [280], [292], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:35:44,584 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:35:44,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:35:44,592 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:35:45,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:35:45,516 INFO L272 AbstractInterpreter]: Visited 103 different actions 577 times. Merged at 20 different actions 115 times. Never widened. Performed 5712 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5712 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 28 fixpoints after 5 different actions. Largest state had 93 variables. [2019-09-10 04:35:45,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:45,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:35:45,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:35:45,517 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 04:35:45,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:45,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:35:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:45,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-10 04:35:45,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:35:47,989 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 04:35:48,736 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 04:35:48,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:49,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:49,960 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 04:35:50,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:50,576 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 04:35:50,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:50,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:50,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:50,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:50,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:50,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:51,536 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 04:35:52,270 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-09-10 04:35:52,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:52,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:35:52,951 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:35:53,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-10 04:35:54,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-10 04:35:54,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:55,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:55,878 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 04:35:56,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:56,620 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 04:35:56,975 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 04:35:57,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:57,516 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:35:57,898 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 04:35:58,218 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:35:58,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:58,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:35:58,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:00,114 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 04:36:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:36:00,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:36:00,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 42, 41] total 115 [2019-09-10 04:36:00,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:36:00,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 04:36:00,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 04:36:00,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1007, Invalid=12103, Unknown=0, NotChecked=0, Total=13110 [2019-09-10 04:36:00,234 INFO L87 Difference]: Start difference. First operand 219798 states and 284629 transitions. Second operand 78 states. [2019-09-10 04:36:02,620 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 04:36:03,244 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 04:36:03,491 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-09-10 04:36:04,031 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-09-10 04:36:04,310 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 57 [2019-09-10 04:36:04,569 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2019-09-10 04:36:04,926 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 59 [2019-09-10 04:36:05,569 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 60 [2019-09-10 04:36:05,849 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2019-09-10 04:36:06,224 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 62 [2019-09-10 04:36:06,561 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 63 [2019-09-10 04:36:06,925 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-09-10 04:36:07,206 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 04:36:07,545 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-10 04:36:08,720 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2019-09-10 04:36:09,068 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 04:36:09,509 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 04:36:09,964 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 04:36:10,515 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 04:36:10,862 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-09-10 04:36:11,054 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 04:36:11,435 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-09-10 04:36:11,651 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:36:12,046 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 04:36:12,367 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 04:36:12,894 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 04:36:13,410 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 04:36:14,760 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-10 04:36:15,100 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-09-10 04:36:15,789 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-10 04:36:15,986 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-09-10 04:36:16,174 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 04:36:16,737 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 04:36:17,010 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 04:36:17,643 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 04:36:18,027 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-10 04:36:18,657 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 04:36:18,929 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 04:36:19,216 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 04:36:20,812 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 04:36:21,349 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 04:36:23,258 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:36:24,114 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 04:36:24,852 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 04:36:25,522 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 04:36:25,971 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-09-10 04:36:26,476 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-10 04:36:28,358 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:36:32,049 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:36:32,863 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-09-10 04:36:33,668 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-09-10 04:36:34,110 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-09-10 04:36:36,414 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 04:36:36,690 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:36:37,790 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 84 [2019-09-10 04:36:38,129 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2019-09-10 04:36:38,850 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-09-10 04:36:39,035 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 04:36:39,728 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 71 [2019-09-10 04:36:39,981 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 04:36:40,518 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2019-09-10 04:36:40,827 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 04:36:41,478 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 100 [2019-09-10 04:36:41,802 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 04:36:42,220 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-09-10 04:36:42,479 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 04:36:43,005 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2019-09-10 04:36:43,263 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 04:36:44,674 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 102 [2019-09-10 04:36:45,007 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 04:36:45,332 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-10 04:36:45,571 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:36:47,001 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 89 [2019-09-10 04:36:47,420 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-09-10 04:36:47,734 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-09-10 04:36:48,017 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 04:36:48,437 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 59 [2019-09-10 04:36:48,885 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 92 [2019-09-10 04:36:49,123 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-09-10 04:36:49,382 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-10 04:36:49,570 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 04:36:50,204 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 59 [2019-09-10 04:36:50,596 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 79 [2019-09-10 04:36:50,932 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2019-09-10 04:36:51,179 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 49 [2019-09-10 04:36:51,385 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 43 [2019-09-10 04:36:51,841 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-09-10 04:36:52,411 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 04:36:52,850 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-09-10 04:36:53,307 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-10 04:36:53,518 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 04:36:53,767 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 04:36:55,713 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 04:36:56,476 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 71 [2019-09-10 04:36:56,707 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:36:57,132 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-09-10 04:36:57,466 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-09-10 04:36:57,733 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 04:36:58,388 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 63 [2019-09-10 04:36:58,725 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 70 [2019-09-10 04:36:58,917 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 04:36:59,085 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 04:36:59,394 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-09-10 04:36:59,966 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2019-09-10 04:37:00,859 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 81 [2019-09-10 04:37:01,279 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-09-10 04:37:01,624 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-09-10 04:37:02,033 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-09-10 04:37:03,675 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-09-10 04:37:03,898 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:37:05,459 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 71 [2019-09-10 04:37:05,761 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-09-10 04:37:06,012 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-09-10 04:37:06,283 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-09-10 04:37:06,451 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 04:37:06,989 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 04:37:07,269 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:37:08,604 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 77 [2019-09-10 04:37:08,986 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-09-10 04:37:09,287 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 68 [2019-09-10 04:37:09,581 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2019-09-10 04:37:11,463 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2019-09-10 04:37:12,401 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 84 [2019-09-10 04:37:12,760 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2019-09-10 04:37:13,735 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-09-10 04:37:13,991 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 04:37:15,049 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-10 04:37:17,055 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 04:37:17,330 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:37:18,913 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-09-10 04:37:19,140 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 04:37:20,405 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 04:37:20,752 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-09-10 04:37:21,297 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-09-10 04:37:21,734 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:37:22,536 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2019-09-10 04:37:23,412 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2019-09-10 04:37:24,085 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-09-10 04:37:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:37:28,395 INFO L93 Difference]: Finished difference Result 270334 states and 348803 transitions. [2019-09-10 04:37:28,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 278 states. [2019-09-10 04:37:28,396 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 129 [2019-09-10 04:37:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:37:28,900 INFO L225 Difference]: With dead ends: 270334 [2019-09-10 04:37:28,900 INFO L226 Difference]: Without dead ends: 269965 [2019-09-10 04:37:28,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 265 SyntacticMatches, 8 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50069 ImplicationChecksByTransitivity, 68.3s TimeCoverageRelationStatistics Valid=15964, Invalid=134192, Unknown=0, NotChecked=0, Total=150156 [2019-09-10 04:37:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269965 states. [2019-09-10 04:37:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269965 to 257109. [2019-09-10 04:37:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257109 states. [2019-09-10 04:37:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257109 states to 257109 states and 333317 transitions. [2019-09-10 04:37:38,343 INFO L78 Accepts]: Start accepts. Automaton has 257109 states and 333317 transitions. Word has length 129 [2019-09-10 04:37:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:37:38,343 INFO L475 AbstractCegarLoop]: Abstraction has 257109 states and 333317 transitions. [2019-09-10 04:37:38,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-10 04:37:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 257109 states and 333317 transitions. [2019-09-10 04:37:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 04:37:38,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:37:38,346 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:37:38,346 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:37:38,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1088790599, now seen corresponding path program 1 times [2019-09-10 04:37:38,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:37:38,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:38,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:38,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:38,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:37:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:37:39,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:39,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:37:39,773 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 04:37:39,773 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [214], [226], [228], [231], [235], [237], [238], [241], [244], [247], [259], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:37:39,774 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:37:39,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:37:39,780 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:37:39,979 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:37:39,979 INFO L272 AbstractInterpreter]: Visited 103 different actions 465 times. Merged at 20 different actions 88 times. Never widened. Performed 4413 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4413 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 22 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:37:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:39,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:37:39,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:39,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:37:39,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:39,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:37:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:40,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 04:37:40,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:37:40,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:37:41,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:37:41,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:42,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:42,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:37:42,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:37:42,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 18, 18] total 70 [2019-09-10 04:37:42,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:37:42,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 04:37:42,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 04:37:42,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=4580, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 04:37:42,872 INFO L87 Difference]: Start difference. First operand 257109 states and 333317 transitions. Second operand 54 states. [2019-09-10 04:37:43,985 WARN L188 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 04:37:44,202 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 04:37:45,561 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 04:37:45,857 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 04:37:46,460 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 04:37:47,500 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 04:37:48,004 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 04:37:48,309 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-09-10 04:37:48,552 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 04:37:48,831 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 04:37:49,158 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 04:37:49,496 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 80 [2019-09-10 04:37:49,970 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 04:37:50,498 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-09-10 04:37:51,098 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-09-10 04:37:51,522 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 99 [2019-09-10 04:37:54,534 WARN L188 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-09-10 04:37:55,028 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2019-09-10 04:37:55,571 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 111 [2019-09-10 04:37:56,788 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-09-10 04:37:57,448 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 04:37:57,708 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 04:37:58,044 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 04:37:58,811 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 04:37:59,100 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 04:37:59,476 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 04:37:59,895 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 04:38:00,230 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 04:38:00,442 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 04:38:00,636 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 04:38:00,942 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 04:38:01,196 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-10 04:38:01,485 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 04:38:01,800 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 04:38:02,511 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 04:38:02,906 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 04:38:03,263 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 04:38:04,176 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 04:38:05,330 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 04:38:06,208 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 04:38:07,401 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 04:38:07,910 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 04:38:08,380 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 04:38:09,848 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 04:38:10,583 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 04:38:11,632 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 04:38:12,597 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 04:38:13,252 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 04:38:14,020 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 04:38:14,616 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 04:38:16,088 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 04:38:17,043 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 04:38:18,968 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 04:38:21,019 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 04:38:23,597 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 04:38:25,769 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 04:38:26,790 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 04:38:26,993 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 04:38:27,682 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 04:38:27,849 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 04:38:28,135 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 04:38:28,448 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-10 04:38:28,655 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 04:38:29,424 WARN L188 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 04:38:29,878 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-09-10 04:38:30,094 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 04:38:31,153 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 04:38:31,598 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 04:38:32,476 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 04:38:33,332 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 04:38:33,535 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 04:38:34,650 WARN L188 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 04:38:35,399 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 04:38:35,570 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 04:38:35,872 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 04:38:36,409 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70 [2019-09-10 04:38:36,852 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 67 [2019-09-10 04:38:37,050 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 04:38:37,836 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-09-10 04:38:38,578 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 04:38:39,201 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-10 04:38:39,785 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-09-10 04:38:40,495 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 04:38:40,709 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 04:38:41,062 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 04:38:42,307 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 04:38:42,799 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 04:38:42,994 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 04:38:43,277 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 04:38:43,768 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 04:38:44,211 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 04:38:45,026 WARN L188 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 04:38:45,516 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 04:38:45,771 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 04:38:45,940 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 04:38:46,209 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 04:38:46,710 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-09-10 04:38:46,979 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 04:38:47,523 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2019-09-10 04:38:47,902 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 04:38:48,138 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 04:38:48,583 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-10 04:38:48,994 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 04:38:49,232 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-10 04:38:49,415 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 04:38:50,146 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 04:38:50,605 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-09-10 04:38:50,914 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 04:38:51,354 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 04:38:51,719 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 04:38:52,382 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-09-10 04:38:52,857 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-10 04:38:53,302 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-09-10 04:38:54,676 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-10 04:38:54,979 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 04:38:55,186 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 04:38:56,468 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 04:38:56,682 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 04:38:57,056 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-09-10 04:38:57,378 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 04:38:57,834 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2019-09-10 04:38:58,158 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 04:38:58,384 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 04:38:59,005 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2019-09-10 04:38:59,324 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 04:39:00,021 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 04:39:00,201 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 04:39:00,487 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 04:39:00,919 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 04:39:01,300 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2019-09-10 04:39:01,561 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-09-10 04:39:02,081 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 104 [2019-09-10 04:39:02,432 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-10 04:39:03,357 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 04:39:03,876 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-09-10 04:39:04,228 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-10 04:39:04,826 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-09-10 04:39:05,026 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 04:39:06,160 WARN L188 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 04:39:07,249 WARN L188 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 04:39:07,984 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 04:39:08,483 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 04:39:08,689 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 04:39:08,988 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 04:39:09,469 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 04:39:09,734 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 04:39:12,108 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 04:39:13,238 WARN L188 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 04:39:13,440 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 04:39:13,610 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 04:39:13,934 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 04:39:14,217 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 04:39:14,498 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 04:39:15,279 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-09-10 04:39:15,592 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-09-10 04:39:15,933 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 78 [2019-09-10 04:39:16,160 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 04:39:16,682 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 04:39:17,104 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 04:39:17,795 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 04:39:18,160 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-10 04:39:18,711 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 04:39:18,913 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 04:39:19,358 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 04:39:19,633 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 04:39:19,929 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 04:39:21,339 WARN L188 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 04:39:21,807 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 04:39:22,495 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 04:39:23,090 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-09-10 04:39:23,896 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84