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.3.1.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:24:06,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:24:06,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:24:06,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:24:06,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:24:06,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:24:06,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:24:06,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:24:06,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:24:06,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:24:06,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:24:06,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:24:06,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:24:06,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:24:06,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:24:06,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:24:06,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:24:06,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:24:06,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:24:06,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:24:06,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:24:06,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:24:06,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:24:06,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:24:06,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:24:06,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:24:06,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:24:06,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:24:06,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:24:06,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:24:06,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:24:06,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:24:06,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:24:06,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:24:06,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:24:06,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:24:06,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:24:06,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:24:06,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:24:06,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:24:06,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:24:06,470 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:24:06,484 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:24:06,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:24:06,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:24:06,485 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:24:06,486 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:24:06,486 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:24:06,486 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:24:06,486 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:24:06,486 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:24:06,487 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:24:06,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:24:06,487 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:24:06,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:24:06,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:24:06,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:24:06,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:24:06,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:24:06,489 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:24:06,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:24:06,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:24:06,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:24:06,489 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:24:06,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:24:06,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:24:06,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:24:06,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:24:06,490 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:24:06,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:24:06,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:24:06,491 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:24:06,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:24:06,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:24:06,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:24:06,536 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:24:06,536 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:24:06,537 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2019-09-10 04:24:06,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5755f82d/02387f33804d4f2bb30cf94784047f85/FLAGc86b5734c [2019-09-10 04:24:07,102 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:24:07,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2019-09-10 04:24:07,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5755f82d/02387f33804d4f2bb30cf94784047f85/FLAGc86b5734c [2019-09-10 04:24:07,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5755f82d/02387f33804d4f2bb30cf94784047f85 [2019-09-10 04:24:07,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:24:07,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:24:07,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:24:07,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:24:07,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:24:07,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:24:07" (1/1) ... [2019-09-10 04:24:07,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38deb683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:24:07, skipping insertion in model container [2019-09-10 04:24:07,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:24:07" (1/1) ... [2019-09-10 04:24:07,500 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:24:07,535 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:24:07,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:24:07,922 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:24:07,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:24:08,024 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:24:08,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:24:08 WrapperNode [2019-09-10 04:24:08,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:24:08,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:24:08,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:24:08,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:24:08,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:24:08" (1/1) ... [2019-09-10 04:24:08,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:24:08" (1/1) ... [2019-09-10 04:24:08,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:24:08" (1/1) ... [2019-09-10 04:24:08,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:24:08" (1/1) ... [2019-09-10 04:24:08,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:24:08" (1/1) ... [2019-09-10 04:24:08,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:24:08" (1/1) ... [2019-09-10 04:24:08,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:24:08" (1/1) ... [2019-09-10 04:24:08,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:24:08,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:24:08,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:24:08,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:24:08,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:24:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:24:08,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:24:08,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:24:08,131 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:24:08,131 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:24:08,131 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:24:08,131 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:24:08,132 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:24:08,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:24:08,132 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:24:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:24:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:24:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:24:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:24:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:24:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:24:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:24:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:24:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:24:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:24:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:24:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:24:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:24:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:24:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:24:08,644 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:24:08,644 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:24:08,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:24:08 BoogieIcfgContainer [2019-09-10 04:24:08,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:24:08,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:24:08,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:24:08,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:24:08,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:24:07" (1/3) ... [2019-09-10 04:24:08,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3b0664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:24:08, skipping insertion in model container [2019-09-10 04:24:08,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:24:08" (2/3) ... [2019-09-10 04:24:08,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3b0664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:24:08, skipping insertion in model container [2019-09-10 04:24:08,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:24:08" (3/3) ... [2019-09-10 04:24:08,654 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2019-09-10 04:24:08,664 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:24:08,672 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:24:08,688 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:24:08,716 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:24:08,716 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:24:08,717 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:24:08,717 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:24:08,717 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:24:08,717 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:24:08,717 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:24:08,718 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:24:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-09-10 04:24:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-10 04:24:08,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:24:08,750 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:24:08,753 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:24:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash -670022, now seen corresponding path program 1 times [2019-09-10 04:24:08,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:24:08,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:08,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:24:08,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:08,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:24:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:24:09,135 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:24:09,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:24:09,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:24:09,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:24:09,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:24:09,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:24:09,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:24:09,157 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 5 states. [2019-09-10 04:24:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:24:09,251 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2019-09-10 04:24:09,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:24:09,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-09-10 04:24:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:24:09,270 INFO L225 Difference]: With dead ends: 91 [2019-09-10 04:24:09,271 INFO L226 Difference]: Without dead ends: 82 [2019-09-10 04:24:09,275 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:24:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-10 04:24:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-09-10 04:24:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-10 04:24:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2019-09-10 04:24:09,347 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 47 [2019-09-10 04:24:09,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:24:09,348 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2019-09-10 04:24:09,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:24:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2019-09-10 04:24:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 04:24:09,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:24:09,352 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] [2019-09-10 04:24:09,353 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:24:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:09,355 INFO L82 PathProgramCache]: Analyzing trace with hash 525570851, now seen corresponding path program 1 times [2019-09-10 04:24:09,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:24:09,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:09,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:24:09,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:09,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:24:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:24:09,732 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:24:09,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:24:09,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:24:09,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:24:09,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:24:09,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:24:09,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:24:09,738 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 9 states. [2019-09-10 04:24:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:24:11,411 INFO L93 Difference]: Finished difference Result 409 states and 574 transitions. [2019-09-10 04:24:11,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 04:24:11,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-09-10 04:24:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:24:11,421 INFO L225 Difference]: With dead ends: 409 [2019-09-10 04:24:11,421 INFO L226 Difference]: Without dead ends: 409 [2019-09-10 04:24:11,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:24:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-09-10 04:24:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 250. [2019-09-10 04:24:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-10 04:24:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 336 transitions. [2019-09-10 04:24:11,505 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 336 transitions. Word has length 62 [2019-09-10 04:24:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:24:11,505 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 336 transitions. [2019-09-10 04:24:11,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:24:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 336 transitions. [2019-09-10 04:24:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 04:24:11,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:24:11,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:24:11,515 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:24:11,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:11,515 INFO L82 PathProgramCache]: Analyzing trace with hash -938666349, now seen corresponding path program 1 times [2019-09-10 04:24:11,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:24:11,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:11,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:24:11,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:11,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:24:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:24:11,645 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:24:11,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:24:11,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:24:11,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:24:11,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:24:11,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:24:11,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:24:11,647 INFO L87 Difference]: Start difference. First operand 250 states and 336 transitions. Second operand 5 states. [2019-09-10 04:24:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:24:11,976 INFO L93 Difference]: Finished difference Result 605 states and 810 transitions. [2019-09-10 04:24:11,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:24:11,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 04:24:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:24:11,981 INFO L225 Difference]: With dead ends: 605 [2019-09-10 04:24:11,981 INFO L226 Difference]: Without dead ends: 605 [2019-09-10 04:24:11,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:24:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-10 04:24:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 601. [2019-09-10 04:24:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-10 04:24:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 808 transitions. [2019-09-10 04:24:12,034 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 808 transitions. Word has length 64 [2019-09-10 04:24:12,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:24:12,036 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 808 transitions. [2019-09-10 04:24:12,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:24:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 808 transitions. [2019-09-10 04:24:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 04:24:12,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:24:12,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:24:12,044 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:24:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2068598491, now seen corresponding path program 1 times [2019-09-10 04:24:12,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:24:12,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:12,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:24:12,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:12,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:24:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:24:12,163 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:24:12,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:24:12,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:24:12,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:24:12,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:24:12,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:24:12,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:24:12,165 INFO L87 Difference]: Start difference. First operand 601 states and 808 transitions. Second operand 5 states. [2019-09-10 04:24:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:24:12,457 INFO L93 Difference]: Finished difference Result 1090 states and 1457 transitions. [2019-09-10 04:24:12,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:24:12,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 04:24:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:24:12,467 INFO L225 Difference]: With dead ends: 1090 [2019-09-10 04:24:12,467 INFO L226 Difference]: Without dead ends: 1090 [2019-09-10 04:24:12,467 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:24:12,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-09-10 04:24:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1088. [2019-09-10 04:24:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 04:24:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1456 transitions. [2019-09-10 04:24:12,511 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1456 transitions. Word has length 64 [2019-09-10 04:24:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:24:12,511 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1456 transitions. [2019-09-10 04:24:12,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:24:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1456 transitions. [2019-09-10 04:24:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 04:24:12,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:24:12,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:24:12,513 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:24:12,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash 430370341, now seen corresponding path program 1 times [2019-09-10 04:24:12,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:24:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:12,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:24:12,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:12,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:24:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:24:12,592 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:24:12,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:24:12,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:24:12,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:24:12,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:24:12,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:24:12,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:24:12,594 INFO L87 Difference]: Start difference. First operand 1088 states and 1456 transitions. Second operand 5 states. [2019-09-10 04:24:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:24:12,940 INFO L93 Difference]: Finished difference Result 1998 states and 2640 transitions. [2019-09-10 04:24:12,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:24:12,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 04:24:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:24:12,953 INFO L225 Difference]: With dead ends: 1998 [2019-09-10 04:24:12,953 INFO L226 Difference]: Without dead ends: 1998 [2019-09-10 04:24:12,954 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:24:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-09-10 04:24:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1996. [2019-09-10 04:24:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-09-10 04:24:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2639 transitions. [2019-09-10 04:24:13,036 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2639 transitions. Word has length 64 [2019-09-10 04:24:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:24:13,038 INFO L475 AbstractCegarLoop]: Abstraction has 1996 states and 2639 transitions. [2019-09-10 04:24:13,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:24:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2639 transitions. [2019-09-10 04:24:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 04:24:13,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:24:13,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:24:13,040 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:24:13,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1626115611, now seen corresponding path program 1 times [2019-09-10 04:24:13,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:24:13,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:13,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:24:13,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:13,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:24:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:24:13,240 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:24:13,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:24:13,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:24:13,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:24:13,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:24:13,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:24:13,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:24:13,242 INFO L87 Difference]: Start difference. First operand 1996 states and 2639 transitions. Second operand 9 states. [2019-09-10 04:24:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:24:14,366 INFO L93 Difference]: Finished difference Result 2216 states and 3024 transitions. [2019-09-10 04:24:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 04:24:14,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-09-10 04:24:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:24:14,380 INFO L225 Difference]: With dead ends: 2216 [2019-09-10 04:24:14,380 INFO L226 Difference]: Without dead ends: 2216 [2019-09-10 04:24:14,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-10 04:24:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2019-09-10 04:24:14,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1988. [2019-09-10 04:24:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1988 states. [2019-09-10 04:24:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 2611 transitions. [2019-09-10 04:24:14,452 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 2611 transitions. Word has length 64 [2019-09-10 04:24:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:24:14,453 INFO L475 AbstractCegarLoop]: Abstraction has 1988 states and 2611 transitions. [2019-09-10 04:24:14,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:24:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2611 transitions. [2019-09-10 04:24:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 04:24:14,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:24:14,454 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:24:14,454 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:24:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:14,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1591892951, now seen corresponding path program 1 times [2019-09-10 04:24:14,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:24:14,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:14,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:24:14,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:14,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:24:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:24:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:24:14,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:24:14,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:24:14,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:24:14,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:24:14,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:24:14,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:24:14,569 INFO L87 Difference]: Start difference. First operand 1988 states and 2611 transitions. Second operand 9 states. [2019-09-10 04:24:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:24:15,099 INFO L93 Difference]: Finished difference Result 2349 states and 3105 transitions. [2019-09-10 04:24:15,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:24:15,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-09-10 04:24:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:24:15,111 INFO L225 Difference]: With dead ends: 2349 [2019-09-10 04:24:15,111 INFO L226 Difference]: Without dead ends: 2349 [2019-09-10 04:24:15,112 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:24:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2019-09-10 04:24:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2013. [2019-09-10 04:24:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2013 states. [2019-09-10 04:24:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2643 transitions. [2019-09-10 04:24:15,170 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2643 transitions. Word has length 64 [2019-09-10 04:24:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:24:15,171 INFO L475 AbstractCegarLoop]: Abstraction has 2013 states and 2643 transitions. [2019-09-10 04:24:15,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:24:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2643 transitions. [2019-09-10 04:24:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 04:24:15,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:24:15,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:24:15,172 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:24:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:15,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2094864628, now seen corresponding path program 1 times [2019-09-10 04:24:15,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:24:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:15,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:24:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:15,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:24:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:24:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:24:15,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:24:15,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:24:15,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:24:15,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:24:15,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:24:15,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:24:15,264 INFO L87 Difference]: Start difference. First operand 2013 states and 2643 transitions. Second operand 8 states. [2019-09-10 04:24:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:24:15,353 INFO L93 Difference]: Finished difference Result 2498 states and 3405 transitions. [2019-09-10 04:24:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:24:15,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-09-10 04:24:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:24:15,368 INFO L225 Difference]: With dead ends: 2498 [2019-09-10 04:24:15,369 INFO L226 Difference]: Without dead ends: 2498 [2019-09-10 04:24:15,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:24:15,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2019-09-10 04:24:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2229. [2019-09-10 04:24:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2229 states. [2019-09-10 04:24:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 2863 transitions. [2019-09-10 04:24:15,439 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 2863 transitions. Word has length 65 [2019-09-10 04:24:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:24:15,440 INFO L475 AbstractCegarLoop]: Abstraction has 2229 states and 2863 transitions. [2019-09-10 04:24:15,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:24:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2863 transitions. [2019-09-10 04:24:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 04:24:15,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:24:15,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:24:15,441 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:24:15,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:15,442 INFO L82 PathProgramCache]: Analyzing trace with hash 534608897, now seen corresponding path program 1 times [2019-09-10 04:24:15,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:24:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:15,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:24:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:15,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:24:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:24:15,523 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:24:15,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:24:15,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:24:15,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:24:15,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:24:15,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:24:15,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:24:15,525 INFO L87 Difference]: Start difference. First operand 2229 states and 2863 transitions. Second operand 7 states. [2019-09-10 04:24:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:24:16,112 INFO L93 Difference]: Finished difference Result 3064 states and 3911 transitions. [2019-09-10 04:24:16,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:24:16,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-09-10 04:24:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:24:16,131 INFO L225 Difference]: With dead ends: 3064 [2019-09-10 04:24:16,131 INFO L226 Difference]: Without dead ends: 3064 [2019-09-10 04:24:16,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:24:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2019-09-10 04:24:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 3055. [2019-09-10 04:24:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3055 states. [2019-09-10 04:24:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 3903 transitions. [2019-09-10 04:24:16,232 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 3903 transitions. Word has length 65 [2019-09-10 04:24:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:24:16,233 INFO L475 AbstractCegarLoop]: Abstraction has 3055 states and 3903 transitions. [2019-09-10 04:24:16,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:24:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 3903 transitions. [2019-09-10 04:24:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 04:24:16,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:24:16,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,238 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:24:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:16,239 INFO L82 PathProgramCache]: Analyzing trace with hash -605840881, now seen corresponding path program 1 times [2019-09-10 04:24:16,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:24:16,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:16,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:24:16,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:16,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:24:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:24:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:24:16,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:24:16,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:24:16,337 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2019-09-10 04:24:16,339 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [132], [135], [139], [152], [154], [155], [156], [179], [182], [186], [188], [189], [192], [208], [210], [212], [215], [219], [221], [222], [223], [224], [227], [230], [235], [238], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:24:16,405 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:24:16,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:24:16,491 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:24:16,946 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:24:16,949 INFO L272 AbstractInterpreter]: Visited 77 different actions 459 times. Merged at 13 different actions 92 times. Widened at 1 different actions 1 times. Performed 3674 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3674 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 4 different actions. Largest state had 74 variables. [2019-09-10 04:24:16,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:16,954 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:24:17,181 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 91.87% of their original sizes. [2019-09-10 04:24:17,181 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:24:21,448 INFO L420 sIntCurrentIteration]: We unified 102 AI predicates to 102 [2019-09-10 04:24:21,448 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:24:21,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:24:21,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [5] total 63 [2019-09-10 04:24:21,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:24:21,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 04:24:21,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 04:24:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=3170, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 04:24:21,453 INFO L87 Difference]: Start difference. First operand 3055 states and 3903 transitions. Second operand 60 states. [2019-09-10 04:24:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:24:44,489 INFO L93 Difference]: Finished difference Result 3776 states and 5026 transitions. [2019-09-10 04:24:44,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-10 04:24:44,490 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 103 [2019-09-10 04:24:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:24:44,510 INFO L225 Difference]: With dead ends: 3776 [2019-09-10 04:24:44,510 INFO L226 Difference]: Without dead ends: 3776 [2019-09-10 04:24:44,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4518 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=998, Invalid=11658, Unknown=0, NotChecked=0, Total=12656 [2019-09-10 04:24:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2019-09-10 04:24:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 3250. [2019-09-10 04:24:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3250 states. [2019-09-10 04:24:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 4122 transitions. [2019-09-10 04:24:44,664 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 4122 transitions. Word has length 103 [2019-09-10 04:24:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:24:44,664 INFO L475 AbstractCegarLoop]: Abstraction has 3250 states and 4122 transitions. [2019-09-10 04:24:44,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 04:24:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 4122 transitions. [2019-09-10 04:24:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 04:24:44,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:24:44,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:44,669 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:24:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash 624508955, now seen corresponding path program 1 times [2019-09-10 04:24:44,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:24:44,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:44,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:24:44,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:24:44,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:24:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:24:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:24:44,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:24:44,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:24:44,757 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2019-09-10 04:24:44,757 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [132], [135], [139], [152], [154], [155], [156], [179], [182], [186], [188], [189], [192], [195], [200], [203], [210], [212], [215], [219], [221], [222], [223], [224], [227], [243], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:24:44,761 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:24:44,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:24:44,772 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:24:44,951 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:24:44,951 INFO L272 AbstractInterpreter]: Visited 77 different actions 407 times. Merged at 13 different actions 83 times. Widened at 1 different actions 1 times. Performed 3107 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3107 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 5 different actions. Largest state had 74 variables. [2019-09-10 04:24:44,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:24:44,952 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:24:45,054 INFO L227 lantSequenceWeakener]: Weakened 80 states. On average, predicates are now at 77.03% of their original sizes. [2019-09-10 04:24:45,054 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:24:47,544 INFO L420 sIntCurrentIteration]: We unified 102 AI predicates to 102 [2019-09-10 04:24:47,544 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:24:47,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:24:47,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [61] imperfect sequences [5] total 64 [2019-09-10 04:24:47,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:24:47,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 04:24:47,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 04:24:47,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=3347, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 04:24:47,547 INFO L87 Difference]: Start difference. First operand 3250 states and 4122 transitions. Second operand 61 states. [2019-09-10 04:25:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:25:13,368 INFO L93 Difference]: Finished difference Result 3762 states and 5110 transitions. [2019-09-10 04:25:13,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-10 04:25:13,368 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 103 [2019-09-10 04:25:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:25:13,391 INFO L225 Difference]: With dead ends: 3762 [2019-09-10 04:25:13,391 INFO L226 Difference]: Without dead ends: 3756 [2019-09-10 04:25:13,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4847 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1397, Invalid=15633, Unknown=0, NotChecked=0, Total=17030 [2019-09-10 04:25:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3756 states. [2019-09-10 04:25:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3756 to 3261. [2019-09-10 04:25:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3261 states. [2019-09-10 04:25:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3261 states to 3261 states and 4165 transitions. [2019-09-10 04:25:13,514 INFO L78 Accepts]: Start accepts. Automaton has 3261 states and 4165 transitions. Word has length 103 [2019-09-10 04:25:13,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:25:13,515 INFO L475 AbstractCegarLoop]: Abstraction has 3261 states and 4165 transitions. [2019-09-10 04:25:13,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 04:25:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 4165 transitions. [2019-09-10 04:25:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 04:25:13,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:25:13,520 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:13,520 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:25:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1341535527, now seen corresponding path program 1 times [2019-09-10 04:25:13,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:25:13,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:13,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:25:13,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:13,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:25:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:25:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:25:13,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:25:13,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:25:13,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2019-09-10 04:25:13,737 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [132], [135], [139], [152], [154], [155], [156], [159], [162], [167], [170], [177], [179], [182], [186], [188], [189], [192], [208], [210], [212], [215], [219], [221], [222], [223], [224], [227], [243], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:25:13,743 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:25:13,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:25:13,751 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:25:14,050 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:25:14,051 INFO L272 AbstractInterpreter]: Visited 80 different actions 767 times. Merged at 15 different actions 179 times. Widened at 1 different actions 3 times. Performed 5568 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5568 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 6 different actions. Largest state had 74 variables. [2019-09-10 04:25:14,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:14,051 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:25:14,144 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 85.98% of their original sizes. [2019-09-10 04:25:14,144 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:25:19,178 INFO L420 sIntCurrentIteration]: We unified 102 AI predicates to 102 [2019-09-10 04:25:19,178 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:25:19,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:25:19,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [13] total 77 [2019-09-10 04:25:19,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:25:19,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 04:25:19,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 04:25:19,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=3754, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 04:25:19,182 INFO L87 Difference]: Start difference. First operand 3261 states and 4165 transitions. Second operand 66 states. [2019-09-10 04:25:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:25:40,434 INFO L93 Difference]: Finished difference Result 4589 states and 6286 transitions. [2019-09-10 04:25:40,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-10 04:25:40,435 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 103 [2019-09-10 04:25:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:25:40,459 INFO L225 Difference]: With dead ends: 4589 [2019-09-10 04:25:40,459 INFO L226 Difference]: Without dead ends: 4589 [2019-09-10 04:25:40,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3634 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=988, Invalid=9112, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 04:25:40,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2019-09-10 04:25:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 3941. [2019-09-10 04:25:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-09-10 04:25:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 5039 transitions. [2019-09-10 04:25:40,571 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 5039 transitions. Word has length 103 [2019-09-10 04:25:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:25:40,571 INFO L475 AbstractCegarLoop]: Abstraction has 3941 states and 5039 transitions. [2019-09-10 04:25:40,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 04:25:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 5039 transitions. [2019-09-10 04:25:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 04:25:40,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:25:40,575 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] [2019-09-10 04:25:40,575 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:25:40,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:40,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1567936969, now seen corresponding path program 1 times [2019-09-10 04:25:40,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:25:40,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:40,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:25:40,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:40,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:25:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:25:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:25:40,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:25:40,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:25:40,698 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 04:25:40,700 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [130], [132], [135], [139], [141], [146], [154], [155], [156], [159], [175], [177], [188], [189], [192], [208], [210], [212], [215], [219], [221], [222], [223], [224], [227], [243], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:25:40,706 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:25:40,707 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:25:40,714 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:25:41,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:25:41,024 INFO L272 AbstractInterpreter]: Visited 78 different actions 475 times. Merged at 17 different actions 114 times. Widened at 1 different actions 1 times. Performed 3834 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3834 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 25 fixpoints after 8 different actions. Largest state had 74 variables. [2019-09-10 04:25:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:41,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:25:41,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:25:41,026 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:25:41,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:25:41,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:25:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:25:41,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:25:41,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:25:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 04:25:41,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:25:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:25:41,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:25:41,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:25:41,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:25:41,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:25:41,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:25:41,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:25:41,498 INFO L87 Difference]: Start difference. First operand 3941 states and 5039 transitions. Second operand 5 states. [2019-09-10 04:25:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:25:41,806 INFO L93 Difference]: Finished difference Result 5938 states and 7392 transitions. [2019-09-10 04:25:41,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:25:41,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 04:25:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:25:41,833 INFO L225 Difference]: With dead ends: 5938 [2019-09-10 04:25:41,833 INFO L226 Difference]: Without dead ends: 5938 [2019-09-10 04:25:41,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:25:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5938 states. [2019-09-10 04:25:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5938 to 5936. [2019-09-10 04:25:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5936 states. [2019-09-10 04:25:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5936 states to 5936 states and 7391 transitions. [2019-09-10 04:25:41,965 INFO L78 Accepts]: Start accepts. Automaton has 5936 states and 7391 transitions. Word has length 104 [2019-09-10 04:25:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:25:41,965 INFO L475 AbstractCegarLoop]: Abstraction has 5936 states and 7391 transitions. [2019-09-10 04:25:41,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:25:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 5936 states and 7391 transitions. [2019-09-10 04:25:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 04:25:41,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:25:41,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:41,968 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:25:41,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:41,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1219268335, now seen corresponding path program 1 times [2019-09-10 04:25:41,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:25:41,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:41,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:25:41,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:41,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:25:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:25:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 04:25:42,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:25:42,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:25:42,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 04:25:42,435 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [132], [135], [139], [149], [154], [155], [156], [159], [162], [167], [170], [177], [179], [182], [186], [188], [189], [192], [208], [210], [212], [215], [219], [221], [222], [223], [224], [227], [243], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:25:42,441 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:25:42,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:25:42,453 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:25:43,158 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:25:43,159 INFO L272 AbstractInterpreter]: Visited 81 different actions 784 times. Merged at 18 different actions 207 times. Widened at 1 different actions 2 times. Performed 5370 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5370 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 44 fixpoints after 7 different actions. Largest state had 74 variables. [2019-09-10 04:25:43,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:43,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:25:43,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:25:43,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:25:43,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:25:43,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:25:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:25:43,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 04:25:43,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:25:43,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:25:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:25:43,990 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:25:44,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:25:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 04:25:44,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:25:44,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 41 [2019-09-10 04:25:44,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:25:44,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 04:25:44,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 04:25:44,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 04:25:44,761 INFO L87 Difference]: Start difference. First operand 5936 states and 7391 transitions. Second operand 31 states. [2019-09-10 04:25:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:25:52,093 INFO L93 Difference]: Finished difference Result 24183 states and 30898 transitions. [2019-09-10 04:25:52,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-10 04:25:52,094 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 105 [2019-09-10 04:25:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:25:52,188 INFO L225 Difference]: With dead ends: 24183 [2019-09-10 04:25:52,188 INFO L226 Difference]: Without dead ends: 24171 [2019-09-10 04:25:52,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3686 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2537, Invalid=11269, Unknown=0, NotChecked=0, Total=13806 [2019-09-10 04:25:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24171 states. [2019-09-10 04:25:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24171 to 21888. [2019-09-10 04:25:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21888 states. [2019-09-10 04:25:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21888 states to 21888 states and 27919 transitions. [2019-09-10 04:25:52,934 INFO L78 Accepts]: Start accepts. Automaton has 21888 states and 27919 transitions. Word has length 105 [2019-09-10 04:25:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:25:52,935 INFO L475 AbstractCegarLoop]: Abstraction has 21888 states and 27919 transitions. [2019-09-10 04:25:52,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 04:25:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 21888 states and 27919 transitions. [2019-09-10 04:25:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 04:25:52,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:25:52,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:52,939 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:25:52,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash -51256305, now seen corresponding path program 1 times [2019-09-10 04:25:52,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:25:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:52,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:25:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:52,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:25:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:25:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:25:53,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:25:53,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:25:53,328 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 04:25:53,329 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [132], [135], [139], [152], [154], [155], [156], [159], [162], [167], [170], [177], [179], [182], [186], [188], [189], [192], [195], [200], [203], [210], [212], [215], [219], [221], [222], [223], [224], [227], [243], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:25:53,331 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:25:53,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:25:53,338 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:25:54,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:25:54,323 INFO L272 AbstractInterpreter]: Visited 83 different actions 725 times. Merged at 18 different actions 178 times. Widened at 1 different actions 1 times. Performed 5455 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5455 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 36 fixpoints after 6 different actions. Largest state had 74 variables. [2019-09-10 04:25:54,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:54,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:25:54,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:25:54,324 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:25:54,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:25:54,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:25:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:25:54,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-10 04:25:54,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:25:55,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:25:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:25:55,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:25:56,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:25:56,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:25:57,399 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-09-10 04:25:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:25:58,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:25:58,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 26] total 68 [2019-09-10 04:25:58,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:25:58,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 04:25:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 04:25:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=4179, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 04:25:58,336 INFO L87 Difference]: Start difference. First operand 21888 states and 27919 transitions. Second operand 44 states. [2019-09-10 04:26:00,235 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 04:26:00,428 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 04:26:00,599 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 04:26:00,913 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 04:26:01,121 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 04:26:01,318 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 04:26:01,648 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 04:26:01,882 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 04:26:02,110 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 04:26:02,492 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 04:26:02,725 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 04:26:03,278 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 04:26:03,504 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 04:26:03,903 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 04:26:04,556 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 04:26:05,170 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 04:26:05,363 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 04:26:05,974 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 04:26:07,945 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 04:26:08,116 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 04:26:08,756 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 04:26:08,947 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 04:26:09,120 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 04:26:09,268 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 04:26:09,447 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 04:26:10,398 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 04:26:10,559 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 04:26:17,331 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 04:26:17,821 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 04:26:20,476 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 04:26:21,810 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 04:26:22,004 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 04:26:22,931 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 04:26:23,083 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 04:26:23,359 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 04:26:23,752 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 04:26:23,943 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 04:26:24,375 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 04:26:25,393 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 04:26:27,639 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 04:26:27,932 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 04:26:28,125 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 04:26:28,924 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 04:26:29,130 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 04:26:29,325 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 04:26:29,521 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 04:26:29,754 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 04:26:30,096 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 04:26:30,238 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 04:26:30,409 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 04:26:30,576 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 04:26:30,871 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 04:26:31,019 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 04:26:31,728 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 04:26:31,890 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 04:26:32,115 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 04:26:32,427 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 04:26:32,703 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-09-10 04:26:32,867 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 04:26:33,038 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 04:26:33,230 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 04:26:33,503 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-10 04:26:33,671 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 04:26:33,876 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-09-10 04:26:34,178 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 04:26:35,787 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-09-10 04:26:35,941 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 04:26:36,496 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2019-09-10 04:26:40,228 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 04:26:40,651 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 04:26:41,317 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 04:26:41,539 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 04:26:41,799 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 04:26:41,980 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 04:26:42,234 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 04:26:42,405 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 04:26:42,600 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 04:26:42,758 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 04:26:43,283 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 04:26:43,632 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 04:26:44,743 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 04:26:44,895 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 04:26:45,222 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 04:26:45,405 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 04:26:45,603 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 04:26:45,785 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 04:26:46,007 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 04:26:46,745 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 04:26:46,989 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 04:26:47,210 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 04:26:47,399 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 04:26:47,586 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 04:26:47,804 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 04:26:47,999 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 04:26:48,185 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 04:26:48,402 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 04:26:48,579 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 04:26:48,741 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 04:26:49,222 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-09-10 04:26:49,449 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 04:26:49,659 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 04:26:49,859 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 04:26:50,042 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 04:26:50,832 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 04:26:51,024 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 04:26:51,188 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 04:26:51,393 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 04:26:51,571 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 04:26:52,453 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 04:26:52,657 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 04:26:53,229 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 04:26:53,437 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 04:26:53,625 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 04:26:53,801 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 04:26:54,101 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 04:26:54,380 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 04:26:54,591 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 04:26:54,821 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 04:26:55,041 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 04:26:55,229 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 04:26:55,436 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 04:26:55,615 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 04:26:55,795 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 04:26:55,996 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 04:26:56,282 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 04:26:56,508 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 04:26:56,732 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 04:26:56,924 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 04:26:57,112 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 04:26:57,310 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 04:26:57,491 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 04:26:58,002 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 04:26:58,224 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 04:26:58,600 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-09-10 04:26:58,790 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 04:26:59,006 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 04:26:59,189 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 04:26:59,376 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 04:26:59,554 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 04:26:59,788 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 04:26:59,987 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 04:27:00,232 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-09-10 04:27:00,423 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 04:27:00,604 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 04:27:00,789 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 04:27:00,980 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 04:27:01,175 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 04:27:01,407 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 04:27:01,575 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 04:27:01,910 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 04:27:02,130 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 04:27:02,359 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 04:27:02,523 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 04:27:02,700 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 04:27:02,910 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 04:27:03,170 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 04:27:03,439 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 04:27:03,896 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 04:27:04,120 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 04:27:04,784 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2019-09-10 04:27:04,994 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 04:27:05,173 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 04:27:05,347 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 04:27:06,428 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 04:27:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:07,307 INFO L93 Difference]: Finished difference Result 116584 states and 150820 transitions. [2019-09-10 04:27:07,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 406 states. [2019-09-10 04:27:07,308 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 105 [2019-09-10 04:27:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:07,654 INFO L225 Difference]: With dead ends: 116584 [2019-09-10 04:27:07,654 INFO L226 Difference]: Without dead ends: 116506 [2019-09-10 04:27:07,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 251 SyntacticMatches, 6 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86611 ImplicationChecksByTransitivity, 58.0s TimeCoverageRelationStatistics Valid=25237, Invalid=197075, Unknown=0, NotChecked=0, Total=222312 [2019-09-10 04:27:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116506 states. [2019-09-10 04:27:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116506 to 108493. [2019-09-10 04:27:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108493 states. [2019-09-10 04:27:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108493 states to 108493 states and 140702 transitions. [2019-09-10 04:27:11,378 INFO L78 Accepts]: Start accepts. Automaton has 108493 states and 140702 transitions. Word has length 105 [2019-09-10 04:27:11,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:11,379 INFO L475 AbstractCegarLoop]: Abstraction has 108493 states and 140702 transitions. [2019-09-10 04:27:11,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 04:27:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 108493 states and 140702 transitions. [2019-09-10 04:27:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 04:27:11,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:11,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:11,384 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:11,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:11,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2036365007, now seen corresponding path program 1 times [2019-09-10 04:27:11,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:11,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:11,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:11,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:11,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 04:27:13,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:27:13,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:27:13,402 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 04:27:13,402 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [132], [135], [139], [152], [154], [155], [156], [159], [175], [177], [179], [182], [186], [188], [189], [192], [195], [200], [203], [210], [212], [215], [219], [221], [222], [223], [224], [227], [230], [235], [238], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:27:13,404 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:27:13,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:27:13,411 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:27:13,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:27:13,776 INFO L272 AbstractInterpreter]: Visited 83 different actions 655 times. Merged at 18 different actions 150 times. Widened at 1 different actions 1 times. Performed 4945 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4945 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 32 fixpoints after 6 different actions. Largest state had 74 variables. [2019-09-10 04:27:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:13,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:27:13,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:27:13,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:27:13,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:13,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:27:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:13,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-10 04:27:13,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:27:14,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:27:16,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:27:17,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:18,103 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 04:27:18,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:18,605 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 04:27:18,829 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 04:27:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:27:19,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:27:19,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28, 32] total 74 [2019-09-10 04:27:19,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:27:19,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 04:27:19,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 04:27:19,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=587, Invalid=4815, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 04:27:19,579 INFO L87 Difference]: Start difference. First operand 108493 states and 140702 transitions. Second operand 44 states. [2019-09-10 04:27:21,811 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 04:27:22,220 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 04:27:22,504 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-09-10 04:27:23,094 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 04:27:25,782 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:27:26,005 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 04:27:31,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:31,951 INFO L93 Difference]: Finished difference Result 98894 states and 126290 transitions. [2019-09-10 04:27:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 04:27:31,952 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 105 [2019-09-10 04:27:31,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:32,203 INFO L225 Difference]: With dead ends: 98894 [2019-09-10 04:27:32,203 INFO L226 Difference]: Without dead ends: 98891 [2019-09-10 04:27:32,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 163 SyntacticMatches, 8 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5204 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=2977, Invalid=17045, Unknown=0, NotChecked=0, Total=20022 [2019-09-10 04:27:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98891 states. [2019-09-10 04:27:33,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98891 to 93393. [2019-09-10 04:27:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93393 states. [2019-09-10 04:27:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93393 states to 93393 states and 119577 transitions. [2019-09-10 04:27:34,181 INFO L78 Accepts]: Start accepts. Automaton has 93393 states and 119577 transitions. Word has length 105 [2019-09-10 04:27:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:34,181 INFO L475 AbstractCegarLoop]: Abstraction has 93393 states and 119577 transitions. [2019-09-10 04:27:34,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 04:27:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 93393 states and 119577 transitions. [2019-09-10 04:27:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 04:27:34,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:34,186 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:34,186 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:34,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1862924703, now seen corresponding path program 1 times [2019-09-10 04:27:34,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:34,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:34,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:34,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:34,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:27:35,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:27:35,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:27:35,109 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 04:27:35,109 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [132], [135], [139], [152], [154], [155], [156], [159], [162], [165], [177], [179], [182], [186], [188], [189], [192], [195], [200], [203], [210], [212], [215], [219], [221], [222], [223], [224], [227], [230], [235], [238], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:27:35,110 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:27:35,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:27:35,116 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:27:35,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:27:35,401 INFO L272 AbstractInterpreter]: Visited 84 different actions 714 times. Merged at 18 different actions 170 times. Widened at 1 different actions 1 times. Performed 4939 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4939 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 37 fixpoints after 5 different actions. Largest state had 74 variables. [2019-09-10 04:27:35,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:35,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:27:35,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:27:35,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:27:35,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:35,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:27:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:35,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-10 04:27:35,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:27:36,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:36,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:36,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:36,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:36,989 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-10 04:27:36,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:37,396 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 40 [2019-09-10 04:27:37,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:27:37,970 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:27:38,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:39,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:39,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:40,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:27:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:27:40,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:27:40,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 27] total 72 [2019-09-10 04:27:40,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:27:40,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 04:27:40,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 04:27:40,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=4797, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 04:27:40,988 INFO L87 Difference]: Start difference. First operand 93393 states and 119577 transitions. Second operand 49 states. [2019-09-10 04:27:42,583 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-09-10 04:27:43,872 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2019-09-10 04:27:44,124 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 04:27:44,424 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-09-10 04:27:44,802 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-09-10 04:27:45,324 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 57 [2019-09-10 04:27:45,701 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 45 [2019-09-10 04:27:46,276 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 59 [2019-09-10 04:27:46,794 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 59 [2019-09-10 04:27:47,145 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 04:27:47,457 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-09-10 04:27:48,283 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-09-10 04:27:48,600 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-10 04:27:48,983 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-09-10 04:27:49,299 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-10 04:27:49,584 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 04:27:50,373 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-09-10 04:27:50,724 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2019-09-10 04:27:51,156 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 77 [2019-09-10 04:27:51,395 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-09-10 04:27:52,043 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 04:27:52,767 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 94 [2019-09-10 04:27:53,597 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 04:27:54,433 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 96 [2019-09-10 04:27:54,724 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-09-10 04:27:55,345 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 04:27:55,761 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2019-09-10 04:27:56,294 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 66 [2019-09-10 04:27:56,677 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 04:27:57,097 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 04:27:57,817 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 04:27:59,294 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 04:27:59,488 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-09-10 04:28:01,040 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 04:28:01,493 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 04:28:01,686 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-09-10 04:28:02,267 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 04:28:02,997 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-09-10 04:28:03,407 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2019-09-10 04:28:04,280 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 04:28:05,042 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-09-10 04:28:05,727 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 04:28:06,112 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 04:28:06,541 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-10 04:28:07,042 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-10 04:28:07,473 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 04:28:07,861 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2019-09-10 04:28:08,395 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-09-10 04:28:11,998 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 04:28:12,341 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 56 [2019-09-10 04:28:13,074 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 04:28:13,740 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-09-10 04:28:14,342 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-09-10 04:28:14,835 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2019-09-10 04:28:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:28:16,025 INFO L93 Difference]: Finished difference Result 102588 states and 130706 transitions. [2019-09-10 04:28:16,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-10 04:28:16,026 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 106 [2019-09-10 04:28:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:28:16,220 INFO L225 Difference]: With dead ends: 102588 [2019-09-10 04:28:16,221 INFO L226 Difference]: Without dead ends: 102558 [2019-09-10 04:28:16,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 195 SyntacticMatches, 8 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11942 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=5221, Invalid=37009, Unknown=0, NotChecked=0, Total=42230 [2019-09-10 04:28:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102558 states. [2019-09-10 04:28:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102558 to 97458. [2019-09-10 04:28:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97458 states. [2019-09-10 04:28:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97458 states to 97458 states and 124456 transitions. [2019-09-10 04:28:18,251 INFO L78 Accepts]: Start accepts. Automaton has 97458 states and 124456 transitions. Word has length 106 [2019-09-10 04:28:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:28:18,251 INFO L475 AbstractCegarLoop]: Abstraction has 97458 states and 124456 transitions. [2019-09-10 04:28:18,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 04:28:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 97458 states and 124456 transitions. [2019-09-10 04:28:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:28:18,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:28:18,261 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 04:28:18,261 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:28:18,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1413869909, now seen corresponding path program 1 times [2019-09-10 04:28:18,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:28:18,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:18,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:28:18,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:18,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:28:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:28:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-10 04:28:18,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:28:18,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:28:18,350 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 04:28:18,350 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [132], [135], [139], [149], [154], [155], [156], [159], [162], [165], [177], [179], [182], [186], [188], [189], [192], [208], [210], [212], [215], [219], [221], [222], [223], [224], [227], [230], [235], [238], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:28:18,352 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:28:18,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:28:18,358 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:28:18,769 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:28:18,769 INFO L272 AbstractInterpreter]: Visited 82 different actions 928 times. Merged at 18 different actions 241 times. Widened at 1 different actions 2 times. Performed 6966 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6966 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 49 fixpoints after 6 different actions. Largest state had 74 variables. [2019-09-10 04:28:18,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:18,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:28:18,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:28:18,770 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:28:18,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:28:18,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:28:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:28:19,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:28:19,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:28:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 77 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 04:28:19,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:28:19,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:19,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:19,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 28 proven. 11 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-10 04:28:19,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:28:19,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:28:19,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:28:19,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:28:19,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:28:19,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:28:19,843 INFO L87 Difference]: Start difference. First operand 97458 states and 124456 transitions. Second operand 13 states. [2019-09-10 04:28:20,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:28:20,691 INFO L93 Difference]: Finished difference Result 93869 states and 121233 transitions. [2019-09-10 04:28:20,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:28:20,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 145 [2019-09-10 04:28:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:28:20,876 INFO L225 Difference]: With dead ends: 93869 [2019-09-10 04:28:20,876 INFO L226 Difference]: Without dead ends: 93869 [2019-09-10 04:28:20,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 282 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:28:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93869 states. [2019-09-10 04:28:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93869 to 89930. [2019-09-10 04:28:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89930 states. [2019-09-10 04:28:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89930 states to 89930 states and 113108 transitions. [2019-09-10 04:28:22,667 INFO L78 Accepts]: Start accepts. Automaton has 89930 states and 113108 transitions. Word has length 145 [2019-09-10 04:28:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:28:22,667 INFO L475 AbstractCegarLoop]: Abstraction has 89930 states and 113108 transitions. [2019-09-10 04:28:22,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:28:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 89930 states and 113108 transitions. [2019-09-10 04:28:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 04:28:22,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:28:22,671 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 04:28:22,672 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:28:22,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:22,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1086559436, now seen corresponding path program 1 times [2019-09-10 04:28:22,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:28:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:22,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:28:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:22,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:28:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:28:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-10 04:28:22,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:28:22,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:28:22,757 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2019-09-10 04:28:22,758 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [132], [135], [139], [149], [154], [155], [156], [159], [162], [165], [177], [179], [182], [186], [188], [189], [192], [195], [198], [210], [212], [215], [219], [221], [222], [223], [224], [227], [230], [235], [238], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:28:22,759 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:28:22,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:28:22,767 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:28:23,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:28:23,126 INFO L272 AbstractInterpreter]: Visited 83 different actions 808 times. Merged at 18 different actions 205 times. Widened at 1 different actions 2 times. Performed 5931 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5931 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 43 fixpoints after 6 different actions. Largest state had 74 variables. [2019-09-10 04:28:23,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:23,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:28:23,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:28:23,126 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:28:23,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:28:23,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:28:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:28:23,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 04:28:23,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:28:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 26 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:28:23,434 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:28:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-10 04:28:23,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:28:23,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2019-09-10 04:28:23,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:28:23,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 04:28:23,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 04:28:23,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-09-10 04:28:23,664 INFO L87 Difference]: Start difference. First operand 89930 states and 113108 transitions. Second operand 16 states. [2019-09-10 04:28:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:28:25,355 INFO L93 Difference]: Finished difference Result 85162 states and 106086 transitions. [2019-09-10 04:28:25,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 04:28:25,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 146 [2019-09-10 04:28:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:28:25,511 INFO L225 Difference]: With dead ends: 85162 [2019-09-10 04:28:25,511 INFO L226 Difference]: Without dead ends: 85162 [2019-09-10 04:28:25,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=346, Invalid=1136, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 04:28:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85162 states. [2019-09-10 04:28:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85162 to 85028. [2019-09-10 04:28:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85028 states. [2019-09-10 04:28:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85028 states to 85028 states and 105909 transitions. [2019-09-10 04:28:27,313 INFO L78 Accepts]: Start accepts. Automaton has 85028 states and 105909 transitions. Word has length 146 [2019-09-10 04:28:27,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:28:27,314 INFO L475 AbstractCegarLoop]: Abstraction has 85028 states and 105909 transitions. [2019-09-10 04:28:27,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 04:28:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 85028 states and 105909 transitions. [2019-09-10 04:28:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 04:28:27,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:28:27,337 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 04:28:27,337 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:28:27,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:27,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1953738576, now seen corresponding path program 1 times [2019-09-10 04:28:27,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:28:27,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:27,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:28:27,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:27,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:28:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:28:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 44 proven. 16 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-10 04:28:27,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:28:27,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:28:27,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2019-09-10 04:28:27,480 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [130], [132], [135], [139], [141], [146], [154], [155], [156], [159], [162], [165], [175], [177], [179], [182], [186], [188], [189], [192], [195], [198], [208], [210], [212], [215], [219], [221], [222], [223], [224], [227], [243], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:28:27,481 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:28:27,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:28:27,488 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:28:27,990 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:28:27,990 INFO L272 AbstractInterpreter]: Visited 85 different actions 1138 times. Merged at 24 different actions 344 times. Widened at 1 different actions 4 times. Performed 7203 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7203 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 89 fixpoints after 8 different actions. Largest state had 74 variables. [2019-09-10 04:28:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:27,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:28:27,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:28:27,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:28:28,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:28:28,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:28:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:28:28,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:28:28,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:28:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 139 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-10 04:28:28,227 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:28:28,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:28,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:28,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 44 proven. 22 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-09-10 04:28:28,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:28:28,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:28:28,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:28:28,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:28:28,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:28:28,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:28:28,430 INFO L87 Difference]: Start difference. First operand 85028 states and 105909 transitions. Second operand 13 states. [2019-09-10 04:28:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:28:29,290 INFO L93 Difference]: Finished difference Result 45950 states and 60408 transitions. [2019-09-10 04:28:29,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:28:29,291 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 184 [2019-09-10 04:28:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:28:29,401 INFO L225 Difference]: With dead ends: 45950 [2019-09-10 04:28:29,401 INFO L226 Difference]: Without dead ends: 45950 [2019-09-10 04:28:29,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 359 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:28:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45950 states. [2019-09-10 04:28:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45950 to 43005. [2019-09-10 04:28:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43005 states. [2019-09-10 04:28:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43005 states to 43005 states and 53526 transitions. [2019-09-10 04:28:30,611 INFO L78 Accepts]: Start accepts. Automaton has 43005 states and 53526 transitions. Word has length 184 [2019-09-10 04:28:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:28:30,611 INFO L475 AbstractCegarLoop]: Abstraction has 43005 states and 53526 transitions. [2019-09-10 04:28:30,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:28:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 43005 states and 53526 transitions. [2019-09-10 04:28:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 04:28:30,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:28:30,623 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 04:28:30,623 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:28:30,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:30,624 INFO L82 PathProgramCache]: Analyzing trace with hash 167253542, now seen corresponding path program 1 times [2019-09-10 04:28:30,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:28:30,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:30,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:28:30,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:30,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:28:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:28:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-10 04:28:30,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:28:30,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:28:30,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2019-09-10 04:28:30,824 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [130], [132], [135], [139], [141], [146], [154], [155], [156], [159], [162], [165], [175], [177], [179], [182], [186], [188], [189], [192], [195], [198], [208], [210], [212], [215], [219], [221], [222], [223], [224], [227], [230], [233], [243], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:28:30,825 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:28:30,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:28:30,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:28:31,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:28:31,741 INFO L272 AbstractInterpreter]: Visited 87 different actions 2067 times. Merged at 26 different actions 688 times. Widened at 1 different actions 9 times. Performed 12712 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12712 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 181 fixpoints after 8 different actions. Largest state had 74 variables. [2019-09-10 04:28:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:31,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:28:31,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:28:31,742 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:28:31,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:28:31,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:28:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:28:31,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 04:28:31,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:28:32,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:32,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 62 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:28:32,564 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:28:33,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:28:33,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:28:33,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:28:33,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:28:33,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:28:33,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:28:33,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:28:33,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:28:33,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:28:33,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:28:33,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,517 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-09-10 04:28:33,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:33,870 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-09-10 04:28:33,938 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-09-10 04:28:35,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:28:35,951 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 45 proven. 56 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-10 04:28:35,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:28:35,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 21] total 44 [2019-09-10 04:28:35,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:28:35,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 04:28:35,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 04:28:35,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1711, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 04:28:35,965 INFO L87 Difference]: Start difference. First operand 43005 states and 53526 transitions. Second operand 25 states. [2019-09-10 04:28:36,362 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:28:37,185 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:28:37,481 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:28:38,461 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 04:28:38,842 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 04:28:39,141 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 04:28:39,468 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 04:28:39,808 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:28:40,007 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 04:28:40,248 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:28:40,502 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:28:40,666 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:28:41,881 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:28:42,107 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 04:28:42,265 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:28:42,469 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:28:42,802 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:28:43,004 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:28:43,625 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:28:43,901 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:28:44,639 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 04:28:44,849 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 04:28:45,141 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:28:45,394 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 04:28:45,624 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 04:28:46,015 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 04:28:46,407 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 04:28:46,687 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 04:28:47,057 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 04:28:47,266 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:28:47,486 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:28:47,753 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 04:28:48,001 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 04:28:48,258 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:28:48,466 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:28:49,116 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:28:49,678 WARN L188 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:28:49,839 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:28:50,004 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:28:50,209 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:28:50,402 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 04:28:50,569 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 04:28:50,796 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:28:51,085 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 04:28:51,558 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 04:28:52,730 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:28:53,014 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 04:28:53,240 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:28:53,641 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:28:53,910 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:28:54,107 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:28:55,199 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 04:28:55,466 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 04:28:55,830 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:28:56,124 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 04:28:56,364 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 04:28:56,640 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 04:28:57,141 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 04:28:57,506 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 04:28:57,864 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 04:28:58,146 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:28:58,672 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 04:28:59,048 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 04:28:59,261 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:28:59,541 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:28:59,801 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-09-10 04:29:00,032 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 04:29:00,287 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 04:29:00,633 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:29:00,877 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:29:01,042 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:29:01,226 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:29:01,476 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 04:29:01,862 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 04:29:02,181 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 04:29:02,758 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:29:02,917 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:29:03,239 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 04:29:03,475 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 04:29:04,165 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:29:04,377 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 04:29:04,627 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:29:05,015 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:29:05,426 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:29:05,812 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 04:29:06,119 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 04:29:06,457 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:29:06,665 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:29:07,049 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:29:07,355 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:29:08,474 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:29:08,709 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:29:09,511 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:29:09,730 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 04:29:09,989 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 04:29:10,354 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:29:10,641 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:29:10,865 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 04:29:11,069 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 04:29:11,382 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:29:11,622 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:29:11,929 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 04:29:12,284 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:29:12,448 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:29:12,894 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:29:13,166 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 04:29:13,473 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:29:13,893 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 04:29:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:29:15,387 INFO L93 Difference]: Finished difference Result 76979 states and 94840 transitions. [2019-09-10 04:29:15,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-10 04:29:15,387 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 185 [2019-09-10 04:29:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:29:15,530 INFO L225 Difference]: With dead ends: 76979 [2019-09-10 04:29:15,531 INFO L226 Difference]: Without dead ends: 76979 [2019-09-10 04:29:15,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 355 SyntacticMatches, 24 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 8224 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=4125, Invalid=21635, Unknown=0, NotChecked=0, Total=25760 [2019-09-10 04:29:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76979 states. [2019-09-10 04:29:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76979 to 68092. [2019-09-10 04:29:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68092 states. [2019-09-10 04:29:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68092 states to 68092 states and 84855 transitions. [2019-09-10 04:29:16,999 INFO L78 Accepts]: Start accepts. Automaton has 68092 states and 84855 transitions. Word has length 185 [2019-09-10 04:29:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:29:17,000 INFO L475 AbstractCegarLoop]: Abstraction has 68092 states and 84855 transitions. [2019-09-10 04:29:17,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 04:29:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 68092 states and 84855 transitions. [2019-09-10 04:29:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 04:29:17,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:29:17,010 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 04:29:17,010 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:29:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:29:17,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1805173196, now seen corresponding path program 1 times [2019-09-10 04:29:17,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:29:17,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:29:17,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:29:17,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:29:17,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:29:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:29:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-10 04:29:17,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:29:17,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:29:17,112 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2019-09-10 04:29:17,112 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [132], [135], [139], [149], [154], [155], [156], [159], [162], [165], [177], [179], [182], [186], [188], [189], [192], [195], [198], [200], [203], [210], [212], [215], [219], [221], [222], [223], [224], [227], [230], [233], [243], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:29:17,115 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:29:17,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:29:17,122 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:29:18,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:29:18,342 INFO L272 AbstractInterpreter]: Visited 85 different actions 1791 times. Merged at 21 different actions 559 times. Widened at 1 different actions 6 times. Performed 12902 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12902 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 130 fixpoints after 7 different actions. Largest state had 74 variables. [2019-09-10 04:29:18,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:29:18,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:29:18,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:29:18,343 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:29:18,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:29:18,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:29:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:29:18,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:29:18,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:29:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 148 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 04:29:18,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:29:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-10 04:29:18,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:29:18,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 5] total 15 [2019-09-10 04:29:18,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:29:18,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:29:18,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:29:18,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:29:18,778 INFO L87 Difference]: Start difference. First operand 68092 states and 84855 transitions. Second operand 13 states. [2019-09-10 04:29:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:29:19,666 INFO L93 Difference]: Finished difference Result 30237 states and 39184 transitions. [2019-09-10 04:29:19,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 04:29:19,671 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-09-10 04:29:19,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:29:19,730 INFO L225 Difference]: With dead ends: 30237 [2019-09-10 04:29:19,730 INFO L226 Difference]: Without dead ends: 30237 [2019-09-10 04:29:19,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2019-09-10 04:29:19,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30237 states. [2019-09-10 04:29:20,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30237 to 23228. [2019-09-10 04:29:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23228 states. [2019-09-10 04:29:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23228 states to 23228 states and 27555 transitions. [2019-09-10 04:29:20,496 INFO L78 Accepts]: Start accepts. Automaton has 23228 states and 27555 transitions. Word has length 186 [2019-09-10 04:29:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:29:20,496 INFO L475 AbstractCegarLoop]: Abstraction has 23228 states and 27555 transitions. [2019-09-10 04:29:20,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:29:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 23228 states and 27555 transitions. [2019-09-10 04:29:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 04:29:20,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:29:20,503 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 04:29:20,503 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:29:20,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:29:20,504 INFO L82 PathProgramCache]: Analyzing trace with hash -904919032, now seen corresponding path program 1 times [2019-09-10 04:29:20,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:29:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:29:20,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:29:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:29:20,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:29:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:29:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 36 proven. 70 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-10 04:29:21,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:29:21,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:29:21,017 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2019-09-10 04:29:21,017 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [97], [98], [99], [101], [110], [114], [116], [118], [124], [127], [132], [135], [139], [152], [154], [155], [156], [159], [162], [165], [167], [170], [177], [179], [182], [186], [188], [189], [192], [195], [198], [200], [203], [210], [212], [215], [219], [221], [222], [223], [224], [227], [230], [233], [243], [245], [247], [250], [254], [256], [257], [260], [262], [265], [267], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285] [2019-09-10 04:29:21,022 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:29:21,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:29:21,028 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:29:21,306 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:29:21,306 INFO L272 AbstractInterpreter]: Visited 87 different actions 942 times. Merged at 22 different actions 276 times. Widened at 1 different actions 2 times. Performed 6060 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6060 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 73 fixpoints after 9 different actions. Largest state had 74 variables. [2019-09-10 04:29:21,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:29:21,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:29:21,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:29:21,307 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:29:21,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:29:21,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:29:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:29:21,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-10 04:29:21,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:29:22,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:22,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:23,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 50 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:29:24,194 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:29:24,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:25,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:25,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:25,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:25,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:25,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:25,663 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-09-10 04:29:28,033 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 04:29:28,039 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2019-09-10 04:29:28,376 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2019-09-10 04:29:28,728 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2019-09-10 04:29:29,111 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2019-09-10 04:29:29,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:29,138 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2019-09-10 04:29:33,719 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 73 [2019-09-10 04:29:33,724 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 64 [2019-09-10 04:29:36,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:37,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:37,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:37,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:29:37,689 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 04:29:38,012 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 1300