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.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:35:46,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:35:46,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:35:46,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:35:46,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:35:46,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:35:46,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:35:46,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:35:46,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:35:46,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:35:46,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:35:46,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:35:46,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:35:46,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:35:46,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:35:46,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:35:46,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:35:46,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:35:46,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:35:46,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:35:46,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:35:46,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:35:46,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:35:46,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:35:46,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:35:46,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:35:46,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:35:46,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:35:46,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:35:46,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:35:46,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:35:46,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:35:46,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:35:46,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:35:46,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:35:46,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:35:46,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:35:46,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:35:46,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:35:46,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:35:46,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:35:46,400 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:35:46,413 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:35:46,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:35:46,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:35:46,414 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:35:46,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:35:46,415 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:35:46,415 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:35:46,416 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:35:46,416 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:35:46,416 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:35:46,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:35:46,417 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:35:46,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:35:46,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:35:46,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:35:46,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:35:46,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:35:46,418 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:35:46,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:35:46,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:35:46,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:35:46,419 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:35:46,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:35:46,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:35:46,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:35:46,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:35:46,420 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:35:46,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:35:46,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:35:46,420 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:35:46,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:35:46,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:35:46,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:35:46,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:35:46,464 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:35:46,465 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.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 06:35:46,522 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190b5b9b6/c39b4227fdb44030b41e6fe56c905ed6/FLAGb10ebf1a3 [2019-09-10 06:35:47,082 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:35:47,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 06:35:47,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190b5b9b6/c39b4227fdb44030b41e6fe56c905ed6/FLAGb10ebf1a3 [2019-09-10 06:35:47,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190b5b9b6/c39b4227fdb44030b41e6fe56c905ed6 [2019-09-10 06:35:47,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:35:47,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:35:47,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:35:47,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:35:47,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:35:47,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:35:47" (1/1) ... [2019-09-10 06:35:47,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:47, skipping insertion in model container [2019-09-10 06:35:47,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:35:47" (1/1) ... [2019-09-10 06:35:47,385 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:35:47,491 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:35:48,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:35:48,186 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:35:48,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:35:48,562 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:35:48,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:48 WrapperNode [2019-09-10 06:35:48,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:35:48,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:35:48,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:35:48,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:35:48,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:48" (1/1) ... [2019-09-10 06:35:48,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:48" (1/1) ... [2019-09-10 06:35:48,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:48" (1/1) ... [2019-09-10 06:35:48,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:48" (1/1) ... [2019-09-10 06:35:48,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:48" (1/1) ... [2019-09-10 06:35:48,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:48" (1/1) ... [2019-09-10 06:35:48,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:48" (1/1) ... [2019-09-10 06:35:48,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:35:48,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:35:48,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:35:48,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:35:48,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:35:48,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:35:48,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:35:48,783 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:35:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:35:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:35:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:35:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:35:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:35:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:35:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:35:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:35:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:35:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:35:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:35:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:35:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:35:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:35:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:35:50,639 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:35:50,640 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:35:50,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:35:50 BoogieIcfgContainer [2019-09-10 06:35:50,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:35:50,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:35:50,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:35:50,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:35:50,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:35:47" (1/3) ... [2019-09-10 06:35:50,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b04a7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:35:50, skipping insertion in model container [2019-09-10 06:35:50,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:35:48" (2/3) ... [2019-09-10 06:35:50,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b04a7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:35:50, skipping insertion in model container [2019-09-10 06:35:50,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:35:50" (3/3) ... [2019-09-10 06:35:50,655 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 06:35:50,668 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:35:50,676 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-10 06:35:50,693 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-10 06:35:50,720 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:35:50,720 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:35:50,720 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:35:50,720 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:35:50,720 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:35:50,721 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:35:50,721 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:35:50,721 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:35:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states. [2019-09-10 06:35:50,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:35:50,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:50,776 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:35:50,778 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:50,783 INFO L82 PathProgramCache]: Analyzing trace with hash 612696190, now seen corresponding path program 1 times [2019-09-10 06:35:50,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:50,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:50,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:50,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:50,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:51,258 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:35:51,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:51,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:35:51,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:51,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:35:51,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:35:51,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:35:51,286 INFO L87 Difference]: Start difference. First operand 462 states. Second operand 5 states. [2019-09-10 06:35:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:51,916 INFO L93 Difference]: Finished difference Result 502 states and 860 transitions. [2019-09-10 06:35:51,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:35:51,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-10 06:35:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:51,935 INFO L225 Difference]: With dead ends: 502 [2019-09-10 06:35:51,935 INFO L226 Difference]: Without dead ends: 490 [2019-09-10 06:35:51,937 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:35:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-10 06:35:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 484. [2019-09-10 06:35:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-10 06:35:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 654 transitions. [2019-09-10 06:35:52,033 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 654 transitions. Word has length 55 [2019-09-10 06:35:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:52,034 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 654 transitions. [2019-09-10 06:35:52,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:35:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 654 transitions. [2019-09-10 06:35:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:35:52,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:52,047 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:35:52,047 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:52,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1659380668, now seen corresponding path program 1 times [2019-09-10 06:35:52,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:52,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:52,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:52,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:52,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:52,300 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:35:52,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:52,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:35:52,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:52,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:35:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:35:52,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:52,307 INFO L87 Difference]: Start difference. First operand 484 states and 654 transitions. Second operand 3 states. [2019-09-10 06:35:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:52,379 INFO L93 Difference]: Finished difference Result 766 states and 1039 transitions. [2019-09-10 06:35:52,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:52,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:35:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:52,386 INFO L225 Difference]: With dead ends: 766 [2019-09-10 06:35:52,386 INFO L226 Difference]: Without dead ends: 766 [2019-09-10 06:35:52,387 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:35:52,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-09-10 06:35:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 758. [2019-09-10 06:35:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-09-10 06:35:52,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1033 transitions. [2019-09-10 06:35:52,428 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1033 transitions. Word has length 56 [2019-09-10 06:35:52,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:52,429 INFO L475 AbstractCegarLoop]: Abstraction has 758 states and 1033 transitions. [2019-09-10 06:35:52,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:35:52,429 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1033 transitions. [2019-09-10 06:35:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:35:52,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:52,432 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:35:52,432 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:52,433 INFO L82 PathProgramCache]: Analyzing trace with hash 438922513, now seen corresponding path program 1 times [2019-09-10 06:35:52,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:52,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:52,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:52,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:52,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:52,552 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:35:52,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:52,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:35:52,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:52,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:35:52,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:35:52,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:52,555 INFO L87 Difference]: Start difference. First operand 758 states and 1033 transitions. Second operand 3 states. [2019-09-10 06:35:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:52,592 INFO L93 Difference]: Finished difference Result 1102 states and 1521 transitions. [2019-09-10 06:35:52,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:52,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:35:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:52,600 INFO L225 Difference]: With dead ends: 1102 [2019-09-10 06:35:52,600 INFO L226 Difference]: Without dead ends: 1102 [2019-09-10 06:35:52,600 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:35:52,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-09-10 06:35:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1096. [2019-09-10 06:35:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2019-09-10 06:35:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1517 transitions. [2019-09-10 06:35:52,628 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1517 transitions. Word has length 56 [2019-09-10 06:35:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:52,629 INFO L475 AbstractCegarLoop]: Abstraction has 1096 states and 1517 transitions. [2019-09-10 06:35:52,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:35:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1517 transitions. [2019-09-10 06:35:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:35:52,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:52,632 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:35:52,632 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:52,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2011379690, now seen corresponding path program 1 times [2019-09-10 06:35:52,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:52,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:52,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:52,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:52,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:52,767 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:35:52,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:52,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:35:52,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:52,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:35:52,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:35:52,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:35:52,769 INFO L87 Difference]: Start difference. First operand 1096 states and 1517 transitions. Second operand 6 states. [2019-09-10 06:35:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:53,177 INFO L93 Difference]: Finished difference Result 1884 states and 2671 transitions. [2019-09-10 06:35:53,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:35:53,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:35:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:53,227 INFO L225 Difference]: With dead ends: 1884 [2019-09-10 06:35:53,227 INFO L226 Difference]: Without dead ends: 1884 [2019-09-10 06:35:53,227 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:35:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2019-09-10 06:35:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1864. [2019-09-10 06:35:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1864 states. [2019-09-10 06:35:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2655 transitions. [2019-09-10 06:35:53,270 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2655 transitions. Word has length 56 [2019-09-10 06:35:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:53,270 INFO L475 AbstractCegarLoop]: Abstraction has 1864 states and 2655 transitions. [2019-09-10 06:35:53,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:35:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2655 transitions. [2019-09-10 06:35:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:35:53,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:53,273 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:35:53,273 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:53,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:53,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1500009087, now seen corresponding path program 1 times [2019-09-10 06:35:53,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:53,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:53,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:53,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:53,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:53,394 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:35:53,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:53,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:35:53,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:53,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:35:53,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:35:53,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:35:53,399 INFO L87 Difference]: Start difference. First operand 1864 states and 2655 transitions. Second operand 6 states. [2019-09-10 06:35:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:53,809 INFO L93 Difference]: Finished difference Result 4346 states and 6207 transitions. [2019-09-10 06:35:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:35:53,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:35:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:53,831 INFO L225 Difference]: With dead ends: 4346 [2019-09-10 06:35:53,831 INFO L226 Difference]: Without dead ends: 4346 [2019-09-10 06:35:53,832 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:35:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-09-10 06:35:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4331. [2019-09-10 06:35:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4331 states. [2019-09-10 06:35:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 6196 transitions. [2019-09-10 06:35:53,954 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 6196 transitions. Word has length 57 [2019-09-10 06:35:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:53,954 INFO L475 AbstractCegarLoop]: Abstraction has 4331 states and 6196 transitions. [2019-09-10 06:35:53,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:35:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 6196 transitions. [2019-09-10 06:35:53,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:35:53,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:53,959 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:35:53,959 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:53,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1393968156, now seen corresponding path program 1 times [2019-09-10 06:35:53,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:53,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:53,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:53,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:53,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:54,087 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:35:54,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:54,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:35:54,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:54,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:35:54,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:35:54,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:54,092 INFO L87 Difference]: Start difference. First operand 4331 states and 6196 transitions. Second operand 3 states. [2019-09-10 06:35:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:54,218 INFO L93 Difference]: Finished difference Result 6265 states and 8864 transitions. [2019-09-10 06:35:54,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:54,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-10 06:35:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:54,252 INFO L225 Difference]: With dead ends: 6265 [2019-09-10 06:35:54,252 INFO L226 Difference]: Without dead ends: 6265 [2019-09-10 06:35:54,253 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:35:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6265 states. [2019-09-10 06:35:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6265 to 6218. [2019-09-10 06:35:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2019-09-10 06:35:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 8819 transitions. [2019-09-10 06:35:54,467 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 8819 transitions. Word has length 57 [2019-09-10 06:35:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:54,467 INFO L475 AbstractCegarLoop]: Abstraction has 6218 states and 8819 transitions. [2019-09-10 06:35:54,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:35:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 8819 transitions. [2019-09-10 06:35:54,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:35:54,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:54,475 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:35:54,476 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash 605372369, now seen corresponding path program 1 times [2019-09-10 06:35:54,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:54,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:54,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:54,611 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:35:54,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:54,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:35:54,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:54,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:35:54,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:35:54,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:35:54,614 INFO L87 Difference]: Start difference. First operand 6218 states and 8819 transitions. Second operand 7 states. [2019-09-10 06:35:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:55,476 INFO L93 Difference]: Finished difference Result 20805 states and 29807 transitions. [2019-09-10 06:35:55,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:35:55,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:35:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:55,553 INFO L225 Difference]: With dead ends: 20805 [2019-09-10 06:35:55,554 INFO L226 Difference]: Without dead ends: 20805 [2019-09-10 06:35:55,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:35:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20805 states. [2019-09-10 06:35:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20805 to 6240. [2019-09-10 06:35:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6240 states. [2019-09-10 06:35:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6240 states to 6240 states and 8850 transitions. [2019-09-10 06:35:55,899 INFO L78 Accepts]: Start accepts. Automaton has 6240 states and 8850 transitions. Word has length 58 [2019-09-10 06:35:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:55,901 INFO L475 AbstractCegarLoop]: Abstraction has 6240 states and 8850 transitions. [2019-09-10 06:35:55,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:35:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 6240 states and 8850 transitions. [2019-09-10 06:35:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:35:55,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:55,904 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:35:55,906 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:55,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:55,906 INFO L82 PathProgramCache]: Analyzing trace with hash -879419620, now seen corresponding path program 1 times [2019-09-10 06:35:55,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:55,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:55,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:55,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:55,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:56,058 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:35:56,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:56,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:35:56,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:56,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:35:56,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:35:56,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:35:56,061 INFO L87 Difference]: Start difference. First operand 6240 states and 8850 transitions. Second operand 7 states. [2019-09-10 06:35:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:56,745 INFO L93 Difference]: Finished difference Result 18129 states and 25924 transitions. [2019-09-10 06:35:56,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:35:56,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:35:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:56,783 INFO L225 Difference]: With dead ends: 18129 [2019-09-10 06:35:56,784 INFO L226 Difference]: Without dead ends: 18129 [2019-09-10 06:35:56,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:35:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18129 states. [2019-09-10 06:35:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18129 to 6254. [2019-09-10 06:35:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6254 states. [2019-09-10 06:35:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 8868 transitions. [2019-09-10 06:35:57,121 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 8868 transitions. Word has length 58 [2019-09-10 06:35:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:57,122 INFO L475 AbstractCegarLoop]: Abstraction has 6254 states and 8868 transitions. [2019-09-10 06:35:57,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:35:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 8868 transitions. [2019-09-10 06:35:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:35:57,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:57,125 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:35:57,126 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:57,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:57,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1079105450, now seen corresponding path program 1 times [2019-09-10 06:35:57,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:57,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:57,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:57,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:57,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:57,221 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:35:57,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:57,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:35:57,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:57,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:35:57,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:35:57,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:35:57,223 INFO L87 Difference]: Start difference. First operand 6254 states and 8868 transitions. Second operand 7 states. [2019-09-10 06:35:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:58,067 INFO L93 Difference]: Finished difference Result 27809 states and 39754 transitions. [2019-09-10 06:35:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:35:58,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:35:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:58,121 INFO L225 Difference]: With dead ends: 27809 [2019-09-10 06:35:58,122 INFO L226 Difference]: Without dead ends: 27809 [2019-09-10 06:35:58,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:35:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27809 states. [2019-09-10 06:35:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27809 to 6288. [2019-09-10 06:35:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6288 states. [2019-09-10 06:35:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6288 states to 6288 states and 8912 transitions. [2019-09-10 06:35:58,844 INFO L78 Accepts]: Start accepts. Automaton has 6288 states and 8912 transitions. Word has length 58 [2019-09-10 06:35:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:58,844 INFO L475 AbstractCegarLoop]: Abstraction has 6288 states and 8912 transitions. [2019-09-10 06:35:58,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:35:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6288 states and 8912 transitions. [2019-09-10 06:35:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:35:58,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:58,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:58,848 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:58,849 INFO L82 PathProgramCache]: Analyzing trace with hash 184722790, now seen corresponding path program 1 times [2019-09-10 06:35:58,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:58,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:58,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:58,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:58,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:58,995 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:35:58,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:58,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:35:58,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:58,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:35:58,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:35:58,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:35:58,997 INFO L87 Difference]: Start difference. First operand 6288 states and 8912 transitions. Second operand 9 states. [2019-09-10 06:36:00,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:00,494 INFO L93 Difference]: Finished difference Result 22597 states and 32392 transitions. [2019-09-10 06:36:00,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:36:00,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-10 06:36:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:00,537 INFO L225 Difference]: With dead ends: 22597 [2019-09-10 06:36:00,538 INFO L226 Difference]: Without dead ends: 22597 [2019-09-10 06:36:00,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:36:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22597 states. [2019-09-10 06:36:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22597 to 6254. [2019-09-10 06:36:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6254 states. [2019-09-10 06:36:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 8866 transitions. [2019-09-10 06:36:00,808 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 8866 transitions. Word has length 59 [2019-09-10 06:36:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:00,808 INFO L475 AbstractCegarLoop]: Abstraction has 6254 states and 8866 transitions. [2019-09-10 06:36:00,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:36:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 8866 transitions. [2019-09-10 06:36:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:36:00,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:00,812 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:36:00,813 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash -869337794, now seen corresponding path program 1 times [2019-09-10 06:36:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:00,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:00,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:00,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:00,962 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:36:00,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:00,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:36:00,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:00,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:36:00,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:36:00,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:36:00,964 INFO L87 Difference]: Start difference. First operand 6254 states and 8866 transitions. Second operand 9 states. [2019-09-10 06:36:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:02,505 INFO L93 Difference]: Finished difference Result 22531 states and 32813 transitions. [2019-09-10 06:36:02,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:36:02,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-10 06:36:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:02,562 INFO L225 Difference]: With dead ends: 22531 [2019-09-10 06:36:02,562 INFO L226 Difference]: Without dead ends: 22531 [2019-09-10 06:36:02,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:36:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22531 states. [2019-09-10 06:36:02,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22531 to 6254. [2019-09-10 06:36:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6254 states. [2019-09-10 06:36:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 8864 transitions. [2019-09-10 06:36:02,835 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 8864 transitions. Word has length 59 [2019-09-10 06:36:02,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:02,835 INFO L475 AbstractCegarLoop]: Abstraction has 6254 states and 8864 transitions. [2019-09-10 06:36:02,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:36:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 8864 transitions. [2019-09-10 06:36:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:36:02,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:02,841 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:36:02,842 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:02,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:02,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2011941325, now seen corresponding path program 1 times [2019-09-10 06:36:02,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:02,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:02,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:02,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:02,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:03,101 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:36:03,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:03,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:36:03,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:03,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:36:03,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:36:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:36:03,103 INFO L87 Difference]: Start difference. First operand 6254 states and 8864 transitions. Second operand 8 states. [2019-09-10 06:36:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:04,253 INFO L93 Difference]: Finished difference Result 18078 states and 26173 transitions. [2019-09-10 06:36:04,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:36:04,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-09-10 06:36:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:04,292 INFO L225 Difference]: With dead ends: 18078 [2019-09-10 06:36:04,292 INFO L226 Difference]: Without dead ends: 18078 [2019-09-10 06:36:04,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:36:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18078 states. [2019-09-10 06:36:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18078 to 6097. [2019-09-10 06:36:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6097 states. [2019-09-10 06:36:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6097 states to 6097 states and 8658 transitions. [2019-09-10 06:36:04,514 INFO L78 Accepts]: Start accepts. Automaton has 6097 states and 8658 transitions. Word has length 59 [2019-09-10 06:36:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:04,514 INFO L475 AbstractCegarLoop]: Abstraction has 6097 states and 8658 transitions. [2019-09-10 06:36:04,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:36:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6097 states and 8658 transitions. [2019-09-10 06:36:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:36:04,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:04,518 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:36:04,518 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:04,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:04,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2023106222, now seen corresponding path program 1 times [2019-09-10 06:36:04,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:04,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:04,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:04,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:04,590 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:36:04,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:04,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:04,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:04,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:04,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:04,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:04,592 INFO L87 Difference]: Start difference. First operand 6097 states and 8658 transitions. Second operand 3 states. [2019-09-10 06:36:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:04,635 INFO L93 Difference]: Finished difference Result 6103 states and 8570 transitions. [2019-09-10 06:36:04,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:04,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:36:04,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:04,646 INFO L225 Difference]: With dead ends: 6103 [2019-09-10 06:36:04,646 INFO L226 Difference]: Without dead ends: 6103 [2019-09-10 06:36:04,647 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:36:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6103 states. [2019-09-10 06:36:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6103 to 6097. [2019-09-10 06:36:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6097 states. [2019-09-10 06:36:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6097 states to 6097 states and 8566 transitions. [2019-09-10 06:36:04,721 INFO L78 Accepts]: Start accepts. Automaton has 6097 states and 8566 transitions. Word has length 60 [2019-09-10 06:36:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:04,722 INFO L475 AbstractCegarLoop]: Abstraction has 6097 states and 8566 transitions. [2019-09-10 06:36:04,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 6097 states and 8566 transitions. [2019-09-10 06:36:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:36:04,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:04,726 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:36:04,727 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:04,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:04,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2132862918, now seen corresponding path program 1 times [2019-09-10 06:36:04,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:04,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:04,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:04,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:04,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:04,802 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:36:04,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:04,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:04,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:04,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:04,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:04,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:04,804 INFO L87 Difference]: Start difference. First operand 6097 states and 8566 transitions. Second operand 3 states. [2019-09-10 06:36:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:04,857 INFO L93 Difference]: Finished difference Result 6104 states and 8471 transitions. [2019-09-10 06:36:04,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:04,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:36:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:04,868 INFO L225 Difference]: With dead ends: 6104 [2019-09-10 06:36:04,868 INFO L226 Difference]: Without dead ends: 6104 [2019-09-10 06:36:04,869 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:36:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6104 states. [2019-09-10 06:36:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6104 to 6097. [2019-09-10 06:36:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6097 states. [2019-09-10 06:36:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6097 states to 6097 states and 8466 transitions. [2019-09-10 06:36:04,944 INFO L78 Accepts]: Start accepts. Automaton has 6097 states and 8466 transitions. Word has length 60 [2019-09-10 06:36:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:04,944 INFO L475 AbstractCegarLoop]: Abstraction has 6097 states and 8466 transitions. [2019-09-10 06:36:04,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6097 states and 8466 transitions. [2019-09-10 06:36:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:36:04,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:04,948 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:36:04,948 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:04,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:04,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1598100968, now seen corresponding path program 1 times [2019-09-10 06:36:04,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:04,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:04,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:04,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:04,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:05,022 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:36:05,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:05,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:05,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:05,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:05,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:05,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:05,024 INFO L87 Difference]: Start difference. First operand 6097 states and 8466 transitions. Second operand 3 states. [2019-09-10 06:36:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:05,062 INFO L93 Difference]: Finished difference Result 6063 states and 8243 transitions. [2019-09-10 06:36:05,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:05,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:36:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:05,072 INFO L225 Difference]: With dead ends: 6063 [2019-09-10 06:36:05,073 INFO L226 Difference]: Without dead ends: 6063 [2019-09-10 06:36:05,075 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:36:05,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2019-09-10 06:36:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 6057. [2019-09-10 06:36:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6057 states. [2019-09-10 06:36:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6057 states to 6057 states and 8239 transitions. [2019-09-10 06:36:05,144 INFO L78 Accepts]: Start accepts. Automaton has 6057 states and 8239 transitions. Word has length 60 [2019-09-10 06:36:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:05,145 INFO L475 AbstractCegarLoop]: Abstraction has 6057 states and 8239 transitions. [2019-09-10 06:36:05,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 6057 states and 8239 transitions. [2019-09-10 06:36:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:05,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:05,149 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:36:05,150 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:05,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:05,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1654307287, now seen corresponding path program 1 times [2019-09-10 06:36:05,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:05,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:05,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:05,229 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:36:05,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:05,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:05,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:05,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:05,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:05,231 INFO L87 Difference]: Start difference. First operand 6057 states and 8239 transitions. Second operand 3 states. [2019-09-10 06:36:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:05,326 INFO L93 Difference]: Finished difference Result 7053 states and 9629 transitions. [2019-09-10 06:36:05,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:05,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:36:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:05,334 INFO L225 Difference]: With dead ends: 7053 [2019-09-10 06:36:05,334 INFO L226 Difference]: Without dead ends: 7053 [2019-09-10 06:36:05,334 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:36:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7053 states. [2019-09-10 06:36:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7053 to 5674. [2019-09-10 06:36:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5674 states. [2019-09-10 06:36:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 7737 transitions. [2019-09-10 06:36:05,402 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 7737 transitions. Word has length 61 [2019-09-10 06:36:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:05,402 INFO L475 AbstractCegarLoop]: Abstraction has 5674 states and 7737 transitions. [2019-09-10 06:36:05,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 7737 transitions. [2019-09-10 06:36:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:36:05,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:05,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:05,406 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:05,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:05,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1763616113, now seen corresponding path program 1 times [2019-09-10 06:36:05,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:05,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:05,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:05,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:05,470 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:36:05,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:05,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:05,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:05,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:05,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:05,472 INFO L87 Difference]: Start difference. First operand 5674 states and 7737 transitions. Second operand 3 states. [2019-09-10 06:36:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:05,536 INFO L93 Difference]: Finished difference Result 7962 states and 10954 transitions. [2019-09-10 06:36:05,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:05,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-10 06:36:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:05,545 INFO L225 Difference]: With dead ends: 7962 [2019-09-10 06:36:05,546 INFO L226 Difference]: Without dead ends: 7962 [2019-09-10 06:36:05,548 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:36:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7962 states. [2019-09-10 06:36:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7962 to 5613. [2019-09-10 06:36:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-09-10 06:36:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 7645 transitions. [2019-09-10 06:36:05,644 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 7645 transitions. Word has length 62 [2019-09-10 06:36:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:05,645 INFO L475 AbstractCegarLoop]: Abstraction has 5613 states and 7645 transitions. [2019-09-10 06:36:05,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 7645 transitions. [2019-09-10 06:36:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:36:05,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:05,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:05,649 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:05,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash -131917929, now seen corresponding path program 1 times [2019-09-10 06:36:05,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:05,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:05,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:05,715 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:36:05,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:05,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:05,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:05,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:05,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:05,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:05,717 INFO L87 Difference]: Start difference. First operand 5613 states and 7645 transitions. Second operand 3 states. [2019-09-10 06:36:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:05,794 INFO L93 Difference]: Finished difference Result 7875 states and 10820 transitions. [2019-09-10 06:36:05,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:05,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-10 06:36:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:05,803 INFO L225 Difference]: With dead ends: 7875 [2019-09-10 06:36:05,803 INFO L226 Difference]: Without dead ends: 7875 [2019-09-10 06:36:05,803 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:36:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7875 states. [2019-09-10 06:36:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7875 to 5524. [2019-09-10 06:36:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5524 states. [2019-09-10 06:36:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 7521 transitions. [2019-09-10 06:36:05,870 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 7521 transitions. Word has length 62 [2019-09-10 06:36:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:05,870 INFO L475 AbstractCegarLoop]: Abstraction has 5524 states and 7521 transitions. [2019-09-10 06:36:05,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 7521 transitions. [2019-09-10 06:36:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:36:05,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:05,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:05,874 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:05,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:05,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1773291386, now seen corresponding path program 1 times [2019-09-10 06:36:05,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:05,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:05,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:05,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:05,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:06,693 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:36:06,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:06,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:36:06,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:06,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:36:06,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:36:06,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:36:06,697 INFO L87 Difference]: Start difference. First operand 5524 states and 7521 transitions. Second operand 13 states. [2019-09-10 06:36:08,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:08,294 INFO L93 Difference]: Finished difference Result 9088 states and 12508 transitions. [2019-09-10 06:36:08,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:36:08,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-09-10 06:36:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:08,304 INFO L225 Difference]: With dead ends: 9088 [2019-09-10 06:36:08,304 INFO L226 Difference]: Without dead ends: 9088 [2019-09-10 06:36:08,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:36:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2019-09-10 06:36:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 5520. [2019-09-10 06:36:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5520 states. [2019-09-10 06:36:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5520 states to 5520 states and 7516 transitions. [2019-09-10 06:36:08,379 INFO L78 Accepts]: Start accepts. Automaton has 5520 states and 7516 transitions. Word has length 62 [2019-09-10 06:36:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:08,380 INFO L475 AbstractCegarLoop]: Abstraction has 5520 states and 7516 transitions. [2019-09-10 06:36:08,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:36:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 5520 states and 7516 transitions. [2019-09-10 06:36:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:36:08,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:08,384 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:08,384 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:08,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:08,385 INFO L82 PathProgramCache]: Analyzing trace with hash -625592832, now seen corresponding path program 1 times [2019-09-10 06:36:08,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:08,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:08,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:08,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:08,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:08,850 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:36:08,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:08,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:36:08,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:08,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:36:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:36:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:36:08,853 INFO L87 Difference]: Start difference. First operand 5520 states and 7516 transitions. Second operand 10 states. [2019-09-10 06:36:09,290 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-09-10 06:36:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:10,191 INFO L93 Difference]: Finished difference Result 11461 states and 15832 transitions. [2019-09-10 06:36:10,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:36:10,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-09-10 06:36:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:10,205 INFO L225 Difference]: With dead ends: 11461 [2019-09-10 06:36:10,206 INFO L226 Difference]: Without dead ends: 11461 [2019-09-10 06:36:10,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:36:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-09-10 06:36:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 5451. [2019-09-10 06:36:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5451 states. [2019-09-10 06:36:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5451 states to 5451 states and 7436 transitions. [2019-09-10 06:36:10,294 INFO L78 Accepts]: Start accepts. Automaton has 5451 states and 7436 transitions. Word has length 62 [2019-09-10 06:36:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:10,295 INFO L475 AbstractCegarLoop]: Abstraction has 5451 states and 7436 transitions. [2019-09-10 06:36:10,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:36:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 5451 states and 7436 transitions. [2019-09-10 06:36:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:36:10,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:10,302 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:36:10,302 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:10,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:10,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2083745963, now seen corresponding path program 1 times [2019-09-10 06:36:10,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:10,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:10,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:10,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:10,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:10,398 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:36:10,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:10,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:10,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:10,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:10,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:10,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:10,400 INFO L87 Difference]: Start difference. First operand 5451 states and 7436 transitions. Second operand 6 states. [2019-09-10 06:36:10,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:10,570 INFO L93 Difference]: Finished difference Result 18835 states and 25651 transitions. [2019-09-10 06:36:10,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:36:10,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-10 06:36:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:10,594 INFO L225 Difference]: With dead ends: 18835 [2019-09-10 06:36:10,595 INFO L226 Difference]: Without dead ends: 18835 [2019-09-10 06:36:10,595 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:36:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18835 states. [2019-09-10 06:36:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18835 to 14483. [2019-09-10 06:36:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14483 states. [2019-09-10 06:36:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14483 states to 14483 states and 19685 transitions. [2019-09-10 06:36:10,746 INFO L78 Accepts]: Start accepts. Automaton has 14483 states and 19685 transitions. Word has length 72 [2019-09-10 06:36:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:10,746 INFO L475 AbstractCegarLoop]: Abstraction has 14483 states and 19685 transitions. [2019-09-10 06:36:10,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 14483 states and 19685 transitions. [2019-09-10 06:36:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:36:10,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:10,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:10,755 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:10,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:10,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1744904066, now seen corresponding path program 1 times [2019-09-10 06:36:10,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:10,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:10,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:10,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:10,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:10,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:36:10,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:10,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:10,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:10,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:10,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:10,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:10,842 INFO L87 Difference]: Start difference. First operand 14483 states and 19685 transitions. Second operand 5 states. [2019-09-10 06:36:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:10,965 INFO L93 Difference]: Finished difference Result 13667 states and 18612 transitions. [2019-09-10 06:36:10,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:10,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-09-10 06:36:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:10,983 INFO L225 Difference]: With dead ends: 13667 [2019-09-10 06:36:10,983 INFO L226 Difference]: Without dead ends: 13667 [2019-09-10 06:36:10,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13667 states. [2019-09-10 06:36:11,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13667 to 13663. [2019-09-10 06:36:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13663 states. [2019-09-10 06:36:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13663 states to 13663 states and 18610 transitions. [2019-09-10 06:36:11,119 INFO L78 Accepts]: Start accepts. Automaton has 13663 states and 18610 transitions. Word has length 73 [2019-09-10 06:36:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:11,119 INFO L475 AbstractCegarLoop]: Abstraction has 13663 states and 18610 transitions. [2019-09-10 06:36:11,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 13663 states and 18610 transitions. [2019-09-10 06:36:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:36:11,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:11,128 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:36:11,128 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:11,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:11,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1665118235, now seen corresponding path program 1 times [2019-09-10 06:36:11,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:11,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:11,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:11,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:11,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:11,238 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:36:11,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:11,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:11,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:11,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:11,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:11,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:11,240 INFO L87 Difference]: Start difference. First operand 13663 states and 18610 transitions. Second operand 6 states. [2019-09-10 06:36:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:11,430 INFO L93 Difference]: Finished difference Result 25201 states and 33833 transitions. [2019-09-10 06:36:11,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:36:11,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-10 06:36:11,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:11,464 INFO L225 Difference]: With dead ends: 25201 [2019-09-10 06:36:11,465 INFO L226 Difference]: Without dead ends: 25201 [2019-09-10 06:36:11,466 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:36:11,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25201 states. [2019-09-10 06:36:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25201 to 13993. [2019-09-10 06:36:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13993 states. [2019-09-10 06:36:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13993 states to 13993 states and 18830 transitions. [2019-09-10 06:36:11,755 INFO L78 Accepts]: Start accepts. Automaton has 13993 states and 18830 transitions. Word has length 74 [2019-09-10 06:36:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:11,756 INFO L475 AbstractCegarLoop]: Abstraction has 13993 states and 18830 transitions. [2019-09-10 06:36:11,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 13993 states and 18830 transitions. [2019-09-10 06:36:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:36:11,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:11,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:11,768 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:11,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1859339602, now seen corresponding path program 1 times [2019-09-10 06:36:11,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:11,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:11,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:11,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:11,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:11,856 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:36:11,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:11,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:11,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:11,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:11,858 INFO L87 Difference]: Start difference. First operand 13993 states and 18830 transitions. Second operand 3 states. [2019-09-10 06:36:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:11,970 INFO L93 Difference]: Finished difference Result 25345 states and 33732 transitions. [2019-09-10 06:36:11,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:11,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:36:11,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:12,000 INFO L225 Difference]: With dead ends: 25345 [2019-09-10 06:36:12,000 INFO L226 Difference]: Without dead ends: 25345 [2019-09-10 06:36:12,001 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:36:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25345 states. [2019-09-10 06:36:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25345 to 23771. [2019-09-10 06:36:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23771 states. [2019-09-10 06:36:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23771 states to 23771 states and 31823 transitions. [2019-09-10 06:36:12,263 INFO L78 Accepts]: Start accepts. Automaton has 23771 states and 31823 transitions. Word has length 75 [2019-09-10 06:36:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:12,263 INFO L475 AbstractCegarLoop]: Abstraction has 23771 states and 31823 transitions. [2019-09-10 06:36:12,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 23771 states and 31823 transitions. [2019-09-10 06:36:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:36:12,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:12,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:12,270 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:12,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:12,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1309001061, now seen corresponding path program 1 times [2019-09-10 06:36:12,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:12,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:12,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:12,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:12,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:12,331 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:36:12,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:12,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:12,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:12,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:12,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:12,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:12,333 INFO L87 Difference]: Start difference. First operand 23771 states and 31823 transitions. Second operand 3 states. [2019-09-10 06:36:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:12,443 INFO L93 Difference]: Finished difference Result 43242 states and 56805 transitions. [2019-09-10 06:36:12,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:12,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:36:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:12,492 INFO L225 Difference]: With dead ends: 43242 [2019-09-10 06:36:12,492 INFO L226 Difference]: Without dead ends: 43242 [2019-09-10 06:36:12,492 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:36:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43242 states. [2019-09-10 06:36:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43242 to 39960. [2019-09-10 06:36:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39960 states. [2019-09-10 06:36:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39960 states to 39960 states and 52654 transitions. [2019-09-10 06:36:12,948 INFO L78 Accepts]: Start accepts. Automaton has 39960 states and 52654 transitions. Word has length 76 [2019-09-10 06:36:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:12,948 INFO L475 AbstractCegarLoop]: Abstraction has 39960 states and 52654 transitions. [2019-09-10 06:36:12,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 39960 states and 52654 transitions. [2019-09-10 06:36:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:36:12,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:12,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:12,953 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:12,953 INFO L82 PathProgramCache]: Analyzing trace with hash 449656965, now seen corresponding path program 1 times [2019-09-10 06:36:12,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:12,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:12,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:12,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:12,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:13,005 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:36:13,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:13,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:13,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:13,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:13,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:13,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:13,006 INFO L87 Difference]: Start difference. First operand 39960 states and 52654 transitions. Second operand 3 states. [2019-09-10 06:36:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:13,157 INFO L93 Difference]: Finished difference Result 58490 states and 76271 transitions. [2019-09-10 06:36:13,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:13,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:36:13,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:13,235 INFO L225 Difference]: With dead ends: 58490 [2019-09-10 06:36:13,235 INFO L226 Difference]: Without dead ends: 58490 [2019-09-10 06:36:13,235 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:36:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58490 states. [2019-09-10 06:36:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58490 to 58488. [2019-09-10 06:36:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58488 states. [2019-09-10 06:36:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58488 states to 58488 states and 76270 transitions. [2019-09-10 06:36:13,727 INFO L78 Accepts]: Start accepts. Automaton has 58488 states and 76270 transitions. Word has length 78 [2019-09-10 06:36:13,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:13,727 INFO L475 AbstractCegarLoop]: Abstraction has 58488 states and 76270 transitions. [2019-09-10 06:36:13,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 58488 states and 76270 transitions. [2019-09-10 06:36:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:36:13,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:13,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:13,735 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1613619318, now seen corresponding path program 1 times [2019-09-10 06:36:13,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:13,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:13,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:13,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:13,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:13,804 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:36:13,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:13,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:13,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:13,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:13,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:13,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:13,806 INFO L87 Difference]: Start difference. First operand 58488 states and 76270 transitions. Second operand 5 states. [2019-09-10 06:36:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:15,050 INFO L93 Difference]: Finished difference Result 103522 states and 130494 transitions. [2019-09-10 06:36:15,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:36:15,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 06:36:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:15,180 INFO L225 Difference]: With dead ends: 103522 [2019-09-10 06:36:15,180 INFO L226 Difference]: Without dead ends: 103522 [2019-09-10 06:36:15,181 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:36:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103522 states. [2019-09-10 06:36:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103522 to 65072. [2019-09-10 06:36:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65072 states. [2019-09-10 06:36:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65072 states to 65072 states and 83802 transitions. [2019-09-10 06:36:15,875 INFO L78 Accepts]: Start accepts. Automaton has 65072 states and 83802 transitions. Word has length 89 [2019-09-10 06:36:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:15,875 INFO L475 AbstractCegarLoop]: Abstraction has 65072 states and 83802 transitions. [2019-09-10 06:36:15,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 65072 states and 83802 transitions. [2019-09-10 06:36:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:36:15,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:15,888 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, 1, 1] [2019-09-10 06:36:15,888 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:15,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:15,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1950557848, now seen corresponding path program 1 times [2019-09-10 06:36:15,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:15,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:15,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:15,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:15,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:15,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:15,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:15,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:15,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:15,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:15,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:15,966 INFO L87 Difference]: Start difference. First operand 65072 states and 83802 transitions. Second operand 3 states. [2019-09-10 06:36:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:17,600 INFO L93 Difference]: Finished difference Result 121610 states and 152825 transitions. [2019-09-10 06:36:17,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:17,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:36:17,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:17,734 INFO L225 Difference]: With dead ends: 121610 [2019-09-10 06:36:17,734 INFO L226 Difference]: Without dead ends: 121610 [2019-09-10 06:36:17,734 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:36:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121610 states. [2019-09-10 06:36:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121610 to 106128. [2019-09-10 06:36:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106128 states. [2019-09-10 06:36:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106128 states to 106128 states and 134776 transitions. [2019-09-10 06:36:19,038 INFO L78 Accepts]: Start accepts. Automaton has 106128 states and 134776 transitions. Word has length 97 [2019-09-10 06:36:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:19,038 INFO L475 AbstractCegarLoop]: Abstraction has 106128 states and 134776 transitions. [2019-09-10 06:36:19,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 106128 states and 134776 transitions. [2019-09-10 06:36:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:36:19,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:19,050 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:19,050 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:19,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:19,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1162840062, now seen corresponding path program 1 times [2019-09-10 06:36:19,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:19,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:19,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:19,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:19,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:19,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:36:19,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:36:19,197 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:36:19,199 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [76], [110], [113], [116], [129], [132], [145], [148], [161], [164], [167], [171], [173], [176], [192], [194], [197], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [317], [322], [335], [337], [350], [358], [377], [388], [390], [403], [411], [430], [443], [446], [449], [452], [454], [456], [509], [570], [700], [848], [946], [950], [988], [1016], [1019], [1022], [1026], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:36:19,269 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:36:19,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:36:19,476 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:36:20,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:36:20,018 INFO L272 AbstractInterpreter]: Visited 93 different actions 361 times. Merged at 31 different actions 234 times. Widened at 11 different actions 32 times. Performed 1571 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1571 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 8 different actions. Largest state had 234 variables. [2019-09-10 06:36:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:20,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:36:20,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:36:20,025 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:36:20,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:20,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:36:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:20,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:36:20,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:36:20,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:36:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:20,605 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:36:20,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:36:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:20,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:36:20,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2019-09-10 06:36:20,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:36:20,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:36:20,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:36:20,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:36:20,920 INFO L87 Difference]: Start difference. First operand 106128 states and 134776 transitions. Second operand 13 states. [2019-09-10 06:36:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:24,588 INFO L93 Difference]: Finished difference Result 245923 states and 311196 transitions. [2019-09-10 06:36:24,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:36:24,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2019-09-10 06:36:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:25,306 INFO L225 Difference]: With dead ends: 245923 [2019-09-10 06:36:25,306 INFO L226 Difference]: Without dead ends: 245923 [2019-09-10 06:36:25,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=537, Invalid=1625, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:36:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245923 states. [2019-09-10 06:36:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245923 to 155025. [2019-09-10 06:36:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155025 states. [2019-09-10 06:36:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155025 states to 155025 states and 196792 transitions. [2019-09-10 06:36:30,548 INFO L78 Accepts]: Start accepts. Automaton has 155025 states and 196792 transitions. Word has length 99 [2019-09-10 06:36:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:30,549 INFO L475 AbstractCegarLoop]: Abstraction has 155025 states and 196792 transitions. [2019-09-10 06:36:30,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:36:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 155025 states and 196792 transitions. [2019-09-10 06:36:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:36:30,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:30,567 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:36:30,568 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:30,568 INFO L82 PathProgramCache]: Analyzing trace with hash 719809032, now seen corresponding path program 1 times [2019-09-10 06:36:30,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:30,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:30,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:30,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:30,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:30,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:36:30,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:36:30,643 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 06:36:30,643 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [129], [132], [145], [148], [161], [164], [167], [171], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [324], [335], [337], [350], [358], [377], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [483], [509], [570], [700], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1464], [1492], [1495], [1498], [1502], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:36:30,650 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:36:30,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:36:30,709 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:36:30,966 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:36:30,966 INFO L272 AbstractInterpreter]: Visited 90 different actions 275 times. Merged at 27 different actions 160 times. Widened at 10 different actions 19 times. Performed 1276 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 5 different actions. Largest state had 234 variables. [2019-09-10 06:36:30,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:30,967 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:36:31,526 INFO L227 lantSequenceWeakener]: Weakened 74 states. On average, predicates are now at 92.34% of their original sizes. [2019-09-10 06:36:31,526 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:36:37,405 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 06:36:37,406 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:36:37,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:36:37,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [5] total 65 [2019-09-10 06:36:37,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:37,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 06:36:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 06:36:37,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=3389, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 06:36:37,409 INFO L87 Difference]: Start difference. First operand 155025 states and 196792 transitions. Second operand 62 states. [2019-09-10 06:37:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:28,067 INFO L93 Difference]: Finished difference Result 228174 states and 287742 transitions. [2019-09-10 06:37:28,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-10 06:37:28,067 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 100 [2019-09-10 06:37:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:28,360 INFO L225 Difference]: With dead ends: 228174 [2019-09-10 06:37:28,360 INFO L226 Difference]: Without dead ends: 228174 [2019-09-10 06:37:28,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7056 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=2465, Invalid=20185, Unknown=0, NotChecked=0, Total=22650 [2019-09-10 06:37:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228174 states. [2019-09-10 06:37:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228174 to 155561. [2019-09-10 06:37:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155561 states. [2019-09-10 06:37:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155561 states to 155561 states and 197130 transitions. [2019-09-10 06:37:29,996 INFO L78 Accepts]: Start accepts. Automaton has 155561 states and 197130 transitions. Word has length 100 [2019-09-10 06:37:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:29,996 INFO L475 AbstractCegarLoop]: Abstraction has 155561 states and 197130 transitions. [2019-09-10 06:37:29,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 06:37:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 155561 states and 197130 transitions. [2019-09-10 06:37:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:37:30,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:30,007 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:37:30,007 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:30,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash -15585594, now seen corresponding path program 1 times [2019-09-10 06:37:30,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:30,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:30,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:30,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:30,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:30,096 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:37:30,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:30,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:30,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:30,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:30,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:30,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:30,097 INFO L87 Difference]: Start difference. First operand 155561 states and 197130 transitions. Second operand 5 states. [2019-09-10 06:37:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:31,777 INFO L93 Difference]: Finished difference Result 187370 states and 232342 transitions. [2019-09-10 06:37:31,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:31,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 06:37:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:32,045 INFO L225 Difference]: With dead ends: 187370 [2019-09-10 06:37:32,046 INFO L226 Difference]: Without dead ends: 187370 [2019-09-10 06:37:32,046 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:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187370 states. [2019-09-10 06:37:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187370 to 148060. [2019-09-10 06:37:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148060 states. [2019-09-10 06:37:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148060 states to 148060 states and 185181 transitions. [2019-09-10 06:37:33,406 INFO L78 Accepts]: Start accepts. Automaton has 148060 states and 185181 transitions. Word has length 101 [2019-09-10 06:37:33,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:33,407 INFO L475 AbstractCegarLoop]: Abstraction has 148060 states and 185181 transitions. [2019-09-10 06:37:33,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 148060 states and 185181 transitions. [2019-09-10 06:37:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:37:33,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:33,417 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:37:33,417 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:33,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1914724117, now seen corresponding path program 1 times [2019-09-10 06:37:33,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:33,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:33,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:33,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:33,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:33,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:37:33,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:37:33,498 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 06:37:33,498 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [129], [132], [145], [148], [151], [161], [164], [167], [171], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [324], [335], [337], [350], [358], [377], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [483], [507], [570], [700], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1464], [1492], [1495], [1498], [1502], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:37:33,502 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:37:33,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:37:33,549 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:37:33,712 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:37:33,712 INFO L272 AbstractInterpreter]: Visited 91 different actions 275 times. Merged at 27 different actions 159 times. Widened at 9 different actions 14 times. Performed 1273 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1273 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 4 different actions. Largest state had 234 variables. [2019-09-10 06:37:33,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:33,713 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:37:34,019 INFO L227 lantSequenceWeakener]: Weakened 75 states. On average, predicates are now at 92.41% of their original sizes. [2019-09-10 06:37:34,020 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:37:42,834 INFO L420 sIntCurrentIteration]: We unified 100 AI predicates to 100 [2019-09-10 06:37:42,834 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:37:42,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:37:42,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [5] total 66 [2019-09-10 06:37:42,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:42,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 06:37:42,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 06:37:42,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=3540, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 06:37:42,841 INFO L87 Difference]: Start difference. First operand 148060 states and 185181 transitions. Second operand 63 states. [2019-09-10 06:38:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:24,939 INFO L93 Difference]: Finished difference Result 218236 states and 271233 transitions. [2019-09-10 06:38:24,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-10 06:38:24,939 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 101 [2019-09-10 06:38:24,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:25,179 INFO L225 Difference]: With dead ends: 218236 [2019-09-10 06:38:25,179 INFO L226 Difference]: Without dead ends: 218236 [2019-09-10 06:38:25,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4763 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1879, Invalid=15413, Unknown=0, NotChecked=0, Total=17292 [2019-09-10 06:38:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218236 states. [2019-09-10 06:38:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218236 to 148093. [2019-09-10 06:38:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148093 states. [2019-09-10 06:38:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148093 states to 148093 states and 185216 transitions. [2019-09-10 06:38:26,929 INFO L78 Accepts]: Start accepts. Automaton has 148093 states and 185216 transitions. Word has length 101 [2019-09-10 06:38:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:26,930 INFO L475 AbstractCegarLoop]: Abstraction has 148093 states and 185216 transitions. [2019-09-10 06:38:26,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 06:38:26,930 INFO L276 IsEmpty]: Start isEmpty. Operand 148093 states and 185216 transitions. [2019-09-10 06:38:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:38:26,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:26,946 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:38:26,946 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:26,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:26,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1855442686, now seen corresponding path program 1 times [2019-09-10 06:38:26,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:26,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:26,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:26,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:26,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:27,041 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:38:27,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:27,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:27,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:27,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:27,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:27,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:27,043 INFO L87 Difference]: Start difference. First operand 148093 states and 185216 transitions. Second operand 5 states. [2019-09-10 06:38:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:27,552 INFO L93 Difference]: Finished difference Result 208855 states and 260657 transitions. [2019-09-10 06:38:27,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:27,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 06:38:27,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:27,788 INFO L225 Difference]: With dead ends: 208855 [2019-09-10 06:38:27,789 INFO L226 Difference]: Without dead ends: 208855 [2019-09-10 06:38:27,789 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:38:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208855 states. [2019-09-10 06:38:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208855 to 171545. [2019-09-10 06:38:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171545 states. [2019-09-10 06:38:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171545 states to 171545 states and 214264 transitions. [2019-09-10 06:38:30,091 INFO L78 Accepts]: Start accepts. Automaton has 171545 states and 214264 transitions. Word has length 103 [2019-09-10 06:38:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:30,092 INFO L475 AbstractCegarLoop]: Abstraction has 171545 states and 214264 transitions. [2019-09-10 06:38:30,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 171545 states and 214264 transitions. [2019-09-10 06:38:30,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 06:38:30,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:30,109 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:30,110 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1041085272, now seen corresponding path program 1 times [2019-09-10 06:38:30,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:30,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:30,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:30,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:38:30,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:30,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:38:30,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:30,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:38:30,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:38:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:38:30,197 INFO L87 Difference]: Start difference. First operand 171545 states and 214264 transitions. Second operand 4 states. [2019-09-10 06:38:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:31,294 INFO L93 Difference]: Finished difference Result 380063 states and 473749 transitions. [2019-09-10 06:38:31,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:31,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-10 06:38:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:31,766 INFO L225 Difference]: With dead ends: 380063 [2019-09-10 06:38:31,767 INFO L226 Difference]: Without dead ends: 380063 [2019-09-10 06:38:31,767 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:38:32,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380063 states. [2019-09-10 06:38:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380063 to 171184. [2019-09-10 06:38:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171184 states. [2019-09-10 06:38:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171184 states to 171184 states and 213844 transitions. [2019-09-10 06:38:35,185 INFO L78 Accepts]: Start accepts. Automaton has 171184 states and 213844 transitions. Word has length 105 [2019-09-10 06:38:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:35,185 INFO L475 AbstractCegarLoop]: Abstraction has 171184 states and 213844 transitions. [2019-09-10 06:38:35,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:38:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 171184 states and 213844 transitions. [2019-09-10 06:38:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 06:38:35,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:35,196 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:35,197 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:35,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:35,197 INFO L82 PathProgramCache]: Analyzing trace with hash 680245603, now seen corresponding path program 1 times [2019-09-10 06:38:35,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:35,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:35,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:35,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:35,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:35,292 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:38:35,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:35,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:35,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:35,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:35,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:35,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:35,295 INFO L87 Difference]: Start difference. First operand 171184 states and 213844 transitions. Second operand 5 states. [2019-09-10 06:38:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:37,389 INFO L93 Difference]: Finished difference Result 307240 states and 379681 transitions. [2019-09-10 06:38:37,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:38:37,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 06:38:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:37,738 INFO L225 Difference]: With dead ends: 307240 [2019-09-10 06:38:37,738 INFO L226 Difference]: Without dead ends: 307240 [2019-09-10 06:38:37,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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:38:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307240 states. [2019-09-10 06:38:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307240 to 170871. [2019-09-10 06:38:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170871 states. [2019-09-10 06:38:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170871 states to 170871 states and 213463 transitions. [2019-09-10 06:38:43,863 INFO L78 Accepts]: Start accepts. Automaton has 170871 states and 213463 transitions. Word has length 105 [2019-09-10 06:38:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:43,863 INFO L475 AbstractCegarLoop]: Abstraction has 170871 states and 213463 transitions. [2019-09-10 06:38:43,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 170871 states and 213463 transitions. [2019-09-10 06:38:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:38:43,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:43,871 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:43,871 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:43,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:43,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1800782462, now seen corresponding path program 1 times [2019-09-10 06:38:43,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:43,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:43,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:43,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:43,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:43,958 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:38:43,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:43,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:43,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:43,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:43,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:43,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:43,960 INFO L87 Difference]: Start difference. First operand 170871 states and 213463 transitions. Second operand 5 states. [2019-09-10 06:38:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:44,669 INFO L93 Difference]: Finished difference Result 226732 states and 282822 transitions. [2019-09-10 06:38:44,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:44,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 06:38:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:44,954 INFO L225 Difference]: With dead ends: 226732 [2019-09-10 06:38:44,955 INFO L226 Difference]: Without dead ends: 226732 [2019-09-10 06:38:44,955 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:38:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226732 states. [2019-09-10 06:38:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226732 to 199648. [2019-09-10 06:38:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199648 states. [2019-09-10 06:38:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199648 states to 199648 states and 248991 transitions. [2019-09-10 06:38:47,831 INFO L78 Accepts]: Start accepts. Automaton has 199648 states and 248991 transitions. Word has length 106 [2019-09-10 06:38:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:47,832 INFO L475 AbstractCegarLoop]: Abstraction has 199648 states and 248991 transitions. [2019-09-10 06:38:47,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 199648 states and 248991 transitions. [2019-09-10 06:38:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:38:47,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:47,841 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:47,841 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:47,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:47,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1134697774, now seen corresponding path program 1 times [2019-09-10 06:38:47,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:47,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:47,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:47,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:47,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:47,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:47,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:47,909 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 06:38:47,910 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [119], [129], [132], [145], [148], [151], [154], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [324], [335], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [483], [488], [491], [494], [497], [501], [570], [698], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:38:47,915 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:47,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:47,949 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:48,142 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:38:48,142 INFO L272 AbstractInterpreter]: Visited 96 different actions 311 times. Merged at 29 different actions 188 times. Widened at 11 different actions 26 times. Performed 1358 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1358 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 3 different actions. Largest state had 237 variables. [2019-09-10 06:38:48,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:48,143 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:38:48,451 INFO L227 lantSequenceWeakener]: Weakened 80 states. On average, predicates are now at 92.72% of their original sizes. [2019-09-10 06:38:48,451 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:38:54,901 INFO L420 sIntCurrentIteration]: We unified 105 AI predicates to 105 [2019-09-10 06:38:54,901 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:38:54,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:38:54,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [5] total 69 [2019-09-10 06:38:54,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:54,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 06:38:54,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 06:38:54,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3975, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 06:38:54,905 INFO L87 Difference]: Start difference. First operand 199648 states and 248991 transitions. Second operand 66 states. [2019-09-10 06:39:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:49,721 INFO L93 Difference]: Finished difference Result 249724 states and 310178 transitions. [2019-09-10 06:39:49,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-10 06:39:49,721 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 106 [2019-09-10 06:39:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:49,979 INFO L225 Difference]: With dead ends: 249724 [2019-09-10 06:39:49,979 INFO L226 Difference]: Without dead ends: 249724 [2019-09-10 06:39:49,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3316 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1025, Invalid=12547, Unknown=0, NotChecked=0, Total=13572 [2019-09-10 06:39:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249724 states. [2019-09-10 06:39:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249724 to 207408. [2019-09-10 06:39:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207408 states. [2019-09-10 06:39:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207408 states to 207408 states and 258550 transitions. [2019-09-10 06:39:52,467 INFO L78 Accepts]: Start accepts. Automaton has 207408 states and 258550 transitions. Word has length 106 [2019-09-10 06:39:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:52,468 INFO L475 AbstractCegarLoop]: Abstraction has 207408 states and 258550 transitions. [2019-09-10 06:39:52,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 06:39:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 207408 states and 258550 transitions. [2019-09-10 06:39:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 06:39:52,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:52,479 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:52,479 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:52,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1990651521, now seen corresponding path program 1 times [2019-09-10 06:39:52,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:52,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:52,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:52,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:52,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:52,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:52,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:52,550 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 06:39:52,551 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [119], [129], [132], [145], [148], [161], [164], [167], [171], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [483], [509], [570], [698], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:39:52,553 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:52,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:52,583 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:52,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:39:52,715 INFO L272 AbstractInterpreter]: Visited 98 different actions 290 times. Merged at 35 different actions 170 times. Widened at 10 different actions 15 times. Performed 1304 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1304 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 5 different actions. Largest state had 236 variables. [2019-09-10 06:39:52,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:52,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:39:52,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:52,716 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:52,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:52,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:39:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:52,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 06:39:52,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:39:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:52,987 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:53,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:39:53,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2019-09-10 06:39:53,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:39:53,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:39:53,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:39:53,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:39:53,081 INFO L87 Difference]: Start difference. First operand 207408 states and 258550 transitions. Second operand 10 states. [2019-09-10 06:39:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:54,362 INFO L93 Difference]: Finished difference Result 329544 states and 398427 transitions. [2019-09-10 06:39:54,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:39:54,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2019-09-10 06:39:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:55,753 INFO L225 Difference]: With dead ends: 329544 [2019-09-10 06:39:55,753 INFO L226 Difference]: Without dead ends: 329544 [2019-09-10 06:39:55,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:39:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329544 states. [2019-09-10 06:39:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329544 to 216675. [2019-09-10 06:39:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216675 states. [2019-09-10 06:39:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216675 states to 216675 states and 265599 transitions. [2019-09-10 06:39:58,872 INFO L78 Accepts]: Start accepts. Automaton has 216675 states and 265599 transitions. Word has length 107 [2019-09-10 06:39:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:58,872 INFO L475 AbstractCegarLoop]: Abstraction has 216675 states and 265599 transitions. [2019-09-10 06:39:58,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:39:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 216675 states and 265599 transitions. [2019-09-10 06:39:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:39:58,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:58,882 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:58,882 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:58,882 INFO L82 PathProgramCache]: Analyzing trace with hash 543051623, now seen corresponding path program 1 times [2019-09-10 06:39:58,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:58,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:58,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:58,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:58,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:58,955 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:39:58,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:58,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:39:58,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:58,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:39:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:39:58,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:39:58,956 INFO L87 Difference]: Start difference. First operand 216675 states and 265599 transitions. Second operand 4 states. [2019-09-10 06:40:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:00,659 INFO L93 Difference]: Finished difference Result 431320 states and 526248 transitions. [2019-09-10 06:40:00,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:40:00,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-10 06:40:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:01,165 INFO L225 Difference]: With dead ends: 431320 [2019-09-10 06:40:01,165 INFO L226 Difference]: Without dead ends: 431320 [2019-09-10 06:40:01,165 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:40:01,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431320 states. [2019-09-10 06:40:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431320 to 230473. [2019-09-10 06:40:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230473 states. [2019-09-10 06:40:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230473 states to 230473 states and 283130 transitions. [2019-09-10 06:40:07,821 INFO L78 Accepts]: Start accepts. Automaton has 230473 states and 283130 transitions. Word has length 109 [2019-09-10 06:40:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:07,821 INFO L475 AbstractCegarLoop]: Abstraction has 230473 states and 283130 transitions. [2019-09-10 06:40:07,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:40:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 230473 states and 283130 transitions. [2019-09-10 06:40:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:40:07,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:07,831 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:07,831 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:07,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:07,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1152296734, now seen corresponding path program 1 times [2019-09-10 06:40:07,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:07,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:07,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:07,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:07,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:08,044 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:40:08,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:08,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:40:08,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:08,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:40:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:40:08,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:40:08,046 INFO L87 Difference]: Start difference. First operand 230473 states and 283130 transitions. Second operand 10 states. [2019-09-10 06:40:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:10,197 INFO L93 Difference]: Finished difference Result 410120 states and 498857 transitions. [2019-09-10 06:40:10,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:40:10,198 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2019-09-10 06:40:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:10,757 INFO L225 Difference]: With dead ends: 410120 [2019-09-10 06:40:10,757 INFO L226 Difference]: Without dead ends: 410120 [2019-09-10 06:40:10,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=540, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:40:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410120 states. [2019-09-10 06:40:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410120 to 303776. [2019-09-10 06:40:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303776 states. [2019-09-10 06:40:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303776 states to 303776 states and 372434 transitions. [2019-09-10 06:40:19,296 INFO L78 Accepts]: Start accepts. Automaton has 303776 states and 372434 transitions. Word has length 109 [2019-09-10 06:40:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:19,296 INFO L475 AbstractCegarLoop]: Abstraction has 303776 states and 372434 transitions. [2019-09-10 06:40:19,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:40:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 303776 states and 372434 transitions. [2019-09-10 06:40:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:40:19,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:19,309 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:19,309 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:19,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2042896233, now seen corresponding path program 1 times [2019-09-10 06:40:19,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:19,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:19,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:19,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:19,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:19,442 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:40:19,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:19,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:40:19,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:19,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:40:19,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:40:19,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:40:19,444 INFO L87 Difference]: Start difference. First operand 303776 states and 372434 transitions. Second operand 9 states. [2019-09-10 06:40:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:22,165 INFO L93 Difference]: Finished difference Result 502123 states and 614323 transitions. [2019-09-10 06:40:22,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:40:22,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-10 06:40:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:22,826 INFO L225 Difference]: With dead ends: 502123 [2019-09-10 06:40:22,826 INFO L226 Difference]: Without dead ends: 502123 [2019-09-10 06:40:22,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:40:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502123 states. [2019-09-10 06:40:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502123 to 303724. [2019-09-10 06:40:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303724 states. [2019-09-10 06:40:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303724 states to 303724 states and 372376 transitions. [2019-09-10 06:40:32,142 INFO L78 Accepts]: Start accepts. Automaton has 303724 states and 372376 transitions. Word has length 110 [2019-09-10 06:40:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:32,142 INFO L475 AbstractCegarLoop]: Abstraction has 303724 states and 372376 transitions. [2019-09-10 06:40:32,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:40:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 303724 states and 372376 transitions. [2019-09-10 06:40:32,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:40:32,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:32,151 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:32,151 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:32,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:32,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1697576377, now seen corresponding path program 1 times [2019-09-10 06:40:32,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:32,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:32,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:32,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:32,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:32,202 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:40:32,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:32,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:40:32,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:32,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:40:32,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:40:32,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:40:32,203 INFO L87 Difference]: Start difference. First operand 303724 states and 372376 transitions. Second operand 3 states. [2019-09-10 06:40:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:33,817 INFO L93 Difference]: Finished difference Result 331553 states and 403343 transitions. [2019-09-10 06:40:33,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:40:33,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 06:40:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:34,158 INFO L225 Difference]: With dead ends: 331553 [2019-09-10 06:40:34,159 INFO L226 Difference]: Without dead ends: 331553 [2019-09-10 06:40:34,159 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:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331553 states. [2019-09-10 06:40:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331553 to 300392. [2019-09-10 06:40:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300392 states. [2019-09-10 06:40:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300392 states to 300392 states and 365857 transitions. [2019-09-10 06:40:41,377 INFO L78 Accepts]: Start accepts. Automaton has 300392 states and 365857 transitions. Word has length 110 [2019-09-10 06:40:41,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:41,377 INFO L475 AbstractCegarLoop]: Abstraction has 300392 states and 365857 transitions. [2019-09-10 06:40:41,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:40:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 300392 states and 365857 transitions. [2019-09-10 06:40:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:40:41,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:41,387 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:41,387 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1121732087, now seen corresponding path program 1 times [2019-09-10 06:40:41,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:41,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:41,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:41,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:41,609 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:40:41,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:41,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:41,610 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:40:41,610 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [119], [129], [132], [145], [148], [151], [154], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [259], [261], [270], [324], [335], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [467], [470], [473], [475], [488], [491], [494], [497], [501], [570], [698], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:40:41,612 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:41,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:41,645 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:41,971 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:41,972 INFO L272 AbstractInterpreter]: Visited 105 different actions 417 times. Merged at 38 different actions 283 times. Widened at 13 different actions 43 times. Performed 1751 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1751 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 10 different actions. Largest state had 238 variables. [2019-09-10 06:40:41,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:41,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:41,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:41,972 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:41,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:41,995 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:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:42,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:40:42,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:43,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:43,839 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:40:43,840 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:44,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:44,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:44,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:45,017 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:40:45,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:40:45,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 13] total 29 [2019-09-10 06:40:45,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:40:45,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:40:45,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:40:45,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:40:45,032 INFO L87 Difference]: Start difference. First operand 300392 states and 365857 transitions. Second operand 22 states. [2019-09-10 06:40:49,033 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-09-10 06:40:54,297 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 06:40:55,062 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 06:40:55,412 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-09-10 06:40:55,616 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 06:40:56,097 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 06:40:56,276 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 06:40:57,030 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 06:40:57,278 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 06:40:57,807 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 06:40:58,154 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:40:58,985 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 06:41:00,821 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 06:41:01,105 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 06:41:01,333 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 06:41:01,928 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:41:02,449 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-10 06:41:02,860 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:41:03,228 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 06:41:03,933 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 06:41:04,387 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 06:41:04,975 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:41:05,210 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 06:41:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:07,408 INFO L93 Difference]: Finished difference Result 677552 states and 810138 transitions. [2019-09-10 06:41:07,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-10 06:41:07,409 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 110 [2019-09-10 06:41:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:08,145 INFO L225 Difference]: With dead ends: 677552 [2019-09-10 06:41:08,146 INFO L226 Difference]: Without dead ends: 677552 [2019-09-10 06:41:08,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 179 SyntacticMatches, 23 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4381 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2895, Invalid=10677, Unknown=0, NotChecked=0, Total=13572 [2019-09-10 06:41:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677552 states. [2019-09-10 06:41:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677552 to 395358. [2019-09-10 06:41:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395358 states. [2019-09-10 06:41:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395358 states to 395358 states and 479722 transitions. [2019-09-10 06:41:20,121 INFO L78 Accepts]: Start accepts. Automaton has 395358 states and 479722 transitions. Word has length 110 [2019-09-10 06:41:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:20,121 INFO L475 AbstractCegarLoop]: Abstraction has 395358 states and 479722 transitions. [2019-09-10 06:41:20,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:41:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 395358 states and 479722 transitions. [2019-09-10 06:41:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:41:20,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:20,131 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, 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:20,131 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash -130693552, now seen corresponding path program 1 times [2019-09-10 06:41:20,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:20,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:20,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:41:20,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:20,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:41:20,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:20,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:41:20,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:41:20,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:41:20,195 INFO L87 Difference]: Start difference. First operand 395358 states and 479722 transitions. Second operand 4 states. [2019-09-10 06:41:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:21,567 INFO L93 Difference]: Finished difference Result 519827 states and 630973 transitions. [2019-09-10 06:41:21,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:41:21,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 06:41:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:22,290 INFO L225 Difference]: With dead ends: 519827 [2019-09-10 06:41:22,290 INFO L226 Difference]: Without dead ends: 519827 [2019-09-10 06:41:22,290 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:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519827 states. [2019-09-10 06:41:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519827 to 395321. [2019-09-10 06:41:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395321 states. [2019-09-10 06:41:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395321 states to 395321 states and 479676 transitions. [2019-09-10 06:41:32,856 INFO L78 Accepts]: Start accepts. Automaton has 395321 states and 479676 transitions. Word has length 112 [2019-09-10 06:41:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:32,856 INFO L475 AbstractCegarLoop]: Abstraction has 395321 states and 479676 transitions. [2019-09-10 06:41:32,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:41:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 395321 states and 479676 transitions. [2019-09-10 06:41:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:41:32,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:32,865 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, 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:32,865 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:32,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:32,866 INFO L82 PathProgramCache]: Analyzing trace with hash 505868363, now seen corresponding path program 1 times [2019-09-10 06:41:32,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:32,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:32,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:32,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:32,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:32,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:32,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:32,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:32,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:32,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:32,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:32,919 INFO L87 Difference]: Start difference. First operand 395321 states and 479676 transitions. Second operand 3 states. [2019-09-10 06:41:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:33,941 INFO L93 Difference]: Finished difference Result 409120 states and 494988 transitions. [2019-09-10 06:41:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:33,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 06:41:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:40,157 INFO L225 Difference]: With dead ends: 409120 [2019-09-10 06:41:40,158 INFO L226 Difference]: Without dead ends: 409120 [2019-09-10 06:41:40,158 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:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409120 states. [2019-09-10 06:41:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409120 to 408416. [2019-09-10 06:41:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408416 states. [2019-09-10 06:41:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408416 states to 408416 states and 494285 transitions. [2019-09-10 06:41:43,647 INFO L78 Accepts]: Start accepts. Automaton has 408416 states and 494285 transitions. Word has length 112 [2019-09-10 06:41:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:43,647 INFO L475 AbstractCegarLoop]: Abstraction has 408416 states and 494285 transitions. [2019-09-10 06:41:43,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 408416 states and 494285 transitions. [2019-09-10 06:41:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:41:43,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:43,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:43,656 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1466322329, now seen corresponding path program 1 times [2019-09-10 06:41:43,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:43,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:43,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:43,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:43,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:43,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:43,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:43,895 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:41:43,896 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [76], [79], [82], [85], [89], [110], [113], [116], [129], [132], [135], [138], [173], [176], [192], [194], [197], [200], [203], [206], [208], [210], [213], [216], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [333], [337], [350], [358], [361], [364], [367], [369], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [512], [515], [518], [521], [531], [534], [537], [541], [561], [700], [721], [749], [752], [755], [759], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:41:43,899 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:43,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:44,897 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:45,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:45,246 INFO L272 AbstractInterpreter]: Visited 107 different actions 550 times. Merged at 41 different actions 409 times. Widened at 16 different actions 76 times. Performed 2097 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2097 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 12 different actions. Largest state had 238 variables. [2019-09-10 06:41:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:45,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:45,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:45,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:41:45,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:45,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:41:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:45,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:41:45,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:45,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:45,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:45,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:45,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:45,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:45,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:45,807 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:45,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:46,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:46,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:46,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:46,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:46,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:41:46,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 29 [2019-09-10 06:41:46,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:41:46,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:41:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:41:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:41:46,123 INFO L87 Difference]: Start difference. First operand 408416 states and 494285 transitions. Second operand 24 states. [2019-09-10 06:41:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:50,499 INFO L93 Difference]: Finished difference Result 680950 states and 817202 transitions. [2019-09-10 06:41:50,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:41:50,499 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 112 [2019-09-10 06:41:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:51,281 INFO L225 Difference]: With dead ends: 680950 [2019-09-10 06:41:51,281 INFO L226 Difference]: Without dead ends: 680950 [2019-09-10 06:41:51,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=384, Invalid=1686, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 06:41:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680950 states. [2019-09-10 06:42:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680950 to 408440. [2019-09-10 06:42:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408440 states. [2019-09-10 06:42:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408440 states to 408440 states and 494309 transitions. [2019-09-10 06:42:03,804 INFO L78 Accepts]: Start accepts. Automaton has 408440 states and 494309 transitions. Word has length 112 [2019-09-10 06:42:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:03,804 INFO L475 AbstractCegarLoop]: Abstraction has 408440 states and 494309 transitions. [2019-09-10 06:42:03,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:42:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 408440 states and 494309 transitions. [2019-09-10 06:42:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:42:03,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:03,814 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:03,814 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash 925115211, now seen corresponding path program 1 times [2019-09-10 06:42:03,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:03,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:03,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:04,210 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:42:04,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:04,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:04,211 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:42:04,211 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [119], [129], [132], [145], [148], [151], [154], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [222], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [259], [261], [270], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [467], [470], [473], [475], [488], [491], [494], [497], [501], [570], [698], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:42:04,213 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:04,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:04,247 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:04,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:04,579 INFO L272 AbstractInterpreter]: Visited 107 different actions 423 times. Merged at 40 different actions 288 times. Widened at 13 different actions 42 times. Performed 1808 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1808 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 11 different actions. Largest state had 238 variables. [2019-09-10 06:42:04,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:04,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:04,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:04,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:42:05,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:05,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:42:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:05,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:42:05,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:05,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:05,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:05,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:05,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:05,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:05,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,026 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:42:06,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:06,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,279 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:42:06,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:06,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 27 [2019-09-10 06:42:06,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:06,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:42:06,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:42:06,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:42:06,288 INFO L87 Difference]: Start difference. First operand 408440 states and 494309 transitions. Second operand 22 states. [2019-09-10 06:42:08,405 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2019-09-10 06:42:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:17,721 INFO L93 Difference]: Finished difference Result 547389 states and 657355 transitions. [2019-09-10 06:42:17,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:42:17,721 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 112 [2019-09-10 06:42:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:18,441 INFO L225 Difference]: With dead ends: 547389 [2019-09-10 06:42:18,441 INFO L226 Difference]: Without dead ends: 547389 [2019-09-10 06:42:18,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 209 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:42:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547389 states. [2019-09-10 06:42:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547389 to 410158. [2019-09-10 06:42:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410158 states. [2019-09-10 06:42:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410158 states to 410158 states and 496151 transitions. [2019-09-10 06:42:24,780 INFO L78 Accepts]: Start accepts. Automaton has 410158 states and 496151 transitions. Word has length 112 [2019-09-10 06:42:24,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:24,780 INFO L475 AbstractCegarLoop]: Abstraction has 410158 states and 496151 transitions. [2019-09-10 06:42:24,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:42:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 410158 states and 496151 transitions. [2019-09-10 06:42:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:42:24,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:24,790 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:24,790 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:24,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1297221371, now seen corresponding path program 1 times [2019-09-10 06:42:24,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:24,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:24,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:24,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:24,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:25,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:25,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:25,064 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:42:25,064 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [76], [110], [113], [116], [119], [122], [125], [127], [129], [132], [135], [145], [148], [161], [164], [167], [171], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [414], [417], [420], [422], [443], [446], [449], [452], [454], [456], [509], [568], [848], [946], [950], [953], [956], [959], [962], [965], [969], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:42:25,066 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:25,066 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:25,103 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:25,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:25,438 INFO L272 AbstractInterpreter]: Visited 108 different actions 451 times. Merged at 41 different actions 312 times. Widened at 14 different actions 43 times. Performed 1817 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1817 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 11 different actions. Largest state had 237 variables. [2019-09-10 06:42:25,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:25,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:25,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:25,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:42:25,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:25,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:25,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 06:42:25,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:25,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:25,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:25,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:25,957 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:25,957 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:26,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,314 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,320 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:42:26,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [11] total 27 [2019-09-10 06:42:26,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:26,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:42:26,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:42:26,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:42:26,321 INFO L87 Difference]: Start difference. First operand 410158 states and 496151 transitions. Second operand 10 states. [2019-09-10 06:42:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:29,771 INFO L93 Difference]: Finished difference Result 440597 states and 531669 transitions. [2019-09-10 06:42:29,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:42:29,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-09-10 06:42:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:30,300 INFO L225 Difference]: With dead ends: 440597 [2019-09-10 06:42:30,300 INFO L226 Difference]: Without dead ends: 440597 [2019-09-10 06:42:30,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=1245, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:42:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440597 states. [2019-09-10 06:42:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440597 to 431135. [2019-09-10 06:42:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431135 states. [2019-09-10 06:42:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431135 states to 431135 states and 521061 transitions. [2019-09-10 06:42:41,109 INFO L78 Accepts]: Start accepts. Automaton has 431135 states and 521061 transitions. Word has length 113 [2019-09-10 06:42:41,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:41,109 INFO L475 AbstractCegarLoop]: Abstraction has 431135 states and 521061 transitions. [2019-09-10 06:42:41,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:42:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 431135 states and 521061 transitions. [2019-09-10 06:42:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:42:41,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:41,122 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:41,122 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:41,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:41,123 INFO L82 PathProgramCache]: Analyzing trace with hash -936777338, now seen corresponding path program 1 times [2019-09-10 06:42:41,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:41,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:41,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:41,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:41,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:41,449 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:42:41,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:41,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:42:41,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:41,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:42:41,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:42:41,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:42:41,451 INFO L87 Difference]: Start difference. First operand 431135 states and 521061 transitions. Second operand 10 states. [2019-09-10 06:42:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:44,092 INFO L93 Difference]: Finished difference Result 610456 states and 738346 transitions. [2019-09-10 06:42:44,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:42:44,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-09-10 06:42:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:44,755 INFO L225 Difference]: With dead ends: 610456 [2019-09-10 06:42:44,755 INFO L226 Difference]: Without dead ends: 610456 [2019-09-10 06:42:44,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:42:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610456 states. [2019-09-10 06:42:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610456 to 423030. [2019-09-10 06:42:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423030 states. [2019-09-10 06:42:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423030 states to 423030 states and 511365 transitions. [2019-09-10 06:42:56,676 INFO L78 Accepts]: Start accepts. Automaton has 423030 states and 511365 transitions. Word has length 113 [2019-09-10 06:42:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:56,677 INFO L475 AbstractCegarLoop]: Abstraction has 423030 states and 511365 transitions. [2019-09-10 06:42:56,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:42:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 423030 states and 511365 transitions. [2019-09-10 06:42:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:42:56,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:56,687 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:56,687 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:56,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1500858457, now seen corresponding path program 1 times [2019-09-10 06:42:56,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:56,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:56,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:56,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:42:56,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:56,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:42:56,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:56,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:42:56,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:42:56,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:42:56,744 INFO L87 Difference]: Start difference. First operand 423030 states and 511365 transitions. Second operand 4 states. [2019-09-10 06:42:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:59,141 INFO L93 Difference]: Finished difference Result 457805 states and 552479 transitions. [2019-09-10 06:42:59,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:42:59,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-10 06:42:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:59,770 INFO L225 Difference]: With dead ends: 457805 [2019-09-10 06:42:59,770 INFO L226 Difference]: Without dead ends: 457805 [2019-09-10 06:42:59,770 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:43:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457805 states. [2019-09-10 06:43:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457805 to 422916. [2019-09-10 06:43:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422916 states. [2019-09-10 06:43:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422916 states to 422916 states and 511231 transitions. [2019-09-10 06:43:11,663 INFO L78 Accepts]: Start accepts. Automaton has 422916 states and 511231 transitions. Word has length 113 [2019-09-10 06:43:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:11,664 INFO L475 AbstractCegarLoop]: Abstraction has 422916 states and 511231 transitions. [2019-09-10 06:43:11,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:43:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 422916 states and 511231 transitions. [2019-09-10 06:43:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:43:11,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:11,672 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:43:11,672 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash -955355422, now seen corresponding path program 1 times [2019-09-10 06:43:11,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:11,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:11,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:11,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:11,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:11,934 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,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:11,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:43:11,934 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:43:11,935 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [76], [79], [82], [85], [89], [110], [113], [116], [129], [132], [135], [138], [141], [143], [145], [148], [151], [161], [164], [167], [171], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [335], [337], [350], [358], [361], [364], [367], [369], [379], [382], [390], [393], [396], [399], [401], [403], [443], [446], [449], [452], [454], [456], [507], [700], [721], [749], [752], [755], [759], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:43:11,936 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:43:11,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:43:11,963 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:43:12,270 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:43:12,271 INFO L272 AbstractInterpreter]: Visited 108 different actions 426 times. Merged at 41 different actions 291 times. Widened at 12 different actions 37 times. Performed 1788 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1788 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 10 different actions. Largest state had 237 variables. [2019-09-10 06:43:12,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:12,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:43:12,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:12,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:43:13,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:13,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:43:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:13,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:43:13,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:43:13,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:13,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:13,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:13,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:13,723 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:43:14,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:14,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:43:14,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2019-09-10 06:43:14,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:43:14,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:43:14,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:43:14,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:43:14,087 INFO L87 Difference]: Start difference. First operand 422916 states and 511231 transitions. Second operand 24 states. [2019-09-10 06:43:16,500 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 06:43:16,965 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 06:43:17,662 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 06:43:17,965 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 06:43:18,539 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 06:43:18,943 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 06:43:22,573 WARN L188 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 06:43:22,754 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 06:43:23,247 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 06:43:23,417 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 06:43:23,873 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 06:43:24,260 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 06:43:24,419 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-09-10 06:43:24,696 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 06:43:24,867 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 06:43:25,363 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 06:43:25,511 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 06:43:25,842 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 06:43:25,983 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:43:27,349 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 06:43:27,628 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 06:43:27,779 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:43:28,081 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 06:43:28,389 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:43:31,939 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:43:32,265 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2019-09-10 06:43:32,413 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 06:43:32,574 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:43:33,364 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 06:43:33,533 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:43:33,844 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 06:43:33,997 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:43:34,174 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 06:43:36,441 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 06:43:37,000 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 06:43:41,926 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2019-09-10 06:43:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:46,997 INFO L93 Difference]: Finished difference Result 1083437 states and 1295999 transitions. [2019-09-10 06:43:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2019-09-10 06:43:46,997 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 113 [2019-09-10 06:43:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:48,430 INFO L225 Difference]: With dead ends: 1083437 [2019-09-10 06:43:48,430 INFO L226 Difference]: Without dead ends: 1083437 [2019-09-10 06:43:48,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16394 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=7615, Invalid=37117, Unknown=0, NotChecked=0, Total=44732 [2019-09-10 06:43:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083437 states. [2019-09-10 06:43:57,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083437 to 437422. [2019-09-10 06:43:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437422 states. [2019-09-10 06:43:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437422 states to 437422 states and 528579 transitions. [2019-09-10 06:43:59,273 INFO L78 Accepts]: Start accepts. Automaton has 437422 states and 528579 transitions. Word has length 113 [2019-09-10 06:43:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:59,273 INFO L475 AbstractCegarLoop]: Abstraction has 437422 states and 528579 transitions. [2019-09-10 06:43:59,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:43:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 437422 states and 528579 transitions. [2019-09-10 06:43:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:43:59,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:59,281 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:43:59,281 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:59,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:59,282 INFO L82 PathProgramCache]: Analyzing trace with hash -113616927, now seen corresponding path program 1 times [2019-09-10 06:43:59,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:59,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:59,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:59,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:59,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:59,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:43:59,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:43:59,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:43:59,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:43:59,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:43:59,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:43:59,339 INFO L87 Difference]: Start difference. First operand 437422 states and 528579 transitions. Second operand 3 states. [2019-09-10 06:44:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:00,226 INFO L93 Difference]: Finished difference Result 428278 states and 507122 transitions. [2019-09-10 06:44:00,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:44:00,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-10 06:44:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:00,660 INFO L225 Difference]: With dead ends: 428278 [2019-09-10 06:44:00,660 INFO L226 Difference]: Without dead ends: 428278 [2019-09-10 06:44:00,660 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:44:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428278 states. [2019-09-10 06:44:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428278 to 422810. [2019-09-10 06:44:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422810 states. [2019-09-10 06:44:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422810 states to 422810 states and 500697 transitions. [2019-09-10 06:44:11,745 INFO L78 Accepts]: Start accepts. Automaton has 422810 states and 500697 transitions. Word has length 113 [2019-09-10 06:44:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:11,745 INFO L475 AbstractCegarLoop]: Abstraction has 422810 states and 500697 transitions. [2019-09-10 06:44:11,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:44:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 422810 states and 500697 transitions. [2019-09-10 06:44:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:44:11,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:11,752 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:11,752 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2020913854, now seen corresponding path program 1 times [2019-09-10 06:44:11,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:11,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:11,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:11,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:11,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:13,299 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:44:13,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:13,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:44:13,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:13,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:44:13,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:44:13,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:44:13,300 INFO L87 Difference]: Start difference. First operand 422810 states and 500697 transitions. Second operand 11 states. [2019-09-10 06:44:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:22,209 INFO L93 Difference]: Finished difference Result 750876 states and 889784 transitions. [2019-09-10 06:44:22,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:44:22,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 113 [2019-09-10 06:44:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:23,125 INFO L225 Difference]: With dead ends: 750876 [2019-09-10 06:44:23,125 INFO L226 Difference]: Without dead ends: 750876 [2019-09-10 06:44:23,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:44:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750876 states. [2019-09-10 06:44:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750876 to 412563. [2019-09-10 06:44:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412563 states. [2019-09-10 06:44:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412563 states to 412563 states and 488774 transitions. [2019-09-10 06:44:28,473 INFO L78 Accepts]: Start accepts. Automaton has 412563 states and 488774 transitions. Word has length 113 [2019-09-10 06:44:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:28,473 INFO L475 AbstractCegarLoop]: Abstraction has 412563 states and 488774 transitions. [2019-09-10 06:44:28,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:44:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 412563 states and 488774 transitions. [2019-09-10 06:44:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:44:29,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:29,406 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:29,406 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:29,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:29,406 INFO L82 PathProgramCache]: Analyzing trace with hash 106565661, now seen corresponding path program 1 times [2019-09-10 06:44:29,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:29,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:29,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:29,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:29,739 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:44:29,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:29,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:44:29,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:29,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:44:29,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:44:29,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:44:29,741 INFO L87 Difference]: Start difference. First operand 412563 states and 488774 transitions. Second operand 15 states. [2019-09-10 06:44:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:36,068 INFO L93 Difference]: Finished difference Result 915641 states and 1082882 transitions. [2019-09-10 06:44:36,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 06:44:36,069 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 113 [2019-09-10 06:44:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:37,213 INFO L225 Difference]: With dead ends: 915641 [2019-09-10 06:44:37,213 INFO L226 Difference]: Without dead ends: 915641 [2019-09-10 06:44:37,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=658, Invalid=2204, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 06:44:37,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915641 states. [2019-09-10 06:44:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915641 to 422509. [2019-09-10 06:44:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422509 states. [2019-09-10 06:44:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422509 states to 422509 states and 500250 transitions. [2019-09-10 06:44:53,071 INFO L78 Accepts]: Start accepts. Automaton has 422509 states and 500250 transitions. Word has length 113 [2019-09-10 06:44:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:53,071 INFO L475 AbstractCegarLoop]: Abstraction has 422509 states and 500250 transitions. [2019-09-10 06:44:53,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:44:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 422509 states and 500250 transitions. [2019-09-10 06:44:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:44:53,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:53,075 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:53,076 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:53,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1882114311, now seen corresponding path program 1 times [2019-09-10 06:44:53,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:53,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:53,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:53,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:53,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:44:53,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:44:53,412 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [76], [110], [113], [116], [119], [122], [127], [129], [132], [135], [145], [148], [161], [164], [167], [171], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [414], [417], [420], [422], [443], [446], [449], [452], [454], [456], [509], [568], [573], [696], [848], [946], [950], [953], [956], [959], [962], [965], [969], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:44:53,416 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:44:53,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:44:53,438 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:44:53,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:44:53,667 INFO L272 AbstractInterpreter]: Visited 109 different actions 468 times. Merged at 41 different actions 328 times. Widened at 14 different actions 50 times. Performed 1829 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1829 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 11 different actions. Largest state had 237 variables. [2019-09-10 06:44:53,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:53,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:44:53,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:53,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:44:53,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:53,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:44:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:53,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:44:53,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:44:53,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:53,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:54,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:54,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:54,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:54,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:54,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:54,299 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:44:54,299 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:44:54,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:54,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:54,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:54,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:54,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:54,590 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:44:54,593 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:44:54,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [15] total 32 [2019-09-10 06:44:54,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:54,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:44:54,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:44:54,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:44:54,595 INFO L87 Difference]: Start difference. First operand 422509 states and 500250 transitions. Second operand 11 states. [2019-09-10 06:44:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:57,272 INFO L93 Difference]: Finished difference Result 459145 states and 543243 transitions. [2019-09-10 06:44:57,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:44:57,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 114 [2019-09-10 06:44:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:57,744 INFO L225 Difference]: With dead ends: 459145 [2019-09-10 06:44:57,744 INFO L226 Difference]: Without dead ends: 459145 [2019-09-10 06:44:57,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=176, Invalid=1306, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:44:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459145 states. [2019-09-10 06:45:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459145 to 428165. [2019-09-10 06:45:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428165 states. [2019-09-10 06:45:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428165 states to 428165 states and 506784 transitions. [2019-09-10 06:45:09,036 INFO L78 Accepts]: Start accepts. Automaton has 428165 states and 506784 transitions. Word has length 114 [2019-09-10 06:45:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:09,037 INFO L475 AbstractCegarLoop]: Abstraction has 428165 states and 506784 transitions. [2019-09-10 06:45:09,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:45:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 428165 states and 506784 transitions. [2019-09-10 06:45:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:45:09,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:09,041 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:09,041 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:09,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1722768340, now seen corresponding path program 1 times [2019-09-10 06:45:09,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:09,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:09,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:09,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:09,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:09,482 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:45:09,483 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [110], [113], [116], [119], [129], [132], [145], [148], [151], [154], [157], [159], [161], [164], [167], [171], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [259], [261], [270], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [443], [456], [464], [467], [470], [473], [475], [570], [698], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1795], [1796], [1800], [1801], [1802] [2019-09-10 06:45:09,485 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:09,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:09,507 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:09,684 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:09,684 INFO L272 AbstractInterpreter]: Visited 109 different actions 426 times. Merged at 41 different actions 290 times. Widened at 11 different actions 35 times. Performed 1709 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1709 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 12 different actions. Largest state had 237 variables. [2019-09-10 06:45:09,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:09,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:09,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:09,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:45:09,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:09,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:45:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:09,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:45:09,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:45:09,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:09,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:09,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,304 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:45:10,305 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:45:10,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:10,729 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:45:10,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:45:10,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2019-09-10 06:45:10,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:45:10,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 06:45:10,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 06:45:10,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:45:10,735 INFO L87 Difference]: Start difference. First operand 428165 states and 506784 transitions. Second operand 27 states. [2019-09-10 06:45:10,934 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 06:45:13,839 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:45:16,189 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:45:16,574 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 06:45:16,833 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 06:45:19,213 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:45:19,476 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 06:45:19,911 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:45:20,631 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:45:21,068 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:45:21,259 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:45:21,926 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 06:45:22,089 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 06:45:22,578 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 06:45:22,753 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:45:22,961 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 06:45:25,512 WARN L188 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:45:26,001 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:45:28,637 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 06:45:29,623 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:45:29,813 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 06:45:30,008 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 06:45:30,383 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 06:45:32,748 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:45:33,341 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:45:33,587 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:45:34,208 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 06:45:34,395 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:45:35,004 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:45:36,274 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:45:36,502 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:45:37,272 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:45:37,486 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:45:37,878 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 06:45:38,307 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:45:39,295 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:45:39,539 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:45:40,207 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:45:40,460 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:45:40,673 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:45:41,407 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 06:45:41,639 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:45:42,568 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:45:43,376 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:45:44,574 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:45:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:47,928 INFO L93 Difference]: Finished difference Result 945094 states and 1120035 transitions. [2019-09-10 06:45:47,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-10 06:45:47,929 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 114 [2019-09-10 06:45:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:49,022 INFO L225 Difference]: With dead ends: 945094 [2019-09-10 06:45:49,022 INFO L226 Difference]: Without dead ends: 945094 [2019-09-10 06:45:49,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7457 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=3875, Invalid=19687, Unknown=0, NotChecked=0, Total=23562 [2019-09-10 06:45:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945094 states. [2019-09-10 06:46:03,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945094 to 412337. [2019-09-10 06:46:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412337 states. [2019-09-10 06:46:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412337 states to 412337 states and 488091 transitions. [2019-09-10 06:46:03,572 INFO L78 Accepts]: Start accepts. Automaton has 412337 states and 488091 transitions. Word has length 114 [2019-09-10 06:46:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:03,572 INFO L475 AbstractCegarLoop]: Abstraction has 412337 states and 488091 transitions. [2019-09-10 06:46:03,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 06:46:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 412337 states and 488091 transitions. [2019-09-10 06:46:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:46:03,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:03,577 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:03,577 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:03,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1701660697, now seen corresponding path program 1 times [2019-09-10 06:46:03,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:03,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:03,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:03,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:03,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:04,447 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:46:04,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:04,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:46:04,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:04,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:46:04,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:46:04,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:46:04,448 INFO L87 Difference]: Start difference. First operand 412337 states and 488091 transitions. Second operand 17 states. [2019-09-10 06:46:05,079 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:46:05,260 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:46:05,783 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:46:06,260 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 06:46:06,576 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 06:46:06,730 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 06:46:07,356 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 06:46:08,502 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 06:46:08,808 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 06:46:09,054 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 06:46:09,330 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-09-10 06:46:09,623 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-09-10 06:46:09,939 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 06:46:10,162 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 06:46:10,444 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-09-10 06:46:10,735 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-09-10 06:46:10,997 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-09-10 06:46:11,354 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-09-10 06:46:11,849 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 06:46:12,091 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 06:46:12,401 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 06:46:12,805 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 06:46:13,063 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 06:46:13,265 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 06:46:13,541 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-09-10 06:46:13,715 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 06:46:13,918 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 06:46:14,504 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 06:46:14,700 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:46:14,965 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 06:46:15,165 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 06:46:15,344 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 06:46:15,576 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 06:46:15,752 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 06:46:16,704 WARN L188 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 06:46:16,930 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:46:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:18,691 INFO L93 Difference]: Finished difference Result 734445 states and 868622 transitions. [2019-09-10 06:46:18,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 06:46:18,691 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 115 [2019-09-10 06:46:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:20,564 INFO L225 Difference]: With dead ends: 734445 [2019-09-10 06:46:20,564 INFO L226 Difference]: Without dead ends: 734445 [2019-09-10 06:46:20,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=920, Invalid=3240, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 06:46:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734445 states.