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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:38:23,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:38:23,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:38:23,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:38:23,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:38:23,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:38:23,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:38:23,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:38:23,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:38:23,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:38:23,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:38:23,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:38:23,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:38:23,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:38:23,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:38:23,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:38:23,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:38:23,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:38:23,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:38:23,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:38:23,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:38:23,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:38:23,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:38:23,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:38:23,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:38:23,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:38:23,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:38:23,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:38:23,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:38:23,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:38:23,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:38:23,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:38:23,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:38:23,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:38:23,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:38:23,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:38:23,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:38:23,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:38:23,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:38:23,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:38:23,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:38:23,458 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:38:23,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:38:23,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:38:23,475 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:38:23,475 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:38:23,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:38:23,476 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:38:23,476 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:38:23,476 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:38:23,476 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:38:23,476 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:38:23,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:38:23,477 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:38:23,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:38:23,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:38:23,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:38:23,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:38:23,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:38:23,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:38:23,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:38:23,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:38:23,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:38:23,479 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:38:23,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:38:23,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:38:23,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:38:23,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:38:23,480 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:38:23,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:38:23,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:38:23,481 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:38:23,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:38:23,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:38:23,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:38:23,531 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:38:23,531 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:38:23,532 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:38:23,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fe56102/5ea74ce7cf224be3b24b62bfbd34ff7f/FLAG03c9efe37 [2019-09-10 08:38:24,169 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:38:24,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:38:24,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fe56102/5ea74ce7cf224be3b24b62bfbd34ff7f/FLAG03c9efe37 [2019-09-10 08:38:24,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fe56102/5ea74ce7cf224be3b24b62bfbd34ff7f [2019-09-10 08:38:24,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:38:24,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:38:24,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:38:24,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:38:24,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:38:24,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:38:24" (1/1) ... [2019-09-10 08:38:24,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebb0b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:38:24, skipping insertion in model container [2019-09-10 08:38:24,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:38:24" (1/1) ... [2019-09-10 08:38:24,464 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:38:24,530 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:38:24,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:38:24,954 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:38:25,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:38:25,056 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:38:25,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:38:25 WrapperNode [2019-09-10 08:38:25,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:38:25,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:38:25,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:38:25,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:38:25,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:38:25" (1/1) ... [2019-09-10 08:38:25,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:38:25" (1/1) ... [2019-09-10 08:38:25,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:38:25" (1/1) ... [2019-09-10 08:38:25,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:38:25" (1/1) ... [2019-09-10 08:38:25,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:38:25" (1/1) ... [2019-09-10 08:38:25,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:38:25" (1/1) ... [2019-09-10 08:38:25,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:38:25" (1/1) ... [2019-09-10 08:38:25,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:38:25,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:38:25,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:38:25,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:38:25,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:38:25" (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:38:25,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:38:25,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:38:25,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:38:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:38:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:38:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:38:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:38:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:38:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:38:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:38:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:38:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:38:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:38:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:38:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:38:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:38:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:38:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:38:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:38:25,978 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:38:25,978 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:38:25,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:38:25 BoogieIcfgContainer [2019-09-10 08:38:25,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:38:25,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:38:25,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:38:25,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:38:25,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:38:24" (1/3) ... [2019-09-10 08:38:25,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a35bdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:38:25, skipping insertion in model container [2019-09-10 08:38:25,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:38:25" (2/3) ... [2019-09-10 08:38:25,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a35bdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:38:25, skipping insertion in model container [2019-09-10 08:38:25,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:38:25" (3/3) ... [2019-09-10 08:38:25,988 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:38:25,998 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:38:26,006 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:38:26,023 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:38:26,051 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:38:26,051 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:38:26,051 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:38:26,051 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:38:26,052 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:38:26,052 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:38:26,052 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:38:26,052 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:38:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-09-10 08:38:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 08:38:26,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:26,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:26,092 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:26,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:26,096 INFO L82 PathProgramCache]: Analyzing trace with hash 170153311, now seen corresponding path program 1 times [2019-09-10 08:38:26,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:26,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:26,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:26,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:26,578 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:38:26,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:26,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:26,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:26,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:26,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:26,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:26,624 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 3 states. [2019-09-10 08:38:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:26,770 INFO L93 Difference]: Finished difference Result 249 states and 408 transitions. [2019-09-10 08:38:26,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:26,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 08:38:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:26,786 INFO L225 Difference]: With dead ends: 249 [2019-09-10 08:38:26,787 INFO L226 Difference]: Without dead ends: 241 [2019-09-10 08:38:26,789 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:38:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-10 08:38:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2019-09-10 08:38:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-10 08:38:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 369 transitions. [2019-09-10 08:38:26,849 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 369 transitions. Word has length 66 [2019-09-10 08:38:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:26,850 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 369 transitions. [2019-09-10 08:38:26,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 369 transitions. [2019-09-10 08:38:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:38:26,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:26,854 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:26,855 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:26,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:26,855 INFO L82 PathProgramCache]: Analyzing trace with hash -340326208, now seen corresponding path program 1 times [2019-09-10 08:38:26,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:26,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:26,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:26,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:26,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:27,037 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:38:27,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:27,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:27,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:27,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:27,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:27,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:27,041 INFO L87 Difference]: Start difference. First operand 238 states and 369 transitions. Second operand 3 states. [2019-09-10 08:38:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:27,106 INFO L93 Difference]: Finished difference Result 399 states and 627 transitions. [2019-09-10 08:38:27,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:27,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 08:38:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:27,118 INFO L225 Difference]: With dead ends: 399 [2019-09-10 08:38:27,118 INFO L226 Difference]: Without dead ends: 399 [2019-09-10 08:38:27,122 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:38:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-10 08:38:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2019-09-10 08:38:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-09-10 08:38:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 624 transitions. [2019-09-10 08:38:27,168 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 624 transitions. Word has length 68 [2019-09-10 08:38:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:27,169 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 624 transitions. [2019-09-10 08:38:27,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 624 transitions. [2019-09-10 08:38:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 08:38:27,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:27,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:27,176 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:27,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:27,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1584902111, now seen corresponding path program 1 times [2019-09-10 08:38:27,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:27,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:27,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:27,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:27,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:27,299 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:38:27,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:27,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:27,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:27,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:27,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:27,303 INFO L87 Difference]: Start difference. First operand 395 states and 624 transitions. Second operand 3 states. [2019-09-10 08:38:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:27,341 INFO L93 Difference]: Finished difference Result 697 states and 1105 transitions. [2019-09-10 08:38:27,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:27,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 08:38:27,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:27,346 INFO L225 Difference]: With dead ends: 697 [2019-09-10 08:38:27,346 INFO L226 Difference]: Without dead ends: 697 [2019-09-10 08:38:27,347 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:38:27,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-10 08:38:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 691. [2019-09-10 08:38:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-10 08:38:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1100 transitions. [2019-09-10 08:38:27,375 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1100 transitions. Word has length 70 [2019-09-10 08:38:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:27,376 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 1100 transitions. [2019-09-10 08:38:27,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1100 transitions. [2019-09-10 08:38:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 08:38:27,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:27,379 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] [2019-09-10 08:38:27,379 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:27,379 INFO L82 PathProgramCache]: Analyzing trace with hash 834475330, now seen corresponding path program 1 times [2019-09-10 08:38:27,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:27,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:27,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:27,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:27,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:27,549 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:38:27,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:27,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:38:27,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:27,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:38:27,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:38:27,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:27,551 INFO L87 Difference]: Start difference. First operand 691 states and 1100 transitions. Second operand 5 states. [2019-09-10 08:38:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:27,762 INFO L93 Difference]: Finished difference Result 2015 states and 3258 transitions. [2019-09-10 08:38:27,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:38:27,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 08:38:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:27,774 INFO L225 Difference]: With dead ends: 2015 [2019-09-10 08:38:27,775 INFO L226 Difference]: Without dead ends: 2015 [2019-09-10 08:38:27,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 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:38:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2019-09-10 08:38:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1504. [2019-09-10 08:38:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2019-09-10 08:38:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2432 transitions. [2019-09-10 08:38:27,818 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2432 transitions. Word has length 72 [2019-09-10 08:38:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:27,818 INFO L475 AbstractCegarLoop]: Abstraction has 1504 states and 2432 transitions. [2019-09-10 08:38:27,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:38:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2432 transitions. [2019-09-10 08:38:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 08:38:27,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:27,821 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] [2019-09-10 08:38:27,821 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:27,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:27,822 INFO L82 PathProgramCache]: Analyzing trace with hash 37321009, now seen corresponding path program 1 times [2019-09-10 08:38:27,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:27,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:27,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:27,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:27,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:27,938 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:38:27,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:27,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:38:27,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:27,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:38:27,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:38:27,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:38:27,940 INFO L87 Difference]: Start difference. First operand 1504 states and 2432 transitions. Second operand 4 states. [2019-09-10 08:38:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:28,021 INFO L93 Difference]: Finished difference Result 2105 states and 3409 transitions. [2019-09-10 08:38:28,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:38:28,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-10 08:38:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:28,034 INFO L225 Difference]: With dead ends: 2105 [2019-09-10 08:38:28,034 INFO L226 Difference]: Without dead ends: 2105 [2019-09-10 08:38:28,034 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:38:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2019-09-10 08:38:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 2094. [2019-09-10 08:38:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-09-10 08:38:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3393 transitions. [2019-09-10 08:38:28,095 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3393 transitions. Word has length 73 [2019-09-10 08:38:28,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:28,096 INFO L475 AbstractCegarLoop]: Abstraction has 2094 states and 3393 transitions. [2019-09-10 08:38:28,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:38:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3393 transitions. [2019-09-10 08:38:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:38:28,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:28,099 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] [2019-09-10 08:38:28,099 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1099898857, now seen corresponding path program 1 times [2019-09-10 08:38:28,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:28,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:28,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:28,237 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:38:28,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:28,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:38:28,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:28,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:38:28,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:38:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:38:28,240 INFO L87 Difference]: Start difference. First operand 2094 states and 3393 transitions. Second operand 7 states. [2019-09-10 08:38:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:28,499 INFO L93 Difference]: Finished difference Result 5745 states and 9238 transitions. [2019-09-10 08:38:28,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:38:28,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 08:38:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:28,535 INFO L225 Difference]: With dead ends: 5745 [2019-09-10 08:38:28,535 INFO L226 Difference]: Without dead ends: 5745 [2019-09-10 08:38:28,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:38:28,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5745 states. [2019-09-10 08:38:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5745 to 5598. [2019-09-10 08:38:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5598 states. [2019-09-10 08:38:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 9025 transitions. [2019-09-10 08:38:28,803 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 9025 transitions. Word has length 74 [2019-09-10 08:38:28,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:28,804 INFO L475 AbstractCegarLoop]: Abstraction has 5598 states and 9025 transitions. [2019-09-10 08:38:28,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:38:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 9025 transitions. [2019-09-10 08:38:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 08:38:28,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:28,809 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] [2019-09-10 08:38:28,809 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:28,809 INFO L82 PathProgramCache]: Analyzing trace with hash -315368200, now seen corresponding path program 1 times [2019-09-10 08:38:28,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:28,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:28,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:28,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:28,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:28,924 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:38:28,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:28,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:38:28,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:28,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:38:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:38:28,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:38:28,926 INFO L87 Difference]: Start difference. First operand 5598 states and 9025 transitions. Second operand 4 states. [2019-09-10 08:38:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:29,079 INFO L93 Difference]: Finished difference Result 11221 states and 18147 transitions. [2019-09-10 08:38:29,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:38:29,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-10 08:38:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:29,139 INFO L225 Difference]: With dead ends: 11221 [2019-09-10 08:38:29,139 INFO L226 Difference]: Without dead ends: 11221 [2019-09-10 08:38:29,140 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:38:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11221 states. [2019-09-10 08:38:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11221 to 7916. [2019-09-10 08:38:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7916 states. [2019-09-10 08:38:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7916 states to 7916 states and 12765 transitions. [2019-09-10 08:38:29,365 INFO L78 Accepts]: Start accepts. Automaton has 7916 states and 12765 transitions. Word has length 75 [2019-09-10 08:38:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:29,366 INFO L475 AbstractCegarLoop]: Abstraction has 7916 states and 12765 transitions. [2019-09-10 08:38:29,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:38:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 7916 states and 12765 transitions. [2019-09-10 08:38:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:38:29,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:29,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:29,369 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1281911695, now seen corresponding path program 1 times [2019-09-10 08:38:29,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:29,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:29,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:29,475 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:38:29,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:29,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:29,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:29,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:29,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:29,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:29,477 INFO L87 Difference]: Start difference. First operand 7916 states and 12765 transitions. Second operand 3 states. [2019-09-10 08:38:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:29,539 INFO L93 Difference]: Finished difference Result 11626 states and 18727 transitions. [2019-09-10 08:38:29,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:29,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 08:38:29,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:29,576 INFO L225 Difference]: With dead ends: 11626 [2019-09-10 08:38:29,577 INFO L226 Difference]: Without dead ends: 11626 [2019-09-10 08:38:29,577 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:38:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11626 states. [2019-09-10 08:38:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11626 to 11624. [2019-09-10 08:38:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11624 states. [2019-09-10 08:38:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11624 states to 11624 states and 18726 transitions. [2019-09-10 08:38:29,790 INFO L78 Accepts]: Start accepts. Automaton has 11624 states and 18726 transitions. Word has length 76 [2019-09-10 08:38:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:29,790 INFO L475 AbstractCegarLoop]: Abstraction has 11624 states and 18726 transitions. [2019-09-10 08:38:29,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 11624 states and 18726 transitions. [2019-09-10 08:38:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:38:29,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:29,792 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:29,793 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:29,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:29,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1289808927, now seen corresponding path program 1 times [2019-09-10 08:38:29,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:29,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:29,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:29,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:29,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:29,853 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:38:29,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:29,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:29,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:29,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:29,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:29,855 INFO L87 Difference]: Start difference. First operand 11624 states and 18726 transitions. Second operand 3 states. [2019-09-10 08:38:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:29,935 INFO L93 Difference]: Finished difference Result 17390 states and 27821 transitions. [2019-09-10 08:38:29,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:29,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 08:38:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:29,977 INFO L225 Difference]: With dead ends: 17390 [2019-09-10 08:38:29,977 INFO L226 Difference]: Without dead ends: 17390 [2019-09-10 08:38:29,978 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:38:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17390 states. [2019-09-10 08:38:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17390 to 17388. [2019-09-10 08:38:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17388 states. [2019-09-10 08:38:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17388 states to 17388 states and 27820 transitions. [2019-09-10 08:38:30,385 INFO L78 Accepts]: Start accepts. Automaton has 17388 states and 27820 transitions. Word has length 76 [2019-09-10 08:38:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:30,385 INFO L475 AbstractCegarLoop]: Abstraction has 17388 states and 27820 transitions. [2019-09-10 08:38:30,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 17388 states and 27820 transitions. [2019-09-10 08:38:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:38:30,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:30,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:30,387 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:30,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:30,387 INFO L82 PathProgramCache]: Analyzing trace with hash -645952435, now seen corresponding path program 1 times [2019-09-10 08:38:30,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:30,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:30,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:30,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:30,448 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:38:30,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:30,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:30,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:30,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:30,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:30,451 INFO L87 Difference]: Start difference. First operand 17388 states and 27820 transitions. Second operand 3 states. [2019-09-10 08:38:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:30,561 INFO L93 Difference]: Finished difference Result 24648 states and 39158 transitions. [2019-09-10 08:38:30,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:30,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 08:38:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:30,637 INFO L225 Difference]: With dead ends: 24648 [2019-09-10 08:38:30,637 INFO L226 Difference]: Without dead ends: 24648 [2019-09-10 08:38:30,638 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:38:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24648 states. [2019-09-10 08:38:31,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24648 to 24646. [2019-09-10 08:38:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24646 states. [2019-09-10 08:38:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24646 states to 24646 states and 39157 transitions. [2019-09-10 08:38:31,540 INFO L78 Accepts]: Start accepts. Automaton has 24646 states and 39157 transitions. Word has length 76 [2019-09-10 08:38:31,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:31,540 INFO L475 AbstractCegarLoop]: Abstraction has 24646 states and 39157 transitions. [2019-09-10 08:38:31,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 24646 states and 39157 transitions. [2019-09-10 08:38:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:38:31,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:31,541 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] [2019-09-10 08:38:31,542 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:31,542 INFO L82 PathProgramCache]: Analyzing trace with hash 384202792, now seen corresponding path program 1 times [2019-09-10 08:38:31,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:31,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:31,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:31,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:31,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:31,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:31,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:38:31,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:31,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:38:31,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:38:31,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:31,711 INFO L87 Difference]: Start difference. First operand 24646 states and 39157 transitions. Second operand 5 states. [2019-09-10 08:38:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:31,895 INFO L93 Difference]: Finished difference Result 36013 states and 57038 transitions. [2019-09-10 08:38:31,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:38:31,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:38:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:31,979 INFO L225 Difference]: With dead ends: 36013 [2019-09-10 08:38:31,980 INFO L226 Difference]: Without dead ends: 36013 [2019-09-10 08:38:31,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36013 states. [2019-09-10 08:38:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36013 to 36007. [2019-09-10 08:38:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36007 states. [2019-09-10 08:38:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36007 states to 36007 states and 57035 transitions. [2019-09-10 08:38:32,635 INFO L78 Accepts]: Start accepts. Automaton has 36007 states and 57035 transitions. Word has length 77 [2019-09-10 08:38:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:32,635 INFO L475 AbstractCegarLoop]: Abstraction has 36007 states and 57035 transitions. [2019-09-10 08:38:32,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:38:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 36007 states and 57035 transitions. [2019-09-10 08:38:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:38:32,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:32,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] [2019-09-10 08:38:32,637 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:32,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1943011290, now seen corresponding path program 1 times [2019-09-10 08:38:32,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:32,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:32,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:32,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:32,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:32,830 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:38:32,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:32,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:38:32,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:32,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:38:32,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:38:32,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:32,832 INFO L87 Difference]: Start difference. First operand 36007 states and 57035 transitions. Second operand 5 states. [2019-09-10 08:38:33,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:33,109 INFO L93 Difference]: Finished difference Result 79609 states and 126067 transitions. [2019-09-10 08:38:33,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:38:33,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-10 08:38:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:34,281 INFO L225 Difference]: With dead ends: 79609 [2019-09-10 08:38:34,281 INFO L226 Difference]: Without dead ends: 79609 [2019-09-10 08:38:34,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:34,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79609 states. [2019-09-10 08:38:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79609 to 49651. [2019-09-10 08:38:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49651 states. [2019-09-10 08:38:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49651 states to 49651 states and 78372 transitions. [2019-09-10 08:38:35,085 INFO L78 Accepts]: Start accepts. Automaton has 49651 states and 78372 transitions. Word has length 80 [2019-09-10 08:38:35,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:35,086 INFO L475 AbstractCegarLoop]: Abstraction has 49651 states and 78372 transitions. [2019-09-10 08:38:35,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:38:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 49651 states and 78372 transitions. [2019-09-10 08:38:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:38:35,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:35,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:35,087 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:35,088 INFO L82 PathProgramCache]: Analyzing trace with hash 101898565, now seen corresponding path program 1 times [2019-09-10 08:38:35,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:35,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:35,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:35,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:35,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:35,186 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:38:35,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:35,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:38:35,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:35,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:38:35,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:38:35,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:35,187 INFO L87 Difference]: Start difference. First operand 49651 states and 78372 transitions. Second operand 5 states. [2019-09-10 08:38:35,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:35,487 INFO L93 Difference]: Finished difference Result 85329 states and 133453 transitions. [2019-09-10 08:38:35,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:38:35,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 08:38:35,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:35,626 INFO L225 Difference]: With dead ends: 85329 [2019-09-10 08:38:35,627 INFO L226 Difference]: Without dead ends: 85329 [2019-09-10 08:38:35,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:38:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85329 states. [2019-09-10 08:38:36,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85329 to 50739. [2019-09-10 08:38:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50739 states. [2019-09-10 08:38:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50739 states to 50739 states and 79451 transitions. [2019-09-10 08:38:36,646 INFO L78 Accepts]: Start accepts. Automaton has 50739 states and 79451 transitions. Word has length 81 [2019-09-10 08:38:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:36,646 INFO L475 AbstractCegarLoop]: Abstraction has 50739 states and 79451 transitions. [2019-09-10 08:38:36,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:38:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 50739 states and 79451 transitions. [2019-09-10 08:38:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:38:36,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:36,650 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:36,650 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:36,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:36,650 INFO L82 PathProgramCache]: Analyzing trace with hash 477987945, now seen corresponding path program 1 times [2019-09-10 08:38:36,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:36,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:36,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:36,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:36,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:36,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:36,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:36,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:36,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:36,733 INFO L87 Difference]: Start difference. First operand 50739 states and 79451 transitions. Second operand 3 states. [2019-09-10 08:38:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:36,840 INFO L93 Difference]: Finished difference Result 42729 states and 66645 transitions. [2019-09-10 08:38:36,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:36,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:38:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:36,897 INFO L225 Difference]: With dead ends: 42729 [2019-09-10 08:38:36,897 INFO L226 Difference]: Without dead ends: 42729 [2019-09-10 08:38:36,897 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:38:36,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42729 states. [2019-09-10 08:38:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42729 to 42727. [2019-09-10 08:38:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42727 states. [2019-09-10 08:38:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42727 states to 42727 states and 66644 transitions. [2019-09-10 08:38:37,603 INFO L78 Accepts]: Start accepts. Automaton has 42727 states and 66644 transitions. Word has length 107 [2019-09-10 08:38:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:37,603 INFO L475 AbstractCegarLoop]: Abstraction has 42727 states and 66644 transitions. [2019-09-10 08:38:37,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 42727 states and 66644 transitions. [2019-09-10 08:38:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:38:37,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:37,606 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:37,606 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1113947205, now seen corresponding path program 1 times [2019-09-10 08:38:37,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:37,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:37,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:37,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:37,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:37,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:38:37,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:38:37,706 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 08:38:37,708 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [158], [191], [194], [199], [214], [217], [220], [222], [224], [227], [230], [233], [236], [243], [251], [253], [256], [257], [259], [268], [271], [282], [285], [295], [303], [307], [309], [311], [314], [345], [355], [365], [383], [386], [417], [427], [437], [455], [458], [489], [499], [509], [623], [624], [628], [629], [630] [2019-09-10 08:38:37,768 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:38:37,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:38:37,970 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:38:38,163 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:38:38,166 INFO L272 AbstractInterpreter]: Visited 91 different actions 159 times. Merged at 40 different actions 63 times. Never widened. Performed 650 root evaluator evaluations with a maximum evaluation depth of 5. Performed 650 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 171 variables. [2019-09-10 08:38:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:38,170 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:38:38,488 INFO L227 lantSequenceWeakener]: Weakened 87 states. On average, predicates are now at 87.24% of their original sizes. [2019-09-10 08:38:38,488 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:38:42,929 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 08:38:42,929 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:38:42,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:38:42,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [5] total 57 [2019-09-10 08:38:42,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:42,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 08:38:42,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 08:38:42,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 08:38:42,933 INFO L87 Difference]: Start difference. First operand 42727 states and 66644 transitions. Second operand 54 states. [2019-09-10 08:40:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:16,109 INFO L93 Difference]: Finished difference Result 619286 states and 929916 transitions. [2019-09-10 08:40:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 447 states. [2019-09-10 08:40:16,109 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 107 [2019-09-10 08:40:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:17,620 INFO L225 Difference]: With dead ends: 619286 [2019-09-10 08:40:17,620 INFO L226 Difference]: Without dead ends: 619286 [2019-09-10 08:40:17,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99387 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=24342, Invalid=195150, Unknown=0, NotChecked=0, Total=219492 [2019-09-10 08:40:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619286 states. [2019-09-10 08:40:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619286 to 121811. [2019-09-10 08:40:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121811 states. [2019-09-10 08:40:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121811 states to 121811 states and 188408 transitions. [2019-09-10 08:40:26,788 INFO L78 Accepts]: Start accepts. Automaton has 121811 states and 188408 transitions. Word has length 107 [2019-09-10 08:40:26,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:26,789 INFO L475 AbstractCegarLoop]: Abstraction has 121811 states and 188408 transitions. [2019-09-10 08:40:26,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 08:40:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 121811 states and 188408 transitions. [2019-09-10 08:40:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:40:26,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:26,794 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:40:26,794 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:26,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:26,795 INFO L82 PathProgramCache]: Analyzing trace with hash 723995340, now seen corresponding path program 1 times [2019-09-10 08:40:26,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:26,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:26,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:26,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:26,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:40:26,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:26,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:40:26,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:26,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:40:26,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:40:26,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:40:26,910 INFO L87 Difference]: Start difference. First operand 121811 states and 188408 transitions. Second operand 5 states. [2019-09-10 08:40:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:27,465 INFO L93 Difference]: Finished difference Result 139948 states and 216767 transitions. [2019-09-10 08:40:27,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:40:27,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 08:40:27,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:27,713 INFO L225 Difference]: With dead ends: 139948 [2019-09-10 08:40:27,713 INFO L226 Difference]: Without dead ends: 139948 [2019-09-10 08:40:27,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:40:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139948 states. [2019-09-10 08:40:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139948 to 137294. [2019-09-10 08:40:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137294 states. [2019-09-10 08:40:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137294 states to 137294 states and 212532 transitions. [2019-09-10 08:40:33,046 INFO L78 Accepts]: Start accepts. Automaton has 137294 states and 212532 transitions. Word has length 110 [2019-09-10 08:40:33,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:33,046 INFO L475 AbstractCegarLoop]: Abstraction has 137294 states and 212532 transitions. [2019-09-10 08:40:33,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:40:33,046 INFO L276 IsEmpty]: Start isEmpty. Operand 137294 states and 212532 transitions. [2019-09-10 08:40:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:40:33,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:33,049 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:33,050 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:33,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1672529094, now seen corresponding path program 1 times [2019-09-10 08:40:33,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:33,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:33,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:33,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:33,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:40:33,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:33,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:33,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:33,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:33,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:33,116 INFO L87 Difference]: Start difference. First operand 137294 states and 212532 transitions. Second operand 3 states. [2019-09-10 08:40:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:33,833 INFO L93 Difference]: Finished difference Result 212391 states and 328523 transitions. [2019-09-10 08:40:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:40:33,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:40:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:34,200 INFO L225 Difference]: With dead ends: 212391 [2019-09-10 08:40:34,201 INFO L226 Difference]: Without dead ends: 212391 [2019-09-10 08:40:34,201 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:40:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212391 states. [2019-09-10 08:40:36,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212391 to 211869. [2019-09-10 08:40:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211869 states. [2019-09-10 08:40:36,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211869 states to 211869 states and 328002 transitions. [2019-09-10 08:40:36,999 INFO L78 Accepts]: Start accepts. Automaton has 211869 states and 328002 transitions. Word has length 111 [2019-09-10 08:40:36,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:36,999 INFO L475 AbstractCegarLoop]: Abstraction has 211869 states and 328002 transitions. [2019-09-10 08:40:36,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:40:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 211869 states and 328002 transitions. [2019-09-10 08:40:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:40:37,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:37,004 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:40:37,004 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:37,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:37,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2104094732, now seen corresponding path program 1 times [2019-09-10 08:40:37,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:37,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:37,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:37,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:37,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:37,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:37,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:37,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:37,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:37,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:37,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:37,076 INFO L87 Difference]: Start difference. First operand 211869 states and 328002 transitions. Second operand 3 states. [2019-09-10 08:40:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:37,259 INFO L93 Difference]: Finished difference Result 87753 states and 135282 transitions. [2019-09-10 08:40:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:40:37,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:40:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:37,351 INFO L225 Difference]: With dead ends: 87753 [2019-09-10 08:40:37,351 INFO L226 Difference]: Without dead ends: 87753 [2019-09-10 08:40:37,351 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:40:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87753 states. [2019-09-10 08:40:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87753 to 87751. [2019-09-10 08:40:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87751 states. [2019-09-10 08:40:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87751 states to 87751 states and 135281 transitions. [2019-09-10 08:40:41,256 INFO L78 Accepts]: Start accepts. Automaton has 87751 states and 135281 transitions. Word has length 111 [2019-09-10 08:40:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:41,256 INFO L475 AbstractCegarLoop]: Abstraction has 87751 states and 135281 transitions. [2019-09-10 08:40:41,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:40:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 87751 states and 135281 transitions. [2019-09-10 08:40:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:40:41,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:41,259 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:40:41,259 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:41,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:41,260 INFO L82 PathProgramCache]: Analyzing trace with hash 767705507, now seen corresponding path program 1 times [2019-09-10 08:40:41,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:41,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:41,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:41,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:41,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:40:41,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:41,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:40:41,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:41,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:40:41,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:40:41,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:40:41,368 INFO L87 Difference]: Start difference. First operand 87751 states and 135281 transitions. Second operand 5 states. [2019-09-10 08:40:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:41,695 INFO L93 Difference]: Finished difference Result 94949 states and 146324 transitions. [2019-09-10 08:40:41,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:40:41,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:40:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:41,799 INFO L225 Difference]: With dead ends: 94949 [2019-09-10 08:40:41,799 INFO L226 Difference]: Without dead ends: 94949 [2019-09-10 08:40:41,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:40:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94949 states. [2019-09-10 08:40:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94949 to 94779. [2019-09-10 08:40:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94779 states. [2019-09-10 08:40:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94779 states to 94779 states and 146157 transitions. [2019-09-10 08:40:43,196 INFO L78 Accepts]: Start accepts. Automaton has 94779 states and 146157 transitions. Word has length 113 [2019-09-10 08:40:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:43,196 INFO L475 AbstractCegarLoop]: Abstraction has 94779 states and 146157 transitions. [2019-09-10 08:40:43,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:40:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 94779 states and 146157 transitions. [2019-09-10 08:40:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:40:43,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:43,199 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:40:43,199 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:43,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:43,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1430128237, now seen corresponding path program 1 times [2019-09-10 08:40:43,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:43,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:43,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:40:43,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:43,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:40:43,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:43,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:40:43,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:40:43,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:40:43,338 INFO L87 Difference]: Start difference. First operand 94779 states and 146157 transitions. Second operand 4 states. [2019-09-10 08:40:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:43,766 INFO L93 Difference]: Finished difference Result 183881 states and 280887 transitions. [2019-09-10 08:40:43,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:40:43,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 08:40:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:43,985 INFO L225 Difference]: With dead ends: 183881 [2019-09-10 08:40:43,985 INFO L226 Difference]: Without dead ends: 183881 [2019-09-10 08:40:43,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:40:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183881 states. [2019-09-10 08:40:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183881 to 183879. [2019-09-10 08:40:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183879 states. [2019-09-10 08:40:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183879 states to 183879 states and 280886 transitions. [2019-09-10 08:40:46,449 INFO L78 Accepts]: Start accepts. Automaton has 183879 states and 280886 transitions. Word has length 114 [2019-09-10 08:40:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:46,450 INFO L475 AbstractCegarLoop]: Abstraction has 183879 states and 280886 transitions. [2019-09-10 08:40:46,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:40:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 183879 states and 280886 transitions. [2019-09-10 08:40:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:40:46,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:46,453 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:40:46,453 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash 710230287, now seen corresponding path program 1 times [2019-09-10 08:40:46,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:46,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:46,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:40:46,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:46,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:46,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:46,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:46,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:46,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:46,499 INFO L87 Difference]: Start difference. First operand 183879 states and 280886 transitions. Second operand 3 states. [2019-09-10 08:40:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:47,394 INFO L93 Difference]: Finished difference Result 367744 states and 561751 transitions. [2019-09-10 08:40:47,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:40:47,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 08:40:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:47,876 INFO L225 Difference]: With dead ends: 367744 [2019-09-10 08:40:47,876 INFO L226 Difference]: Without dead ends: 367744 [2019-09-10 08:40:47,876 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:40:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367744 states. [2019-09-10 08:40:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367744 to 183881. [2019-09-10 08:40:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183881 states. [2019-09-10 08:40:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183881 states to 183881 states and 280888 transitions. [2019-09-10 08:40:52,745 INFO L78 Accepts]: Start accepts. Automaton has 183881 states and 280888 transitions. Word has length 115 [2019-09-10 08:40:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:52,745 INFO L475 AbstractCegarLoop]: Abstraction has 183881 states and 280888 transitions. [2019-09-10 08:40:52,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:40:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 183881 states and 280888 transitions. [2019-09-10 08:40:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:40:52,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:52,748 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:40:52,748 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:52,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:52,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1524060780, now seen corresponding path program 1 times [2019-09-10 08:40:52,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:52,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:52,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:52,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:52,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:40:53,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:53,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:53,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:53,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:53,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:53,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:53,825 INFO L87 Difference]: Start difference. First operand 183881 states and 280888 transitions. Second operand 3 states. [2019-09-10 08:40:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:54,560 INFO L93 Difference]: Finished difference Result 357634 states and 541918 transitions. [2019-09-10 08:40:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:40:54,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 08:40:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:55,050 INFO L225 Difference]: With dead ends: 357634 [2019-09-10 08:40:55,050 INFO L226 Difference]: Without dead ends: 357634 [2019-09-10 08:40:55,051 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:40:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357634 states. [2019-09-10 08:41:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357634 to 357632. [2019-09-10 08:41:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357632 states. [2019-09-10 08:41:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357632 states to 357632 states and 541917 transitions. [2019-09-10 08:41:03,942 INFO L78 Accepts]: Start accepts. Automaton has 357632 states and 541917 transitions. Word has length 116 [2019-09-10 08:41:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:03,943 INFO L475 AbstractCegarLoop]: Abstraction has 357632 states and 541917 transitions. [2019-09-10 08:41:03,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 357632 states and 541917 transitions. [2019-09-10 08:41:03,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:41:03,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:03,949 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:41:03,949 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:03,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:03,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1435687287, now seen corresponding path program 1 times [2019-09-10 08:41:03,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:03,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:03,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:41:04,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:04,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:04,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:04,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:04,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:04,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:04,047 INFO L87 Difference]: Start difference. First operand 357632 states and 541917 transitions. Second operand 4 states. [2019-09-10 08:41:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:05,696 INFO L93 Difference]: Finished difference Result 273647 states and 413464 transitions. [2019-09-10 08:41:05,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:41:05,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-10 08:41:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:06,081 INFO L225 Difference]: With dead ends: 273647 [2019-09-10 08:41:06,082 INFO L226 Difference]: Without dead ends: 273587 [2019-09-10 08:41:06,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273587 states. [2019-09-10 08:41:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273587 to 273587. [2019-09-10 08:41:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273587 states. [2019-09-10 08:41:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273587 states to 273587 states and 413378 transitions. [2019-09-10 08:41:15,480 INFO L78 Accepts]: Start accepts. Automaton has 273587 states and 413378 transitions. Word has length 116 [2019-09-10 08:41:15,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:15,480 INFO L475 AbstractCegarLoop]: Abstraction has 273587 states and 413378 transitions. [2019-09-10 08:41:15,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:15,481 INFO L276 IsEmpty]: Start isEmpty. Operand 273587 states and 413378 transitions. [2019-09-10 08:41:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:41:15,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:15,485 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:41:15,485 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:15,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:15,486 INFO L82 PathProgramCache]: Analyzing trace with hash -562858339, now seen corresponding path program 1 times [2019-09-10 08:41:15,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:15,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:15,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:15,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:15,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:41:15,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:15,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:15,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:15,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:15,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:15,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:15,548 INFO L87 Difference]: Start difference. First operand 273587 states and 413378 transitions. Second operand 3 states. [2019-09-10 08:41:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:17,352 INFO L93 Difference]: Finished difference Result 391709 states and 592192 transitions. [2019-09-10 08:41:17,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:17,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 08:41:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:17,903 INFO L225 Difference]: With dead ends: 391709 [2019-09-10 08:41:17,903 INFO L226 Difference]: Without dead ends: 391709 [2019-09-10 08:41:17,904 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:41:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391709 states. [2019-09-10 08:41:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391709 to 375333. [2019-09-10 08:41:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375333 states. [2019-09-10 08:41:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375333 states to 375333 states and 564567 transitions. [2019-09-10 08:41:26,799 INFO L78 Accepts]: Start accepts. Automaton has 375333 states and 564567 transitions. Word has length 116 [2019-09-10 08:41:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:26,799 INFO L475 AbstractCegarLoop]: Abstraction has 375333 states and 564567 transitions. [2019-09-10 08:41:26,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 375333 states and 564567 transitions. [2019-09-10 08:41:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:41:26,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:26,804 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:41:26,804 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:26,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:26,805 INFO L82 PathProgramCache]: Analyzing trace with hash 366781120, now seen corresponding path program 1 times [2019-09-10 08:41:26,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:26,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:26,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:26,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:26,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:41:26,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:26,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:26,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:26,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:26,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:26,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:26,864 INFO L87 Difference]: Start difference. First operand 375333 states and 564567 transitions. Second operand 3 states. [2019-09-10 08:41:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:29,145 INFO L93 Difference]: Finished difference Result 524536 states and 785033 transitions. [2019-09-10 08:41:29,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:29,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 08:41:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:29,936 INFO L225 Difference]: With dead ends: 524536 [2019-09-10 08:41:29,936 INFO L226 Difference]: Without dead ends: 524536 [2019-09-10 08:41:29,936 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:41:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524536 states. [2019-09-10 08:41:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524536 to 380207. [2019-09-10 08:41:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380207 states. [2019-09-10 08:41:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380207 states to 380207 states and 570412 transitions. [2019-09-10 08:41:41,705 INFO L78 Accepts]: Start accepts. Automaton has 380207 states and 570412 transitions. Word has length 118 [2019-09-10 08:41:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:41,705 INFO L475 AbstractCegarLoop]: Abstraction has 380207 states and 570412 transitions. [2019-09-10 08:41:41,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 380207 states and 570412 transitions. [2019-09-10 08:41:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:41:41,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:41,711 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:41:41,711 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:41,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:41,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1735814953, now seen corresponding path program 1 times [2019-09-10 08:41:41,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:41,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:41,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:41,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:41,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:41,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:41:41,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:41:41,885 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 08:41:41,886 INFO L207 CegarAbsIntRunner]: [0], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [158], [161], [166], [176], [179], [181], [184], [187], [189], [191], [194], [199], [214], [217], [220], [222], [224], [227], [230], [233], [236], [243], [251], [253], [256], [257], [259], [268], [271], [282], [285], [295], [303], [307], [309], [311], [314], [332], [335], [338], [341], [343], [345], [365], [379], [381], [383], [386], [417], [427], [437], [455], [458], [489], [499], [509], [609], [612], [615], [623], [624], [628], [629], [630] [2019-09-10 08:41:41,898 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:41:41,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:41:41,931 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:41:42,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:41:42,144 INFO L272 AbstractInterpreter]: Visited 108 different actions 323 times. Merged at 57 different actions 200 times. Never widened. Performed 1098 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1098 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 8 different actions. Largest state had 172 variables. [2019-09-10 08:41:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:42,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:41:42,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:41:42,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:41:42,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:42,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:41:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:42,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:41:42,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:41:42,395 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:41:42,395 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:41:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:41:42,454 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:41:42,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2019-09-10 08:41:42,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:42,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:42,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:42,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:42,456 INFO L87 Difference]: Start difference. First operand 380207 states and 570412 transitions. Second operand 4 states. [2019-09-10 08:41:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:48,078 INFO L93 Difference]: Finished difference Result 629384 states and 942787 transitions. [2019-09-10 08:41:48,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:41:48,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-10 08:41:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:48,973 INFO L225 Difference]: With dead ends: 629384 [2019-09-10 08:41:48,973 INFO L226 Difference]: Without dead ends: 629384 [2019-09-10 08:41:48,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629384 states. [2019-09-10 08:42:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629384 to 512744. [2019-09-10 08:42:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512744 states. [2019-09-10 08:42:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512744 states to 512744 states and 768119 transitions. [2019-09-10 08:42:02,186 INFO L78 Accepts]: Start accepts. Automaton has 512744 states and 768119 transitions. Word has length 118 [2019-09-10 08:42:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:02,186 INFO L475 AbstractCegarLoop]: Abstraction has 512744 states and 768119 transitions. [2019-09-10 08:42:02,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:42:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 512744 states and 768119 transitions. [2019-09-10 08:42:02,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:42:02,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:02,191 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:42:02,191 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:02,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:02,192 INFO L82 PathProgramCache]: Analyzing trace with hash -266673369, now seen corresponding path program 1 times [2019-09-10 08:42:02,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:02,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:02,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:02,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:02,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:02,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:02,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:02,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:02,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:02,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:02,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:02,280 INFO L87 Difference]: Start difference. First operand 512744 states and 768119 transitions. Second operand 3 states. [2019-09-10 08:42:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:04,403 INFO L93 Difference]: Finished difference Result 222811 states and 332620 transitions. [2019-09-10 08:42:04,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:04,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 08:42:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:04,712 INFO L225 Difference]: With dead ends: 222811 [2019-09-10 08:42:04,712 INFO L226 Difference]: Without dead ends: 222811 [2019-09-10 08:42:04,712 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:42:04,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222811 states. [2019-09-10 08:42:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222811 to 165041. [2019-09-10 08:42:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165041 states. [2019-09-10 08:42:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165041 states to 165041 states and 248207 transitions. [2019-09-10 08:42:13,269 INFO L78 Accepts]: Start accepts. Automaton has 165041 states and 248207 transitions. Word has length 118 [2019-09-10 08:42:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:13,269 INFO L475 AbstractCegarLoop]: Abstraction has 165041 states and 248207 transitions. [2019-09-10 08:42:13,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 165041 states and 248207 transitions. [2019-09-10 08:42:13,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:42:13,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:13,273 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:42:13,273 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:13,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:13,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1646607505, now seen corresponding path program 1 times [2019-09-10 08:42:13,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:13,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:13,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:13,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:13,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:42:13,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:13,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:42:13,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:13,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:42:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:42:13,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:42:13,427 INFO L87 Difference]: Start difference. First operand 165041 states and 248207 transitions. Second operand 4 states. [2019-09-10 08:42:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:14,261 INFO L93 Difference]: Finished difference Result 269635 states and 401258 transitions. [2019-09-10 08:42:14,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:42:14,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-10 08:42:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:14,600 INFO L225 Difference]: With dead ends: 269635 [2019-09-10 08:42:14,600 INFO L226 Difference]: Without dead ends: 269635 [2019-09-10 08:42:14,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:42:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269635 states. [2019-09-10 08:42:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269635 to 269633. [2019-09-10 08:42:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269633 states. [2019-09-10 08:42:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269633 states to 269633 states and 401257 transitions. [2019-09-10 08:42:21,775 INFO L78 Accepts]: Start accepts. Automaton has 269633 states and 401257 transitions. Word has length 119 [2019-09-10 08:42:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:21,776 INFO L475 AbstractCegarLoop]: Abstraction has 269633 states and 401257 transitions. [2019-09-10 08:42:21,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:42:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 269633 states and 401257 transitions. [2019-09-10 08:42:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:42:21,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:21,782 INFO L399 BasicCegarLoop]: trace histogram [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:42:21,782 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:21,783 INFO L82 PathProgramCache]: Analyzing trace with hash 790055070, now seen corresponding path program 1 times [2019-09-10 08:42:21,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:21,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:21,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:21,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:21,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:42:21,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:21,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:21,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:21,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:21,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:21,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:21,854 INFO L87 Difference]: Start difference. First operand 269633 states and 401257 transitions. Second operand 3 states. [2019-09-10 08:42:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:24,043 INFO L93 Difference]: Finished difference Result 473957 states and 696472 transitions. [2019-09-10 08:42:24,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:24,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:42:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:24,713 INFO L225 Difference]: With dead ends: 473957 [2019-09-10 08:42:24,713 INFO L226 Difference]: Without dead ends: 473957 [2019-09-10 08:42:24,713 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:42:25,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473957 states. [2019-09-10 08:42:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473957 to 473955. [2019-09-10 08:42:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473955 states. [2019-09-10 08:42:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473955 states to 473955 states and 696471 transitions. [2019-09-10 08:42:37,223 INFO L78 Accepts]: Start accepts. Automaton has 473955 states and 696471 transitions. Word has length 121 [2019-09-10 08:42:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:37,223 INFO L475 AbstractCegarLoop]: Abstraction has 473955 states and 696471 transitions. [2019-09-10 08:42:37,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 473955 states and 696471 transitions. [2019-09-10 08:42:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:42:37,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:37,233 INFO L399 BasicCegarLoop]: trace histogram [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:42:37,233 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:37,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1680989343, now seen corresponding path program 1 times [2019-09-10 08:42:37,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:37,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:37,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:37,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:37,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:42:37,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:37,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:42:37,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:37,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:42:37,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:42:37,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:42:37,332 INFO L87 Difference]: Start difference. First operand 473955 states and 696471 transitions. Second operand 4 states. [2019-09-10 08:42:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:38,593 INFO L93 Difference]: Finished difference Result 425561 states and 624911 transitions. [2019-09-10 08:42:38,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:42:38,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-10 08:42:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:39,208 INFO L225 Difference]: With dead ends: 425561 [2019-09-10 08:42:39,208 INFO L226 Difference]: Without dead ends: 425513 [2019-09-10 08:42:39,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:42:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425513 states. [2019-09-10 08:42:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425513 to 425513. [2019-09-10 08:42:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425513 states. [2019-09-10 08:42:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425513 states to 425513 states and 624848 transitions. [2019-09-10 08:42:52,150 INFO L78 Accepts]: Start accepts. Automaton has 425513 states and 624848 transitions. Word has length 121 [2019-09-10 08:42:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:52,150 INFO L475 AbstractCegarLoop]: Abstraction has 425513 states and 624848 transitions. [2019-09-10 08:42:52,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:42:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 425513 states and 624848 transitions. [2019-09-10 08:42:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:42:52,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:52,159 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:42:52,159 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:52,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1189508418, now seen corresponding path program 1 times [2019-09-10 08:42:52,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:52,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:52,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:52,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:52,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:42:52,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:52,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:52,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:52,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:52,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:52,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:52,242 INFO L87 Difference]: Start difference. First operand 425513 states and 624848 transitions. Second operand 3 states. [2019-09-10 08:42:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:55,338 INFO L93 Difference]: Finished difference Result 596204 states and 873094 transitions. [2019-09-10 08:42:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:55,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 08:42:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:56,194 INFO L225 Difference]: With dead ends: 596204 [2019-09-10 08:42:56,195 INFO L226 Difference]: Without dead ends: 596204 [2019-09-10 08:42:56,195 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:42:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596204 states. [2019-09-10 08:43:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596204 to 430791. [2019-09-10 08:43:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430791 states. [2019-09-10 08:43:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430791 states to 430791 states and 631335 transitions. [2019-09-10 08:43:11,015 INFO L78 Accepts]: Start accepts. Automaton has 430791 states and 631335 transitions. Word has length 123 [2019-09-10 08:43:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:11,015 INFO L475 AbstractCegarLoop]: Abstraction has 430791 states and 631335 transitions. [2019-09-10 08:43:11,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 430791 states and 631335 transitions. [2019-09-10 08:43:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:43:11,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:11,026 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:43:11,027 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1176955519, now seen corresponding path program 1 times [2019-09-10 08:43:11,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:11,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:11,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:43:11,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:11,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:11,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:11,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:11,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:11,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:11,143 INFO L87 Difference]: Start difference. First operand 430791 states and 631335 transitions. Second operand 4 states. [2019-09-10 08:43:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:14,176 INFO L93 Difference]: Finished difference Result 832399 states and 1207397 transitions. [2019-09-10 08:43:14,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:43:14,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-10 08:43:14,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:23,291 INFO L225 Difference]: With dead ends: 832399 [2019-09-10 08:43:23,291 INFO L226 Difference]: Without dead ends: 832399 [2019-09-10 08:43:23,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832399 states. [2019-09-10 08:43:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832399 to 832397. [2019-09-10 08:43:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832397 states. [2019-09-10 08:43:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832397 states to 832397 states and 1207396 transitions. [2019-09-10 08:43:36,525 INFO L78 Accepts]: Start accepts. Automaton has 832397 states and 1207396 transitions. Word has length 124 [2019-09-10 08:43:36,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:36,525 INFO L475 AbstractCegarLoop]: Abstraction has 832397 states and 1207396 transitions. [2019-09-10 08:43:36,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 832397 states and 1207396 transitions. [2019-09-10 08:43:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:43:36,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:36,542 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:43:36,542 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:36,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:36,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1229350557, now seen corresponding path program 1 times [2019-09-10 08:43:36,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:36,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:36,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:36,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:36,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:43:36,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:36,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:36,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:36,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:36,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:36,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:36,585 INFO L87 Difference]: Start difference. First operand 832397 states and 1207396 transitions. Second operand 3 states. [2019-09-10 08:43:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:51,246 INFO L93 Difference]: Finished difference Result 1664702 states and 2414674 transitions. [2019-09-10 08:43:51,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:51,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 08:43:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:55,354 INFO L225 Difference]: With dead ends: 1664702 [2019-09-10 08:43:55,354 INFO L226 Difference]: Without dead ends: 1664702 [2019-09-10 08:43:55,355 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:43:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664702 states. [2019-09-10 08:44:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664702 to 832403. [2019-09-10 08:44:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832403 states. [2019-09-10 08:44:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832403 states to 832403 states and 1207402 transitions. [2019-09-10 08:44:26,334 INFO L78 Accepts]: Start accepts. Automaton has 832403 states and 1207402 transitions. Word has length 125 [2019-09-10 08:44:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:26,334 INFO L475 AbstractCegarLoop]: Abstraction has 832403 states and 1207402 transitions. [2019-09-10 08:44:26,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 832403 states and 1207402 transitions. [2019-09-10 08:44:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:44:26,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:26,355 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:44:26,356 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:26,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:26,356 INFO L82 PathProgramCache]: Analyzing trace with hash -441572160, now seen corresponding path program 1 times [2019-09-10 08:44:26,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:26,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:26,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:26,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:26,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:44:26,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:26,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:26,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:26,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:26,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:26,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:26,470 INFO L87 Difference]: Start difference. First operand 832403 states and 1207402 transitions. Second operand 4 states. [2019-09-10 08:44:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:36,720 INFO L93 Difference]: Finished difference Result 832588 states and 1207618 transitions. [2019-09-10 08:44:36,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:36,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-10 08:44:36,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:37,837 INFO L225 Difference]: With dead ends: 832588 [2019-09-10 08:44:37,837 INFO L226 Difference]: Without dead ends: 832397 [2019-09-10 08:44:37,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832397 states. [2019-09-10 08:44:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832397 to 832397. [2019-09-10 08:44:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832397 states. [2019-09-10 08:45:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832397 states to 832397 states and 1207390 transitions. [2019-09-10 08:45:03,884 INFO L78 Accepts]: Start accepts. Automaton has 832397 states and 1207390 transitions. Word has length 126 [2019-09-10 08:45:03,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:03,885 INFO L475 AbstractCegarLoop]: Abstraction has 832397 states and 1207390 transitions. [2019-09-10 08:45:03,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 832397 states and 1207390 transitions. [2019-09-10 08:45:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:45:03,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:03,900 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:45:03,900 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:03,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash -488324446, now seen corresponding path program 1 times [2019-09-10 08:45:03,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:03,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:03,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:03,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:03,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:45:03,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:03,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:03,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:03,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:03,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:03,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:03,971 INFO L87 Difference]: Start difference. First operand 832397 states and 1207390 transitions. Second operand 3 states. [2019-09-10 08:45:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:11,170 INFO L93 Difference]: Finished difference Result 1234047 states and 1768615 transitions. [2019-09-10 08:45:11,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:11,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 08:45:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:13,121 INFO L225 Difference]: With dead ends: 1234047 [2019-09-10 08:45:13,122 INFO L226 Difference]: Without dead ends: 1234047 [2019-09-10 08:45:13,122 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:45:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234047 states. [2019-09-10 08:45:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234047 to 1234045. [2019-09-10 08:45:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1234045 states. [2019-09-10 08:46:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234045 states to 1234045 states and 1768614 transitions. [2019-09-10 08:46:00,985 INFO L78 Accepts]: Start accepts. Automaton has 1234045 states and 1768614 transitions. Word has length 126 [2019-09-10 08:46:00,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:00,985 INFO L475 AbstractCegarLoop]: Abstraction has 1234045 states and 1768614 transitions. [2019-09-10 08:46:00,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1234045 states and 1768614 transitions. [2019-09-10 08:46:01,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:46:01,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:01,016 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:46:01,017 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:01,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:01,017 INFO L82 PathProgramCache]: Analyzing trace with hash -21553747, now seen corresponding path program 1 times [2019-09-10 08:46:01,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:01,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:01,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:01,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:01,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:46:01,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:01,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:46:01,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:01,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:46:01,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:46:01,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:46:01,115 INFO L87 Difference]: Start difference. First operand 1234045 states and 1768614 transitions. Second operand 5 states. [2019-09-10 08:46:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:05,943 INFO L93 Difference]: Finished difference Result 1234045 states and 1751790 transitions. [2019-09-10 08:46:18,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:46:18,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-09-10 08:46:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:20,708 INFO L225 Difference]: With dead ends: 1234045 [2019-09-10 08:46:20,708 INFO L226 Difference]: Without dead ends: 1234045 [2019-09-10 08:46:20,709 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:46:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234045 states. [2019-09-10 08:46:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234045 to 1234045. [2019-09-10 08:46:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1234045 states. [2019-09-10 08:46:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234045 states to 1234045 states and 1751790 transitions. [2019-09-10 08:46:57,779 INFO L78 Accepts]: Start accepts. Automaton has 1234045 states and 1751790 transitions. Word has length 129 [2019-09-10 08:46:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:57,779 INFO L475 AbstractCegarLoop]: Abstraction has 1234045 states and 1751790 transitions. [2019-09-10 08:46:57,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:46:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1234045 states and 1751790 transitions. [2019-09-10 08:46:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:46:57,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:57,799 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:46:57,799 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:57,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:57,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1966861496, now seen corresponding path program 1 times [2019-09-10 08:46:57,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:57,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:57,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:57,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:57,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:46:57,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:57,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:57,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:57,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:57,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:57,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:57,921 INFO L87 Difference]: Start difference. First operand 1234045 states and 1751790 transitions. Second operand 4 states. [2019-09-10 08:47:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:05,066 INFO L93 Difference]: Finished difference Result 1087208 states and 1541115 transitions. [2019-09-10 08:47:05,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:05,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 08:47:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:07,002 INFO L225 Difference]: With dead ends: 1087208 [2019-09-10 08:47:07,002 INFO L226 Difference]: Without dead ends: 1087208 [2019-09-10 08:47:07,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087208 states.