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_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:32:46,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:32:46,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:32:46,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:32:46,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:32:46,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:32:46,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:32:46,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:32:46,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:32:46,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:32:46,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:32:46,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:32:46,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:32:46,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:32:46,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:32:46,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:32:46,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:32:46,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:32:46,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:32:46,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:32:46,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:32:46,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:32:46,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:32:46,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:32:46,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:32:46,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:32:46,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:32:46,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:32:46,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:32:46,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:32:46,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:32:46,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:32:46,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:32:46,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:32:46,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:32:46,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:32:46,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:32:46,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:32:46,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:32:46,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:32:46,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:32:46,766 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:32:46,781 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:32:46,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:32:46,782 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:32:46,782 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:32:46,783 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:32:46,783 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:32:46,783 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:32:46,783 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:32:46,783 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:32:46,784 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:32:46,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:32:46,785 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:32:46,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:32:46,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:32:46,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:32:46,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:32:46,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:32:46,786 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:32:46,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:32:46,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:32:46,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:32:46,787 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:32:46,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:32:46,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:32:46,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:32:46,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:32:46,788 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:32:46,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:32:46,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:32:46,788 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:32:46,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:32:46,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:32:46,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:32:46,834 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:32:46,835 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:32:46,835 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:32:46,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a1caf7a4/541cf9f6f878431fa92795b1b7d8bbe8/FLAGecea58095 [2019-09-10 04:32:47,340 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:32:47,341 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:32:47,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a1caf7a4/541cf9f6f878431fa92795b1b7d8bbe8/FLAGecea58095 [2019-09-10 04:32:47,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a1caf7a4/541cf9f6f878431fa92795b1b7d8bbe8 [2019-09-10 04:32:47,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:32:47,736 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:32:47,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:32:47,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:32:47,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:32:47,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:32:47" (1/1) ... [2019-09-10 04:32:47,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10dcc338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:32:47, skipping insertion in model container [2019-09-10 04:32:47,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:32:47" (1/1) ... [2019-09-10 04:32:47,753 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:32:47,799 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:32:48,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:32:48,240 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:32:48,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:32:48,368 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:32:48,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:32:48 WrapperNode [2019-09-10 04:32:48,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:32:48,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:32:48,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:32:48,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:32:48,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:32:48" (1/1) ... [2019-09-10 04:32:48,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:32:48" (1/1) ... [2019-09-10 04:32:48,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:32:48" (1/1) ... [2019-09-10 04:32:48,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:32:48" (1/1) ... [2019-09-10 04:32:48,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:32:48" (1/1) ... [2019-09-10 04:32:48,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:32:48" (1/1) ... [2019-09-10 04:32:48,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:32:48" (1/1) ... [2019-09-10 04:32:48,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:32:48,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:32:48,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:32:48,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:32:48,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:32:48" (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:32:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:32:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:32:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:32:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:32:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:32:48,539 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:32:48,539 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:32:48,539 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:32:48,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:32:48,540 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:32:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:32:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:32:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:32:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:32:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:32:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:32:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:32:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:32:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:32:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:32:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:32:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:32:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:32:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:32:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:32:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:32:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:32:49,118 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:32:49,118 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:32:49,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:32:49 BoogieIcfgContainer [2019-09-10 04:32:49,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:32:49,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:32:49,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:32:49,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:32:49,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:32:47" (1/3) ... [2019-09-10 04:32:49,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a7b1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:32:49, skipping insertion in model container [2019-09-10 04:32:49,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:32:48" (2/3) ... [2019-09-10 04:32:49,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a7b1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:32:49, skipping insertion in model container [2019-09-10 04:32:49,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:32:49" (3/3) ... [2019-09-10 04:32:49,129 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:32:49,140 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:32:49,149 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:32:49,165 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:32:49,202 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:32:49,202 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:32:49,203 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:32:49,203 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:32:49,203 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:32:49,203 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:32:49,204 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:32:49,204 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:32:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2019-09-10 04:32:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 04:32:49,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:49,250 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:32:49,252 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash 902089726, now seen corresponding path program 1 times [2019-09-10 04:32:49,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:49,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:49,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:49,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:49,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:49,650 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:32:49,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:32:49,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:32:49,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:49,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:32:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:32:49,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:32:49,676 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 5 states. [2019-09-10 04:32:49,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:49,778 INFO L93 Difference]: Finished difference Result 103 states and 150 transitions. [2019-09-10 04:32:49,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:32:49,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-10 04:32:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:49,793 INFO L225 Difference]: With dead ends: 103 [2019-09-10 04:32:49,794 INFO L226 Difference]: Without dead ends: 99 [2019-09-10 04:32:49,796 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:32:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-10 04:32:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-09-10 04:32:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-10 04:32:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2019-09-10 04:32:49,844 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 54 [2019-09-10 04:32:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:49,844 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2019-09-10 04:32:49,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:32:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2019-09-10 04:32:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 04:32:49,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:49,848 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:32:49,848 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:49,849 INFO L82 PathProgramCache]: Analyzing trace with hash -736751421, now seen corresponding path program 1 times [2019-09-10 04:32:49,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:49,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:49,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:49,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:49,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:50,308 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:32:50,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:32:50,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:32:50,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:50,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:32:50,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:32:50,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:32:50,313 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand 11 states. [2019-09-10 04:32:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:53,248 INFO L93 Difference]: Finished difference Result 676 states and 966 transitions. [2019-09-10 04:32:53,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 04:32:53,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2019-09-10 04:32:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:53,261 INFO L225 Difference]: With dead ends: 676 [2019-09-10 04:32:53,261 INFO L226 Difference]: Without dead ends: 676 [2019-09-10 04:32:53,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 04:32:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-09-10 04:32:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 485. [2019-09-10 04:32:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-10 04:32:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 679 transitions. [2019-09-10 04:32:53,356 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 679 transitions. Word has length 76 [2019-09-10 04:32:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:53,357 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 679 transitions. [2019-09-10 04:32:53,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:32:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 679 transitions. [2019-09-10 04:32:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:32:53,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:53,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:32:53,363 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:53,363 INFO L82 PathProgramCache]: Analyzing trace with hash -340438925, now seen corresponding path program 1 times [2019-09-10 04:32:53,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:53,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:53,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:53,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:53,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:53,454 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:32:53,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:32:53,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:32:53,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:53,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:32:53,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:32:53,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:32:53,459 INFO L87 Difference]: Start difference. First operand 485 states and 679 transitions. Second operand 3 states. [2019-09-10 04:32:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:53,490 INFO L93 Difference]: Finished difference Result 891 states and 1248 transitions. [2019-09-10 04:32:53,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:32:53,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 04:32:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:53,497 INFO L225 Difference]: With dead ends: 891 [2019-09-10 04:32:53,497 INFO L226 Difference]: Without dead ends: 891 [2019-09-10 04:32:53,498 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:32:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-09-10 04:32:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2019-09-10 04:32:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-09-10 04:32:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1247 transitions. [2019-09-10 04:32:53,547 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1247 transitions. Word has length 78 [2019-09-10 04:32:53,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:53,548 INFO L475 AbstractCegarLoop]: Abstraction has 889 states and 1247 transitions. [2019-09-10 04:32:53,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:32:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1247 transitions. [2019-09-10 04:32:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:32:53,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:53,554 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:32:53,554 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:53,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:53,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1628141381, now seen corresponding path program 1 times [2019-09-10 04:32:53,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:53,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:53,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:53,701 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:32:53,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:32:53,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:32:53,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:53,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:32:53,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:32:53,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:32:53,704 INFO L87 Difference]: Start difference. First operand 889 states and 1247 transitions. Second operand 5 states. [2019-09-10 04:32:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:54,135 INFO L93 Difference]: Finished difference Result 1377 states and 1907 transitions. [2019-09-10 04:32:54,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:32:54,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 04:32:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:54,144 INFO L225 Difference]: With dead ends: 1377 [2019-09-10 04:32:54,144 INFO L226 Difference]: Without dead ends: 1377 [2019-09-10 04:32:54,144 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:32:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2019-09-10 04:32:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1375. [2019-09-10 04:32:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2019-09-10 04:32:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1906 transitions. [2019-09-10 04:32:54,195 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1906 transitions. Word has length 78 [2019-09-10 04:32:54,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:54,196 INFO L475 AbstractCegarLoop]: Abstraction has 1375 states and 1906 transitions. [2019-09-10 04:32:54,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:32:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1906 transitions. [2019-09-10 04:32:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:32:54,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:54,200 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:32:54,200 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:54,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1480171141, now seen corresponding path program 1 times [2019-09-10 04:32:54,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:54,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:54,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:54,303 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:32:54,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:32:54,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:32:54,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:54,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:32:54,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:32:54,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:32:54,305 INFO L87 Difference]: Start difference. First operand 1375 states and 1906 transitions. Second operand 5 states. [2019-09-10 04:32:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:54,721 INFO L93 Difference]: Finished difference Result 2571 states and 3537 transitions. [2019-09-10 04:32:54,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:32:54,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 04:32:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:54,738 INFO L225 Difference]: With dead ends: 2571 [2019-09-10 04:32:54,739 INFO L226 Difference]: Without dead ends: 2571 [2019-09-10 04:32:54,739 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:32:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2019-09-10 04:32:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2569. [2019-09-10 04:32:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2019-09-10 04:32:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3536 transitions. [2019-09-10 04:32:54,874 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3536 transitions. Word has length 78 [2019-09-10 04:32:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:54,875 INFO L475 AbstractCegarLoop]: Abstraction has 2569 states and 3536 transitions. [2019-09-10 04:32:54,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:32:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3536 transitions. [2019-09-10 04:32:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:32:54,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:54,880 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:32:54,880 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:54,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1567287301, now seen corresponding path program 1 times [2019-09-10 04:32:54,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:54,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:54,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:54,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:55,070 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:32:55,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:32:55,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:32:55,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:55,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:32:55,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:32:55,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:32:55,077 INFO L87 Difference]: Start difference. First operand 2569 states and 3536 transitions. Second operand 5 states. [2019-09-10 04:32:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:55,510 INFO L93 Difference]: Finished difference Result 4815 states and 6563 transitions. [2019-09-10 04:32:55,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:32:55,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 04:32:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:55,539 INFO L225 Difference]: With dead ends: 4815 [2019-09-10 04:32:55,539 INFO L226 Difference]: Without dead ends: 4815 [2019-09-10 04:32:55,539 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:32:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2019-09-10 04:32:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 4813. [2019-09-10 04:32:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4813 states. [2019-09-10 04:32:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 6562 transitions. [2019-09-10 04:32:55,718 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 6562 transitions. Word has length 78 [2019-09-10 04:32:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:55,718 INFO L475 AbstractCegarLoop]: Abstraction has 4813 states and 6562 transitions. [2019-09-10 04:32:55,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:32:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 6562 transitions. [2019-09-10 04:32:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:32:55,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:55,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:32:55,720 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:55,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash -371542031, now seen corresponding path program 1 times [2019-09-10 04:32:55,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:55,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:55,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:55,998 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:32:55,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:32:55,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:32:55,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:56,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:32:56,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:32:56,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:32:56,001 INFO L87 Difference]: Start difference. First operand 4813 states and 6562 transitions. Second operand 11 states. [2019-09-10 04:32:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:58,592 INFO L93 Difference]: Finished difference Result 6825 states and 9706 transitions. [2019-09-10 04:32:58,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 04:32:58,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2019-09-10 04:32:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:58,634 INFO L225 Difference]: With dead ends: 6825 [2019-09-10 04:32:58,634 INFO L226 Difference]: Without dead ends: 6825 [2019-09-10 04:32:58,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 04:32:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6825 states. [2019-09-10 04:32:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6825 to 4831. [2019-09-10 04:32:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4831 states. [2019-09-10 04:32:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4831 states to 4831 states and 6542 transitions. [2019-09-10 04:32:58,830 INFO L78 Accepts]: Start accepts. Automaton has 4831 states and 6542 transitions. Word has length 78 [2019-09-10 04:32:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:58,831 INFO L475 AbstractCegarLoop]: Abstraction has 4831 states and 6542 transitions. [2019-09-10 04:32:58,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:32:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4831 states and 6542 transitions. [2019-09-10 04:32:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:32:58,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:58,833 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:32:58,833 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2107323483, now seen corresponding path program 1 times [2019-09-10 04:32:58,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:58,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:58,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:58,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:58,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:58,946 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:32:58,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:32:58,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:32:58,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:58,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:32:58,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:32:58,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:32:58,949 INFO L87 Difference]: Start difference. First operand 4831 states and 6542 transitions. Second operand 9 states. [2019-09-10 04:32:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:59,595 INFO L93 Difference]: Finished difference Result 6065 states and 8051 transitions. [2019-09-10 04:32:59,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:32:59,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 04:32:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:59,633 INFO L225 Difference]: With dead ends: 6065 [2019-09-10 04:32:59,633 INFO L226 Difference]: Without dead ends: 6065 [2019-09-10 04:32:59,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:32:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2019-09-10 04:32:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 4856. [2019-09-10 04:32:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4856 states. [2019-09-10 04:32:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4856 states to 4856 states and 6572 transitions. [2019-09-10 04:32:59,832 INFO L78 Accepts]: Start accepts. Automaton has 4856 states and 6572 transitions. Word has length 78 [2019-09-10 04:32:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:59,832 INFO L475 AbstractCegarLoop]: Abstraction has 4856 states and 6572 transitions. [2019-09-10 04:32:59,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:32:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4856 states and 6572 transitions. [2019-09-10 04:32:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 04:32:59,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:59,834 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:32:59,835 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:59,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:59,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1300973737, now seen corresponding path program 1 times [2019-09-10 04:32:59,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:59,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:59,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:59,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:59,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:59,940 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:32:59,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:32:59,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:32:59,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:59,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:32:59,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:32:59,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:32:59,942 INFO L87 Difference]: Start difference. First operand 4856 states and 6572 transitions. Second operand 5 states. [2019-09-10 04:33:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:33:00,449 INFO L93 Difference]: Finished difference Result 6113 states and 8275 transitions. [2019-09-10 04:33:00,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:33:00,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 04:33:00,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:33:00,496 INFO L225 Difference]: With dead ends: 6113 [2019-09-10 04:33:00,496 INFO L226 Difference]: Without dead ends: 6113 [2019-09-10 04:33:00,497 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:33:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6113 states. [2019-09-10 04:33:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6113 to 6106. [2019-09-10 04:33:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6106 states. [2019-09-10 04:33:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6106 states to 6106 states and 8270 transitions. [2019-09-10 04:33:00,648 INFO L78 Accepts]: Start accepts. Automaton has 6106 states and 8270 transitions. Word has length 79 [2019-09-10 04:33:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:33:00,649 INFO L475 AbstractCegarLoop]: Abstraction has 6106 states and 8270 transitions. [2019-09-10 04:33:00,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:33:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6106 states and 8270 transitions. [2019-09-10 04:33:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 04:33:00,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:33:00,650 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:33:00,651 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:33:00,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:33:00,651 INFO L82 PathProgramCache]: Analyzing trace with hash 346451224, now seen corresponding path program 1 times [2019-09-10 04:33:00,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:33:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:00,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:33:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:00,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:33:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:33:00,775 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:33:00,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:33:00,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:33:00,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:33:00,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:33:00,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:33:00,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:33:00,785 INFO L87 Difference]: Start difference. First operand 6106 states and 8270 transitions. Second operand 8 states. [2019-09-10 04:33:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:33:00,932 INFO L93 Difference]: Finished difference Result 7602 states and 10588 transitions. [2019-09-10 04:33:00,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:33:00,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-09-10 04:33:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:33:00,976 INFO L225 Difference]: With dead ends: 7602 [2019-09-10 04:33:00,977 INFO L226 Difference]: Without dead ends: 7602 [2019-09-10 04:33:00,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:33:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7602 states. [2019-09-10 04:33:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7602 to 6862. [2019-09-10 04:33:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6862 states. [2019-09-10 04:33:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 9034 transitions. [2019-09-10 04:33:01,239 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 9034 transitions. Word has length 79 [2019-09-10 04:33:01,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:33:01,239 INFO L475 AbstractCegarLoop]: Abstraction has 6862 states and 9034 transitions. [2019-09-10 04:33:01,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:33:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 9034 transitions. [2019-09-10 04:33:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 04:33:01,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:33:01,246 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:33:01,246 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:33:01,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:33:01,247 INFO L82 PathProgramCache]: Analyzing trace with hash -543777363, now seen corresponding path program 1 times [2019-09-10 04:33:01,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:33:01,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:01,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:33:01,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:01,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:33:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:33:01,405 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:33:01,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:33:01,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:33:01,407 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2019-09-10 04:33:01,410 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], [217], [219], [221], [224], [228], [230], [231], [234], [237], [242], [245], [252], [254], [257], [261], [263], [264], [267], [283], [285], [287], [290], [294], [296], [297], [298], [299], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:33:01,473 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:33:01,473 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:33:01,597 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:33:02,246 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:33:02,249 INFO L272 AbstractInterpreter]: Visited 93 different actions 566 times. Merged at 15 different actions 115 times. Widened at 1 different actions 1 times. Performed 5347 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5347 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:33:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:33:02,256 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:33:02,644 INFO L227 lantSequenceWeakener]: Weakened 96 states. On average, predicates are now at 78.11% of their original sizes. [2019-09-10 04:33:02,645 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:33:05,366 INFO L420 sIntCurrentIteration]: We unified 122 AI predicates to 122 [2019-09-10 04:33:05,366 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:33:05,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:33:05,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [5] total 63 [2019-09-10 04:33:05,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:33:05,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 04:33:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 04:33:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=3203, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 04:33:05,371 INFO L87 Difference]: Start difference. First operand 6862 states and 9034 transitions. Second operand 60 states. [2019-09-10 04:34:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:36,774 INFO L93 Difference]: Finished difference Result 11502 states and 15799 transitions. [2019-09-10 04:34:36,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2019-09-10 04:34:36,775 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 123 [2019-09-10 04:34:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:36,813 INFO L225 Difference]: With dead ends: 11502 [2019-09-10 04:34:36,814 INFO L226 Difference]: Without dead ends: 11502 [2019-09-10 04:34:36,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23342 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=4852, Invalid=58400, Unknown=0, NotChecked=0, Total=63252 [2019-09-10 04:34:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11502 states. [2019-09-10 04:34:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11502 to 10305. [2019-09-10 04:34:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10305 states. [2019-09-10 04:34:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10305 states to 10305 states and 13479 transitions. [2019-09-10 04:34:37,249 INFO L78 Accepts]: Start accepts. Automaton has 10305 states and 13479 transitions. Word has length 123 [2019-09-10 04:34:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:37,249 INFO L475 AbstractCegarLoop]: Abstraction has 10305 states and 13479 transitions. [2019-09-10 04:34:37,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 04:34:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 10305 states and 13479 transitions. [2019-09-10 04:34:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 04:34:37,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:37,261 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] [2019-09-10 04:34:37,261 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:37,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:37,263 INFO L82 PathProgramCache]: Analyzing trace with hash 341684559, now seen corresponding path program 1 times [2019-09-10 04:34:37,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:37,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:37,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:37,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:37,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:37,564 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:34:37,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:34:37,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:34:37,565 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2019-09-10 04:34:37,567 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], [217], [219], [221], [224], [228], [230], [231], [234], [250], [252], [254], [257], [261], [263], [264], [267], [283], [285], [287], [290], [294], [296], [297], [298], [299], [302], [305], [310], [313], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:34:37,582 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:34:37,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:34:37,610 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:34:38,374 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:34:38,374 INFO L272 AbstractInterpreter]: Visited 96 different actions 757 times. Merged at 17 different actions 168 times. Widened at 1 different actions 1 times. Performed 7141 root evaluator evaluations with a maximum evaluation depth of 5. Performed 7141 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 40 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:34:38,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:38,375 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:34:38,577 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 88.82% of their original sizes. [2019-09-10 04:34:38,577 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:34:45,331 INFO L420 sIntCurrentIteration]: We unified 122 AI predicates to 122 [2019-09-10 04:34:45,331 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:34:45,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:34:45,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [14] total 82 [2019-09-10 04:34:45,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:45,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 04:34:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 04:34:45,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=4310, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 04:34:45,334 INFO L87 Difference]: Start difference. First operand 10305 states and 13479 transitions. Second operand 70 states. [2019-09-10 04:36:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:11,501 INFO L93 Difference]: Finished difference Result 19566 states and 26477 transitions. [2019-09-10 04:36:11,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-09-10 04:36:11,502 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 123 [2019-09-10 04:36:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:11,564 INFO L225 Difference]: With dead ends: 19566 [2019-09-10 04:36:11,565 INFO L226 Difference]: Without dead ends: 19560 [2019-09-10 04:36:11,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15148 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=2649, Invalid=37953, Unknown=0, NotChecked=0, Total=40602 [2019-09-10 04:36:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19560 states. [2019-09-10 04:36:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19560 to 17291. [2019-09-10 04:36:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17291 states. [2019-09-10 04:36:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17291 states to 17291 states and 22629 transitions. [2019-09-10 04:36:12,627 INFO L78 Accepts]: Start accepts. Automaton has 17291 states and 22629 transitions. Word has length 123 [2019-09-10 04:36:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:12,628 INFO L475 AbstractCegarLoop]: Abstraction has 17291 states and 22629 transitions. [2019-09-10 04:36:12,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 04:36:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 17291 states and 22629 transitions. [2019-09-10 04:36:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 04:36:12,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:12,638 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:36:12,638 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:12,640 INFO L82 PathProgramCache]: Analyzing trace with hash -448966771, now seen corresponding path program 1 times [2019-09-10 04:36:12,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:12,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:12,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:12,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:12,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:12,745 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:36:12,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:12,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:36:12,746 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2019-09-10 04:36:12,748 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], [217], [219], [221], [224], [228], [230], [231], [234], [250], [252], [254], [257], [261], [263], [264], [267], [270], [275], [278], [285], [287], [290], [294], [296], [297], [298], [299], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:36:12,756 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:36:12,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:36:12,768 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:13,059 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:36:13,060 INFO L272 AbstractInterpreter]: Visited 93 different actions 512 times. Merged at 15 different actions 102 times. Widened at 1 different actions 1 times. Performed 4991 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4991 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:36:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:13,060 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:36:13,220 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 86.64% of their original sizes. [2019-09-10 04:36:13,221 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:36:19,974 INFO L420 sIntCurrentIteration]: We unified 122 AI predicates to 122 [2019-09-10 04:36:19,974 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:36:19,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:36:19,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [71] imperfect sequences [5] total 74 [2019-09-10 04:36:19,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:19,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 04:36:19,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 04:36:19,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=4416, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 04:36:19,977 INFO L87 Difference]: Start difference. First operand 17291 states and 22629 transitions. Second operand 71 states. [2019-09-10 04:37:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:37:36,773 INFO L93 Difference]: Finished difference Result 25781 states and 34892 transitions. [2019-09-10 04:37:36,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-09-10 04:37:36,773 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 123 [2019-09-10 04:37:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:37:36,859 INFO L225 Difference]: With dead ends: 25781 [2019-09-10 04:37:36,859 INFO L226 Difference]: Without dead ends: 25781 [2019-09-10 04:37:36,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13179 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=2529, Invalid=33003, Unknown=0, NotChecked=0, Total=35532 [2019-09-10 04:37:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25781 states. [2019-09-10 04:37:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25781 to 23475. [2019-09-10 04:37:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23475 states. [2019-09-10 04:37:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23475 states to 23475 states and 30849 transitions. [2019-09-10 04:37:37,394 INFO L78 Accepts]: Start accepts. Automaton has 23475 states and 30849 transitions. Word has length 123 [2019-09-10 04:37:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:37:37,394 INFO L475 AbstractCegarLoop]: Abstraction has 23475 states and 30849 transitions. [2019-09-10 04:37:37,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 04:37:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 23475 states and 30849 transitions. [2019-09-10 04:37:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 04:37:37,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:37:37,403 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:37:37,404 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:37:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:37,404 INFO L82 PathProgramCache]: Analyzing trace with hash -2031424327, now seen corresponding path program 1 times [2019-09-10 04:37:37,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:37:37,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:37,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:37,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:37:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:37,486 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:37:37,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:37,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:37:37,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2019-09-10 04:37:37,488 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], [204], [209], [212], [219], [221], [224], [228], [230], [231], [234], [250], [252], [254], [257], [261], [263], [264], [267], [283], [285], [287], [290], [294], [296], [297], [298], [299], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:37:37,491 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:37:37,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:37:37,502 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:37:37,798 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:37:37,799 INFO L272 AbstractInterpreter]: Visited 93 different actions 480 times. Merged at 15 different actions 96 times. Never widened. Performed 4951 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4951 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 19 fixpoints after 7 different actions. Largest state had 93 variables. [2019-09-10 04:37:37,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:37,799 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:37:37,943 INFO L227 lantSequenceWeakener]: Weakened 96 states. On average, predicates are now at 77.36% of their original sizes. [2019-09-10 04:37:37,943 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:37:40,763 INFO L420 sIntCurrentIteration]: We unified 122 AI predicates to 122 [2019-09-10 04:37:40,763 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:37:40,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:37:40,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [5] total 63 [2019-09-10 04:37:40,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:37:40,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 04:37:40,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 04:37:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=3227, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 04:37:40,765 INFO L87 Difference]: Start difference. First operand 23475 states and 30849 transitions. Second operand 60 states. [2019-09-10 04:39:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:05,948 INFO L93 Difference]: Finished difference Result 34244 states and 46743 transitions. [2019-09-10 04:39:05,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2019-09-10 04:39:05,948 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 123 [2019-09-10 04:39:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:06,031 INFO L225 Difference]: With dead ends: 34244 [2019-09-10 04:39:06,031 INFO L226 Difference]: Without dead ends: 34244 [2019-09-10 04:39:06,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21647 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=4712, Invalid=54580, Unknown=0, NotChecked=0, Total=59292 [2019-09-10 04:39:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34244 states. [2019-09-10 04:39:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34244 to 31639. [2019-09-10 04:39:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31639 states. [2019-09-10 04:39:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31639 states to 31639 states and 41538 transitions. [2019-09-10 04:39:06,765 INFO L78 Accepts]: Start accepts. Automaton has 31639 states and 41538 transitions. Word has length 123 [2019-09-10 04:39:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:06,766 INFO L475 AbstractCegarLoop]: Abstraction has 31639 states and 41538 transitions. [2019-09-10 04:39:06,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 04:39:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31639 states and 41538 transitions. [2019-09-10 04:39:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 04:39:06,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:06,779 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] [2019-09-10 04:39:06,779 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:06,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash 257714039, now seen corresponding path program 1 times [2019-09-10 04:39:06,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:06,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:06,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:07,140 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:39:07,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:07,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:07,141 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2019-09-10 04:39:07,141 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], [217], [219], [221], [224], [228], [230], [231], [234], [250], [252], [254], [257], [261], [263], [264], [267], [283], [285], [287], [290], [294], [296], [297], [298], [299], [302], [318], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:39:07,145 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:07,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:07,156 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:07,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:39:07,655 INFO L272 AbstractInterpreter]: Visited 97 different actions 775 times. Merged at 20 different actions 200 times. Never widened. Performed 6809 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6809 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 62 fixpoints after 9 different actions. Largest state had 93 variables. [2019-09-10 04:39:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:07,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:39:07,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:07,658 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:39:07,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:07,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:39:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:07,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 04:39:07,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:39:08,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:08,581 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:39:08,582 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:39:09,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:09,393 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:39:09,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:39:09,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 41 [2019-09-10 04:39:09,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:39:09,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 04:39:09,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 04:39:09,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1462, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 04:39:09,405 INFO L87 Difference]: Start difference. First operand 31639 states and 41538 transitions. Second operand 31 states. [2019-09-10 04:39:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:14,501 INFO L93 Difference]: Finished difference Result 72067 states and 93926 transitions. [2019-09-10 04:39:14,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 04:39:14,502 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 124 [2019-09-10 04:39:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:14,727 INFO L225 Difference]: With dead ends: 72067 [2019-09-10 04:39:14,727 INFO L226 Difference]: Without dead ends: 71911 [2019-09-10 04:39:14,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 238 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1473, Invalid=6009, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 04:39:14,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71911 states. [2019-09-10 04:39:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71911 to 69126. [2019-09-10 04:39:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69126 states. [2019-09-10 04:39:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69126 states to 69126 states and 90437 transitions. [2019-09-10 04:39:17,657 INFO L78 Accepts]: Start accepts. Automaton has 69126 states and 90437 transitions. Word has length 124 [2019-09-10 04:39:17,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:17,657 INFO L475 AbstractCegarLoop]: Abstraction has 69126 states and 90437 transitions. [2019-09-10 04:39:17,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 04:39:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 69126 states and 90437 transitions. [2019-09-10 04:39:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:39:17,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:17,673 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:39:17,673 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:17,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:17,674 INFO L82 PathProgramCache]: Analyzing trace with hash 785960293, now seen corresponding path program 1 times [2019-09-10 04:39:17,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:17,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:17,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:17,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:17,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 04:39:18,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:18,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:18,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:39:18,003 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], [204], [209], [212], [219], [221], [224], [228], [230], [231], [234], [250], [252], [254], [257], [261], [263], [264], [267], [283], [285], [287], [290], [294], [296], [297], [298], [299], [302], [305], [310], [313], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:39:18,005 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:18,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:18,014 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:18,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:39:18,419 INFO L272 AbstractInterpreter]: Visited 99 different actions 719 times. Merged at 20 different actions 154 times. Widened at 1 different actions 1 times. Performed 6907 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6907 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 35 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:39:18,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:18,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:39:18,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:18,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:39:18,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:18,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:39:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:18,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 04:39:18,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:39:18,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:19,178 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:39:19,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:39:19,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:19,897 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:39:19,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:39:19,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 41 [2019-09-10 04:39:19,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:39:19,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 04:39:19,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 04:39:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1478, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 04:39:19,908 INFO L87 Difference]: Start difference. First operand 69126 states and 90437 transitions. Second operand 31 states. [2019-09-10 04:39:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:27,426 INFO L93 Difference]: Finished difference Result 170165 states and 224016 transitions. [2019-09-10 04:39:27,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 04:39:27,426 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 125 [2019-09-10 04:39:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:27,761 INFO L225 Difference]: With dead ends: 170165 [2019-09-10 04:39:27,762 INFO L226 Difference]: Without dead ends: 169619 [2019-09-10 04:39:27,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2362 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1996, Invalid=8104, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 04:39:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169619 states. [2019-09-10 04:39:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169619 to 159722. [2019-09-10 04:39:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159722 states. [2019-09-10 04:39:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159722 states to 159722 states and 210353 transitions. [2019-09-10 04:39:34,923 INFO L78 Accepts]: Start accepts. Automaton has 159722 states and 210353 transitions. Word has length 125 [2019-09-10 04:39:34,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:34,924 INFO L475 AbstractCegarLoop]: Abstraction has 159722 states and 210353 transitions. [2019-09-10 04:39:34,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 04:39:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 159722 states and 210353 transitions. [2019-09-10 04:39:34,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:39:34,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:34,942 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] [2019-09-10 04:39:34,942 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:34,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:34,943 INFO L82 PathProgramCache]: Analyzing trace with hash -4691037, now seen corresponding path program 1 times [2019-09-10 04:39:34,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:34,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:34,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:34,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:34,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:35,018 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:39:35,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:35,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:35,019 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:39:35,019 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], [204], [209], [212], [219], [221], [224], [228], [230], [231], [234], [250], [252], [254], [257], [261], [263], [264], [267], [270], [275], [278], [285], [287], [290], [294], [296], [297], [298], [299], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:39:35,021 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:35,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:35,031 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:35,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:39:35,303 INFO L272 AbstractInterpreter]: Visited 96 different actions 417 times. Merged at 18 different actions 77 times. Never widened. Performed 4215 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 16 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:39:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:35,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:39:35,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:35,305 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:39:35,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:35,329 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:39:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:35,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:39:35,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:39:35,597 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:39:35,598 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:39:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:35,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:35,758 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:39:35,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:39:35,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:39:35,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:39:35,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:39:35,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:39:35,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:39:35,774 INFO L87 Difference]: Start difference. First operand 159722 states and 210353 transitions. Second operand 13 states. [2019-09-10 04:39:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:37,457 INFO L93 Difference]: Finished difference Result 241074 states and 324880 transitions. [2019-09-10 04:39:37,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:39:37,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 125 [2019-09-10 04:39:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:38,071 INFO L225 Difference]: With dead ends: 241074 [2019-09-10 04:39:38,071 INFO L226 Difference]: Without dead ends: 241014 [2019-09-10 04:39:38,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 241 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:39:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241014 states. [2019-09-10 04:39:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241014 to 228392. [2019-09-10 04:39:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228392 states. [2019-09-10 04:39:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228392 states to 228392 states and 298642 transitions. [2019-09-10 04:39:42,777 INFO L78 Accepts]: Start accepts. Automaton has 228392 states and 298642 transitions. Word has length 125 [2019-09-10 04:39:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:42,777 INFO L475 AbstractCegarLoop]: Abstraction has 228392 states and 298642 transitions. [2019-09-10 04:39:42,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:39:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 228392 states and 298642 transitions. [2019-09-10 04:39:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:39:42,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:42,796 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:39:42,796 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:42,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:42,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1920302631, now seen corresponding path program 1 times [2019-09-10 04:39:42,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:42,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:42,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:42,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:42,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:44,033 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:39:44,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:44,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:44,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:39:44,034 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], [204], [209], [212], [219], [221], [224], [228], [230], [231], [234], [250], [252], [254], [257], [261], [263], [264], [267], [270], [275], [278], [285], [287], [290], [294], [296], [297], [298], [299], [302], [318], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:39:44,035 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:44,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:44,045 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:44,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:39:44,609 INFO L272 AbstractInterpreter]: Visited 99 different actions 1008 times. Merged at 20 different actions 236 times. Widened at 1 different actions 3 times. Performed 9916 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9916 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 57 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:39:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:44,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:39:44,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:44,610 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:39:44,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:44,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:39:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:44,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 04:39:44,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:39:45,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:39:45,463 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:39:45,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:39:46,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:39:46,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 52 [2019-09-10 04:39:46,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:39:46,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 04:39:46,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 04:39:46,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2466, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 04:39:46,681 INFO L87 Difference]: Start difference. First operand 228392 states and 298642 transitions. Second operand 37 states. [2019-09-10 04:39:50,344 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 04:39:50,769 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 04:39:51,373 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 04:39:51,517 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 04:39:51,815 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:39:52,080 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 04:39:52,424 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 04:39:52,869 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 04:39:53,039 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 04:39:53,318 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 04:39:53,597 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 04:39:54,415 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 04:39:55,805 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 04:39:56,071 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 04:39:58,773 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 04:39:58,934 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 04:39:59,576 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 04:39:59,831 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:40:00,110 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 04:40:00,614 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 04:40:00,899 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 04:40:01,054 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 04:40:01,214 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 04:40:01,985 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 04:40:02,242 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 04:40:02,608 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-10 04:40:02,977 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 04:40:03,451 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:40:03,983 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 04:40:04,316 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 04:40:04,639 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 04:40:05,202 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 04:40:06,082 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 04:40:09,484 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 04:40:13,193 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:40:15,963 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 04:40:16,466 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 04:40:22,024 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:40:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:31,585 INFO L93 Difference]: Finished difference Result 569954 states and 746695 transitions. [2019-09-10 04:40:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 263 states. [2019-09-10 04:40:31,585 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 125 [2019-09-10 04:40:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:32,915 INFO L225 Difference]: With dead ends: 569954 [2019-09-10 04:40:32,915 INFO L226 Difference]: Without dead ends: 568742 [2019-09-10 04:40:32,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 368 SyntacticMatches, 3 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37021 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=11833, Invalid=85823, Unknown=0, NotChecked=0, Total=97656 [2019-09-10 04:40:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568742 states. [2019-09-10 04:40:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568742 to 508788. [2019-09-10 04:40:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508788 states. [2019-09-10 04:40:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508788 states to 508788 states and 671641 transitions. [2019-09-10 04:40:49,573 INFO L78 Accepts]: Start accepts. Automaton has 508788 states and 671641 transitions. Word has length 125 [2019-09-10 04:40:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:49,573 INFO L475 AbstractCegarLoop]: Abstraction has 508788 states and 671641 transitions. [2019-09-10 04:40:49,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 04:40:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 508788 states and 671641 transitions. [2019-09-10 04:40:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:40:49,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:49,585 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] [2019-09-10 04:40:49,585 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:49,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1099655549, now seen corresponding path program 1 times [2019-09-10 04:40:49,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:49,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:49,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:49,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:49,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:49,656 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:40:49,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:40:49,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:40:49,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:40:49,657 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], [221], [224], [228], [230], [231], [234], [250], [252], [254], [257], [261], [263], [264], [267], [270], [275], [278], [285], [287], [290], [294], [296], [297], [298], [299], [302], [305], [310], [313], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:40:49,659 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:40:49,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:40:49,670 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:40:49,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:40:49,989 INFO L272 AbstractInterpreter]: Visited 96 different actions 427 times. Merged at 18 different actions 81 times. Never widened. Performed 4318 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4318 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 18 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:40:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:49,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:40:49,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:40:49,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:40:50,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:50,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:40:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:50,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:40:50,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:40:50,219 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:40:50,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:40:50,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:50,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:50,382 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:40:50,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:40:50,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:40:50,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:40:50,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:40:50,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:40:50,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:40:50,387 INFO L87 Difference]: Start difference. First operand 508788 states and 671641 transitions. Second operand 13 states. [2019-09-10 04:40:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:59,118 INFO L93 Difference]: Finished difference Result 385500 states and 503483 transitions. [2019-09-10 04:40:59,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:40:59,118 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 125 [2019-09-10 04:40:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:41:00,003 INFO L225 Difference]: With dead ends: 385500 [2019-09-10 04:41:00,003 INFO L226 Difference]: Without dead ends: 385452 [2019-09-10 04:41:00,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 241 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:41:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385452 states. [2019-09-10 04:41:10,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385452 to 355575. [2019-09-10 04:41:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355575 states. [2019-09-10 04:41:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355575 states to 355575 states and 460497 transitions. [2019-09-10 04:41:11,627 INFO L78 Accepts]: Start accepts. Automaton has 355575 states and 460497 transitions. Word has length 125 [2019-09-10 04:41:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:41:11,627 INFO L475 AbstractCegarLoop]: Abstraction has 355575 states and 460497 transitions. [2019-09-10 04:41:11,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:41:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 355575 states and 460497 transitions. [2019-09-10 04:41:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:41:11,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:41:11,636 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, 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:41:11,636 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:41:11,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:11,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1309056171, now seen corresponding path program 1 times [2019-09-10 04:41:11,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:41:11,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:11,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:41:11,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:11,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:41:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:41:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:41:11,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:41:11,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:41:11,707 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:41:11,707 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], [204], [207], [219], [221], [224], [228], [230], [231], [234], [250], [252], [254], [257], [261], [263], [264], [287], [290], [294], [296], [297], [298], [299], [302], [318], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:41:11,709 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:41:11,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:41:11,718 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:41:12,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:41:12,281 INFO L272 AbstractInterpreter]: Visited 95 different actions 884 times. Merged at 18 different actions 217 times. Widened at 1 different actions 3 times. Performed 8521 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8521 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 59 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:41:12,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:12,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:41:12,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:41:12,281 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:41:12,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:41:12,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:41:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:41:12,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:41:12,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:41:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 04:41:12,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:41:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 04:41:12,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:41:12,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:41:12,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:41:12,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:41:12,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:41:12,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:41:12,554 INFO L87 Difference]: Start difference. First operand 355575 states and 460497 transitions. Second operand 5 states. [2019-09-10 04:41:14,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:41:14,484 INFO L93 Difference]: Finished difference Result 180175 states and 223249 transitions. [2019-09-10 04:41:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:41:14,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-10 04:41:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:41:14,833 INFO L225 Difference]: With dead ends: 180175 [2019-09-10 04:41:14,833 INFO L226 Difference]: Without dead ends: 180127 [2019-09-10 04:41:14,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:41:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180127 states. [2019-09-10 04:41:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180127 to 166599. [2019-09-10 04:41:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166599 states. [2019-09-10 04:41:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166599 states to 166599 states and 207324 transitions. [2019-09-10 04:41:22,887 INFO L78 Accepts]: Start accepts. Automaton has 166599 states and 207324 transitions. Word has length 125 [2019-09-10 04:41:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:41:22,888 INFO L475 AbstractCegarLoop]: Abstraction has 166599 states and 207324 transitions. [2019-09-10 04:41:22,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:41:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 166599 states and 207324 transitions. [2019-09-10 04:41:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:41:22,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:41:22,893 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] [2019-09-10 04:41:22,893 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:41:22,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:22,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1542354703, now seen corresponding path program 1 times [2019-09-10 04:41:22,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:41:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:22,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:41:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:22,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:41:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:41:23,326 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:41:23,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:41:23,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:41:23,327 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 04:41:23,327 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], [204], [207], [219], [221], [224], [228], [230], [231], [234], [250], [252], [254], [257], [261], [263], [264], [267], [270], [275], [278], [285], [287], [290], [294], [296], [297], [298], [299], [302], [305], [310], [313], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:41:23,329 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:41:23,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:41:23,338 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:41:23,646 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:41:23,646 INFO L272 AbstractInterpreter]: Visited 100 different actions 531 times. Merged at 20 different actions 104 times. Never widened. Performed 5282 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5282 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 25 fixpoints after 7 different actions. Largest state had 93 variables. [2019-09-10 04:41:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:23,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:41:23,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:41:23,647 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:41:23,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:41:23,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:41:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:41:23,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 04:41:23,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:41:24,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:41:24,565 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:41:24,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:41:25,080 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-10 04:41:25,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:41:26,339 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:41:26,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:41:26,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 54 [2019-09-10 04:41:26,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:41:26,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 04:41:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 04:41:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2674, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 04:41:26,348 INFO L87 Difference]: Start difference. First operand 166599 states and 207324 transitions. Second operand 38 states. [2019-09-10 04:41:28,182 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 04:41:28,510 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 04:41:29,306 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 04:41:29,786 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 04:41:30,302 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 04:41:30,788 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:41:31,623 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 04:41:32,168 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 04:41:32,340 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:41:32,895 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 04:41:33,088 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 04:41:33,319 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 04:41:34,778 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 04:41:36,428 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 04:41:38,543 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:41:38,953 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 04:41:39,545 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 04:41:40,168 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 04:41:41,120 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 04:41:41,295 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 04:41:42,935 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 04:41:43,210 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 04:41:44,314 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 04:41:50,853 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 04:41:53,891 WARN L188 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 04:41:54,775 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 04:41:55,702 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 04:41:56,017 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 04:42:05,043 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:42:05,208 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 04:42:08,349 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 04:42:13,510 WARN L188 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 04:42:13,826 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 04:42:14,069 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:42:14,222 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:42:15,935 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:42:18,450 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:42:18,987 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 04:42:19,471 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 04:42:19,874 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 04:42:21,068 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 04:42:21,291 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 04:42:21,444 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 04:42:21,952 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 04:42:25,467 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 04:42:26,890 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:42:27,196 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 04:42:27,606 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 04:42:28,790 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 04:42:33,373 WARN L188 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 04:42:33,911 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-09-10 04:42:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:37,367 INFO L93 Difference]: Finished difference Result 391192 states and 485115 transitions. [2019-09-10 04:42:37,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 441 states. [2019-09-10 04:42:37,367 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 126 [2019-09-10 04:42:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:38,186 INFO L225 Difference]: With dead ends: 391192 [2019-09-10 04:42:38,186 INFO L226 Difference]: Without dead ends: 388621 [2019-09-10 04:42:38,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 319 SyntacticMatches, 6 SemanticMatches, 491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100204 ImplicationChecksByTransitivity, 51.8s TimeCoverageRelationStatistics Valid=19828, Invalid=222728, Unknown=0, NotChecked=0, Total=242556 [2019-09-10 04:42:39,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388621 states. [2019-09-10 04:42:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388621 to 359483. [2019-09-10 04:42:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359483 states. [2019-09-10 04:42:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359483 states to 359483 states and 449995 transitions. [2019-09-10 04:42:50,474 INFO L78 Accepts]: Start accepts. Automaton has 359483 states and 449995 transitions. Word has length 126 [2019-09-10 04:42:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:50,475 INFO L475 AbstractCegarLoop]: Abstraction has 359483 states and 449995 transitions. [2019-09-10 04:42:50,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 04:42:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 359483 states and 449995 transitions. [2019-09-10 04:42:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:42:50,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:50,479 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, 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] [2019-09-10 04:42:50,479 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:50,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1876612632, now seen corresponding path program 1 times [2019-09-10 04:42:50,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:50,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:50,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:50,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:50,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:50,547 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 04:42:50,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:42:50,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:42:50,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 04:42:50,548 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], [204], [207], [219], [221], [224], [228], [230], [231], [254], [257], [261], [263], [264], [287], [290], [294], [296], [297], [298], [299], [302], [305], [308], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:42:50,549 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:42:50,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:42:50,558 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:42:50,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:42:50,733 INFO L272 AbstractInterpreter]: Visited 93 different actions 256 times. Merged at 16 different actions 45 times. Never widened. Performed 2436 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2436 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 12 fixpoints after 4 different actions. Largest state had 93 variables. [2019-09-10 04:42:50,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:50,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:42:50,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:42:50,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:42:50,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:50,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:42:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:50,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:42:50,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:42:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:42:50,984 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:42:51,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:42:51,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:42:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 04:42:51,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:42:51,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:42:51,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:42:51,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:42:51,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:42:51,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:42:51,157 INFO L87 Difference]: Start difference. First operand 359483 states and 449995 transitions. Second operand 13 states. [2019-09-10 04:42:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:52,389 INFO L93 Difference]: Finished difference Result 166219 states and 209078 transitions. [2019-09-10 04:42:52,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:42:52,392 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 126 [2019-09-10 04:42:52,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:54,028 INFO L225 Difference]: With dead ends: 166219 [2019-09-10 04:42:54,028 INFO L226 Difference]: Without dead ends: 166171 [2019-09-10 04:42:54,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 243 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:42:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166171 states. [2019-09-10 04:42:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166171 to 159208. [2019-09-10 04:42:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159208 states. [2019-09-10 04:42:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159208 states to 159208 states and 195665 transitions. [2019-09-10 04:42:57,659 INFO L78 Accepts]: Start accepts. Automaton has 159208 states and 195665 transitions. Word has length 126 [2019-09-10 04:42:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:57,659 INFO L475 AbstractCegarLoop]: Abstraction has 159208 states and 195665 transitions. [2019-09-10 04:42:57,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:42:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 159208 states and 195665 transitions. [2019-09-10 04:42:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:42:57,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:57,662 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, 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] [2019-09-10 04:42:57,663 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:57,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1994752278, now seen corresponding path program 1 times [2019-09-10 04:42:57,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:57,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:57,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:57,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:57,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:42:57,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:42:57,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:42:57,743 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:42:57,743 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], [204], [207], [219], [221], [224], [228], [230], [231], [254], [257], [261], [263], [264], [267], [270], [273], [285], [287], [290], [294], [296], [297], [298], [299], [302], [305], [308], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:42:57,744 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:42:57,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:42:57,753 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:42:59,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:42:59,463 INFO L272 AbstractInterpreter]: Visited 97 different actions 380 times. Merged at 18 different actions 76 times. Never widened. Performed 3978 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3978 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 22 fixpoints after 5 different actions. Largest state had 93 variables. [2019-09-10 04:42:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:59,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:42:59,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:42:59,464 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:42:59,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:59,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:42:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:59,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:42:59,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:42:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:42:59,804 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:42:59,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:42:59,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:42:59,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:42:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:42:59,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:42:59,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:42:59,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:42:59,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:42:59,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:42:59,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:42:59,976 INFO L87 Difference]: Start difference. First operand 159208 states and 195665 transitions. Second operand 13 states. [2019-09-10 04:43:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:00,852 INFO L93 Difference]: Finished difference Result 74717 states and 94347 transitions. [2019-09-10 04:43:00,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:43:00,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 127 [2019-09-10 04:43:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:01,029 INFO L225 Difference]: With dead ends: 74717 [2019-09-10 04:43:01,029 INFO L226 Difference]: Without dead ends: 74717 [2019-09-10 04:43:01,030 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:43:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74717 states. [2019-09-10 04:43:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74717 to 71833. [2019-09-10 04:43:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71833 states. [2019-09-10 04:43:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71833 states to 71833 states and 86299 transitions. [2019-09-10 04:43:03,456 INFO L78 Accepts]: Start accepts. Automaton has 71833 states and 86299 transitions. Word has length 127 [2019-09-10 04:43:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:43:03,457 INFO L475 AbstractCegarLoop]: Abstraction has 71833 states and 86299 transitions. [2019-09-10 04:43:03,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:43:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 71833 states and 86299 transitions. [2019-09-10 04:43:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:43:03,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:43:03,459 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:43:03,459 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:43:03,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:03,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1247345015, now seen corresponding path program 1 times [2019-09-10 04:43:03,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:43:03,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:03,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:03,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:03,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:43:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:04,972 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:43:04,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:43:04,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:43:04,973 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:43:04,973 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [204], [207], [219], [221], [224], [228], [230], [231], [234], [237], [242], [245], [252], [254], [257], [261], [263], [264], [267], [270], [273], [285], [287], [290], [294], [296], [297], [298], [299], [302], [305], [310], [313], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:43:04,977 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:43:04,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:43:04,987 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:43:06,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:43:06,623 INFO L272 AbstractInterpreter]: Visited 101 different actions 542 times. Merged at 20 different actions 102 times. Never widened. Performed 5443 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5443 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 24 fixpoints after 5 different actions. Largest state had 93 variables. [2019-09-10 04:43:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:06,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:43:06,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:43:06,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:43:06,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:06,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:43:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:06,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-10 04:43:06,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:43:09,157 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 04:43:09,924 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:43:09,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:10,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:11,088 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 04:43:11,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:11,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:11,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:11,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:11,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:12,646 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:43:14,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:14,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:14,698 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:43:14,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:43:15,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-10 04:43:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-10 04:43:16,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:17,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:17,686 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 04:43:17,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:18,388 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 04:43:18,702 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 04:43:18,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:19,251 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:43:19,615 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 04:43:21,128 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:43:21,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:21,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:21,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:43:22,706 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:43:22,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:43:22,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 42, 41] total 115 [2019-09-10 04:43:22,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:43:22,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 04:43:22,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 04:43:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1006, Invalid=12104, Unknown=0, NotChecked=0, Total=13110 [2019-09-10 04:43:22,714 INFO L87 Difference]: Start difference. First operand 71833 states and 86299 transitions. Second operand 78 states. [2019-09-10 04:43:25,716 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-09-10 04:43:26,576 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-10 04:43:26,859 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 47 [2019-09-10 04:43:28,990 WARN L188 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2019-09-10 04:43:29,458 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-09-10 04:43:29,776 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 57 [2019-09-10 04:43:30,098 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-09-10 04:43:30,590 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 59 [2019-09-10 04:43:31,046 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 60 [2019-09-10 04:43:31,398 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-09-10 04:43:31,892 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 62 [2019-09-10 04:43:32,254 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 63 [2019-09-10 04:43:32,606 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-09-10 04:43:32,903 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-09-10 04:43:33,234 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-09-10 04:43:34,463 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-10 04:43:34,874 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 04:43:35,517 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 04:43:35,870 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-09-10 04:43:36,303 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 04:43:36,694 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-09-10 04:43:37,198 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 04:43:37,471 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 04:43:38,008 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 04:43:38,415 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 04:43:39,397 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:43:40,381 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-10 04:43:40,589 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:43:40,914 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-10 04:43:41,153 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-10 04:43:41,448 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 04:43:41,755 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 04:43:42,126 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 04:43:42,757 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 04:43:43,175 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-09-10 04:43:44,027 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 04:43:44,325 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:43:47,734 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:43:48,898 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-09-10 04:43:50,024 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 04:43:50,850 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 04:43:51,427 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2019-09-10 04:43:52,122 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-09-10 04:43:54,271 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:44:00,871 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:44:01,568 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 54 [2019-09-10 04:44:02,638 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2019-09-10 04:44:02,985 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2019-09-10 04:44:06,528 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-09-10 04:44:06,835 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:44:07,704 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 78 [2019-09-10 04:44:08,051 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 76 [2019-09-10 04:44:08,493 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-09-10 04:44:08,685 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-10 04:44:09,471 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 72 [2019-09-10 04:44:09,760 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2019-09-10 04:44:10,428 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 79 [2019-09-10 04:44:10,783 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 04:44:11,465 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 94 [2019-09-10 04:44:11,798 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 04:44:12,318 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2019-09-10 04:44:12,620 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 04:44:13,183 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 89 [2019-09-10 04:44:13,467 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 04:44:15,426 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 96 [2019-09-10 04:44:15,776 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-09-10 04:44:16,118 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-10 04:44:16,368 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:44:17,304 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 82 [2019-09-10 04:44:17,797 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-09-10 04:44:18,121 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 57 [2019-09-10 04:44:18,408 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 04:44:18,916 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 59 [2019-09-10 04:44:19,384 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2019-09-10 04:44:19,624 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-09-10 04:44:19,922 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 04:44:20,117 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-10 04:44:20,883 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 59 [2019-09-10 04:44:21,266 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 77 [2019-09-10 04:44:21,594 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 75 [2019-09-10 04:44:21,847 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 49 [2019-09-10 04:44:22,060 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2019-09-10 04:44:22,669 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 65 [2019-09-10 04:44:23,262 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 04:44:23,830 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-09-10 04:44:24,402 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-10 04:44:24,621 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 04:44:24,895 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 04:44:27,053 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:44:27,737 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2019-09-10 04:44:27,910 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-09-10 04:44:28,758 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 04:44:30,067 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-09-10 04:44:31,001 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2019-09-10 04:44:31,809 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:44:32,073 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:44:32,763 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-09-10 04:44:33,300 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:44:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:44:40,869 INFO L93 Difference]: Finished difference Result 81661 states and 97589 transitions. [2019-09-10 04:44:40,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2019-09-10 04:44:40,869 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 127 [2019-09-10 04:44:40,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:44:41,049 INFO L225 Difference]: With dead ends: 81661 [2019-09-10 04:44:41,050 INFO L226 Difference]: Without dead ends: 81511 [2019-09-10 04:44:41,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 238 SyntacticMatches, 8 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35681 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=12060, Invalid=100500, Unknown=0, NotChecked=0, Total=112560 [2019-09-10 04:44:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81511 states. [2019-09-10 04:44:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81511 to 77018. [2019-09-10 04:44:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77018 states. [2019-09-10 04:44:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77018 states to 77018 states and 92716 transitions. [2019-09-10 04:44:42,488 INFO L78 Accepts]: Start accepts. Automaton has 77018 states and 92716 transitions. Word has length 127 [2019-09-10 04:44:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:44:42,488 INFO L475 AbstractCegarLoop]: Abstraction has 77018 states and 92716 transitions. [2019-09-10 04:44:42,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-10 04:44:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 77018 states and 92716 transitions. [2019-09-10 04:44:42,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 04:44:42,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:44:42,490 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, 1] [2019-09-10 04:44:42,490 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:44:42,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:42,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1772287391, now seen corresponding path program 1 times [2019-09-10 04:44:42,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:44:42,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:42,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:44:42,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:42,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:44:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:44:42,631 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:44:42,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:44:42,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:44:42,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 04:44:42,632 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], [204], [207], [219], [221], [224], [228], [230], [231], [234], [237], [240], [252], [254], [257], [261], [263], [264], [267], [270], [273], [285], [287], [290], [294], [296], [297], [298], [299], [302], [305], [308], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:44:42,634 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:44:42,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:44:42,646 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:44:42,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:44:42,882 INFO L272 AbstractInterpreter]: Visited 101 different actions 437 times. Merged at 20 different actions 95 times. Never widened. Performed 3991 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3991 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 31 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:44:42,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:42,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:44:42,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:44:42,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:44:42,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:44:42,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:44:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:44:43,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 04:44:43,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:44:43,063 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:44:43,063 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:44:43,203 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:44:43,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:44:43,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2019-09-10 04:44:43,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:44:43,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:44:43,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:44:43,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:44:43,209 INFO L87 Difference]: Start difference. First operand 77018 states and 92716 transitions. Second operand 9 states. [2019-09-10 04:44:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:44:45,024 INFO L93 Difference]: Finished difference Result 89623 states and 107972 transitions. [2019-09-10 04:44:45,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:44:45,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-10 04:44:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:44:45,185 INFO L225 Difference]: With dead ends: 89623 [2019-09-10 04:44:45,185 INFO L226 Difference]: Without dead ends: 89593 [2019-09-10 04:44:45,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 252 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 04:44:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89593 states. [2019-09-10 04:44:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89593 to 79551. [2019-09-10 04:44:46,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79551 states. [2019-09-10 04:44:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79551 states to 79551 states and 95412 transitions. [2019-09-10 04:44:46,896 INFO L78 Accepts]: Start accepts. Automaton has 79551 states and 95412 transitions. Word has length 128 [2019-09-10 04:44:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:44:46,896 INFO L475 AbstractCegarLoop]: Abstraction has 79551 states and 95412 transitions. [2019-09-10 04:44:46,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:44:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 79551 states and 95412 transitions. [2019-09-10 04:44:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 04:44:46,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:44:46,897 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:46,898 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:44:46,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:46,898 INFO L82 PathProgramCache]: Analyzing trace with hash 245004972, now seen corresponding path program 1 times [2019-09-10 04:44:46,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:44:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:44:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:46,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:44:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:44:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 04:44:47,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:44:47,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:44:47,810 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 04:44:47,810 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], [191], [196], [197], [198], [201], [204], [209], [214], [219], [221], [224], [228], [230], [231], [234], [237], [240], [252], [254], [257], [261], [263], [264], [267], [270], [273], [285], [287], [290], [294], [296], [297], [298], [299], [302], [305], [310], [313], [320], [322], [325], [329], [331], [332], [335], [337], [340], [342], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362] [2019-09-10 04:44:47,812 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:44:47,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:44:47,817 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:44:48,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:44:48,038 INFO L272 AbstractInterpreter]: Visited 101 different actions 466 times. Merged at 20 different actions 92 times. Never widened. Performed 4734 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4734 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:44:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:48,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:44:48,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:44:48,039 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:44:48,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:44:48,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:44:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:44:48,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 04:44:48,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:44:48,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:44:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:44:48,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:44:49,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:44:49,980 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-09-10 04:44:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:44:50,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:44:50,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17, 17] total 57 [2019-09-10 04:44:50,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:44:50,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 04:44:50,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 04:44:50,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2957, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 04:44:50,438 INFO L87 Difference]: Start difference. First operand 79551 states and 95412 transitions. Second operand 43 states.