java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:04:16,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:04:16,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:04:16,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:04:16,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:04:16,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:04:16,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:04:16,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:04:16,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:04:16,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:04:16,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:04:16,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:04:16,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:04:16,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:04:16,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:04:16,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:04:16,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:04:16,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:04:16,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:04:16,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:04:16,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:04:16,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:04:16,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:04:16,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:04:16,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:04:16,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:04:16,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:04:16,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:04:16,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:04:16,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:04:16,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:04:16,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:04:16,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:04:16,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:04:16,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:04:16,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:04:16,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:04:16,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:04:16,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:04:16,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:04:16,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:04:16,443 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:04:16,472 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:04:16,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:04:16,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:04:16,474 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:04:16,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:04:16,475 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:04:16,475 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:04:16,475 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:04:16,475 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:04:16,476 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:04:16,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:04:16,478 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:04:16,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:04:16,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:04:16,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:04:16,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:04:16,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:04:16,480 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:04:16,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:04:16,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:04:16,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:04:16,481 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:04:16,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:04:16,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:04:16,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:04:16,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:04:16,482 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:04:16,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:04:16,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:04:16,482 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:04:16,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:04:16,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:04:16,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:04:16,557 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:04:16,558 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:04:16,559 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 08:04:16,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e80a0ff/c4637fce9c194b72ba3bbafde77c94c8/FLAG6e644b54e [2019-09-10 08:04:17,074 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:04:17,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 08:04:17,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e80a0ff/c4637fce9c194b72ba3bbafde77c94c8/FLAG6e644b54e [2019-09-10 08:04:17,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e80a0ff/c4637fce9c194b72ba3bbafde77c94c8 [2019-09-10 08:04:17,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:04:17,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:04:17,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:04:17,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:04:17,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:04:17,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:04:17" (1/1) ... [2019-09-10 08:04:17,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffd4eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:17, skipping insertion in model container [2019-09-10 08:04:17,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:04:17" (1/1) ... [2019-09-10 08:04:17,484 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:04:17,545 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:04:17,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:04:17,937 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:04:18,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:04:18,056 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:04:18,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:18 WrapperNode [2019-09-10 08:04:18,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:04:18,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:04:18,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:04:18,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:04:18,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:18" (1/1) ... [2019-09-10 08:04:18,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:18" (1/1) ... [2019-09-10 08:04:18,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:18" (1/1) ... [2019-09-10 08:04:18,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:18" (1/1) ... [2019-09-10 08:04:18,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:18" (1/1) ... [2019-09-10 08:04:18,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:18" (1/1) ... [2019-09-10 08:04:18,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:18" (1/1) ... [2019-09-10 08:04:18,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:04:18,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:04:18,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:04:18,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:04:18,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:04:18,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:04:18,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:04:18,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:04:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:04:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:04:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:04:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:04:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:04:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:04:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:04:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:04:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:04:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:04:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:04:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:04:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:04:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:04:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:04:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:04:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:04:18,955 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:04:18,955 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:04:18,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:04:18 BoogieIcfgContainer [2019-09-10 08:04:18,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:04:18,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:04:18,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:04:18,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:04:18,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:04:17" (1/3) ... [2019-09-10 08:04:18,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6dc912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:04:18, skipping insertion in model container [2019-09-10 08:04:18,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:18" (2/3) ... [2019-09-10 08:04:18,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6dc912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:04:18, skipping insertion in model container [2019-09-10 08:04:18,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:04:18" (3/3) ... [2019-09-10 08:04:18,966 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 08:04:18,978 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:04:18,997 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:04:19,015 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:04:19,043 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:04:19,043 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:04:19,044 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:04:19,044 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:04:19,044 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:04:19,044 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:04:19,045 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:04:19,045 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:04:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-09-10 08:04:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:04:19,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:19,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:19,082 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:19,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:19,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1001395215, now seen corresponding path program 1 times [2019-09-10 08:04:19,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:19,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:19,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:19,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:19,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:04:19,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:19,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:04:19,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:04:19,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:04:19,653 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 3 states. [2019-09-10 08:04:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:19,778 INFO L93 Difference]: Finished difference Result 237 states and 392 transitions. [2019-09-10 08:04:19,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:04:19,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 08:04:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:19,794 INFO L225 Difference]: With dead ends: 237 [2019-09-10 08:04:19,795 INFO L226 Difference]: Without dead ends: 229 [2019-09-10 08:04:19,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:04:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-10 08:04:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-09-10 08:04:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 08:04:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 325 transitions. [2019-09-10 08:04:19,855 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 325 transitions. Word has length 80 [2019-09-10 08:04:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:19,856 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 325 transitions. [2019-09-10 08:04:19,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:04:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 325 transitions. [2019-09-10 08:04:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:04:19,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:19,859 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:19,860 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:19,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:19,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1695070945, now seen corresponding path program 1 times [2019-09-10 08:04:19,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:19,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:19,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:19,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:20,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:20,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:20,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:20,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:20,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:20,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:20,130 INFO L87 Difference]: Start difference. First operand 227 states and 325 transitions. Second operand 5 states. [2019-09-10 08:04:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:20,327 INFO L93 Difference]: Finished difference Result 227 states and 322 transitions. [2019-09-10 08:04:20,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:20,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:04:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:20,330 INFO L225 Difference]: With dead ends: 227 [2019-09-10 08:04:20,330 INFO L226 Difference]: Without dead ends: 227 [2019-09-10 08:04:20,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:20,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-10 08:04:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-10 08:04:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 08:04:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 322 transitions. [2019-09-10 08:04:20,356 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 322 transitions. Word has length 82 [2019-09-10 08:04:20,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:20,357 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 322 transitions. [2019-09-10 08:04:20,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 322 transitions. [2019-09-10 08:04:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:04:20,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:20,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:20,364 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1498664087, now seen corresponding path program 1 times [2019-09-10 08:04:20,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:20,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:20,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:20,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:20,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 08:04:20,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:20,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:20,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:20,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:20,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:20,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:20,571 INFO L87 Difference]: Start difference. First operand 227 states and 322 transitions. Second operand 5 states. [2019-09-10 08:04:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:20,809 INFO L93 Difference]: Finished difference Result 227 states and 319 transitions. [2019-09-10 08:04:20,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:20,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-10 08:04:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:20,814 INFO L225 Difference]: With dead ends: 227 [2019-09-10 08:04:20,814 INFO L226 Difference]: Without dead ends: 227 [2019-09-10 08:04:20,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-10 08:04:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-10 08:04:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 08:04:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2019-09-10 08:04:20,844 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 83 [2019-09-10 08:04:20,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:20,844 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2019-09-10 08:04:20,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2019-09-10 08:04:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:04:20,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:20,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:20,850 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash 565537234, now seen corresponding path program 1 times [2019-09-10 08:04:20,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:20,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:20,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:20,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:20,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:21,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:21,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:21,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:21,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:21,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:21,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:21,009 INFO L87 Difference]: Start difference. First operand 227 states and 319 transitions. Second operand 5 states. [2019-09-10 08:04:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:21,182 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2019-09-10 08:04:21,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:21,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 08:04:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:21,186 INFO L225 Difference]: With dead ends: 227 [2019-09-10 08:04:21,186 INFO L226 Difference]: Without dead ends: 227 [2019-09-10 08:04:21,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-10 08:04:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-10 08:04:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 08:04:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 316 transitions. [2019-09-10 08:04:21,197 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 316 transitions. Word has length 84 [2019-09-10 08:04:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:21,198 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 316 transitions. [2019-09-10 08:04:21,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 316 transitions. [2019-09-10 08:04:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:21,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:21,201 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:21,202 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash 219817577, now seen corresponding path program 1 times [2019-09-10 08:04:21,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:21,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:21,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:21,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:21,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:21,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:21,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:21,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:21,330 INFO L87 Difference]: Start difference. First operand 227 states and 316 transitions. Second operand 5 states. [2019-09-10 08:04:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:21,482 INFO L93 Difference]: Finished difference Result 227 states and 313 transitions. [2019-09-10 08:04:21,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:21,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 08:04:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:21,484 INFO L225 Difference]: With dead ends: 227 [2019-09-10 08:04:21,484 INFO L226 Difference]: Without dead ends: 227 [2019-09-10 08:04:21,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-10 08:04:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-10 08:04:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 08:04:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-09-10 08:04:21,492 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 85 [2019-09-10 08:04:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:21,492 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-09-10 08:04:21,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-09-10 08:04:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:04:21,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:21,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:21,494 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash 693792033, now seen corresponding path program 1 times [2019-09-10 08:04:21,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:21,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:21,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:21,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:21,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:21,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:21,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:21,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:21,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:21,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:21,609 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 5 states. [2019-09-10 08:04:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:21,775 INFO L93 Difference]: Finished difference Result 227 states and 310 transitions. [2019-09-10 08:04:21,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:21,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 08:04:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:21,777 INFO L225 Difference]: With dead ends: 227 [2019-09-10 08:04:21,777 INFO L226 Difference]: Without dead ends: 227 [2019-09-10 08:04:21,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-10 08:04:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-10 08:04:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 08:04:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 310 transitions. [2019-09-10 08:04:21,785 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 310 transitions. Word has length 86 [2019-09-10 08:04:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:21,785 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 310 transitions. [2019-09-10 08:04:21,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 310 transitions. [2019-09-10 08:04:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:04:21,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:21,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:21,787 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash -320560505, now seen corresponding path program 1 times [2019-09-10 08:04:21,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:21,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:21,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:21,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:21,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:04:21,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:21,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:04:21,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:04:21,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:21,931 INFO L87 Difference]: Start difference. First operand 227 states and 310 transitions. Second operand 7 states. [2019-09-10 08:04:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:22,113 INFO L93 Difference]: Finished difference Result 765 states and 1107 transitions. [2019-09-10 08:04:22,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:04:22,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-10 08:04:22,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:22,118 INFO L225 Difference]: With dead ends: 765 [2019-09-10 08:04:22,118 INFO L226 Difference]: Without dead ends: 765 [2019-09-10 08:04:22,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:04:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-09-10 08:04:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 286. [2019-09-10 08:04:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-10 08:04:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 399 transitions. [2019-09-10 08:04:22,131 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 399 transitions. Word has length 87 [2019-09-10 08:04:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:22,131 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 399 transitions. [2019-09-10 08:04:22,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:04:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 399 transitions. [2019-09-10 08:04:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:04:22,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:22,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:22,133 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash -411004634, now seen corresponding path program 1 times [2019-09-10 08:04:22,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:22,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:22,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:22,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:22,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:22,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:22,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:22,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:22,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:22,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:22,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:22,226 INFO L87 Difference]: Start difference. First operand 286 states and 399 transitions. Second operand 5 states. [2019-09-10 08:04:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:22,322 INFO L93 Difference]: Finished difference Result 488 states and 698 transitions. [2019-09-10 08:04:22,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:22,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 08:04:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:22,325 INFO L225 Difference]: With dead ends: 488 [2019-09-10 08:04:22,326 INFO L226 Difference]: Without dead ends: 488 [2019-09-10 08:04:22,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:04:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-10 08:04:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 421. [2019-09-10 08:04:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-10 08:04:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 603 transitions. [2019-09-10 08:04:22,356 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 603 transitions. Word has length 87 [2019-09-10 08:04:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:22,356 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 603 transitions. [2019-09-10 08:04:22,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 603 transitions. [2019-09-10 08:04:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:04:22,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:22,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:22,358 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:22,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:22,358 INFO L82 PathProgramCache]: Analyzing trace with hash -141069036, now seen corresponding path program 1 times [2019-09-10 08:04:22,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:22,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:22,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:22,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:22,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:04:22,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:22,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:04:22,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:04:22,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:04:22,419 INFO L87 Difference]: Start difference. First operand 421 states and 603 transitions. Second operand 3 states. [2019-09-10 08:04:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:22,443 INFO L93 Difference]: Finished difference Result 684 states and 979 transitions. [2019-09-10 08:04:22,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:04:22,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 08:04:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:22,448 INFO L225 Difference]: With dead ends: 684 [2019-09-10 08:04:22,448 INFO L226 Difference]: Without dead ends: 684 [2019-09-10 08:04:22,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:04:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-09-10 08:04:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 682. [2019-09-10 08:04:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-10 08:04:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 978 transitions. [2019-09-10 08:04:22,470 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 978 transitions. Word has length 87 [2019-09-10 08:04:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:22,471 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 978 transitions. [2019-09-10 08:04:22,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:04:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 978 transitions. [2019-09-10 08:04:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:04:22,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:22,472 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:22,473 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:22,473 INFO L82 PathProgramCache]: Analyzing trace with hash 63922835, now seen corresponding path program 1 times [2019-09-10 08:04:22,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:22,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:22,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:22,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:22,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:04:22,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:22,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:04:22,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:04:22,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:04:22,556 INFO L87 Difference]: Start difference. First operand 682 states and 978 transitions. Second operand 3 states. [2019-09-10 08:04:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:22,618 INFO L93 Difference]: Finished difference Result 795 states and 1138 transitions. [2019-09-10 08:04:22,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:04:22,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 08:04:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:22,626 INFO L225 Difference]: With dead ends: 795 [2019-09-10 08:04:22,626 INFO L226 Difference]: Without dead ends: 795 [2019-09-10 08:04:22,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:04:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-09-10 08:04:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2019-09-10 08:04:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-09-10 08:04:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1137 transitions. [2019-09-10 08:04:22,655 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1137 transitions. Word has length 87 [2019-09-10 08:04:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:22,655 INFO L475 AbstractCegarLoop]: Abstraction has 793 states and 1137 transitions. [2019-09-10 08:04:22,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:04:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1137 transitions. [2019-09-10 08:04:22,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:04:22,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:22,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:22,658 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:22,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2048530461, now seen corresponding path program 1 times [2019-09-10 08:04:22,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:22,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:22,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:22,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:22,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:22,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:22,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:04:22,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:22,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:04:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:04:22,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:22,834 INFO L87 Difference]: Start difference. First operand 793 states and 1137 transitions. Second operand 7 states. [2019-09-10 08:04:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:23,009 INFO L93 Difference]: Finished difference Result 2515 states and 3651 transitions. [2019-09-10 08:04:23,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:04:23,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-10 08:04:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:23,022 INFO L225 Difference]: With dead ends: 2515 [2019-09-10 08:04:23,022 INFO L226 Difference]: Without dead ends: 2515 [2019-09-10 08:04:23,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2019-09-10 08:04:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 1134. [2019-09-10 08:04:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-09-10 08:04:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1635 transitions. [2019-09-10 08:04:23,075 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1635 transitions. Word has length 87 [2019-09-10 08:04:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:23,075 INFO L475 AbstractCegarLoop]: Abstraction has 1134 states and 1635 transitions. [2019-09-10 08:04:23,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:04:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1635 transitions. [2019-09-10 08:04:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:04:23,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:23,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:23,077 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash -194393284, now seen corresponding path program 1 times [2019-09-10 08:04:23,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:23,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:23,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:23,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:23,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:23,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:23,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:04:23,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:23,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:04:23,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:04:23,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:23,293 INFO L87 Difference]: Start difference. First operand 1134 states and 1635 transitions. Second operand 7 states. [2019-09-10 08:04:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:23,602 INFO L93 Difference]: Finished difference Result 2764 states and 4016 transitions. [2019-09-10 08:04:23,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:04:23,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-10 08:04:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:23,615 INFO L225 Difference]: With dead ends: 2764 [2019-09-10 08:04:23,615 INFO L226 Difference]: Without dead ends: 2764 [2019-09-10 08:04:23,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:04:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2019-09-10 08:04:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 1368. [2019-09-10 08:04:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-10 08:04:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1978 transitions. [2019-09-10 08:04:23,665 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1978 transitions. Word has length 87 [2019-09-10 08:04:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:23,665 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 1978 transitions. [2019-09-10 08:04:23,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:04:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1978 transitions. [2019-09-10 08:04:23,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:04:23,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:23,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:23,667 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:23,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:23,667 INFO L82 PathProgramCache]: Analyzing trace with hash 80594002, now seen corresponding path program 1 times [2019-09-10 08:04:23,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:23,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:23,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:23,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:23,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:23,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:23,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:23,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:23,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:23,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:23,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:23,770 INFO L87 Difference]: Start difference. First operand 1368 states and 1978 transitions. Second operand 5 states. [2019-09-10 08:04:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:23,871 INFO L93 Difference]: Finished difference Result 2108 states and 3059 transitions. [2019-09-10 08:04:23,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:23,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 08:04:23,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:23,882 INFO L225 Difference]: With dead ends: 2108 [2019-09-10 08:04:23,882 INFO L226 Difference]: Without dead ends: 2108 [2019-09-10 08:04:23,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:04:23,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2019-09-10 08:04:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2058. [2019-09-10 08:04:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-10 08:04:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2992 transitions. [2019-09-10 08:04:23,946 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2992 transitions. Word has length 87 [2019-09-10 08:04:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:23,947 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2992 transitions. [2019-09-10 08:04:23,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2992 transitions. [2019-09-10 08:04:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:04:23,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:23,950 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:23,950 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:23,950 INFO L82 PathProgramCache]: Analyzing trace with hash 116389539, now seen corresponding path program 1 times [2019-09-10 08:04:23,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:23,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:23,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:23,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:23,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:24,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:24,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:24,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:24,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:24,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:24,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:24,230 INFO L87 Difference]: Start difference. First operand 2058 states and 2992 transitions. Second operand 9 states. [2019-09-10 08:04:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:24,989 INFO L93 Difference]: Finished difference Result 3951 states and 5758 transitions. [2019-09-10 08:04:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:04:24,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 08:04:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:25,013 INFO L225 Difference]: With dead ends: 3951 [2019-09-10 08:04:25,014 INFO L226 Difference]: Without dead ends: 3951 [2019-09-10 08:04:25,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:04:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2019-09-10 08:04:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 2058. [2019-09-10 08:04:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-10 08:04:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2991 transitions. [2019-09-10 08:04:25,101 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2991 transitions. Word has length 88 [2019-09-10 08:04:25,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:25,102 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2991 transitions. [2019-09-10 08:04:25,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2991 transitions. [2019-09-10 08:04:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:04:25,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:25,104 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:25,104 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:25,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:25,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2104622850, now seen corresponding path program 1 times [2019-09-10 08:04:25,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:25,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:25,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:25,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:25,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:25,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:25,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:04:25,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:25,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:04:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:04:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:04:25,393 INFO L87 Difference]: Start difference. First operand 2058 states and 2991 transitions. Second operand 10 states. [2019-09-10 08:04:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:26,292 INFO L93 Difference]: Finished difference Result 4079 states and 5916 transitions. [2019-09-10 08:04:26,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:04:26,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 08:04:26,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:26,311 INFO L225 Difference]: With dead ends: 4079 [2019-09-10 08:04:26,311 INFO L226 Difference]: Without dead ends: 4079 [2019-09-10 08:04:26,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:04:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2019-09-10 08:04:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 2058. [2019-09-10 08:04:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-10 08:04:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2987 transitions. [2019-09-10 08:04:26,413 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2987 transitions. Word has length 89 [2019-09-10 08:04:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:26,413 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2987 transitions. [2019-09-10 08:04:26,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:04:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2987 transitions. [2019-09-10 08:04:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:04:26,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:26,416 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:26,417 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:26,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2064177225, now seen corresponding path program 1 times [2019-09-10 08:04:26,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:26,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:26,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:26,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:26,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:26,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:26,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:04:26,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:26,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:04:26,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:04:26,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:04:26,728 INFO L87 Difference]: Start difference. First operand 2058 states and 2987 transitions. Second operand 10 states. [2019-09-10 08:04:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:27,614 INFO L93 Difference]: Finished difference Result 4078 states and 5912 transitions. [2019-09-10 08:04:27,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:04:27,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 08:04:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:27,632 INFO L225 Difference]: With dead ends: 4078 [2019-09-10 08:04:27,632 INFO L226 Difference]: Without dead ends: 4078 [2019-09-10 08:04:27,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:04:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2019-09-10 08:04:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 2058. [2019-09-10 08:04:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-10 08:04:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2985 transitions. [2019-09-10 08:04:27,712 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2985 transitions. Word has length 89 [2019-09-10 08:04:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:27,712 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2985 transitions. [2019-09-10 08:04:27,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:04:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2985 transitions. [2019-09-10 08:04:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:04:27,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:27,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:27,714 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:27,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2120525072, now seen corresponding path program 1 times [2019-09-10 08:04:27,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:27,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:27,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:27,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:27,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:27,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:27,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:04:27,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:27,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:04:27,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:04:27,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:04:27,992 INFO L87 Difference]: Start difference. First operand 2058 states and 2985 transitions. Second operand 10 states. [2019-09-10 08:04:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:29,091 INFO L93 Difference]: Finished difference Result 4069 states and 5890 transitions. [2019-09-10 08:04:29,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:04:29,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-10 08:04:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:29,109 INFO L225 Difference]: With dead ends: 4069 [2019-09-10 08:04:29,109 INFO L226 Difference]: Without dead ends: 4069 [2019-09-10 08:04:29,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:04:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2019-09-10 08:04:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 2058. [2019-09-10 08:04:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-10 08:04:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2979 transitions. [2019-09-10 08:04:29,157 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2979 transitions. Word has length 90 [2019-09-10 08:04:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:29,158 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2979 transitions. [2019-09-10 08:04:29,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:04:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2979 transitions. [2019-09-10 08:04:29,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:04:29,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:29,159 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:29,159 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:29,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:29,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1590865908, now seen corresponding path program 1 times [2019-09-10 08:04:29,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:29,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:29,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:29,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:29,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:29,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:29,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:04:29,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:29,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:04:29,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:04:29,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:04:29,379 INFO L87 Difference]: Start difference. First operand 2058 states and 2979 transitions. Second operand 10 states. [2019-09-10 08:04:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:30,287 INFO L93 Difference]: Finished difference Result 4049 states and 5849 transitions. [2019-09-10 08:04:30,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:04:30,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-09-10 08:04:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:30,298 INFO L225 Difference]: With dead ends: 4049 [2019-09-10 08:04:30,298 INFO L226 Difference]: Without dead ends: 4049 [2019-09-10 08:04:30,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:04:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4049 states. [2019-09-10 08:04:30,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4049 to 2058. [2019-09-10 08:04:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-10 08:04:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2972 transitions. [2019-09-10 08:04:30,346 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2972 transitions. Word has length 91 [2019-09-10 08:04:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:30,346 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2972 transitions. [2019-09-10 08:04:30,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:04:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2972 transitions. [2019-09-10 08:04:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:04:30,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:30,348 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:30,348 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:30,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:30,349 INFO L82 PathProgramCache]: Analyzing trace with hash 142408710, now seen corresponding path program 1 times [2019-09-10 08:04:30,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:30,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:30,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:30,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:30,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:31,700 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 08:04:31,876 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:04:32,050 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 08:04:32,368 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 08:04:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:33,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:33,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:04:33,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:33,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:04:33,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:04:33,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:04:33,337 INFO L87 Difference]: Start difference. First operand 2058 states and 2972 transitions. Second operand 31 states. [2019-09-10 08:04:33,517 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-10 08:04:34,590 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2019-09-10 08:04:35,020 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-09-10 08:04:35,351 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-09-10 08:04:35,813 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 89 [2019-09-10 08:04:36,323 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 103 [2019-09-10 08:04:36,952 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 123 [2019-09-10 08:04:37,677 WARN L188 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 135 [2019-09-10 08:04:38,558 WARN L188 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 163 [2019-09-10 08:04:39,588 WARN L188 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 178 [2019-09-10 08:04:39,911 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2019-09-10 08:04:40,159 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-09-10 08:04:40,600 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-09-10 08:04:41,062 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-09-10 08:04:41,466 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-09-10 08:04:41,891 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-09-10 08:04:42,562 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-10 08:04:43,078 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-10 08:04:43,811 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-09-10 08:04:44,354 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-09-10 08:04:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:49,104 INFO L93 Difference]: Finished difference Result 9570 states and 13933 transitions. [2019-09-10 08:04:49,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 08:04:49,107 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 92 [2019-09-10 08:04:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:49,126 INFO L225 Difference]: With dead ends: 9570 [2019-09-10 08:04:49,126 INFO L226 Difference]: Without dead ends: 9570 [2019-09-10 08:04:49,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=770, Invalid=3390, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:04:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9570 states. [2019-09-10 08:04:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9570 to 2083. [2019-09-10 08:04:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2019-09-10 08:04:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3001 transitions. [2019-09-10 08:04:49,211 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3001 transitions. Word has length 92 [2019-09-10 08:04:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:49,211 INFO L475 AbstractCegarLoop]: Abstraction has 2083 states and 3001 transitions. [2019-09-10 08:04:49,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:04:49,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3001 transitions. [2019-09-10 08:04:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:04:49,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:49,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:49,213 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:49,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:49,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1104384956, now seen corresponding path program 1 times [2019-09-10 08:04:49,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:49,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:49,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:50,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:50,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:04:50,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:50,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:04:50,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:04:50,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:04:50,147 INFO L87 Difference]: Start difference. First operand 2083 states and 3001 transitions. Second operand 19 states. [2019-09-10 08:04:50,709 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:04:50,903 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 08:04:51,197 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 08:04:51,490 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 08:04:51,665 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:04:51,987 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:04:52,275 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:04:52,483 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:04:52,745 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:04:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:53,819 INFO L93 Difference]: Finished difference Result 9957 states and 14496 transitions. [2019-09-10 08:04:53,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:04:53,820 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-09-10 08:04:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:53,839 INFO L225 Difference]: With dead ends: 9957 [2019-09-10 08:04:53,839 INFO L226 Difference]: Without dead ends: 9957 [2019-09-10 08:04:53,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:04:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9957 states. [2019-09-10 08:04:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9957 to 2081. [2019-09-10 08:04:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-09-10 08:04:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2995 transitions. [2019-09-10 08:04:53,923 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2995 transitions. Word has length 92 [2019-09-10 08:04:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:53,923 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 2995 transitions. [2019-09-10 08:04:53,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:04:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2995 transitions. [2019-09-10 08:04:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:04:53,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:53,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:53,925 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:53,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:53,925 INFO L82 PathProgramCache]: Analyzing trace with hash -305465437, now seen corresponding path program 1 times [2019-09-10 08:04:53,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:53,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:53,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:53,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:53,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:55,025 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:04:55,279 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:04:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:56,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:56,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-10 08:04:56,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:56,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 08:04:56,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 08:04:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:04:56,327 INFO L87 Difference]: Start difference. First operand 2081 states and 2995 transitions. Second operand 29 states. [2019-09-10 08:04:56,498 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-10 08:04:57,516 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 08:04:57,898 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 08:04:58,164 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2019-09-10 08:04:58,539 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2019-09-10 08:04:58,967 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 94 [2019-09-10 08:04:59,509 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 109 [2019-09-10 08:05:00,101 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2019-09-10 08:05:00,854 WARN L188 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 130 [2019-09-10 08:05:01,135 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 08:05:01,463 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 08:05:01,734 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 08:05:02,107 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 08:05:02,402 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 08:05:02,846 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 08:05:03,159 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 08:05:03,783 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 08:05:04,141 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 08:05:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:08,455 INFO L93 Difference]: Finished difference Result 7579 states and 11005 transitions. [2019-09-10 08:05:08,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 08:05:08,456 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 92 [2019-09-10 08:05:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:08,469 INFO L225 Difference]: With dead ends: 7579 [2019-09-10 08:05:08,469 INFO L226 Difference]: Without dead ends: 7579 [2019-09-10 08:05:08,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=666, Invalid=2414, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 08:05:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2019-09-10 08:05:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 2092. [2019-09-10 08:05:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2092 states. [2019-09-10 08:05:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 3007 transitions. [2019-09-10 08:05:08,537 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 3007 transitions. Word has length 92 [2019-09-10 08:05:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:08,537 INFO L475 AbstractCegarLoop]: Abstraction has 2092 states and 3007 transitions. [2019-09-10 08:05:08,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 08:05:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 3007 transitions. [2019-09-10 08:05:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:05:08,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:08,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:08,540 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:08,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1864540635, now seen corresponding path program 1 times [2019-09-10 08:05:08,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:08,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:08,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:08,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:08,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:09,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:09,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:05:09,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:09,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:05:09,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:05:09,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:05:09,505 INFO L87 Difference]: Start difference. First operand 2092 states and 3007 transitions. Second operand 19 states. [2019-09-10 08:05:10,052 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 08:05:10,237 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:05:10,516 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-09-10 08:05:10,965 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:05:11,126 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:05:11,431 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:05:11,682 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:05:11,893 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:05:12,122 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:05:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:13,045 INFO L93 Difference]: Finished difference Result 9981 states and 14520 transitions. [2019-09-10 08:05:13,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:05:13,048 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-09-10 08:05:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:13,067 INFO L225 Difference]: With dead ends: 9981 [2019-09-10 08:05:13,067 INFO L226 Difference]: Without dead ends: 9981 [2019-09-10 08:05:13,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:05:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9981 states. [2019-09-10 08:05:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9981 to 2091. [2019-09-10 08:05:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2019-09-10 08:05:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3001 transitions. [2019-09-10 08:05:13,153 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 3001 transitions. Word has length 92 [2019-09-10 08:05:13,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:13,153 INFO L475 AbstractCegarLoop]: Abstraction has 2091 states and 3001 transitions. [2019-09-10 08:05:13,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:05:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3001 transitions. [2019-09-10 08:05:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:05:13,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:13,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:13,155 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:13,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:13,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1961118974, now seen corresponding path program 1 times [2019-09-10 08:05:13,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:13,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:13,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:13,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:13,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:14,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:14,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:05:14,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:14,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:05:14,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:05:14,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:05:14,097 INFO L87 Difference]: Start difference. First operand 2091 states and 3001 transitions. Second operand 19 states. [2019-09-10 08:05:14,860 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 08:05:15,172 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 08:05:15,527 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2019-09-10 08:05:15,700 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 08:05:16,055 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:05:16,289 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:05:16,506 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:05:16,722 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:05:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:17,287 INFO L93 Difference]: Finished difference Result 9965 states and 14498 transitions. [2019-09-10 08:05:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:05:17,288 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2019-09-10 08:05:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:17,305 INFO L225 Difference]: With dead ends: 9965 [2019-09-10 08:05:17,305 INFO L226 Difference]: Without dead ends: 9965 [2019-09-10 08:05:17,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:05:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9965 states. [2019-09-10 08:05:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9965 to 2072. [2019-09-10 08:05:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2019-09-10 08:05:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2975 transitions. [2019-09-10 08:05:17,403 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2975 transitions. Word has length 93 [2019-09-10 08:05:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:17,404 INFO L475 AbstractCegarLoop]: Abstraction has 2072 states and 2975 transitions. [2019-09-10 08:05:17,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:05:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2975 transitions. [2019-09-10 08:05:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:05:17,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:17,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:17,406 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:17,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:17,406 INFO L82 PathProgramCache]: Analyzing trace with hash 701999135, now seen corresponding path program 1 times [2019-09-10 08:05:17,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:17,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:17,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:17,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:17,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:18,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:18,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:05:18,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:18,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:05:18,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:05:18,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:05:18,032 INFO L87 Difference]: Start difference. First operand 2072 states and 2975 transitions. Second operand 13 states. [2019-09-10 08:05:18,430 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 08:05:18,574 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 08:05:18,861 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 08:05:19,052 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 08:05:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:19,246 INFO L93 Difference]: Finished difference Result 7837 states and 11386 transitions. [2019-09-10 08:05:19,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:19,246 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-10 08:05:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:19,255 INFO L225 Difference]: With dead ends: 7837 [2019-09-10 08:05:19,255 INFO L226 Difference]: Without dead ends: 7837 [2019-09-10 08:05:19,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:05:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7837 states. [2019-09-10 08:05:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7837 to 2041. [2019-09-10 08:05:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2019-09-10 08:05:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2936 transitions. [2019-09-10 08:05:19,321 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2936 transitions. Word has length 93 [2019-09-10 08:05:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:19,322 INFO L475 AbstractCegarLoop]: Abstraction has 2041 states and 2936 transitions. [2019-09-10 08:05:19,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:05:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2936 transitions. [2019-09-10 08:05:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:05:19,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:19,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:19,324 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1241325465, now seen corresponding path program 1 times [2019-09-10 08:05:19,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:19,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:19,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:19,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:19,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:05:19,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:19,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:05:19,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:05:19,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:05:19,894 INFO L87 Difference]: Start difference. First operand 2041 states and 2936 transitions. Second operand 13 states. [2019-09-10 08:05:20,301 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 08:05:20,452 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 08:05:20,607 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 08:05:20,907 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 08:05:21,121 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 08:05:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:21,394 INFO L93 Difference]: Finished difference Result 7715 states and 11230 transitions. [2019-09-10 08:05:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:21,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-10 08:05:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:21,403 INFO L225 Difference]: With dead ends: 7715 [2019-09-10 08:05:21,404 INFO L226 Difference]: Without dead ends: 7715 [2019-09-10 08:05:21,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:05:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2019-09-10 08:05:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 2038. [2019-09-10 08:05:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2038 states. [2019-09-10 08:05:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2929 transitions. [2019-09-10 08:05:21,459 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2929 transitions. Word has length 93 [2019-09-10 08:05:21,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:21,459 INFO L475 AbstractCegarLoop]: Abstraction has 2038 states and 2929 transitions. [2019-09-10 08:05:21,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:05:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2929 transitions. [2019-09-10 08:05:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:05:21,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:21,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:21,461 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:21,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:21,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1428521857, now seen corresponding path program 1 times [2019-09-10 08:05:21,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:21,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:21,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:21,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:21,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:22,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:22,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:05:22,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:22,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:05:22,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:05:22,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:05:22,333 INFO L87 Difference]: Start difference. First operand 2038 states and 2929 transitions. Second operand 17 states. [2019-09-10 08:05:23,134 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-09-10 08:05:23,288 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 08:05:23,449 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 08:05:23,577 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-10 08:05:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:24,791 INFO L93 Difference]: Finished difference Result 7838 states and 11406 transitions. [2019-09-10 08:05:24,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:05:24,811 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2019-09-10 08:05:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:24,817 INFO L225 Difference]: With dead ends: 7838 [2019-09-10 08:05:24,818 INFO L226 Difference]: Without dead ends: 7838 [2019-09-10 08:05:24,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:05:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7838 states. [2019-09-10 08:05:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7838 to 2029. [2019-09-10 08:05:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2019-09-10 08:05:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2918 transitions. [2019-09-10 08:05:24,878 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2918 transitions. Word has length 93 [2019-09-10 08:05:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:24,878 INFO L475 AbstractCegarLoop]: Abstraction has 2029 states and 2918 transitions. [2019-09-10 08:05:24,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:05:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2918 transitions. [2019-09-10 08:05:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:05:24,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:24,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:24,880 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:24,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1704891763, now seen corresponding path program 1 times [2019-09-10 08:05:24,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:24,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:24,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:24,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:24,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:24,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:05:24,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:24,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:05:24,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:05:24,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:05:24,955 INFO L87 Difference]: Start difference. First operand 2029 states and 2918 transitions. Second operand 4 states. [2019-09-10 08:05:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:24,989 INFO L93 Difference]: Finished difference Result 2935 states and 4224 transitions. [2019-09-10 08:05:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:05:24,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-10 08:05:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:24,992 INFO L225 Difference]: With dead ends: 2935 [2019-09-10 08:05:24,993 INFO L226 Difference]: Without dead ends: 2935 [2019-09-10 08:05:24,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:05:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2019-09-10 08:05:25,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2933. [2019-09-10 08:05:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2933 states. [2019-09-10 08:05:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 4223 transitions. [2019-09-10 08:05:25,034 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 4223 transitions. Word has length 93 [2019-09-10 08:05:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:25,034 INFO L475 AbstractCegarLoop]: Abstraction has 2933 states and 4223 transitions. [2019-09-10 08:05:25,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:05:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 4223 transitions. [2019-09-10 08:05:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:05:25,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:25,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:25,036 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash -726766473, now seen corresponding path program 1 times [2019-09-10 08:05:25,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:25,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:25,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:25,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:25,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:25,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:25,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:05:25,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:25,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:05:25,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:05:25,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:05:25,108 INFO L87 Difference]: Start difference. First operand 2933 states and 4223 transitions. Second operand 5 states. [2019-09-10 08:05:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:25,163 INFO L93 Difference]: Finished difference Result 4498 states and 6471 transitions. [2019-09-10 08:05:25,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:05:25,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 08:05:25,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:25,169 INFO L225 Difference]: With dead ends: 4498 [2019-09-10 08:05:25,169 INFO L226 Difference]: Without dead ends: 4498 [2019-09-10 08:05:25,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:05:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4498 states. [2019-09-10 08:05:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4498 to 2949. [2019-09-10 08:05:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2949 states. [2019-09-10 08:05:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4225 transitions. [2019-09-10 08:05:25,217 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4225 transitions. Word has length 93 [2019-09-10 08:05:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:25,217 INFO L475 AbstractCegarLoop]: Abstraction has 2949 states and 4225 transitions. [2019-09-10 08:05:25,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:05:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4225 transitions. [2019-09-10 08:05:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:05:25,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:25,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:25,219 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:25,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash 248993705, now seen corresponding path program 1 times [2019-09-10 08:05:25,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:25,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:25,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:25,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:25,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:25,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:25,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:05:25,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:25,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:05:25,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:05:25,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:05:25,891 INFO L87 Difference]: Start difference. First operand 2949 states and 4225 transitions. Second operand 16 states. [2019-09-10 08:05:26,567 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 08:05:27,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:27,924 INFO L93 Difference]: Finished difference Result 8634 states and 12461 transitions. [2019-09-10 08:05:27,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:05:27,924 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-09-10 08:05:27,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:27,932 INFO L225 Difference]: With dead ends: 8634 [2019-09-10 08:05:27,933 INFO L226 Difference]: Without dead ends: 8630 [2019-09-10 08:05:27,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:05:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8630 states. [2019-09-10 08:05:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8630 to 2943. [2019-09-10 08:05:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2943 states. [2019-09-10 08:05:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 4216 transitions. [2019-09-10 08:05:27,998 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 4216 transitions. Word has length 94 [2019-09-10 08:05:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:27,999 INFO L475 AbstractCegarLoop]: Abstraction has 2943 states and 4216 transitions. [2019-09-10 08:05:27,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:05:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 4216 transitions. [2019-09-10 08:05:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:05:28,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:28,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:28,000 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:28,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:28,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2108767036, now seen corresponding path program 1 times [2019-09-10 08:05:28,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:28,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:28,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:29,624 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 08:05:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:30,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:30,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-10 08:05:30,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:30,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 08:05:30,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 08:05:30,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:05:30,323 INFO L87 Difference]: Start difference. First operand 2943 states and 4216 transitions. Second operand 32 states. [2019-09-10 08:05:30,496 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 08:05:31,613 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:05:31,945 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 08:05:32,157 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 08:05:32,417 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 08:05:32,703 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-09-10 08:05:33,009 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 08:05:33,376 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-10 08:05:33,767 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-09-10 08:05:34,302 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 119 [2019-09-10 08:05:34,590 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 08:05:34,860 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 08:05:35,137 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 08:05:35,313 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 08:05:35,601 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 08:05:35,897 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 08:05:36,190 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:05:36,375 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 08:05:36,705 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:05:37,268 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 08:05:37,704 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 08:05:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:43,315 INFO L93 Difference]: Finished difference Result 27083 states and 39169 transitions. [2019-09-10 08:05:43,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 08:05:43,316 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 94 [2019-09-10 08:05:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:43,344 INFO L225 Difference]: With dead ends: 27083 [2019-09-10 08:05:43,344 INFO L226 Difference]: Without dead ends: 27079 [2019-09-10 08:05:43,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=821, Invalid=3339, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:05:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27079 states. [2019-09-10 08:05:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27079 to 2947. [2019-09-10 08:05:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2019-09-10 08:05:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4220 transitions. [2019-09-10 08:05:43,482 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4220 transitions. Word has length 94 [2019-09-10 08:05:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:43,483 INFO L475 AbstractCegarLoop]: Abstraction has 2947 states and 4220 transitions. [2019-09-10 08:05:43,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 08:05:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4220 transitions. [2019-09-10 08:05:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:05:43,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:43,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:43,484 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:43,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:43,485 INFO L82 PathProgramCache]: Analyzing trace with hash -722644151, now seen corresponding path program 1 times [2019-09-10 08:05:43,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:43,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:43,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:43,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:43,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:44,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:44,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:05:44,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:44,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:05:44,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:05:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:05:44,076 INFO L87 Difference]: Start difference. First operand 2947 states and 4220 transitions. Second operand 13 states. [2019-09-10 08:05:44,325 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 08:05:44,496 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 08:05:44,677 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 08:05:44,997 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 08:05:45,236 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 08:05:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:45,499 INFO L93 Difference]: Finished difference Result 11406 states and 16469 transitions. [2019-09-10 08:05:45,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:45,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2019-09-10 08:05:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:45,514 INFO L225 Difference]: With dead ends: 11406 [2019-09-10 08:05:45,515 INFO L226 Difference]: Without dead ends: 11406 [2019-09-10 08:05:45,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-09-10 08:05:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 2926. [2019-09-10 08:05:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2926 states. [2019-09-10 08:05:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4196 transitions. [2019-09-10 08:05:45,634 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4196 transitions. Word has length 94 [2019-09-10 08:05:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:45,634 INFO L475 AbstractCegarLoop]: Abstraction has 2926 states and 4196 transitions. [2019-09-10 08:05:45,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:05:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4196 transitions. [2019-09-10 08:05:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:05:45,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:45,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:45,637 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:45,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:45,638 INFO L82 PathProgramCache]: Analyzing trace with hash -582714908, now seen corresponding path program 1 times [2019-09-10 08:05:45,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:45,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:45,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:45,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:45,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:46,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:46,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:05:46,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:46,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:05:46,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:05:46,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:05:46,123 INFO L87 Difference]: Start difference. First operand 2926 states and 4196 transitions. Second operand 12 states. [2019-09-10 08:05:46,497 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:05:46,625 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:05:46,782 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:05:47,072 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:05:47,291 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:05:47,432 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:05:47,869 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:05:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:47,950 INFO L93 Difference]: Finished difference Result 14178 states and 20495 transitions. [2019-09-10 08:05:47,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:05:47,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-09-10 08:05:47,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:47,963 INFO L225 Difference]: With dead ends: 14178 [2019-09-10 08:05:47,964 INFO L226 Difference]: Without dead ends: 14178 [2019-09-10 08:05:47,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:05:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14178 states. [2019-09-10 08:05:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14178 to 2920. [2019-09-10 08:05:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2019-09-10 08:05:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4189 transitions. [2019-09-10 08:05:48,040 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4189 transitions. Word has length 94 [2019-09-10 08:05:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:48,040 INFO L475 AbstractCegarLoop]: Abstraction has 2920 states and 4189 transitions. [2019-09-10 08:05:48,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:05:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4189 transitions. [2019-09-10 08:05:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:05:48,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:48,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:48,042 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:48,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1711227384, now seen corresponding path program 1 times [2019-09-10 08:05:48,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:48,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:48,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:48,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:48,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:48,606 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 08:05:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:48,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:48,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:05:48,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:48,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:05:48,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:05:48,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:05:48,878 INFO L87 Difference]: Start difference. First operand 2920 states and 4189 transitions. Second operand 16 states. [2019-09-10 08:05:49,334 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:05:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:50,109 INFO L93 Difference]: Finished difference Result 5647 states and 8124 transitions. [2019-09-10 08:05:50,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:05:50,109 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 95 [2019-09-10 08:05:50,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:50,113 INFO L225 Difference]: With dead ends: 5647 [2019-09-10 08:05:50,113 INFO L226 Difference]: Without dead ends: 5624 [2019-09-10 08:05:50,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:05:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5624 states. [2019-09-10 08:05:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5624 to 2578. [2019-09-10 08:05:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2019-09-10 08:05:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3704 transitions. [2019-09-10 08:05:50,151 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3704 transitions. Word has length 95 [2019-09-10 08:05:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:50,152 INFO L475 AbstractCegarLoop]: Abstraction has 2578 states and 3704 transitions. [2019-09-10 08:05:50,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:05:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3704 transitions. [2019-09-10 08:05:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:05:50,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:50,154 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:50,154 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:50,154 INFO L82 PathProgramCache]: Analyzing trace with hash -246045565, now seen corresponding path program 1 times [2019-09-10 08:05:50,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:50,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:50,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:50,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:50,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:50,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:50,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:50,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:50,218 INFO L87 Difference]: Start difference. First operand 2578 states and 3704 transitions. Second operand 3 states. [2019-09-10 08:05:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:50,248 INFO L93 Difference]: Finished difference Result 4886 states and 6953 transitions. [2019-09-10 08:05:50,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:50,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:05:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:50,253 INFO L225 Difference]: With dead ends: 4886 [2019-09-10 08:05:50,253 INFO L226 Difference]: Without dead ends: 4886 [2019-09-10 08:05:50,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states. [2019-09-10 08:05:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4886 to 4704. [2019-09-10 08:05:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4704 states. [2019-09-10 08:05:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4704 states to 4704 states and 6727 transitions. [2019-09-10 08:05:50,304 INFO L78 Accepts]: Start accepts. Automaton has 4704 states and 6727 transitions. Word has length 121 [2019-09-10 08:05:50,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:50,304 INFO L475 AbstractCegarLoop]: Abstraction has 4704 states and 6727 transitions. [2019-09-10 08:05:50,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 4704 states and 6727 transitions. [2019-09-10 08:05:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:05:50,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:50,309 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:50,309 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:50,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:50,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1261305191, now seen corresponding path program 1 times [2019-09-10 08:05:50,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:50,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:50,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:50,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:50,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:50,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:50,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:50,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:50,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:50,367 INFO L87 Difference]: Start difference. First operand 4704 states and 6727 transitions. Second operand 3 states. [2019-09-10 08:05:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:50,399 INFO L93 Difference]: Finished difference Result 8958 states and 12639 transitions. [2019-09-10 08:05:50,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:50,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:05:50,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:50,411 INFO L225 Difference]: With dead ends: 8958 [2019-09-10 08:05:50,411 INFO L226 Difference]: Without dead ends: 8958 [2019-09-10 08:05:50,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8958 states. [2019-09-10 08:05:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8958 to 8596. [2019-09-10 08:05:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2019-09-10 08:05:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 12188 transitions. [2019-09-10 08:05:50,528 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 12188 transitions. Word has length 122 [2019-09-10 08:05:50,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:50,529 INFO L475 AbstractCegarLoop]: Abstraction has 8596 states and 12188 transitions. [2019-09-10 08:05:50,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 12188 transitions. [2019-09-10 08:05:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:05:50,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:50,531 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:50,531 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2090965270, now seen corresponding path program 1 times [2019-09-10 08:05:50,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:50,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:50,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:50,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:50,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:50,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:50,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:50,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:50,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:50,594 INFO L87 Difference]: Start difference. First operand 8596 states and 12188 transitions. Second operand 3 states. [2019-09-10 08:05:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:50,634 INFO L93 Difference]: Finished difference Result 12347 states and 17347 transitions. [2019-09-10 08:05:50,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:50,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 08:05:50,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:50,647 INFO L225 Difference]: With dead ends: 12347 [2019-09-10 08:05:50,647 INFO L226 Difference]: Without dead ends: 12347 [2019-09-10 08:05:50,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12347 states. [2019-09-10 08:05:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12347 to 11829. [2019-09-10 08:05:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11829 states. [2019-09-10 08:05:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11829 states to 11829 states and 16701 transitions. [2019-09-10 08:05:50,832 INFO L78 Accepts]: Start accepts. Automaton has 11829 states and 16701 transitions. Word has length 123 [2019-09-10 08:05:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:50,832 INFO L475 AbstractCegarLoop]: Abstraction has 11829 states and 16701 transitions. [2019-09-10 08:05:50,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 11829 states and 16701 transitions. [2019-09-10 08:05:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:05:50,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:50,833 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:50,833 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:50,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1314654851, now seen corresponding path program 1 times [2019-09-10 08:05:50,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:50,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:50,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:05:50,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:50,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:05:50,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:05:50,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:05:50,935 INFO L87 Difference]: Start difference. First operand 11829 states and 16701 transitions. Second operand 7 states. [2019-09-10 08:05:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:51,389 INFO L93 Difference]: Finished difference Result 28275 states and 39252 transitions. [2019-09-10 08:05:51,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:05:51,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-09-10 08:05:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:51,413 INFO L225 Difference]: With dead ends: 28275 [2019-09-10 08:05:51,413 INFO L226 Difference]: Without dead ends: 28275 [2019-09-10 08:05:51,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:05:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28275 states. [2019-09-10 08:05:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28275 to 12945. [2019-09-10 08:05:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12945 states. [2019-09-10 08:05:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12945 states to 12945 states and 18189 transitions. [2019-09-10 08:05:51,564 INFO L78 Accepts]: Start accepts. Automaton has 12945 states and 18189 transitions. Word has length 125 [2019-09-10 08:05:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:51,564 INFO L475 AbstractCegarLoop]: Abstraction has 12945 states and 18189 transitions. [2019-09-10 08:05:51,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:05:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 12945 states and 18189 transitions. [2019-09-10 08:05:51,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:05:51,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:51,565 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:51,566 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:51,566 INFO L82 PathProgramCache]: Analyzing trace with hash 621055811, now seen corresponding path program 1 times [2019-09-10 08:05:51,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:51,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:51,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:51,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:51,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:51,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:51,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:05:51,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:51,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:05:51,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:05:51,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:05:51,654 INFO L87 Difference]: Start difference. First operand 12945 states and 18189 transitions. Second operand 7 states. [2019-09-10 08:05:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:52,145 INFO L93 Difference]: Finished difference Result 56443 states and 77652 transitions. [2019-09-10 08:05:52,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:05:52,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-09-10 08:05:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:52,193 INFO L225 Difference]: With dead ends: 56443 [2019-09-10 08:05:52,193 INFO L226 Difference]: Without dead ends: 56443 [2019-09-10 08:05:52,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:05:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56443 states. [2019-09-10 08:05:53,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56443 to 28269. [2019-09-10 08:05:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28269 states. [2019-09-10 08:05:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28269 states to 28269 states and 39745 transitions. [2019-09-10 08:05:53,222 INFO L78 Accepts]: Start accepts. Automaton has 28269 states and 39745 transitions. Word has length 125 [2019-09-10 08:05:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:53,222 INFO L475 AbstractCegarLoop]: Abstraction has 28269 states and 39745 transitions. [2019-09-10 08:05:53,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:05:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28269 states and 39745 transitions. [2019-09-10 08:05:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:05:53,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:53,227 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:53,228 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:53,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:53,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1445306896, now seen corresponding path program 1 times [2019-09-10 08:05:53,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:53,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:53,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:53,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:53,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:53,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:53,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:53,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:53,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:53,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:53,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:53,299 INFO L87 Difference]: Start difference. First operand 28269 states and 39745 transitions. Second operand 3 states. [2019-09-10 08:05:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:53,435 INFO L93 Difference]: Finished difference Result 52967 states and 72938 transitions. [2019-09-10 08:05:53,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:53,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-10 08:05:53,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:53,503 INFO L225 Difference]: With dead ends: 52967 [2019-09-10 08:05:53,503 INFO L226 Difference]: Without dead ends: 52967 [2019-09-10 08:05:53,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52967 states. [2019-09-10 08:05:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52967 to 37889. [2019-09-10 08:05:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37889 states. [2019-09-10 08:05:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37889 states to 37889 states and 52373 transitions. [2019-09-10 08:05:55,089 INFO L78 Accepts]: Start accepts. Automaton has 37889 states and 52373 transitions. Word has length 152 [2019-09-10 08:05:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:55,090 INFO L475 AbstractCegarLoop]: Abstraction has 37889 states and 52373 transitions. [2019-09-10 08:05:55,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 37889 states and 52373 transitions. [2019-09-10 08:05:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:05:55,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:55,096 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:55,096 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:55,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:55,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1807818039, now seen corresponding path program 1 times [2019-09-10 08:05:55,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:55,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:55,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:55,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:55,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:55,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:55,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:55,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:55,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:55,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:55,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:55,172 INFO L87 Difference]: Start difference. First operand 37889 states and 52373 transitions. Second operand 3 states. [2019-09-10 08:05:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:55,286 INFO L93 Difference]: Finished difference Result 46023 states and 62522 transitions. [2019-09-10 08:05:55,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:55,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-10 08:05:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:55,342 INFO L225 Difference]: With dead ends: 46023 [2019-09-10 08:05:55,342 INFO L226 Difference]: Without dead ends: 46023 [2019-09-10 08:05:55,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46023 states. [2019-09-10 08:05:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46023 to 43541. [2019-09-10 08:05:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43541 states. [2019-09-10 08:05:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43541 states to 43541 states and 59545 transitions. [2019-09-10 08:05:55,742 INFO L78 Accepts]: Start accepts. Automaton has 43541 states and 59545 transitions. Word has length 153 [2019-09-10 08:05:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:55,743 INFO L475 AbstractCegarLoop]: Abstraction has 43541 states and 59545 transitions. [2019-09-10 08:05:55,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 43541 states and 59545 transitions. [2019-09-10 08:05:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:05:55,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:55,749 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:55,750 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:55,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:55,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1886746401, now seen corresponding path program 1 times [2019-09-10 08:05:55,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:55,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:55,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:55,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:55,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:05:55,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:55,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:05:55,895 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2019-09-10 08:05:55,898 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [111], [115], [118], [121], [123], [127], [130], [133], [135], [139], [142], [145], [147], [151], [154], [157], [159], [162], [166], [169], [172], [176], [179], [182], [185], [188], [190], [193], [196], [199], [201], [204], [207], [210], [212], [215], [218], [221], [223], [226], [229], [232], [234], [236], [239], [242], [246], [248], [251], [252], [254], [257], [260], [268], [270], [273], [281], [283], [286], [294], [296], [299], [307], [309], [312], [320], [322], [331], [333], [336], [339], [341], [356], [358], [361], [364], [366], [381], [383], [386], [389], [391], [406], [408], [411], [414], [416], [431], [433], [436], [439], [441], [450], [455], [457], [460], [569], [570], [574], [575], [576] [2019-09-10 08:05:55,957 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:05:55,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:05:56,114 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:05:57,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:05:57,395 INFO L272 AbstractInterpreter]: Visited 138 different actions 986 times. Merged at 53 different actions 729 times. Widened at 23 different actions 145 times. Performed 3444 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3444 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 123 fixpoints after 23 different actions. Largest state had 157 variables. [2019-09-10 08:05:57,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:57,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:05:57,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:57,402 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 08:05:57,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:57,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:05:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:57,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:05:57,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:05:57,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:58,420 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:05:58,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:58,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:00,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:00,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:06:00,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 25 [2019-09-10 08:06:00,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:06:00,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:06:00,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:06:00,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:06:00,308 INFO L87 Difference]: Start difference. First operand 43541 states and 59545 transitions. Second operand 15 states. [2019-09-10 08:06:01,145 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 08:06:01,331 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:06:01,616 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:06:02,362 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:06:02,652 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 08:06:03,415 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 08:06:03,683 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:06:03,990 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:06:04,299 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:06:04,957 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:06:05,299 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:06:05,741 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:06:06,131 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:06:06,363 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:06:06,672 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:06:07,075 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:06:07,382 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:06:07,636 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:06:07,952 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 08:06:08,152 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:06:08,428 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:06:08,710 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:06:09,026 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:06:09,280 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:06:09,809 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:06:16,027 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:06:16,282 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:06:16,481 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:06:16,775 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:06:17,863 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:06:18,104 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:06:18,311 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:06:18,579 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:06:18,902 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:06:19,348 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:06:19,685 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:06:20,139 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 08:06:20,495 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:06:20,696 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:06:20,931 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 08:06:21,113 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:06:21,735 WARN L188 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:06:21,963 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:06:22,358 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:06:22,605 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:06:22,922 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:06:23,249 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:06:23,677 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:06:23,947 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:06:24,159 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:06:24,483 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:06:24,711 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:06:25,056 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:06:25,260 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:06:25,581 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:06:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:26,586 INFO L93 Difference]: Finished difference Result 274938 states and 371215 transitions. [2019-09-10 08:06:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 08:06:26,587 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 154 [2019-09-10 08:06:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:27,195 INFO L225 Difference]: With dead ends: 274938 [2019-09-10 08:06:27,195 INFO L226 Difference]: Without dead ends: 274938 [2019-09-10 08:06:27,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 260 SyntacticMatches, 30 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2472 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=1713, Invalid=5093, Unknown=0, NotChecked=0, Total=6806 [2019-09-10 08:06:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274938 states. [2019-09-10 08:06:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274938 to 152022. [2019-09-10 08:06:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152022 states. [2019-09-10 08:06:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152022 states to 152022 states and 206805 transitions. [2019-09-10 08:06:33,090 INFO L78 Accepts]: Start accepts. Automaton has 152022 states and 206805 transitions. Word has length 154 [2019-09-10 08:06:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:33,090 INFO L475 AbstractCegarLoop]: Abstraction has 152022 states and 206805 transitions. [2019-09-10 08:06:33,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:06:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 152022 states and 206805 transitions. [2019-09-10 08:06:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:06:33,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:33,108 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:33,108 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash -487734247, now seen corresponding path program 1 times [2019-09-10 08:06:33,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:33,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:33,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:33,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:33,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:33,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:06:33,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:06:33,466 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-10 08:06:33,467 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [111], [115], [118], [121], [123], [127], [130], [133], [135], [139], [142], [145], [147], [151], [154], [157], [159], [162], [166], [169], [172], [176], [179], [182], [185], [188], [190], [193], [196], [199], [201], [204], [207], [210], [212], [215], [218], [221], [223], [226], [229], [232], [234], [236], [239], [246], [248], [251], [252], [254], [257], [260], [263], [268], [270], [273], [281], [283], [286], [289], [294], [296], [299], [307], [309], [312], [320], [322], [331], [333], [336], [339], [341], [356], [358], [361], [364], [366], [374], [377], [383], [386], [389], [391], [406], [408], [411], [414], [416], [424], [427], [433], [436], [439], [441], [457], [460], [464], [569], [570], [574], [575], [576] [2019-09-10 08:06:33,471 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:06:33,472 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:06:33,507 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:06:34,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:06:34,026 INFO L272 AbstractInterpreter]: Visited 140 different actions 768 times. Merged at 55 different actions 549 times. Widened at 17 different actions 94 times. Performed 2801 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2801 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 63 fixpoints after 15 different actions. Largest state had 157 variables. [2019-09-10 08:06:34,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:34,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:06:34,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:06:34,028 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 08:06:34,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:34,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:06:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:34,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 08:06:34,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:06:34,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:34,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:34,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:06:35,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:35,895 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-09-10 08:06:39,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-10 08:06:39,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:06:39,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2019-09-10 08:06:39,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:06:39,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:06:39,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:06:39,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:06:39,983 INFO L87 Difference]: Start difference. First operand 152022 states and 206805 transitions. Second operand 18 states. [2019-09-10 08:06:40,930 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 08:06:41,378 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-09-10 08:06:41,824 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 08:06:42,120 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-10 08:06:42,504 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 08:06:43,186 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 08:06:43,431 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 08:06:43,600 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 08:06:43,860 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-10 08:06:44,103 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 08:06:44,358 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 08:06:45,011 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 08:06:45,330 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 08:06:45,476 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 08:06:45,712 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 08:06:46,133 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 08:06:46,662 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 08:06:46,958 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-10 08:06:49,255 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 08:06:49,449 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 08:06:49,640 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 08:06:50,008 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-09-10 08:06:50,229 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 08:06:50,551 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 08:06:50,952 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 08:06:51,114 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-09-10 08:06:51,329 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 08:06:51,593 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-10 08:06:51,872 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 08:06:52,228 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 08:06:52,488 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 08:06:52,666 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-10 08:06:53,185 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 08:06:53,442 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 08:06:53,674 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-10 08:06:53,909 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 08:06:54,231 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 08:07:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:01,717 INFO L93 Difference]: Finished difference Result 852035 states and 1144202 transitions. [2019-09-10 08:07:01,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 08:07:01,717 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 155 [2019-09-10 08:07:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:02,907 INFO L225 Difference]: With dead ends: 852035 [2019-09-10 08:07:02,907 INFO L226 Difference]: Without dead ends: 852035 [2019-09-10 08:07:02,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 247 SyntacticMatches, 52 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1789 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=1143, Invalid=3827, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 08:07:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852035 states. [2019-09-10 08:07:09,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852035 to 379585. [2019-09-10 08:07:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379585 states. [2019-09-10 08:07:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379585 states to 379585 states and 513975 transitions. [2019-09-10 08:07:16,229 INFO L78 Accepts]: Start accepts. Automaton has 379585 states and 513975 transitions. Word has length 155 [2019-09-10 08:07:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:16,229 INFO L475 AbstractCegarLoop]: Abstraction has 379585 states and 513975 transitions. [2019-09-10 08:07:16,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:07:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 379585 states and 513975 transitions. [2019-09-10 08:07:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:07:16,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:16,247 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:16,248 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1011234669, now seen corresponding path program 1 times [2019-09-10 08:07:16,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:16,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:16,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:16,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:16,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:16,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:16,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:07:16,697 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-10 08:07:16,698 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [111], [115], [118], [121], [123], [127], [130], [133], [135], [139], [142], [145], [147], [151], [154], [157], [159], [162], [166], [169], [172], [176], [179], [182], [185], [188], [190], [193], [196], [199], [201], [204], [207], [210], [212], [215], [218], [221], [223], [226], [229], [232], [234], [236], [239], [246], [248], [251], [252], [254], [257], [260], [268], [270], [273], [276], [281], [283], [286], [289], [294], [296], [299], [307], [309], [312], [320], [322], [331], [333], [336], [339], [341], [356], [358], [361], [364], [366], [374], [377], [383], [386], [389], [391], [399], [402], [408], [411], [414], [416], [431], [433], [436], [439], [441], [457], [460], [464], [569], [570], [574], [575], [576] [2019-09-10 08:07:16,708 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:07:16,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:07:16,758 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:07:17,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:07:17,288 INFO L272 AbstractInterpreter]: Visited 140 different actions 861 times. Merged at 55 different actions 635 times. Widened at 19 different actions 94 times. Performed 3016 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3016 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 77 fixpoints after 17 different actions. Largest state had 157 variables. [2019-09-10 08:07:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:17,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:07:17,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:17,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:07:17,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:17,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:07:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:17,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:07:17,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:07:17,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:17,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:18,039 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:07:18,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:18,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:21,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:21,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:07:21,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 08:07:21,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:07:21,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:07:21,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:07:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:07:21,929 INFO L87 Difference]: Start difference. First operand 379585 states and 513975 transitions. Second operand 20 states. [2019-09-10 08:07:22,067 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 08:07:22,782 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:07:23,091 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:07:23,612 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:07:23,806 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:07:24,060 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:07:24,231 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:07:24,634 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:07:25,170 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:07:25,469 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:07:25,793 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:07:26,212 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:07:26,522 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:07:26,720 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:07:26,977 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:07:27,241 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:07:27,507 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:07:27,690 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:07:28,043 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 08:07:28,891 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:07:29,165 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:07:29,522 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 08:07:31,449 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:07:31,670 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:07:32,038 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:07:32,256 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:07:32,489 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:07:32,743 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:07:32,974 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:07:33,263 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:07:33,475 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:07:33,683 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:07:34,029 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:07:34,333 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:07:34,554 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:07:34,946 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:07:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:50,371 INFO L93 Difference]: Finished difference Result 2059619 states and 2750162 transitions. [2019-09-10 08:07:50,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 08:07:50,372 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 155 [2019-09-10 08:07:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:54,415 INFO L225 Difference]: With dead ends: 2059619 [2019-09-10 08:07:54,415 INFO L226 Difference]: Without dead ends: 2059619 [2019-09-10 08:07:54,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 264 SyntacticMatches, 33 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1173, Invalid=2987, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:07:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059619 states. [2019-09-10 08:08:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059619 to 914993. [2019-09-10 08:08:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914993 states. [2019-09-10 08:08:32,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914993 states to 914993 states and 1235595 transitions. [2019-09-10 08:08:32,658 INFO L78 Accepts]: Start accepts. Automaton has 914993 states and 1235595 transitions. Word has length 155 [2019-09-10 08:08:32,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:32,658 INFO L475 AbstractCegarLoop]: Abstraction has 914993 states and 1235595 transitions. [2019-09-10 08:08:32,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:08:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 914993 states and 1235595 transitions. [2019-09-10 08:08:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:08:32,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:32,700 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:32,700 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:32,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1064288210, now seen corresponding path program 1 times [2019-09-10 08:08:32,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:32,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:32,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:32,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:32,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:32,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:32,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:08:32,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 08:08:32,925 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [111], [115], [118], [121], [123], [127], [130], [133], [135], [139], [142], [145], [147], [151], [154], [157], [159], [162], [166], [169], [172], [176], [179], [182], [185], [190], [193], [196], [199], [201], [204], [207], [210], [212], [215], [218], [221], [223], [226], [229], [232], [234], [236], [239], [246], [248], [251], [252], [254], [257], [260], [268], [270], [273], [281], [283], [286], [289], [294], [296], [299], [302], [307], [309], [312], [320], [322], [331], [333], [336], [339], [341], [349], [352], [358], [361], [364], [366], [374], [377], [383], [386], [389], [391], [406], [408], [411], [414], [416], [431], [433], [436], [439], [441], [457], [460], [464], [506], [511], [569], [570], [574], [575], [576] [2019-09-10 08:08:32,928 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:08:32,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:08:32,950 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:08:33,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:08:33,483 INFO L272 AbstractInterpreter]: Visited 141 different actions 868 times. Merged at 55 different actions 637 times. Widened at 22 different actions 143 times. Performed 3016 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3016 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 74 fixpoints after 19 different actions. Largest state had 157 variables. [2019-09-10 08:08:33,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:33,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:08:33,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:33,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:08:33,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:33,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:08:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:33,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:08:33,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:33,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:33,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:33,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:34,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:42,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:42,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:42,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:42,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:42,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:42,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:43,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:43,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:08:43,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2019-09-10 08:08:43,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:08:43,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:08:43,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:08:43,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:08:43,812 INFO L87 Difference]: Start difference. First operand 914993 states and 1235595 transitions. Second operand 21 states. [2019-09-10 08:08:49,072 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-10 08:08:55,157 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-10 08:09:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:09:34,043 INFO L93 Difference]: Finished difference Result 3778299 states and 5045057 transitions. [2019-09-10 08:09:34,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-10 08:09:34,043 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 156 [2019-09-10 08:09:34,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:09:39,831 INFO L225 Difference]: With dead ends: 3778299 [2019-09-10 08:09:39,831 INFO L226 Difference]: Without dead ends: 3778299 [2019-09-10 08:09:39,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 262 SyntacticMatches, 29 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8123 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=3993, Invalid=18357, Unknown=0, NotChecked=0, Total=22350 [2019-09-10 08:09:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778299 states. [2019-09-10 08:10:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778299 to 838216. [2019-09-10 08:10:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838216 states. [2019-09-10 08:10:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838216 states to 838216 states and 1130832 transitions. [2019-09-10 08:10:32,657 INFO L78 Accepts]: Start accepts. Automaton has 838216 states and 1130832 transitions. Word has length 156 [2019-09-10 08:10:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:32,657 INFO L475 AbstractCegarLoop]: Abstraction has 838216 states and 1130832 transitions. [2019-09-10 08:10:32,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:10:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 838216 states and 1130832 transitions. [2019-09-10 08:10:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:10:32,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:32,681 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:32,681 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash -22646475, now seen corresponding path program 1 times [2019-09-10 08:10:32,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:32,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:32,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:32,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:32,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:32,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:32,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:10:32,912 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 08:10:32,913 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [111], [115], [118], [121], [123], [127], [130], [133], [135], [139], [142], [145], [147], [151], [154], [157], [159], [162], [166], [169], [172], [176], [179], [182], [185], [188], [190], [193], [196], [201], [204], [207], [210], [212], [215], [218], [221], [223], [226], [229], [232], [234], [236], [239], [246], [248], [251], [252], [254], [257], [260], [268], [270], [273], [276], [281], [283], [286], [294], [296], [299], [302], [307], [309], [312], [320], [322], [331], [333], [336], [339], [341], [349], [352], [358], [361], [364], [366], [381], [383], [386], [389], [391], [399], [402], [408], [411], [414], [416], [431], [433], [436], [439], [441], [457], [460], [464], [496], [501], [569], [570], [574], [575], [576] [2019-09-10 08:10:32,915 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:10:32,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:10:32,935 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:10:33,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:10:33,367 INFO L272 AbstractInterpreter]: Visited 141 different actions 848 times. Merged at 55 different actions 620 times. Widened at 18 different actions 93 times. Performed 2931 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2931 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 72 fixpoints after 15 different actions. Largest state had 157 variables. [2019-09-10 08:10:33,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:33,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:10:33,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:33,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:10:33,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:33,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:10:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:33,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:10:33,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:10:33,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:33,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:33,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:33,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:33,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:10:34,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:34,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:34,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:34,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:34,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:35,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:36,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:10:36,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2019-09-10 08:10:36,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:10:36,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:10:36,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:10:36,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:10:36,980 INFO L87 Difference]: Start difference. First operand 838216 states and 1130832 transitions. Second operand 21 states. [2019-09-10 08:10:44,381 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-09-10 08:10:52,138 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 40 DAG size of output: 30