java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:37:06,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:37:06,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:37:06,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:37:06,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:37:06,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:37:06,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:37:06,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:37:06,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:37:06,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:37:06,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:37:06,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:37:06,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:37:06,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:37:06,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:37:06,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:37:06,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:37:06,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:37:06,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:37:06,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:37:06,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:37:06,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:37:06,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:37:06,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:37:06,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:37:06,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:37:06,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:37:06,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:37:06,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:37:06,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:37:06,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:37:06,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:37:06,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:37:06,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:37:06,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:37:06,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:37:06,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:37:06,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:37:06,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:37:06,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:37:06,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:37:06,507 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 06:37:06,521 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:37:06,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:37:06,522 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:37:06,522 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:37:06,523 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:37:06,523 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:37:06,523 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:37:06,524 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:37:06,524 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:37:06,524 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:37:06,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:37:06,525 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:37:06,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:37:06,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:37:06,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:37:06,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:37:06,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:37:06,526 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:37:06,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:37:06,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:37:06,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:37:06,527 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:37:06,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:37:06,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:37:06,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:37:06,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:37:06,528 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:37:06,528 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:37:06,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:37:06,528 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:37:06,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:37:06,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:37:06,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:37:06,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:37:06,573 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:37:06,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:37:06,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3e53c62f/d2dae89182574c80a255ebefcb2e8353/FLAG3c8edef01 [2019-09-10 06:37:07,362 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:37:07,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:37:07,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3e53c62f/d2dae89182574c80a255ebefcb2e8353/FLAG3c8edef01 [2019-09-10 06:37:07,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3e53c62f/d2dae89182574c80a255ebefcb2e8353 [2019-09-10 06:37:07,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:37:07,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:37:07,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:37:07,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:37:07,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:37:07,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:37:07" (1/1) ... [2019-09-10 06:37:07,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fbace32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:07, skipping insertion in model container [2019-09-10 06:37:07,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:37:07" (1/1) ... [2019-09-10 06:37:07,499 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:37:07,680 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:37:08,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:37:08,796 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:37:09,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:37:09,154 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:37:09,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:09 WrapperNode [2019-09-10 06:37:09,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:37:09,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:37:09,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:37:09,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:37:09,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:09" (1/1) ... [2019-09-10 06:37:09,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:09" (1/1) ... [2019-09-10 06:37:09,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:09" (1/1) ... [2019-09-10 06:37:09,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:09" (1/1) ... [2019-09-10 06:37:09,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:09" (1/1) ... [2019-09-10 06:37:09,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:09" (1/1) ... [2019-09-10 06:37:09,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:09" (1/1) ... [2019-09-10 06:37:09,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:37:09,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:37:09,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:37:09,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:37:09,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:09" (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 06:37:09,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:37:09,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:37:09,590 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:37:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:37:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:37:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:37:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:37:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:37:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:37:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:37:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:37:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:37:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:37:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:37:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:37:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:37:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:37:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:37:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:37:13,130 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:37:13,130 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:37:13,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:37:13 BoogieIcfgContainer [2019-09-10 06:37:13,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:37:13,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:37:13,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:37:13,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:37:13,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:37:07" (1/3) ... [2019-09-10 06:37:13,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db8e7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:37:13, skipping insertion in model container [2019-09-10 06:37:13,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:09" (2/3) ... [2019-09-10 06:37:13,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db8e7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:37:13, skipping insertion in model container [2019-09-10 06:37:13,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:37:13" (3/3) ... [2019-09-10 06:37:13,146 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:37:13,158 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:37:13,168 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-10 06:37:13,186 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-10 06:37:13,212 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:37:13,212 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:37:13,212 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:37:13,212 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:37:13,212 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:37:13,212 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:37:13,212 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:37:13,213 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:37:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-09-10 06:37:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:37:13,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:13,288 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] [2019-09-10 06:37:13,290 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:13,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-09-10 06:37:13,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:13,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:13,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:13,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:13,843 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 06:37:13,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:13,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:13,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:13,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:13,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:13,869 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-09-10 06:37:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:16,112 INFO L93 Difference]: Finished difference Result 1574 states and 2692 transitions. [2019-09-10 06:37:16,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:16,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-10 06:37:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:16,144 INFO L225 Difference]: With dead ends: 1574 [2019-09-10 06:37:16,144 INFO L226 Difference]: Without dead ends: 1562 [2019-09-10 06:37:16,146 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 06:37:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-09-10 06:37:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1556. [2019-09-10 06:37:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-09-10 06:37:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2098 transitions. [2019-09-10 06:37:16,274 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2098 transitions. Word has length 55 [2019-09-10 06:37:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:16,275 INFO L475 AbstractCegarLoop]: Abstraction has 1556 states and 2098 transitions. [2019-09-10 06:37:16,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2098 transitions. [2019-09-10 06:37:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:37:16,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:16,280 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] [2019-09-10 06:37:16,281 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:16,281 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-09-10 06:37:16,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:16,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:16,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:16,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:16,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:16,468 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 06:37:16,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:16,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:37:16,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:16,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:37:16,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:37:16,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:37:16,472 INFO L87 Difference]: Start difference. First operand 1556 states and 2098 transitions. Second operand 6 states. [2019-09-10 06:37:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:17,782 INFO L93 Difference]: Finished difference Result 2302 states and 3143 transitions. [2019-09-10 06:37:17,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:17,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:37:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:17,802 INFO L225 Difference]: With dead ends: 2302 [2019-09-10 06:37:17,802 INFO L226 Difference]: Without dead ends: 2302 [2019-09-10 06:37:17,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:37:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-09-10 06:37:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2286. [2019-09-10 06:37:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2286 states. [2019-09-10 06:37:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3132 transitions. [2019-09-10 06:37:17,911 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3132 transitions. Word has length 56 [2019-09-10 06:37:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:17,911 INFO L475 AbstractCegarLoop]: Abstraction has 2286 states and 3132 transitions. [2019-09-10 06:37:17,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:37:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3132 transitions. [2019-09-10 06:37:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:37:17,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:17,923 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] [2019-09-10 06:37:17,923 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:17,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:17,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-09-10 06:37:17,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:17,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:17,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:17,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:17,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:18,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 06:37:18,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:18,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:37:18,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:18,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:37:18,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:37:18,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:37:18,190 INFO L87 Difference]: Start difference. First operand 2286 states and 3132 transitions. Second operand 6 states. [2019-09-10 06:37:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:19,448 INFO L93 Difference]: Finished difference Result 4341 states and 5992 transitions. [2019-09-10 06:37:19,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:19,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:37:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:19,471 INFO L225 Difference]: With dead ends: 4341 [2019-09-10 06:37:19,471 INFO L226 Difference]: Without dead ends: 4341 [2019-09-10 06:37:19,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:37:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2019-09-10 06:37:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 4321. [2019-09-10 06:37:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-09-10 06:37:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5977 transitions. [2019-09-10 06:37:19,580 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5977 transitions. Word has length 56 [2019-09-10 06:37:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:19,580 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5977 transitions. [2019-09-10 06:37:19,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:37:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5977 transitions. [2019-09-10 06:37:19,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:37:19,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:19,586 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] [2019-09-10 06:37:19,586 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:19,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:19,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-09-10 06:37:19,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:19,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:19,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:19,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:19,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:19,840 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 06:37:19,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:19,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:37:19,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:19,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:37:19,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:37:19,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:19,844 INFO L87 Difference]: Start difference. First operand 4321 states and 5977 transitions. Second operand 9 states. [2019-09-10 06:37:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:22,943 INFO L93 Difference]: Finished difference Result 9703 states and 14273 transitions. [2019-09-10 06:37:22,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:37:22,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-10 06:37:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:22,989 INFO L225 Difference]: With dead ends: 9703 [2019-09-10 06:37:22,990 INFO L226 Difference]: Without dead ends: 9703 [2019-09-10 06:37:22,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:37:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9703 states. [2019-09-10 06:37:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9703 to 4321. [2019-09-10 06:37:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-09-10 06:37:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5976 transitions. [2019-09-10 06:37:23,151 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5976 transitions. Word has length 57 [2019-09-10 06:37:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:23,152 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5976 transitions. [2019-09-10 06:37:23,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:37:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5976 transitions. [2019-09-10 06:37:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:37:23,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:23,158 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] [2019-09-10 06:37:23,159 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:23,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:23,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-09-10 06:37:23,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:23,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:23,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:23,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:23,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:23,411 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 06:37:23,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:23,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:37:23,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:23,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:37:23,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:37:23,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:23,413 INFO L87 Difference]: Start difference. First operand 4321 states and 5976 transitions. Second operand 9 states. [2019-09-10 06:37:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:27,587 INFO L93 Difference]: Finished difference Result 11066 states and 15933 transitions. [2019-09-10 06:37:27,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:37:27,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-10 06:37:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:27,632 INFO L225 Difference]: With dead ends: 11066 [2019-09-10 06:37:27,632 INFO L226 Difference]: Without dead ends: 11066 [2019-09-10 06:37:27,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:37:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-09-10 06:37:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4321. [2019-09-10 06:37:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-09-10 06:37:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5975 transitions. [2019-09-10 06:37:27,774 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5975 transitions. Word has length 57 [2019-09-10 06:37:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:27,774 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5975 transitions. [2019-09-10 06:37:27,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:37:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5975 transitions. [2019-09-10 06:37:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:37:27,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:27,779 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] [2019-09-10 06:37:27,780 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:27,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:27,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-09-10 06:37:27,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:27,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:27,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:27,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:27,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:27,922 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 06:37:27,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:27,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:37:27,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:27,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:37:27,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:37:27,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:37:27,923 INFO L87 Difference]: Start difference. First operand 4321 states and 5975 transitions. Second operand 8 states. [2019-09-10 06:37:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:30,222 INFO L93 Difference]: Finished difference Result 9422 states and 13964 transitions. [2019-09-10 06:37:30,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:37:30,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-09-10 06:37:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:30,242 INFO L225 Difference]: With dead ends: 9422 [2019-09-10 06:37:30,242 INFO L226 Difference]: Without dead ends: 9422 [2019-09-10 06:37:30,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:37:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9422 states. [2019-09-10 06:37:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9422 to 4321. [2019-09-10 06:37:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-09-10 06:37:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5974 transitions. [2019-09-10 06:37:30,340 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5974 transitions. Word has length 57 [2019-09-10 06:37:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:30,341 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5974 transitions. [2019-09-10 06:37:30,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:37:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5974 transitions. [2019-09-10 06:37:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:37:30,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:30,346 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] [2019-09-10 06:37:30,346 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:30,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-09-10 06:37:30,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:30,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:30,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:30,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:30,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:30,411 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 06:37:30,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:30,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:30,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:30,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:30,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:30,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:30,413 INFO L87 Difference]: Start difference. First operand 4321 states and 5974 transitions. Second operand 3 states. [2019-09-10 06:37:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:30,544 INFO L93 Difference]: Finished difference Result 5831 states and 7967 transitions. [2019-09-10 06:37:30,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:30,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 06:37:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:30,558 INFO L225 Difference]: With dead ends: 5831 [2019-09-10 06:37:30,558 INFO L226 Difference]: Without dead ends: 5831 [2019-09-10 06:37:30,559 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 06:37:30,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5831 states. [2019-09-10 06:37:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5831 to 5825. [2019-09-10 06:37:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2019-09-10 06:37:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 7963 transitions. [2019-09-10 06:37:30,657 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 7963 transitions. Word has length 58 [2019-09-10 06:37:30,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:30,659 INFO L475 AbstractCegarLoop]: Abstraction has 5825 states and 7963 transitions. [2019-09-10 06:37:30,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 7963 transitions. [2019-09-10 06:37:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:37:30,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:30,665 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] [2019-09-10 06:37:30,665 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-09-10 06:37:30,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:30,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:30,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:30,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:30,766 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 06:37:30,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:30,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:30,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:30,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:30,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:30,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:30,769 INFO L87 Difference]: Start difference. First operand 5825 states and 7963 transitions. Second operand 3 states. [2019-09-10 06:37:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:30,853 INFO L93 Difference]: Finished difference Result 6946 states and 9728 transitions. [2019-09-10 06:37:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:30,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 06:37:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:30,868 INFO L225 Difference]: With dead ends: 6946 [2019-09-10 06:37:30,868 INFO L226 Difference]: Without dead ends: 6946 [2019-09-10 06:37:30,868 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 06:37:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-09-10 06:37:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6354. [2019-09-10 06:37:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6354 states. [2019-09-10 06:37:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6354 states to 6354 states and 8829 transitions. [2019-09-10 06:37:30,959 INFO L78 Accepts]: Start accepts. Automaton has 6354 states and 8829 transitions. Word has length 58 [2019-09-10 06:37:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:30,959 INFO L475 AbstractCegarLoop]: Abstraction has 6354 states and 8829 transitions. [2019-09-10 06:37:30,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 6354 states and 8829 transitions. [2019-09-10 06:37:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:37:30,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:30,965 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] [2019-09-10 06:37:30,966 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:30,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:30,967 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-09-10 06:37:30,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:30,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:30,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:30,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:30,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:31,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:31,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:31,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:31,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:31,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:31,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:31,044 INFO L87 Difference]: Start difference. First operand 6354 states and 8829 transitions. Second operand 3 states. [2019-09-10 06:37:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:31,138 INFO L93 Difference]: Finished difference Result 8287 states and 11698 transitions. [2019-09-10 06:37:31,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:31,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 06:37:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:31,155 INFO L225 Difference]: With dead ends: 8287 [2019-09-10 06:37:31,155 INFO L226 Difference]: Without dead ends: 8287 [2019-09-10 06:37:31,156 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 06:37:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2019-09-10 06:37:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 7385. [2019-09-10 06:37:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7385 states. [2019-09-10 06:37:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7385 states to 7385 states and 10353 transitions. [2019-09-10 06:37:31,269 INFO L78 Accepts]: Start accepts. Automaton has 7385 states and 10353 transitions. Word has length 58 [2019-09-10 06:37:31,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:31,270 INFO L475 AbstractCegarLoop]: Abstraction has 7385 states and 10353 transitions. [2019-09-10 06:37:31,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 7385 states and 10353 transitions. [2019-09-10 06:37:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:37:31,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:31,286 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] [2019-09-10 06:37:31,286 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:31,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:31,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-09-10 06:37:31,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:31,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:31,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:31,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:31,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:31,376 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 06:37:31,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:31,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:31,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:31,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:31,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:31,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:31,382 INFO L87 Difference]: Start difference. First operand 7385 states and 10353 transitions. Second operand 3 states. [2019-09-10 06:37:31,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:31,748 INFO L93 Difference]: Finished difference Result 7581 states and 10724 transitions. [2019-09-10 06:37:31,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:31,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:37:31,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:31,775 INFO L225 Difference]: With dead ends: 7581 [2019-09-10 06:37:31,775 INFO L226 Difference]: Without dead ends: 7581 [2019-09-10 06:37:31,775 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 06:37:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-09-10 06:37:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 6187. [2019-09-10 06:37:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6187 states. [2019-09-10 06:37:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 8753 transitions. [2019-09-10 06:37:31,868 INFO L78 Accepts]: Start accepts. Automaton has 6187 states and 8753 transitions. Word has length 59 [2019-09-10 06:37:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:31,869 INFO L475 AbstractCegarLoop]: Abstraction has 6187 states and 8753 transitions. [2019-09-10 06:37:31,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 6187 states and 8753 transitions. [2019-09-10 06:37:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:37:31,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:31,873 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] [2019-09-10 06:37:31,874 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1119557590, now seen corresponding path program 1 times [2019-09-10 06:37:31,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:31,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:31,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:31,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:31,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:31,971 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 06:37:31,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:31,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:31,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:31,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:31,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:31,973 INFO L87 Difference]: Start difference. First operand 6187 states and 8753 transitions. Second operand 3 states. [2019-09-10 06:37:32,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:32,148 INFO L93 Difference]: Finished difference Result 8813 states and 12820 transitions. [2019-09-10 06:37:32,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:32,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:37:32,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:32,174 INFO L225 Difference]: With dead ends: 8813 [2019-09-10 06:37:32,175 INFO L226 Difference]: Without dead ends: 8813 [2019-09-10 06:37:32,176 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 06:37:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8813 states. [2019-09-10 06:37:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8813 to 7035. [2019-09-10 06:37:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7035 states. [2019-09-10 06:37:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7035 states to 7035 states and 10173 transitions. [2019-09-10 06:37:32,324 INFO L78 Accepts]: Start accepts. Automaton has 7035 states and 10173 transitions. Word has length 59 [2019-09-10 06:37:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:32,325 INFO L475 AbstractCegarLoop]: Abstraction has 7035 states and 10173 transitions. [2019-09-10 06:37:32,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7035 states and 10173 transitions. [2019-09-10 06:37:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:37:32,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:32,330 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] [2019-09-10 06:37:32,330 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:32,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:32,331 INFO L82 PathProgramCache]: Analyzing trace with hash 926744535, now seen corresponding path program 1 times [2019-09-10 06:37:32,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:32,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:32,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:32,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:32,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:32,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:32,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:32,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:32,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:32,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:32,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:32,419 INFO L87 Difference]: Start difference. First operand 7035 states and 10173 transitions. Second operand 3 states. [2019-09-10 06:37:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:32,534 INFO L93 Difference]: Finished difference Result 10987 states and 16201 transitions. [2019-09-10 06:37:32,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:32,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:37:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:32,557 INFO L225 Difference]: With dead ends: 10987 [2019-09-10 06:37:32,557 INFO L226 Difference]: Without dead ends: 10987 [2019-09-10 06:37:32,561 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 06:37:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10987 states. [2019-09-10 06:37:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10987 to 8587. [2019-09-10 06:37:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8587 states. [2019-09-10 06:37:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8587 states to 8587 states and 12623 transitions. [2019-09-10 06:37:32,726 INFO L78 Accepts]: Start accepts. Automaton has 8587 states and 12623 transitions. Word has length 59 [2019-09-10 06:37:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:32,727 INFO L475 AbstractCegarLoop]: Abstraction has 8587 states and 12623 transitions. [2019-09-10 06:37:32,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 8587 states and 12623 transitions. [2019-09-10 06:37:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:37:32,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:32,730 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] [2019-09-10 06:37:32,730 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:32,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1408819210, now seen corresponding path program 1 times [2019-09-10 06:37:32,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:32,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:32,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:32,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:32,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:33,388 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 06:37:33,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:33,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:37:33,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:33,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:37:33,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:37:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:37:33,392 INFO L87 Difference]: Start difference. First operand 8587 states and 12623 transitions. Second operand 13 states. [2019-09-10 06:37:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:35,435 INFO L93 Difference]: Finished difference Result 10221 states and 14985 transitions. [2019-09-10 06:37:35,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:37:35,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-10 06:37:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:35,458 INFO L225 Difference]: With dead ends: 10221 [2019-09-10 06:37:35,458 INFO L226 Difference]: Without dead ends: 10221 [2019-09-10 06:37:35,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:37:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10221 states. [2019-09-10 06:37:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10221 to 8587. [2019-09-10 06:37:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8587 states. [2019-09-10 06:37:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8587 states to 8587 states and 12622 transitions. [2019-09-10 06:37:35,594 INFO L78 Accepts]: Start accepts. Automaton has 8587 states and 12622 transitions. Word has length 60 [2019-09-10 06:37:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:35,595 INFO L475 AbstractCegarLoop]: Abstraction has 8587 states and 12622 transitions. [2019-09-10 06:37:35,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:37:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 8587 states and 12622 transitions. [2019-09-10 06:37:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:37:35,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:35,601 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] [2019-09-10 06:37:35,601 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1965728590, now seen corresponding path program 1 times [2019-09-10 06:37:35,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:35,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:35,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:35,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:36,219 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 06:37:36,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:36,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:37:36,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:36,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:37:36,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:37:36,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:37:36,221 INFO L87 Difference]: Start difference. First operand 8587 states and 12622 transitions. Second operand 14 states. [2019-09-10 06:37:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:38,570 INFO L93 Difference]: Finished difference Result 10348 states and 15178 transitions. [2019-09-10 06:37:38,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:37:38,571 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-09-10 06:37:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:38,595 INFO L225 Difference]: With dead ends: 10348 [2019-09-10 06:37:38,596 INFO L226 Difference]: Without dead ends: 10348 [2019-09-10 06:37:38,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:37:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10348 states. [2019-09-10 06:37:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10348 to 8528. [2019-09-10 06:37:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8528 states. [2019-09-10 06:37:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8528 states to 8528 states and 12545 transitions. [2019-09-10 06:37:38,730 INFO L78 Accepts]: Start accepts. Automaton has 8528 states and 12545 transitions. Word has length 60 [2019-09-10 06:37:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:38,730 INFO L475 AbstractCegarLoop]: Abstraction has 8528 states and 12545 transitions. [2019-09-10 06:37:38,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:37:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 8528 states and 12545 transitions. [2019-09-10 06:37:38,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:37:38,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:38,733 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] [2019-09-10 06:37:38,734 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:38,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:38,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1190610116, now seen corresponding path program 1 times [2019-09-10 06:37:38,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:38,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:38,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:38,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:38,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:39,149 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 06:37:39,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:39,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:37:39,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:39,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:37:39,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:37:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:37:39,151 INFO L87 Difference]: Start difference. First operand 8528 states and 12545 transitions. Second operand 11 states. [2019-09-10 06:37:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:40,690 INFO L93 Difference]: Finished difference Result 18650 states and 27627 transitions. [2019-09-10 06:37:40,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:37:40,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-09-10 06:37:40,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:40,715 INFO L225 Difference]: With dead ends: 18650 [2019-09-10 06:37:40,715 INFO L226 Difference]: Without dead ends: 18650 [2019-09-10 06:37:40,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:37:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18650 states. [2019-09-10 06:37:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18650 to 8524. [2019-09-10 06:37:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8524 states. [2019-09-10 06:37:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8524 states to 8524 states and 12541 transitions. [2019-09-10 06:37:40,878 INFO L78 Accepts]: Start accepts. Automaton has 8524 states and 12541 transitions. Word has length 61 [2019-09-10 06:37:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:40,878 INFO L475 AbstractCegarLoop]: Abstraction has 8524 states and 12541 transitions. [2019-09-10 06:37:40,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:37:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 8524 states and 12541 transitions. [2019-09-10 06:37:40,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:37:40,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:40,881 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] [2019-09-10 06:37:40,881 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:40,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:40,882 INFO L82 PathProgramCache]: Analyzing trace with hash 818671798, now seen corresponding path program 1 times [2019-09-10 06:37:40,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:40,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:40,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:40,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:40,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:41,401 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 06:37:41,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:41,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:37:41,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:41,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:37:41,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:37:41,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:37:41,405 INFO L87 Difference]: Start difference. First operand 8524 states and 12541 transitions. Second operand 13 states. [2019-09-10 06:37:41,622 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-10 06:37:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:43,025 INFO L93 Difference]: Finished difference Result 13405 states and 19701 transitions. [2019-09-10 06:37:43,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:37:43,026 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-10 06:37:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:43,051 INFO L225 Difference]: With dead ends: 13405 [2019-09-10 06:37:43,052 INFO L226 Difference]: Without dead ends: 13405 [2019-09-10 06:37:43,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:37:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13405 states. [2019-09-10 06:37:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13405 to 8479. [2019-09-10 06:37:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8479 states. [2019-09-10 06:37:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8479 states to 8479 states and 12479 transitions. [2019-09-10 06:37:43,242 INFO L78 Accepts]: Start accepts. Automaton has 8479 states and 12479 transitions. Word has length 61 [2019-09-10 06:37:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:43,243 INFO L475 AbstractCegarLoop]: Abstraction has 8479 states and 12479 transitions. [2019-09-10 06:37:43,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:37:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 8479 states and 12479 transitions. [2019-09-10 06:37:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:37:43,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:43,249 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] [2019-09-10 06:37:43,250 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:43,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:43,251 INFO L82 PathProgramCache]: Analyzing trace with hash 624248826, now seen corresponding path program 1 times [2019-09-10 06:37:43,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:43,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:43,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:43,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:43,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:43,387 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 06:37:43,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:43,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:37:43,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:43,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:37:43,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:37:43,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:37:43,390 INFO L87 Difference]: Start difference. First operand 8479 states and 12479 transitions. Second operand 6 states. [2019-09-10 06:37:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:43,705 INFO L93 Difference]: Finished difference Result 29426 states and 42472 transitions. [2019-09-10 06:37:43,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:37:43,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-10 06:37:43,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:43,750 INFO L225 Difference]: With dead ends: 29426 [2019-09-10 06:37:43,750 INFO L226 Difference]: Without dead ends: 29426 [2019-09-10 06:37:43,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:37:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29426 states. [2019-09-10 06:37:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29426 to 25838. [2019-09-10 06:37:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25838 states. [2019-09-10 06:37:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25838 states to 25838 states and 37345 transitions. [2019-09-10 06:37:44,132 INFO L78 Accepts]: Start accepts. Automaton has 25838 states and 37345 transitions. Word has length 67 [2019-09-10 06:37:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:44,133 INFO L475 AbstractCegarLoop]: Abstraction has 25838 states and 37345 transitions. [2019-09-10 06:37:44,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:37:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 25838 states and 37345 transitions. [2019-09-10 06:37:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:37:44,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:44,141 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 06:37:44,141 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1849830759, now seen corresponding path program 1 times [2019-09-10 06:37:44,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:44,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:44,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:44,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:44,288 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 06:37:44,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:44,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:44,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:44,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:44,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:44,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:44,290 INFO L87 Difference]: Start difference. First operand 25838 states and 37345 transitions. Second operand 5 states. [2019-09-10 06:37:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:44,660 INFO L93 Difference]: Finished difference Result 27898 states and 40066 transitions. [2019-09-10 06:37:44,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:44,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 06:37:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:44,705 INFO L225 Difference]: With dead ends: 27898 [2019-09-10 06:37:44,705 INFO L226 Difference]: Without dead ends: 27898 [2019-09-10 06:37:44,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 06:37:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27898 states. [2019-09-10 06:37:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27898 to 24928. [2019-09-10 06:37:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24928 states. [2019-09-10 06:37:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24928 states to 24928 states and 35840 transitions. [2019-09-10 06:37:45,076 INFO L78 Accepts]: Start accepts. Automaton has 24928 states and 35840 transitions. Word has length 68 [2019-09-10 06:37:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:45,077 INFO L475 AbstractCegarLoop]: Abstraction has 24928 states and 35840 transitions. [2019-09-10 06:37:45,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 24928 states and 35840 transitions. [2019-09-10 06:37:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:37:45,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:45,083 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 06:37:45,084 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:45,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:45,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1871092716, now seen corresponding path program 1 times [2019-09-10 06:37:45,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:45,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:45,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:45,209 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 06:37:45,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:45,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:37:45,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:45,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:37:45,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:37:45,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:37:45,212 INFO L87 Difference]: Start difference. First operand 24928 states and 35840 transitions. Second operand 6 states. [2019-09-10 06:37:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:45,417 INFO L93 Difference]: Finished difference Result 43492 states and 61205 transitions. [2019-09-10 06:37:45,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:45,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:37:45,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:45,467 INFO L225 Difference]: With dead ends: 43492 [2019-09-10 06:37:45,467 INFO L226 Difference]: Without dead ends: 43492 [2019-09-10 06:37:45,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:45,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43492 states. [2019-09-10 06:37:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43492 to 25768. [2019-09-10 06:37:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25768 states. [2019-09-10 06:37:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25768 states to 25768 states and 36490 transitions. [2019-09-10 06:37:45,934 INFO L78 Accepts]: Start accepts. Automaton has 25768 states and 36490 transitions. Word has length 70 [2019-09-10 06:37:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:45,935 INFO L475 AbstractCegarLoop]: Abstraction has 25768 states and 36490 transitions. [2019-09-10 06:37:45,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:37:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 25768 states and 36490 transitions. [2019-09-10 06:37:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:37:45,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:45,942 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] [2019-09-10 06:37:45,942 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2055411099, now seen corresponding path program 1 times [2019-09-10 06:37:45,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:45,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:45,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:45,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:45,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:46,009 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 06:37:46,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:46,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:46,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:46,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:46,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:46,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:46,011 INFO L87 Difference]: Start difference. First operand 25768 states and 36490 transitions. Second operand 3 states. [2019-09-10 06:37:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:46,905 INFO L93 Difference]: Finished difference Result 44320 states and 61734 transitions. [2019-09-10 06:37:46,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:46,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-10 06:37:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:46,959 INFO L225 Difference]: With dead ends: 44320 [2019-09-10 06:37:46,959 INFO L226 Difference]: Without dead ends: 44320 [2019-09-10 06:37:46,959 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 06:37:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44320 states. [2019-09-10 06:37:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44320 to 43714. [2019-09-10 06:37:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43714 states. [2019-09-10 06:37:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43714 states to 43714 states and 61129 transitions. [2019-09-10 06:37:47,461 INFO L78 Accepts]: Start accepts. Automaton has 43714 states and 61129 transitions. Word has length 71 [2019-09-10 06:37:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:47,461 INFO L475 AbstractCegarLoop]: Abstraction has 43714 states and 61129 transitions. [2019-09-10 06:37:47,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 43714 states and 61129 transitions. [2019-09-10 06:37:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:37:47,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:47,469 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 06:37:47,469 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:47,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1175358734, now seen corresponding path program 1 times [2019-09-10 06:37:47,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:47,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:47,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:47,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:47,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:47,539 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 06:37:47,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:47,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:47,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:47,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:47,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:47,541 INFO L87 Difference]: Start difference. First operand 43714 states and 61129 transitions. Second operand 3 states. [2019-09-10 06:37:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:47,704 INFO L93 Difference]: Finished difference Result 43699 states and 60373 transitions. [2019-09-10 06:37:47,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:47,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-10 06:37:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:47,756 INFO L225 Difference]: With dead ends: 43699 [2019-09-10 06:37:47,756 INFO L226 Difference]: Without dead ends: 43699 [2019-09-10 06:37:47,756 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 06:37:47,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43699 states. [2019-09-10 06:37:48,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43699 to 33399. [2019-09-10 06:37:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33399 states. [2019-09-10 06:37:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33399 states to 33399 states and 46246 transitions. [2019-09-10 06:37:49,003 INFO L78 Accepts]: Start accepts. Automaton has 33399 states and 46246 transitions. Word has length 72 [2019-09-10 06:37:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:49,004 INFO L475 AbstractCegarLoop]: Abstraction has 33399 states and 46246 transitions. [2019-09-10 06:37:49,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:49,004 INFO L276 IsEmpty]: Start isEmpty. Operand 33399 states and 46246 transitions. [2019-09-10 06:37:49,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:37:49,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:49,010 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 06:37:49,010 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:49,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:49,010 INFO L82 PathProgramCache]: Analyzing trace with hash 353507174, now seen corresponding path program 1 times [2019-09-10 06:37:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:49,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:49,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:49,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:49,075 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 06:37:49,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:49,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:49,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:49,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:49,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:49,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:49,077 INFO L87 Difference]: Start difference. First operand 33399 states and 46246 transitions. Second operand 5 states. [2019-09-10 06:37:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:49,996 INFO L93 Difference]: Finished difference Result 103636 states and 140233 transitions. [2019-09-10 06:37:49,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:49,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-10 06:37:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:50,120 INFO L225 Difference]: With dead ends: 103636 [2019-09-10 06:37:50,120 INFO L226 Difference]: Without dead ends: 103636 [2019-09-10 06:37:50,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103636 states. [2019-09-10 06:37:51,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103636 to 55227. [2019-09-10 06:37:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55227 states. [2019-09-10 06:37:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55227 states to 55227 states and 75268 transitions. [2019-09-10 06:37:51,286 INFO L78 Accepts]: Start accepts. Automaton has 55227 states and 75268 transitions. Word has length 74 [2019-09-10 06:37:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:51,286 INFO L475 AbstractCegarLoop]: Abstraction has 55227 states and 75268 transitions. [2019-09-10 06:37:51,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 55227 states and 75268 transitions. [2019-09-10 06:37:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:37:51,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:51,292 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 06:37:51,292 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:51,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:51,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2143339772, now seen corresponding path program 1 times [2019-09-10 06:37:51,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:51,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:51,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:51,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:51,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:51,406 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 06:37:51,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:51,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:51,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:51,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:51,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:51,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:51,409 INFO L87 Difference]: Start difference. First operand 55227 states and 75268 transitions. Second operand 5 states. [2019-09-10 06:37:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:52,305 INFO L93 Difference]: Finished difference Result 162126 states and 217051 transitions. [2019-09-10 06:37:52,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:52,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 06:37:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:52,482 INFO L225 Difference]: With dead ends: 162126 [2019-09-10 06:37:52,482 INFO L226 Difference]: Without dead ends: 162126 [2019-09-10 06:37:52,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162126 states. [2019-09-10 06:37:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162126 to 107834. [2019-09-10 06:37:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107834 states. [2019-09-10 06:37:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107834 states to 107834 states and 146384 transitions. [2019-09-10 06:37:55,508 INFO L78 Accepts]: Start accepts. Automaton has 107834 states and 146384 transitions. Word has length 77 [2019-09-10 06:37:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:55,508 INFO L475 AbstractCegarLoop]: Abstraction has 107834 states and 146384 transitions. [2019-09-10 06:37:55,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 107834 states and 146384 transitions. [2019-09-10 06:37:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:37:55,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:55,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:55,514 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1797768461, now seen corresponding path program 1 times [2019-09-10 06:37:55,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:55,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:55,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:55,581 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 06:37:55,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:55,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:55,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:55,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:55,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:55,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:55,583 INFO L87 Difference]: Start difference. First operand 107834 states and 146384 transitions. Second operand 3 states. [2019-09-10 06:37:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:55,933 INFO L93 Difference]: Finished difference Result 107329 states and 142300 transitions. [2019-09-10 06:37:55,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:55,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 06:37:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:56,061 INFO L225 Difference]: With dead ends: 107329 [2019-09-10 06:37:56,061 INFO L226 Difference]: Without dead ends: 107329 [2019-09-10 06:37:56,062 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 06:37:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107329 states. [2019-09-10 06:37:57,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107329 to 87978. [2019-09-10 06:37:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87978 states. [2019-09-10 06:37:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87978 states to 87978 states and 117091 transitions. [2019-09-10 06:37:57,533 INFO L78 Accepts]: Start accepts. Automaton has 87978 states and 117091 transitions. Word has length 79 [2019-09-10 06:37:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:57,533 INFO L475 AbstractCegarLoop]: Abstraction has 87978 states and 117091 transitions. [2019-09-10 06:37:57,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 87978 states and 117091 transitions. [2019-09-10 06:37:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:37:57,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:57,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:57,539 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:57,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash 250147946, now seen corresponding path program 1 times [2019-09-10 06:37:57,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:57,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:57,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:57,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:57,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:57,706 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 06:37:57,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:57,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:37:57,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:57,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:37:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:37:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:37:57,708 INFO L87 Difference]: Start difference. First operand 87978 states and 117091 transitions. Second operand 6 states. [2019-09-10 06:37:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:58,187 INFO L93 Difference]: Finished difference Result 108182 states and 143561 transitions. [2019-09-10 06:37:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:37:58,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-09-10 06:37:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:58,341 INFO L225 Difference]: With dead ends: 108182 [2019-09-10 06:37:58,341 INFO L226 Difference]: Without dead ends: 108182 [2019-09-10 06:37:58,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108182 states. [2019-09-10 06:38:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108182 to 99762. [2019-09-10 06:38:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99762 states. [2019-09-10 06:38:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99762 states to 99762 states and 132433 transitions. [2019-09-10 06:38:01,167 INFO L78 Accepts]: Start accepts. Automaton has 99762 states and 132433 transitions. Word has length 82 [2019-09-10 06:38:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:01,167 INFO L475 AbstractCegarLoop]: Abstraction has 99762 states and 132433 transitions. [2019-09-10 06:38:01,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:38:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 99762 states and 132433 transitions. [2019-09-10 06:38:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:38:01,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:01,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:01,172 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:01,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash 874030055, now seen corresponding path program 1 times [2019-09-10 06:38:01,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:01,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:01,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:01,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:01,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:01,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:01,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:01,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:01,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:01,242 INFO L87 Difference]: Start difference. First operand 99762 states and 132433 transitions. Second operand 3 states. [2019-09-10 06:38:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:01,564 INFO L93 Difference]: Finished difference Result 116165 states and 151712 transitions. [2019-09-10 06:38:01,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:01,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 06:38:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:01,683 INFO L225 Difference]: With dead ends: 116165 [2019-09-10 06:38:01,683 INFO L226 Difference]: Without dead ends: 116165 [2019-09-10 06:38:01,684 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 06:38:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116165 states. [2019-09-10 06:38:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116165 to 110832. [2019-09-10 06:38:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110832 states. [2019-09-10 06:38:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110832 states to 110832 states and 145543 transitions. [2019-09-10 06:38:03,087 INFO L78 Accepts]: Start accepts. Automaton has 110832 states and 145543 transitions. Word has length 82 [2019-09-10 06:38:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:03,087 INFO L475 AbstractCegarLoop]: Abstraction has 110832 states and 145543 transitions. [2019-09-10 06:38:03,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 110832 states and 145543 transitions. [2019-09-10 06:38:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 06:38:03,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:03,097 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:03,097 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:03,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:03,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1798700343, now seen corresponding path program 1 times [2019-09-10 06:38:03,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:03,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:03,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:03,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:03,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:03,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:03,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:03,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:03,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:03,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:03,165 INFO L87 Difference]: Start difference. First operand 110832 states and 145543 transitions. Second operand 3 states. [2019-09-10 06:38:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:04,561 INFO L93 Difference]: Finished difference Result 197789 states and 253008 transitions. [2019-09-10 06:38:04,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:04,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 06:38:04,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:04,768 INFO L225 Difference]: With dead ends: 197789 [2019-09-10 06:38:04,768 INFO L226 Difference]: Without dead ends: 197789 [2019-09-10 06:38:04,768 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 06:38:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197789 states. [2019-09-10 06:38:06,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197789 to 174129. [2019-09-10 06:38:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174129 states. [2019-09-10 06:38:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174129 states to 174129 states and 224369 transitions. [2019-09-10 06:38:06,965 INFO L78 Accepts]: Start accepts. Automaton has 174129 states and 224369 transitions. Word has length 90 [2019-09-10 06:38:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:06,965 INFO L475 AbstractCegarLoop]: Abstraction has 174129 states and 224369 transitions. [2019-09-10 06:38:06,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 174129 states and 224369 transitions. [2019-09-10 06:38:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 06:38:06,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:06,975 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] [2019-09-10 06:38:06,976 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:06,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:06,976 INFO L82 PathProgramCache]: Analyzing trace with hash 25741144, now seen corresponding path program 1 times [2019-09-10 06:38:06,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:06,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:06,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:06,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:06,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:38:07,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:07,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:38:07,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:07,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:38:07,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:38:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:38:07,114 INFO L87 Difference]: Start difference. First operand 174129 states and 224369 transitions. Second operand 9 states. [2019-09-10 06:38:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:13,018 INFO L93 Difference]: Finished difference Result 442617 states and 569356 transitions. [2019-09-10 06:38:13,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:38:13,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 06:38:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:13,563 INFO L225 Difference]: With dead ends: 442617 [2019-09-10 06:38:13,563 INFO L226 Difference]: Without dead ends: 442617 [2019-09-10 06:38:13,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:38:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442617 states. [2019-09-10 06:38:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442617 to 174114. [2019-09-10 06:38:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174114 states. [2019-09-10 06:38:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174114 states to 174114 states and 224353 transitions. [2019-09-10 06:38:17,547 INFO L78 Accepts]: Start accepts. Automaton has 174114 states and 224353 transitions. Word has length 92 [2019-09-10 06:38:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:17,547 INFO L475 AbstractCegarLoop]: Abstraction has 174114 states and 224353 transitions. [2019-09-10 06:38:17,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:38:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 174114 states and 224353 transitions. [2019-09-10 06:38:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:38:17,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:17,557 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] [2019-09-10 06:38:17,557 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:17,558 INFO L82 PathProgramCache]: Analyzing trace with hash -978519268, now seen corresponding path program 1 times [2019-09-10 06:38:17,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:17,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:17,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:17,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:17,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:38:17,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:17,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:38:17,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:38:17,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:38:17,766 INFO L87 Difference]: Start difference. First operand 174114 states and 224353 transitions. Second operand 10 states. [2019-09-10 06:38:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:21,367 INFO L93 Difference]: Finished difference Result 584938 states and 748801 transitions. [2019-09-10 06:38:21,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:38:21,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-09-10 06:38:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:22,168 INFO L225 Difference]: With dead ends: 584938 [2019-09-10 06:38:22,168 INFO L226 Difference]: Without dead ends: 584938 [2019-09-10 06:38:22,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:38:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584938 states. [2019-09-10 06:38:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584938 to 282876. [2019-09-10 06:38:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282876 states. [2019-09-10 06:38:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282876 states to 282876 states and 364343 transitions. [2019-09-10 06:38:32,328 INFO L78 Accepts]: Start accepts. Automaton has 282876 states and 364343 transitions. Word has length 93 [2019-09-10 06:38:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:32,328 INFO L475 AbstractCegarLoop]: Abstraction has 282876 states and 364343 transitions. [2019-09-10 06:38:32,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:38:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 282876 states and 364343 transitions. [2019-09-10 06:38:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:38:32,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:32,337 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] [2019-09-10 06:38:32,337 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:32,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:32,338 INFO L82 PathProgramCache]: Analyzing trace with hash -287132240, now seen corresponding path program 1 times [2019-09-10 06:38:32,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:32,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:32,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:32,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:32,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:38:32,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:32,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:38:32,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:32,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:38:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:38:32,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:38:32,465 INFO L87 Difference]: Start difference. First operand 282876 states and 364343 transitions. Second operand 9 states. [2019-09-10 06:38:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:35,103 INFO L93 Difference]: Finished difference Result 620663 states and 797075 transitions. [2019-09-10 06:38:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:38:35,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 06:38:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:35,856 INFO L225 Difference]: With dead ends: 620663 [2019-09-10 06:38:35,857 INFO L226 Difference]: Without dead ends: 620663 [2019-09-10 06:38:35,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:38:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620663 states. [2019-09-10 06:38:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620663 to 282861. [2019-09-10 06:38:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282861 states. [2019-09-10 06:38:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282861 states to 282861 states and 364327 transitions. [2019-09-10 06:38:46,510 INFO L78 Accepts]: Start accepts. Automaton has 282861 states and 364327 transitions. Word has length 93 [2019-09-10 06:38:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:46,510 INFO L475 AbstractCegarLoop]: Abstraction has 282861 states and 364327 transitions. [2019-09-10 06:38:46,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:38:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 282861 states and 364327 transitions. [2019-09-10 06:38:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:38:46,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:46,519 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] [2019-09-10 06:38:46,520 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1974005961, now seen corresponding path program 1 times [2019-09-10 06:38:46,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:46,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:46,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:46,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:46,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:46,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:46,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:38:46,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:46,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:38:46,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:38:46,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:38:46,663 INFO L87 Difference]: Start difference. First operand 282861 states and 364327 transitions. Second operand 9 states. [2019-09-10 06:38:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:50,995 INFO L93 Difference]: Finished difference Result 806351 states and 1037083 transitions. [2019-09-10 06:38:50,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:38:50,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 06:38:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:52,237 INFO L225 Difference]: With dead ends: 806351 [2019-09-10 06:38:52,238 INFO L226 Difference]: Without dead ends: 806351 [2019-09-10 06:38:52,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:38:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806351 states. [2019-09-10 06:39:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806351 to 283746. [2019-09-10 06:39:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283746 states. [2019-09-10 06:39:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283746 states to 283746 states and 365404 transitions. [2019-09-10 06:39:06,974 INFO L78 Accepts]: Start accepts. Automaton has 283746 states and 365404 transitions. Word has length 93 [2019-09-10 06:39:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:06,975 INFO L475 AbstractCegarLoop]: Abstraction has 283746 states and 365404 transitions. [2019-09-10 06:39:06,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:39:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 283746 states and 365404 transitions. [2019-09-10 06:39:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:39:06,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:06,986 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] [2019-09-10 06:39:06,986 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:06,986 INFO L82 PathProgramCache]: Analyzing trace with hash -440996839, now seen corresponding path program 1 times [2019-09-10 06:39:06,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:06,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:06,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:06,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:06,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:39:07,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:07,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:39:07,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:07,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:39:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:39:07,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:39:07,182 INFO L87 Difference]: Start difference. First operand 283746 states and 365404 transitions. Second operand 8 states. [2019-09-10 06:39:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:14,477 INFO L93 Difference]: Finished difference Result 481578 states and 619186 transitions. [2019-09-10 06:39:14,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:39:14,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-09-10 06:39:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:15,265 INFO L225 Difference]: With dead ends: 481578 [2019-09-10 06:39:15,266 INFO L226 Difference]: Without dead ends: 481578 [2019-09-10 06:39:15,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:39:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481578 states. [2019-09-10 06:39:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481578 to 283734. [2019-09-10 06:39:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283734 states. [2019-09-10 06:39:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283734 states to 283734 states and 365391 transitions. [2019-09-10 06:39:20,070 INFO L78 Accepts]: Start accepts. Automaton has 283734 states and 365391 transitions. Word has length 94 [2019-09-10 06:39:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:20,071 INFO L475 AbstractCegarLoop]: Abstraction has 283734 states and 365391 transitions. [2019-09-10 06:39:20,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:39:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 283734 states and 365391 transitions. [2019-09-10 06:39:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:39:20,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:20,082 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] [2019-09-10 06:39:20,083 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:20,083 INFO L82 PathProgramCache]: Analyzing trace with hash -602915897, now seen corresponding path program 1 times [2019-09-10 06:39:20,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:20,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:20,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:20,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:20,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:20,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:20,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:20,309 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-09-10 06:39:20,312 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [203], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [2589], [2593], [2596], [2599], [2602], [2610], [2612], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3887], [3933], [3936], [3939], [3943], [3946], [3950], [3954], [3956], [3959], [3963], [3966], [3969], [3973], [4241], [4244], [4247], [4251], [4255], [4259], [4342], [4344], [4986], [4987], [4991], [4992], [4993] [2019-09-10 06:39:20,361 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:20,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:20,568 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:20,900 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:39:20,903 INFO L272 AbstractInterpreter]: Visited 89 different actions 206 times. Merged at 27 different actions 105 times. Widened at 1 different actions 1 times. Performed 1033 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1033 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 6 different actions. Largest state had 253 variables. [2019-09-10 06:39:20,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:20,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:39:20,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:20,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:39:20,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:20,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:39:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:21,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:39:21,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:39:21,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:21,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:22,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:22,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:22,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:22,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:22,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:22,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:39:22,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2019-09-10 06:39:22,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:39:22,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:39:22,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:39:22,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:39:22,359 INFO L87 Difference]: Start difference. First operand 283734 states and 365391 transitions. Second operand 19 states. [2019-09-10 06:39:23,028 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 06:39:26,441 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-09-10 06:39:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:32,060 INFO L93 Difference]: Finished difference Result 724117 states and 926609 transitions. [2019-09-10 06:39:32,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:39:32,060 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2019-09-10 06:39:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:33,390 INFO L225 Difference]: With dead ends: 724117 [2019-09-10 06:39:33,390 INFO L226 Difference]: Without dead ends: 724117 [2019-09-10 06:39:33,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 168 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=415, Invalid=1477, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:39:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724117 states. [2019-09-10 06:39:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724117 to 284391. [2019-09-10 06:39:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284391 states. [2019-09-10 06:39:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284391 states to 284391 states and 366189 transitions. [2019-09-10 06:39:49,235 INFO L78 Accepts]: Start accepts. Automaton has 284391 states and 366189 transitions. Word has length 94 [2019-09-10 06:39:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:49,235 INFO L475 AbstractCegarLoop]: Abstraction has 284391 states and 366189 transitions. [2019-09-10 06:39:49,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:39:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 284391 states and 366189 transitions. [2019-09-10 06:39:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:39:49,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:49,267 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] [2019-09-10 06:39:49,268 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:49,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:49,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1717699109, now seen corresponding path program 1 times [2019-09-10 06:39:49,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:49,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:49,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:49,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:49,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:49,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:49,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:49,435 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-09-10 06:39:49,435 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [166], [169], [170], [172], [175], [180], [182], [203], [205], [1028], [1272], [1276], [1387], [1460], [1463], [1466], [1470], [1473], [1477], [1481], [1483], [1486], [1489], [1493], [2148], [2151], [2154], [2170], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [3479], [3482], [3486], [3488], [3491], [3494], [3498], [3502], [3505], [3508], [3511], [3513], [3542], [3561], [3563], [3582], [4986], [4987], [4991], [4992], [4993] [2019-09-10 06:39:49,445 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:49,445 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:49,516 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:49,749 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:39:49,749 INFO L272 AbstractInterpreter]: Visited 89 different actions 225 times. Merged at 28 different actions 124 times. Widened at 5 different actions 5 times. Performed 1104 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1104 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 6 different actions. Largest state had 253 variables. [2019-09-10 06:39:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:49,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:39:49,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:49,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:39:49,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:49,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:39:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:50,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 06:39:50,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:39:50,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:39:50,726 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:39:51,943 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:39:51,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [5] total 21 [2019-09-10 06:39:51,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:51,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:39:51,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:39:51,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:39:51,946 INFO L87 Difference]: Start difference. First operand 284391 states and 366189 transitions. Second operand 10 states. [2019-09-10 06:39:52,381 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-09-10 06:39:53,152 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 06:39:53,823 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 06:39:55,053 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 06:39:55,634 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 06:39:55,905 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:40:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:02,643 INFO L93 Difference]: Finished difference Result 625267 states and 796912 transitions. [2019-09-10 06:40:02,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:40:02,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-10 06:40:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:03,767 INFO L225 Difference]: With dead ends: 625267 [2019-09-10 06:40:03,767 INFO L226 Difference]: Without dead ends: 625267 [2019-09-10 06:40:03,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 167 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:40:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625267 states. [2019-09-10 06:40:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625267 to 350246. [2019-09-10 06:40:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350246 states. [2019-09-10 06:40:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350246 states to 350246 states and 449134 transitions. [2019-09-10 06:40:11,265 INFO L78 Accepts]: Start accepts. Automaton has 350246 states and 449134 transitions. Word has length 94 [2019-09-10 06:40:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:11,265 INFO L475 AbstractCegarLoop]: Abstraction has 350246 states and 449134 transitions. [2019-09-10 06:40:11,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:40:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 350246 states and 449134 transitions. [2019-09-10 06:40:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:40:11,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:11,278 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] [2019-09-10 06:40:11,279 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:11,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:11,279 INFO L82 PathProgramCache]: Analyzing trace with hash 982202329, now seen corresponding path program 1 times [2019-09-10 06:40:11,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:11,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:11,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:11,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:11,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:11,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:11,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:40:11,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:11,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:40:11,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:40:11,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:40:11,479 INFO L87 Difference]: Start difference. First operand 350246 states and 449134 transitions. Second operand 12 states. [2019-09-10 06:40:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:19,319 INFO L93 Difference]: Finished difference Result 745150 states and 953325 transitions. [2019-09-10 06:40:19,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:40:19,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-09-10 06:40:19,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:21,389 INFO L225 Difference]: With dead ends: 745150 [2019-09-10 06:40:21,389 INFO L226 Difference]: Without dead ends: 745150 [2019-09-10 06:40:21,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:40:21,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745150 states. [2019-09-10 06:40:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745150 to 357636. [2019-09-10 06:40:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357636 states. [2019-09-10 06:40:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357636 states to 357636 states and 458640 transitions. [2019-09-10 06:40:33,605 INFO L78 Accepts]: Start accepts. Automaton has 357636 states and 458640 transitions. Word has length 95 [2019-09-10 06:40:33,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:33,605 INFO L475 AbstractCegarLoop]: Abstraction has 357636 states and 458640 transitions. [2019-09-10 06:40:33,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:40:33,605 INFO L276 IsEmpty]: Start isEmpty. Operand 357636 states and 458640 transitions. [2019-09-10 06:40:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:40:33,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:33,615 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] [2019-09-10 06:40:33,615 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:33,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:33,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2084722691, now seen corresponding path program 1 times [2019-09-10 06:40:33,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:33,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:33,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:33,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:33,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:33,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:33,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:33,748 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-09-10 06:40:33,752 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [185], [201], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2227], [2230], [2233], [2241], [2243], [3274], [3278], [3282], [3301], [3303], [3708], [3722], [3724], [3728], [4353], [4613], [4617], [4620], [4623], [4626], [4629], [4632], [4636], [4639], [4643], [4646], [4650], [4682], [4685], [4689], [4692], [4696], [4698], [4701], [4704], [4708], [4712], [4716], [4799], [4801], [4986], [4987], [4991], [4992], [4993] [2019-09-10 06:40:33,762 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:33,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:33,811 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:34,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:34,047 INFO L272 AbstractInterpreter]: Visited 90 different actions 215 times. Merged at 30 different actions 114 times. Widened at 5 different actions 8 times. Performed 1078 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1078 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 7 different actions. Largest state had 253 variables. [2019-09-10 06:40:34,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:34,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:34,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:34,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:40:34,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:34,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:40:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:34,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:40:34,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:34,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:40:34,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:40:34,955 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:40:34,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [5] total 19 [2019-09-10 06:40:34,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:34,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:40:34,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:40:34,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:40:34,957 INFO L87 Difference]: Start difference. First operand 357636 states and 458640 transitions. Second operand 9 states. [2019-09-10 06:40:35,807 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:40:37,066 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 06:40:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:39,270 INFO L93 Difference]: Finished difference Result 480759 states and 614575 transitions. [2019-09-10 06:40:39,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:40:39,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 06:40:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:40,037 INFO L225 Difference]: With dead ends: 480759 [2019-09-10 06:40:40,037 INFO L226 Difference]: Without dead ends: 480759 [2019-09-10 06:40:40,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 173 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:40:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480759 states. [2019-09-10 06:40:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480759 to 357626. [2019-09-10 06:40:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357626 states. [2019-09-10 06:40:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357626 states to 357626 states and 458411 transitions. [2019-09-10 06:40:52,715 INFO L78 Accepts]: Start accepts. Automaton has 357626 states and 458411 transitions. Word has length 95 [2019-09-10 06:40:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:52,715 INFO L475 AbstractCegarLoop]: Abstraction has 357626 states and 458411 transitions. [2019-09-10 06:40:52,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:40:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 357626 states and 458411 transitions. [2019-09-10 06:40:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:40:52,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:52,728 INFO L399 BasicCegarLoop]: trace histogram [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 06:40:52,728 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:52,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:52,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1487914464, now seen corresponding path program 1 times [2019-09-10 06:40:52,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:52,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:52,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:52,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:52,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:52,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:52,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:40:52,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:52,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:40:52,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:40:52,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:40:52,792 INFO L87 Difference]: Start difference. First operand 357626 states and 458411 transitions. Second operand 3 states. [2019-09-10 06:40:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:54,686 INFO L93 Difference]: Finished difference Result 357628 states and 450124 transitions. [2019-09-10 06:40:54,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:40:54,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 06:40:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:55,135 INFO L225 Difference]: With dead ends: 357628 [2019-09-10 06:40:55,135 INFO L226 Difference]: Without dead ends: 357628 [2019-09-10 06:40:55,136 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 06:40:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357628 states. [2019-09-10 06:41:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357628 to 357509. [2019-09-10 06:41:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357509 states. [2019-09-10 06:41:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357509 states to 357509 states and 449993 transitions. [2019-09-10 06:41:04,516 INFO L78 Accepts]: Start accepts. Automaton has 357509 states and 449993 transitions. Word has length 95 [2019-09-10 06:41:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:04,516 INFO L475 AbstractCegarLoop]: Abstraction has 357509 states and 449993 transitions. [2019-09-10 06:41:04,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 357509 states and 449993 transitions. [2019-09-10 06:41:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:41:04,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:04,525 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] [2019-09-10 06:41:04,525 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:04,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash -286705209, now seen corresponding path program 1 times [2019-09-10 06:41:04,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:04,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:04,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:04,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:04,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:04,680 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-09-10 06:41:04,680 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [203], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2182], [2198], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [2589], [2593], [2596], [2599], [2602], [2610], [2612], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3887], [3933], [3936], [3939], [3943], [3946], [3950], [3954], [3956], [3959], [3963], [3966], [3969], [3973], [4241], [4244], [4247], [4251], [4255], [4259], [4342], [4344], [4986], [4987], [4991], [4992], [4993] [2019-09-10 06:41:04,683 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:04,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:04,743 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:04,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:04,927 INFO L272 AbstractInterpreter]: Visited 90 different actions 213 times. Merged at 28 different actions 112 times. Widened at 5 different actions 5 times. Performed 1056 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1056 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 6 different actions. Largest state had 253 variables. [2019-09-10 06:41:04,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:04,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:04,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:04,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:41:04,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:04,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:41:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:05,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 06:41:05,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:05,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:06,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:41:06,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-09-10 06:41:06,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:41:06,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:41:06,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:41:06,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:41:06,239 INFO L87 Difference]: Start difference. First operand 357509 states and 449993 transitions. Second operand 7 states. [2019-09-10 06:41:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:07,772 INFO L93 Difference]: Finished difference Result 551231 states and 685992 transitions. [2019-09-10 06:41:07,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:41:07,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-10 06:41:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:08,480 INFO L225 Difference]: With dead ends: 551231 [2019-09-10 06:41:08,480 INFO L226 Difference]: Without dead ends: 551231 [2019-09-10 06:41:08,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:41:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551231 states. [2019-09-10 06:41:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551231 to 446018. [2019-09-10 06:41:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446018 states. [2019-09-10 06:41:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446018 states to 446018 states and 559492 transitions. [2019-09-10 06:41:21,038 INFO L78 Accepts]: Start accepts. Automaton has 446018 states and 559492 transitions. Word has length 95 [2019-09-10 06:41:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:21,038 INFO L475 AbstractCegarLoop]: Abstraction has 446018 states and 559492 transitions. [2019-09-10 06:41:21,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:41:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 446018 states and 559492 transitions. [2019-09-10 06:41:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:41:21,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:21,045 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:21,046 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:21,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash -802766303, now seen corresponding path program 1 times [2019-09-10 06:41:21,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:21,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:21,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:21,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:21,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:21,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:21,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:21,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:21,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:21,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:21,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:21,123 INFO L87 Difference]: Start difference. First operand 446018 states and 559492 transitions. Second operand 3 states. [2019-09-10 06:41:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:22,299 INFO L93 Difference]: Finished difference Result 442585 states and 551680 transitions. [2019-09-10 06:41:22,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:22,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 06:41:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:22,822 INFO L225 Difference]: With dead ends: 442585 [2019-09-10 06:41:22,822 INFO L226 Difference]: Without dead ends: 442585 [2019-09-10 06:41:22,823 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 06:41:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442585 states. [2019-09-10 06:41:34,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442585 to 442221. [2019-09-10 06:41:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442221 states. [2019-09-10 06:41:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442221 states to 442221 states and 551297 transitions. [2019-09-10 06:41:36,565 INFO L78 Accepts]: Start accepts. Automaton has 442221 states and 551297 transitions. Word has length 96 [2019-09-10 06:41:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:36,566 INFO L475 AbstractCegarLoop]: Abstraction has 442221 states and 551297 transitions. [2019-09-10 06:41:36,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 442221 states and 551297 transitions. [2019-09-10 06:41:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:41:36,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:36,574 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:36,574 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1316813398, now seen corresponding path program 1 times [2019-09-10 06:41:36,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:36,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:36,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:36,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:36,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:41:36,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:36,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:41:36,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:36,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:41:36,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:41:36,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:41:36,633 INFO L87 Difference]: Start difference. First operand 442221 states and 551297 transitions. Second operand 4 states. [2019-09-10 06:41:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:45,413 INFO L93 Difference]: Finished difference Result 749870 states and 931900 transitions. [2019-09-10 06:41:45,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:41:45,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 06:41:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:46,473 INFO L225 Difference]: With dead ends: 749870 [2019-09-10 06:41:46,473 INFO L226 Difference]: Without dead ends: 749870 [2019-09-10 06:41:46,473 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 06:41:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749870 states. [2019-09-10 06:41:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749870 to 472446. [2019-09-10 06:41:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472446 states. [2019-09-10 06:41:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472446 states to 472446 states and 590389 transitions. [2019-09-10 06:41:54,733 INFO L78 Accepts]: Start accepts. Automaton has 472446 states and 590389 transitions. Word has length 97 [2019-09-10 06:41:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:54,733 INFO L475 AbstractCegarLoop]: Abstraction has 472446 states and 590389 transitions. [2019-09-10 06:41:54,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:41:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 472446 states and 590389 transitions. [2019-09-10 06:41:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:41:54,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:54,742 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] [2019-09-10 06:41:54,742 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:54,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:54,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1191866658, now seen corresponding path program 1 times [2019-09-10 06:41:54,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:54,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:54,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:54,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:54,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:41:54,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:54,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:41:54,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:54,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:41:54,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:41:54,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:41:54,829 INFO L87 Difference]: Start difference. First operand 472446 states and 590389 transitions. Second operand 5 states. [2019-09-10 06:42:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:02,454 INFO L93 Difference]: Finished difference Result 520937 states and 648026 transitions. [2019-09-10 06:42:02,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:42:02,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 06:42:02,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:03,206 INFO L225 Difference]: With dead ends: 520937 [2019-09-10 06:42:03,206 INFO L226 Difference]: Without dead ends: 520937 [2019-09-10 06:42:03,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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 06:42:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520937 states. [2019-09-10 06:42:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520937 to 455230. [2019-09-10 06:42:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455230 states. [2019-09-10 06:42:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455230 states to 455230 states and 567132 transitions. [2019-09-10 06:42:09,745 INFO L78 Accepts]: Start accepts. Automaton has 455230 states and 567132 transitions. Word has length 97 [2019-09-10 06:42:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:09,745 INFO L475 AbstractCegarLoop]: Abstraction has 455230 states and 567132 transitions. [2019-09-10 06:42:09,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:42:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 455230 states and 567132 transitions. [2019-09-10 06:42:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:42:09,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:09,756 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:09,756 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:09,756 INFO L82 PathProgramCache]: Analyzing trace with hash -186718423, now seen corresponding path program 1 times [2019-09-10 06:42:09,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:09,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:09,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:09,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:09,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:09,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:42:09,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:09,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:42:09,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:42:09,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:42:09,831 INFO L87 Difference]: Start difference. First operand 455230 states and 567132 transitions. Second operand 5 states. [2019-09-10 06:42:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:12,795 INFO L93 Difference]: Finished difference Result 461027 states and 566635 transitions. [2019-09-10 06:42:12,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:42:12,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 06:42:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:13,319 INFO L225 Difference]: With dead ends: 461027 [2019-09-10 06:42:13,320 INFO L226 Difference]: Without dead ends: 461027 [2019-09-10 06:42:13,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:42:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461027 states. [2019-09-10 06:42:24,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461027 to 421121. [2019-09-10 06:42:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421121 states. [2019-09-10 06:42:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421121 states to 421121 states and 516498 transitions. [2019-09-10 06:42:26,169 INFO L78 Accepts]: Start accepts. Automaton has 421121 states and 516498 transitions. Word has length 98 [2019-09-10 06:42:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:26,169 INFO L475 AbstractCegarLoop]: Abstraction has 421121 states and 516498 transitions. [2019-09-10 06:42:26,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:42:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 421121 states and 516498 transitions. [2019-09-10 06:42:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:42:26,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:26,176 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] [2019-09-10 06:42:26,177 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1378332097, now seen corresponding path program 1 times [2019-09-10 06:42:26,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:26,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:26,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:26,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:26,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:26,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:26,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:42:26,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:26,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:42:26,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:42:26,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:42:26,259 INFO L87 Difference]: Start difference. First operand 421121 states and 516498 transitions. Second operand 5 states. [2019-09-10 06:42:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:27,511 INFO L93 Difference]: Finished difference Result 521584 states and 638793 transitions. [2019-09-10 06:42:27,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:42:27,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 06:42:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:29,641 INFO L225 Difference]: With dead ends: 521584 [2019-09-10 06:42:29,642 INFO L226 Difference]: Without dead ends: 521584 [2019-09-10 06:42:29,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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 06:42:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521584 states. [2019-09-10 06:42:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521584 to 472214. [2019-09-10 06:42:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472214 states. [2019-09-10 06:42:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472214 states to 472214 states and 577902 transitions. [2019-09-10 06:42:41,934 INFO L78 Accepts]: Start accepts. Automaton has 472214 states and 577902 transitions. Word has length 98 [2019-09-10 06:42:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:41,935 INFO L475 AbstractCegarLoop]: Abstraction has 472214 states and 577902 transitions. [2019-09-10 06:42:41,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:42:41,935 INFO L276 IsEmpty]: Start isEmpty. Operand 472214 states and 577902 transitions. [2019-09-10 06:42:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:42:41,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:41,944 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] [2019-09-10 06:42:41,945 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:41,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:41,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1537742470, now seen corresponding path program 1 times [2019-09-10 06:42:41,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:41,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:41,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:41,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:41,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:42:42,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:42,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:42:42,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:42,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:42:42,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:42:42,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:42:42,033 INFO L87 Difference]: Start difference. First operand 472214 states and 577902 transitions. Second operand 3 states. [2019-09-10 06:42:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:44,226 INFO L93 Difference]: Finished difference Result 431005 states and 523050 transitions. [2019-09-10 06:42:44,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:42:44,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 06:42:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:44,903 INFO L225 Difference]: With dead ends: 431005 [2019-09-10 06:42:44,903 INFO L226 Difference]: Without dead ends: 414383 [2019-09-10 06:42:44,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 06:42:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414383 states. [2019-09-10 06:42:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414383 to 288689. [2019-09-10 06:42:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288689 states. [2019-09-10 06:42:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288689 states to 288689 states and 352016 transitions. [2019-09-10 06:42:54,449 INFO L78 Accepts]: Start accepts. Automaton has 288689 states and 352016 transitions. Word has length 100 [2019-09-10 06:42:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:54,450 INFO L475 AbstractCegarLoop]: Abstraction has 288689 states and 352016 transitions. [2019-09-10 06:42:54,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:42:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 288689 states and 352016 transitions. [2019-09-10 06:42:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:42:54,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:54,458 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] [2019-09-10 06:42:54,458 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash 887178001, now seen corresponding path program 1 times [2019-09-10 06:42:54,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:54,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:54,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:54,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:54,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:42:54,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:54,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:42:54,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:42:54,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:42:54,523 INFO L87 Difference]: Start difference. First operand 288689 states and 352016 transitions. Second operand 3 states. [2019-09-10 06:42:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:56,041 INFO L93 Difference]: Finished difference Result 369924 states and 448448 transitions. [2019-09-10 06:42:56,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:42:56,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 06:42:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:56,486 INFO L225 Difference]: With dead ends: 369924 [2019-09-10 06:42:56,487 INFO L226 Difference]: Without dead ends: 369924 [2019-09-10 06:42:56,487 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 06:42:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369924 states. [2019-09-10 06:43:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369924 to 279803. [2019-09-10 06:43:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279803 states. [2019-09-10 06:43:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279803 states to 279803 states and 339866 transitions. [2019-09-10 06:43:00,399 INFO L78 Accepts]: Start accepts. Automaton has 279803 states and 339866 transitions. Word has length 101 [2019-09-10 06:43:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:00,399 INFO L475 AbstractCegarLoop]: Abstraction has 279803 states and 339866 transitions. [2019-09-10 06:43:00,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:43:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 279803 states and 339866 transitions. [2019-09-10 06:43:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:43:00,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:00,408 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] [2019-09-10 06:43:00,408 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1476573405, now seen corresponding path program 1 times [2019-09-10 06:43:00,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:00,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:00,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:00,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:00,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:43:00,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:43:00,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:43:00,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:43:00,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:43:00,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:43:00,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:43:00,555 INFO L87 Difference]: Start difference. First operand 279803 states and 339866 transitions. Second operand 9 states. [2019-09-10 06:43:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:03,308 INFO L93 Difference]: Finished difference Result 404999 states and 490023 transitions. [2019-09-10 06:43:03,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:43:03,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 06:43:03,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:03,906 INFO L225 Difference]: With dead ends: 404999 [2019-09-10 06:43:03,906 INFO L226 Difference]: Without dead ends: 404999 [2019-09-10 06:43:03,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:43:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404999 states. [2019-09-10 06:43:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404999 to 279803. [2019-09-10 06:43:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279803 states. [2019-09-10 06:43:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279803 states to 279803 states and 339864 transitions. [2019-09-10 06:43:11,647 INFO L78 Accepts]: Start accepts. Automaton has 279803 states and 339864 transitions. Word has length 103 [2019-09-10 06:43:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:11,648 INFO L475 AbstractCegarLoop]: Abstraction has 279803 states and 339864 transitions. [2019-09-10 06:43:11,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:43:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 279803 states and 339864 transitions. [2019-09-10 06:43:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:43:11,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:11,656 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] [2019-09-10 06:43:11,656 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1536461249, now seen corresponding path program 1 times [2019-09-10 06:43:11,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:11,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:11,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:11,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:11,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:43:11,851 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 06:43:11,852 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [185], [201], [205], [2148], [2151], [2154], [2157], [2162], [2165], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2220], [2222], [2224], [2227], [2230], [2233], [2241], [2243], [2266], [2269], [2272], [2275], [2283], [2285], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3744], [3747], [3750], [3753], [3756], [3760], [3763], [3767], [3770], [3774], [3806], [3809], [3813], [3816], [3819], [3822], [3827], [3830], [3833], [3836], [3840], [3844], [3848], [3851], [3854], [3857], [3865], [3869], [4986], [4987], [4991], [4992], [4993] [2019-09-10 06:43:11,858 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:43:11,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:43:11,903 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:43:12,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:43:12,970 INFO L272 AbstractInterpreter]: Visited 99 different actions 430 times. Merged at 38 different actions 302 times. Widened at 15 different actions 50 times. Performed 1607 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1607 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 13 different actions. Largest state had 255 variables. [2019-09-10 06:43:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:12,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:43:12,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:12,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:43:12,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:12,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:43:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:13,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:43:13,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:43:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:13,615 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:43:13,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:13,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:13,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:13,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:16,442 WARN L188 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-09-10 06:43:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:43:17,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:43:17,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 26 [2019-09-10 06:43:17,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:43:17,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:43:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:43:17,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:43:17,311 INFO L87 Difference]: Start difference. First operand 279803 states and 339864 transitions. Second operand 19 states. [2019-09-10 06:43:17,677 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 06:43:18,107 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:43:18,342 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 06:43:18,755 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:43:20,693 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-10 06:43:21,181 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:43:21,916 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 06:43:22,500 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 06:43:22,868 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 06:43:25,176 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 06:43:25,492 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 06:43:25,814 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 06:43:26,094 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 06:43:26,507 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 06:43:26,762 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:43:26,957 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 06:43:27,133 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:43:27,383 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:43:27,692 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 06:43:28,263 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 06:43:29,171 WARN L188 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:43:29,366 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 06:43:29,558 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:43:29,807 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:43:30,162 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 06:43:30,412 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:43:30,728 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 06:43:31,205 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 06:43:31,917 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 06:43:32,175 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 06:43:32,462 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:43:32,734 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 06:43:33,431 WARN L188 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:43:34,050 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 06:43:34,337 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 06:43:35,343 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 06:43:35,698 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:43:36,093 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:43:36,622 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:43:36,849 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:43:37,361 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:43:37,663 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:43:38,187 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:43:39,055 WARN L188 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 06:43:39,516 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 06:43:40,015 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 06:43:40,352 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:43:40,945 WARN L188 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 06:43:41,213 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 06:43:41,415 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:43:42,050 WARN L188 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:43:42,525 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:43:42,965 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 06:43:43,232 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:43:43,480 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:43:43,851 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:43:44,058 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:43:44,300 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 06:43:44,515 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 06:43:44,997 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 06:43:45,572 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 06:43:46,090 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 06:43:46,338 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 06:43:46,660 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 06:43:47,181 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 06:43:48,081 WARN L188 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:43:49,108 WARN L188 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 06:43:49,689 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 06:43:50,021 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:43:50,487 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 06:43:51,003 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:43:51,496 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:43:51,724 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:43:52,101 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:43:52,544 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 06:43:52,975 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:43:53,388 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 06:43:54,373 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:43:54,753 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 06:43:55,567 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 06:43:56,285 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 06:43:56,811 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:43:57,415 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:43:58,143 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 06:43:58,835 WARN L188 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 06:43:59,151 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 06:43:59,716 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-10 06:44:00,234 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 06:44:00,895 WARN L188 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:44:01,654 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-09-10 06:44:02,359 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:44:03,344 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:44:03,884 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-10 06:44:04,260 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 06:44:04,570 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 06:44:05,625 WARN L188 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 06:44:06,143 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:44:06,569 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:44:06,816 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:44:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:08,598 INFO L93 Difference]: Finished difference Result 854567 states and 1025802 transitions. [2019-09-10 06:44:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-10 06:44:08,599 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 104 [2019-09-10 06:44:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:08,599 INFO L225 Difference]: With dead ends: 854567 [2019-09-10 06:44:08,599 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 06:44:08,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 232 SyntacticMatches, 16 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=3747, Invalid=13809, Unknown=0, NotChecked=0, Total=17556 [2019-09-10 06:44:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 06:44:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 06:44:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 06:44:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 06:44:08,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2019-09-10 06:44:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:08,605 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 06:44:08,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:44:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 06:44:08,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 06:44:08,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 06:44:08 BoogieIcfgContainer [2019-09-10 06:44:08,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 06:44:08,612 INFO L168 Benchmark]: Toolchain (without parser) took 421131.70 ms. Allocated memory was 132.6 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 82.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-09-10 06:44:08,613 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory is still 106.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 06:44:08,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1673.80 ms. Allocated memory was 132.6 MB in the beginning and 218.6 MB in the end (delta: 86.0 MB). Free memory was 82.4 MB in the beginning and 122.3 MB in the end (delta: -39.9 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. [2019-09-10 06:44:08,614 INFO L168 Benchmark]: Boogie Preprocessor took 343.99 ms. Allocated memory is still 218.6 MB. Free memory was 122.3 MB in the beginning and 108.1 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2019-09-10 06:44:08,614 INFO L168 Benchmark]: RCFGBuilder took 3631.89 ms. Allocated memory was 218.6 MB in the beginning and 355.5 MB in the end (delta: 136.8 MB). Free memory was 108.1 MB in the beginning and 221.1 MB in the end (delta: -112.9 MB). Peak memory consumption was 92.2 MB. Max. memory is 7.1 GB. [2019-09-10 06:44:08,615 INFO L168 Benchmark]: TraceAbstraction took 415476.84 ms. Allocated memory was 355.5 MB in the beginning and 4.0 GB in the end (delta: 3.6 GB). Free memory was 216.9 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-09-10 06:44:08,617 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory is still 106.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1673.80 ms. Allocated memory was 132.6 MB in the beginning and 218.6 MB in the end (delta: 86.0 MB). Free memory was 82.4 MB in the beginning and 122.3 MB in the end (delta: -39.9 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 343.99 ms. Allocated memory is still 218.6 MB. Free memory was 122.3 MB in the beginning and 108.1 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3631.89 ms. Allocated memory was 218.6 MB in the beginning and 355.5 MB in the end (delta: 136.8 MB). Free memory was 108.1 MB in the beginning and 221.1 MB in the end (delta: -112.9 MB). Peak memory consumption was 92.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 415476.84 ms. Allocated memory was 355.5 MB in the beginning and 4.0 GB in the end (delta: 3.6 GB). Free memory was 216.9 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 721]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3451]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1855]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5743]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 370]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 1259 locations, 6 error locations. SAFE Result, 415.4s OverallTime, 47 OverallIterations, 2 TraceHistogramMax, 187.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28113 SDtfs, 88413 SDslu, 63510 SDs, 0 SdLazy, 40998 SolverSat, 2583 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1677 GetRequests, 1021 SyntacticMatches, 40 SemanticMatches, 616 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7932 ImplicationChecksByTransitivity, 58.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=472446occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.5s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 206.4s AutomataMinimizationTime, 47 MinimizatonAttempts, 3970825 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 4172 NumberOfCodeBlocks, 4172 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 4597 ConstructedInterpolants, 168 QuantifiedInterpolants, 3400922 SizeOfPredicates, 44 NumberOfNonLiveVariables, 6770 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 57 InterpolantComputations, 46 PerfectInterpolantSequences, 212/258 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...