java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:36:15,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:36:15,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:36:15,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:36:15,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:36:15,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:36:15,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:36:15,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:36:15,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:36:15,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:36:15,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:36:15,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:36:15,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:36:15,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:36:15,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:36:15,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:36:15,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:36:15,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:36:15,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:36:15,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:36:15,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:36:15,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:36:15,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:36:15,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:36:15,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:36:15,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:36:15,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:36:15,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:36:15,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:36:15,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:36:15,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:36:15,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:36:15,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:36:15,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:36:15,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:36:15,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:36:15,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:36:15,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:36:15,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:36:15,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:36:15,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:36:15,560 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:36:15,576 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:36:15,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:36:15,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:36:15,577 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:36:15,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:36:15,578 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:36:15,578 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:36:15,579 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:36:15,579 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:36:15,579 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:36:15,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:36:15,580 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:36:15,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:36:15,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:36:15,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:36:15,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:36:15,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:36:15,581 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:36:15,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:36:15,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:36:15,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:36:15,582 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:36:15,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:36:15,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:36:15,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:36:15,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:36:15,583 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:36:15,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:36:15,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:36:15,584 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:36:15,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:36:15,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:36:15,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:36:15,640 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:36:15,640 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:36:15,641 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:36:15,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08f5d7d7/157f19226dad4df787400fdc32276bc7/FLAG29414540f [2019-09-10 06:36:16,308 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:36:16,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:36:16,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08f5d7d7/157f19226dad4df787400fdc32276bc7/FLAG29414540f [2019-09-10 06:36:16,561 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08f5d7d7/157f19226dad4df787400fdc32276bc7 [2019-09-10 06:36:16,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:36:16,573 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:36:16,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:36:16,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:36:16,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:36:16,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:36:16" (1/1) ... [2019-09-10 06:36:16,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d681588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:16, skipping insertion in model container [2019-09-10 06:36:16,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:36:16" (1/1) ... [2019-09-10 06:36:16,592 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:36:16,703 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:36:17,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:36:17,481 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:36:17,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:36:17,886 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:36:17,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:17 WrapperNode [2019-09-10 06:36:17,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:36:17,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:36:17,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:36:17,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:36:17,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:17" (1/1) ... [2019-09-10 06:36:17,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:17" (1/1) ... [2019-09-10 06:36:17,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:17" (1/1) ... [2019-09-10 06:36:17,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:17" (1/1) ... [2019-09-10 06:36:18,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:17" (1/1) ... [2019-09-10 06:36:18,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:17" (1/1) ... [2019-09-10 06:36:18,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:17" (1/1) ... [2019-09-10 06:36:18,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:36:18,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:36:18,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:36:18,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:36:18,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:17" (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:36:18,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:36:18,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:36:18,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:36:18,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:36:18,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:36:18,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:36:18,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:36:18,191 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:36:18,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:36:18,192 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:36:18,192 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:36:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:36:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:36:18,194 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:36:18,194 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:36:18,195 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:36:18,195 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:36:18,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:36:18,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:36:20,370 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:36:20,371 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:36:20,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:36:20 BoogieIcfgContainer [2019-09-10 06:36:20,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:36:20,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:36:20,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:36:20,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:36:20,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:36:16" (1/3) ... [2019-09-10 06:36:20,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472f695f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:36:20, skipping insertion in model container [2019-09-10 06:36:20,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:17" (2/3) ... [2019-09-10 06:36:20,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472f695f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:36:20, skipping insertion in model container [2019-09-10 06:36:20,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:36:20" (3/3) ... [2019-09-10 06:36:20,381 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:36:20,391 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:36:20,400 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-10 06:36:20,417 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-10 06:36:20,445 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:36:20,445 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:36:20,445 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:36:20,445 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:36:20,446 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:36:20,446 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:36:20,446 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:36:20,446 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:36:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states. [2019-09-10 06:36:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 06:36:20,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:20,496 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] [2019-09-10 06:36:20,498 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:20,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:20,505 INFO L82 PathProgramCache]: Analyzing trace with hash 769372493, now seen corresponding path program 1 times [2019-09-10 06:36:20,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:20,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:20,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:20,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:20,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:21,099 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:21,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:21,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:21,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:21,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:21,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:21,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:21,131 INFO L87 Difference]: Start difference. First operand 461 states. Second operand 5 states. [2019-09-10 06:36:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:21,840 INFO L93 Difference]: Finished difference Result 501 states and 858 transitions. [2019-09-10 06:36:21,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:21,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-10 06:36:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:21,864 INFO L225 Difference]: With dead ends: 501 [2019-09-10 06:36:21,864 INFO L226 Difference]: Without dead ends: 489 [2019-09-10 06:36:21,866 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:36:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-10 06:36:21,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 483. [2019-09-10 06:36:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-10 06:36:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 657 transitions. [2019-09-10 06:36:21,948 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 657 transitions. Word has length 54 [2019-09-10 06:36:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:21,949 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 657 transitions. [2019-09-10 06:36:21,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 657 transitions. [2019-09-10 06:36:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:36:21,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:21,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] [2019-09-10 06:36:21,954 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:21,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:21,955 INFO L82 PathProgramCache]: Analyzing trace with hash 861483672, now seen corresponding path program 1 times [2019-09-10 06:36:21,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:21,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:21,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:21,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:22,072 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:22,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:22,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:22,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:22,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:22,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:22,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:22,076 INFO L87 Difference]: Start difference. First operand 483 states and 657 transitions. Second operand 3 states. [2019-09-10 06:36:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:22,127 INFO L93 Difference]: Finished difference Result 765 states and 1046 transitions. [2019-09-10 06:36:22,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:22,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-10 06:36:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:22,133 INFO L225 Difference]: With dead ends: 765 [2019-09-10 06:36:22,133 INFO L226 Difference]: Without dead ends: 765 [2019-09-10 06:36:22,134 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:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-09-10 06:36:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 757. [2019-09-10 06:36:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-09-10 06:36:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1040 transitions. [2019-09-10 06:36:22,165 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1040 transitions. Word has length 55 [2019-09-10 06:36:22,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:22,166 INFO L475 AbstractCegarLoop]: Abstraction has 757 states and 1040 transitions. [2019-09-10 06:36:22,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1040 transitions. [2019-09-10 06:36:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:36:22,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:22,169 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:36:22,169 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:22,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash 481355333, now seen corresponding path program 1 times [2019-09-10 06:36:22,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:22,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:22,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:22,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:22,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:22,313 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:22,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:22,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:22,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:22,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:22,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:22,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:22,316 INFO L87 Difference]: Start difference. First operand 757 states and 1040 transitions. Second operand 3 states. [2019-09-10 06:36:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:22,374 INFO L93 Difference]: Finished difference Result 1101 states and 1536 transitions. [2019-09-10 06:36:22,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:22,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-10 06:36:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:22,383 INFO L225 Difference]: With dead ends: 1101 [2019-09-10 06:36:22,383 INFO L226 Difference]: Without dead ends: 1101 [2019-09-10 06:36:22,384 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:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-09-10 06:36:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1095. [2019-09-10 06:36:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-09-10 06:36:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1532 transitions. [2019-09-10 06:36:22,412 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1532 transitions. Word has length 55 [2019-09-10 06:36:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:22,414 INFO L475 AbstractCegarLoop]: Abstraction has 1095 states and 1532 transitions. [2019-09-10 06:36:22,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1532 transitions. [2019-09-10 06:36:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:36:22,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:22,419 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:36:22,419 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:22,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2053812510, now seen corresponding path program 1 times [2019-09-10 06:36:22,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:22,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:22,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:22,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:22,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:22,603 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:22,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:22,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:22,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:22,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:22,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:22,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:22,605 INFO L87 Difference]: Start difference. First operand 1095 states and 1532 transitions. Second operand 6 states. [2019-09-10 06:36:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:23,063 INFO L93 Difference]: Finished difference Result 1883 states and 2706 transitions. [2019-09-10 06:36:23,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:23,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-10 06:36:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:23,073 INFO L225 Difference]: With dead ends: 1883 [2019-09-10 06:36:23,074 INFO L226 Difference]: Without dead ends: 1883 [2019-09-10 06:36:23,074 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:36:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2019-09-10 06:36:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1863. [2019-09-10 06:36:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1863 states. [2019-09-10 06:36:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2690 transitions. [2019-09-10 06:36:23,123 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2690 transitions. Word has length 55 [2019-09-10 06:36:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:23,124 INFO L475 AbstractCegarLoop]: Abstraction has 1863 states and 2690 transitions. [2019-09-10 06:36:23,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2690 transitions. [2019-09-10 06:36:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:36:23,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:23,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] [2019-09-10 06:36:23,128 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:23,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash 287776612, now seen corresponding path program 1 times [2019-09-10 06:36:23,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:23,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:23,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:23,347 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:23,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:23,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:23,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:23,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:23,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:23,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:23,351 INFO L87 Difference]: Start difference. First operand 1863 states and 2690 transitions. Second operand 6 states. [2019-09-10 06:36:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:23,743 INFO L93 Difference]: Finished difference Result 4345 states and 6314 transitions. [2019-09-10 06:36:23,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:23,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:36:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:23,766 INFO L225 Difference]: With dead ends: 4345 [2019-09-10 06:36:23,766 INFO L226 Difference]: Without dead ends: 4345 [2019-09-10 06:36:23,767 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:36:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4345 states. [2019-09-10 06:36:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4345 to 4330. [2019-09-10 06:36:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4330 states. [2019-09-10 06:36:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6303 transitions. [2019-09-10 06:36:23,864 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6303 transitions. Word has length 56 [2019-09-10 06:36:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:23,865 INFO L475 AbstractCegarLoop]: Abstraction has 4330 states and 6303 transitions. [2019-09-10 06:36:23,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6303 transitions. [2019-09-10 06:36:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:36:23,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:23,868 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:36:23,868 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:23,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:23,868 INFO L82 PathProgramCache]: Analyzing trace with hash 393817543, now seen corresponding path program 1 times [2019-09-10 06:36:23,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:23,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:23,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:23,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:23,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:23,943 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:23,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:23,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:23,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:23,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:23,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:23,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:23,945 INFO L87 Difference]: Start difference. First operand 4330 states and 6303 transitions. Second operand 3 states. [2019-09-10 06:36:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:24,035 INFO L93 Difference]: Finished difference Result 6264 states and 9027 transitions. [2019-09-10 06:36:24,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:24,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:36:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:24,068 INFO L225 Difference]: With dead ends: 6264 [2019-09-10 06:36:24,068 INFO L226 Difference]: Without dead ends: 6264 [2019-09-10 06:36:24,069 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:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2019-09-10 06:36:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 6217. [2019-09-10 06:36:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2019-09-10 06:36:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 8982 transitions. [2019-09-10 06:36:24,234 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 8982 transitions. Word has length 56 [2019-09-10 06:36:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:24,235 INFO L475 AbstractCegarLoop]: Abstraction has 6217 states and 8982 transitions. [2019-09-10 06:36:24,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 8982 transitions. [2019-09-10 06:36:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:36:24,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:24,248 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:36:24,248 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:24,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:24,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1900631734, now seen corresponding path program 1 times [2019-09-10 06:36:24,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:24,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:24,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:24,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:24,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:24,458 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:24,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:24,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:36:24,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:24,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:36:24,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:36:24,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:36:24,461 INFO L87 Difference]: Start difference. First operand 6217 states and 8982 transitions. Second operand 7 states. [2019-09-10 06:36:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:25,586 INFO L93 Difference]: Finished difference Result 27264 states and 39688 transitions. [2019-09-10 06:36:25,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:36:25,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-10 06:36:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:25,727 INFO L225 Difference]: With dead ends: 27264 [2019-09-10 06:36:25,727 INFO L226 Difference]: Without dead ends: 27264 [2019-09-10 06:36:25,728 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:36:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27264 states. [2019-09-10 06:36:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27264 to 6251. [2019-09-10 06:36:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6251 states. [2019-09-10 06:36:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6251 states to 6251 states and 9026 transitions. [2019-09-10 06:36:26,142 INFO L78 Accepts]: Start accepts. Automaton has 6251 states and 9026 transitions. Word has length 57 [2019-09-10 06:36:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:26,144 INFO L475 AbstractCegarLoop]: Abstraction has 6251 states and 9026 transitions. [2019-09-10 06:36:26,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:36:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 6251 states and 9026 transitions. [2019-09-10 06:36:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:36:26,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:26,147 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:36:26,148 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:26,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:26,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1596178184, now seen corresponding path program 1 times [2019-09-10 06:36:26,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:26,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:26,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:26,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:26,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:26,269 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:26,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:26,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:36:26,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:26,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:36:26,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:36:26,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:36:26,272 INFO L87 Difference]: Start difference. First operand 6251 states and 9026 transitions. Second operand 7 states. [2019-09-10 06:36:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:27,150 INFO L93 Difference]: Finished difference Result 20808 states and 30254 transitions. [2019-09-10 06:36:27,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:36:27,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-10 06:36:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:27,202 INFO L225 Difference]: With dead ends: 20808 [2019-09-10 06:36:27,202 INFO L226 Difference]: Without dead ends: 20808 [2019-09-10 06:36:27,203 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:36:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20808 states. [2019-09-10 06:36:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20808 to 6273. [2019-09-10 06:36:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6273 states. [2019-09-10 06:36:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6273 states to 6273 states and 9057 transitions. [2019-09-10 06:36:27,529 INFO L78 Accepts]: Start accepts. Automaton has 6273 states and 9057 transitions. Word has length 57 [2019-09-10 06:36:27,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:27,530 INFO L475 AbstractCegarLoop]: Abstraction has 6273 states and 9057 transitions. [2019-09-10 06:36:27,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:36:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 6273 states and 9057 transitions. [2019-09-10 06:36:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:36:27,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:27,534 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:36:27,535 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:27,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:27,535 INFO L82 PathProgramCache]: Analyzing trace with hash -728834285, now seen corresponding path program 1 times [2019-09-10 06:36:27,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:27,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:27,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:27,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:27,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:27,640 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:27,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:27,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:36:27,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:27,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:36:27,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:36:27,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:36:27,642 INFO L87 Difference]: Start difference. First operand 6273 states and 9057 transitions. Second operand 7 states. [2019-09-10 06:36:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:28,361 INFO L93 Difference]: Finished difference Result 18141 states and 26405 transitions. [2019-09-10 06:36:28,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:36:28,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-10 06:36:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:28,398 INFO L225 Difference]: With dead ends: 18141 [2019-09-10 06:36:28,398 INFO L226 Difference]: Without dead ends: 18141 [2019-09-10 06:36:28,399 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:36:28,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18141 states. [2019-09-10 06:36:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18141 to 6287. [2019-09-10 06:36:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6287 states. [2019-09-10 06:36:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6287 states to 6287 states and 9075 transitions. [2019-09-10 06:36:29,062 INFO L78 Accepts]: Start accepts. Automaton has 6287 states and 9075 transitions. Word has length 57 [2019-09-10 06:36:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:29,062 INFO L475 AbstractCegarLoop]: Abstraction has 6287 states and 9075 transitions. [2019-09-10 06:36:29,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:36:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 6287 states and 9075 transitions. [2019-09-10 06:36:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:36:29,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:29,066 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:36:29,066 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:29,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:29,067 INFO L82 PathProgramCache]: Analyzing trace with hash -400384619, now seen corresponding path program 1 times [2019-09-10 06:36:29,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:29,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:29,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:29,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:29,277 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:29,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:29,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:36:29,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:29,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:36:29,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:36:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:36:29,284 INFO L87 Difference]: Start difference. First operand 6287 states and 9075 transitions. Second operand 9 states. [2019-09-10 06:36:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:30,948 INFO L93 Difference]: Finished difference Result 22500 states and 32837 transitions. [2019-09-10 06:36:30,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:36:30,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-10 06:36:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:30,995 INFO L225 Difference]: With dead ends: 22500 [2019-09-10 06:36:30,996 INFO L226 Difference]: Without dead ends: 22500 [2019-09-10 06:36:30,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:36:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22500 states. [2019-09-10 06:36:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22500 to 6253. [2019-09-10 06:36:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6253 states. [2019-09-10 06:36:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6253 states to 6253 states and 9029 transitions. [2019-09-10 06:36:31,321 INFO L78 Accepts]: Start accepts. Automaton has 6253 states and 9029 transitions. Word has length 58 [2019-09-10 06:36:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:31,321 INFO L475 AbstractCegarLoop]: Abstraction has 6253 states and 9029 transitions. [2019-09-10 06:36:31,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:36:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 6253 states and 9029 transitions. [2019-09-10 06:36:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:36:31,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:31,326 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:36:31,327 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:31,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:31,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1454445203, now seen corresponding path program 1 times [2019-09-10 06:36:31,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:31,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:31,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:31,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:31,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:31,486 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:31,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:31,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:36:31,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:31,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:36:31,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:36:31,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:36:31,488 INFO L87 Difference]: Start difference. First operand 6253 states and 9029 transitions. Second operand 9 states. [2019-09-10 06:36:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:32,977 INFO L93 Difference]: Finished difference Result 22530 states and 33356 transitions. [2019-09-10 06:36:32,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:36:32,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-10 06:36:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:33,012 INFO L225 Difference]: With dead ends: 22530 [2019-09-10 06:36:33,013 INFO L226 Difference]: Without dead ends: 22530 [2019-09-10 06:36:33,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:36:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2019-09-10 06:36:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 6253. [2019-09-10 06:36:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6253 states. [2019-09-10 06:36:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6253 states to 6253 states and 9027 transitions. [2019-09-10 06:36:33,317 INFO L78 Accepts]: Start accepts. Automaton has 6253 states and 9027 transitions. Word has length 58 [2019-09-10 06:36:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:33,317 INFO L475 AbstractCegarLoop]: Abstraction has 6253 states and 9027 transitions. [2019-09-10 06:36:33,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:36:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 6253 states and 9027 transitions. [2019-09-10 06:36:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:36:33,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:33,321 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:36:33,322 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash -780512958, now seen corresponding path program 1 times [2019-09-10 06:36:33,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:33,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:33,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:33,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:33,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:33,494 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:33,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:33,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:36:33,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:33,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:36:33,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:36:33,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:36:33,497 INFO L87 Difference]: Start difference. First operand 6253 states and 9027 transitions. Second operand 8 states. [2019-09-10 06:36:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:34,419 INFO L93 Difference]: Finished difference Result 11458 states and 16698 transitions. [2019-09-10 06:36:34,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:36:34,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-09-10 06:36:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:34,440 INFO L225 Difference]: With dead ends: 11458 [2019-09-10 06:36:34,440 INFO L226 Difference]: Without dead ends: 11458 [2019-09-10 06:36:34,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:36:34,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2019-09-10 06:36:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 6088. [2019-09-10 06:36:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6088 states. [2019-09-10 06:36:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 8805 transitions. [2019-09-10 06:36:34,587 INFO L78 Accepts]: Start accepts. Automaton has 6088 states and 8805 transitions. Word has length 58 [2019-09-10 06:36:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:34,588 INFO L475 AbstractCegarLoop]: Abstraction has 6088 states and 8805 transitions. [2019-09-10 06:36:34,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:36:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 6088 states and 8805 transitions. [2019-09-10 06:36:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:36:34,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:34,593 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:34,594 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1313400580, now seen corresponding path program 1 times [2019-09-10 06:36:34,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:34,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:34,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:34,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:34,682 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:34,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:34,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:34,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:34,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:34,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:34,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:34,685 INFO L87 Difference]: Start difference. First operand 6088 states and 8805 transitions. Second operand 3 states. [2019-09-10 06:36:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:34,734 INFO L93 Difference]: Finished difference Result 6094 states and 8717 transitions. [2019-09-10 06:36:34,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:34,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:36:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:34,745 INFO L225 Difference]: With dead ends: 6094 [2019-09-10 06:36:34,745 INFO L226 Difference]: Without dead ends: 6094 [2019-09-10 06:36:34,746 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:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6094 states. [2019-09-10 06:36:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6094 to 6088. [2019-09-10 06:36:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6088 states. [2019-09-10 06:36:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 8713 transitions. [2019-09-10 06:36:34,835 INFO L78 Accepts]: Start accepts. Automaton has 6088 states and 8713 transitions. Word has length 59 [2019-09-10 06:36:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:34,835 INFO L475 AbstractCegarLoop]: Abstraction has 6088 states and 8713 transitions. [2019-09-10 06:36:34,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 6088 states and 8713 transitions. [2019-09-10 06:36:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:36:34,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:34,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:34,842 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1203643884, now seen corresponding path program 1 times [2019-09-10 06:36:34,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:34,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:34,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:34,931 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:34,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:34,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:34,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:34,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:34,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:34,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:34,934 INFO L87 Difference]: Start difference. First operand 6088 states and 8713 transitions. Second operand 3 states. [2019-09-10 06:36:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:35,005 INFO L93 Difference]: Finished difference Result 6095 states and 8618 transitions. [2019-09-10 06:36:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:35,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:36:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:35,013 INFO L225 Difference]: With dead ends: 6095 [2019-09-10 06:36:35,013 INFO L226 Difference]: Without dead ends: 6095 [2019-09-10 06:36:35,016 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:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-09-10 06:36:35,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 6088. [2019-09-10 06:36:35,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6088 states. [2019-09-10 06:36:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 8613 transitions. [2019-09-10 06:36:35,111 INFO L78 Accepts]: Start accepts. Automaton has 6088 states and 8613 transitions. Word has length 59 [2019-09-10 06:36:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:35,112 INFO L475 AbstractCegarLoop]: Abstraction has 6088 states and 8613 transitions. [2019-09-10 06:36:35,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 6088 states and 8613 transitions. [2019-09-10 06:36:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:36:35,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:35,116 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:35,117 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:35,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash 776650189, now seen corresponding path program 1 times [2019-09-10 06:36:35,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:35,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:35,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:35,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:35,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:35,245 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:35,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:35,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:35,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:35,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:35,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:35,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:35,247 INFO L87 Difference]: Start difference. First operand 6088 states and 8613 transitions. Second operand 3 states. [2019-09-10 06:36:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:35,289 INFO L93 Difference]: Finished difference Result 6054 states and 8390 transitions. [2019-09-10 06:36:35,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:35,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:36:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:35,297 INFO L225 Difference]: With dead ends: 6054 [2019-09-10 06:36:35,297 INFO L226 Difference]: Without dead ends: 6054 [2019-09-10 06:36:35,300 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:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2019-09-10 06:36:35,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 6048. [2019-09-10 06:36:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6048 states. [2019-09-10 06:36:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6048 states to 6048 states and 8386 transitions. [2019-09-10 06:36:35,370 INFO L78 Accepts]: Start accepts. Automaton has 6048 states and 8386 transitions. Word has length 59 [2019-09-10 06:36:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:35,370 INFO L475 AbstractCegarLoop]: Abstraction has 6048 states and 8386 transitions. [2019-09-10 06:36:35,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 6048 states and 8386 transitions. [2019-09-10 06:36:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:36:35,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:35,375 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:35,375 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:35,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1527639271, now seen corresponding path program 1 times [2019-09-10 06:36:35,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:35,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:35,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:35,425 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:35,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:35,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:35,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:35,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:35,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:35,427 INFO L87 Difference]: Start difference. First operand 6048 states and 8386 transitions. Second operand 3 states. [2019-09-10 06:36:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:35,503 INFO L93 Difference]: Finished difference Result 7046 states and 9811 transitions. [2019-09-10 06:36:35,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:35,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:36:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:35,512 INFO L225 Difference]: With dead ends: 7046 [2019-09-10 06:36:35,512 INFO L226 Difference]: Without dead ends: 7046 [2019-09-10 06:36:35,512 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:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7046 states. [2019-09-10 06:36:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7046 to 5667. [2019-09-10 06:36:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5667 states. [2019-09-10 06:36:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5667 states to 5667 states and 7880 transitions. [2019-09-10 06:36:35,583 INFO L78 Accepts]: Start accepts. Automaton has 5667 states and 7880 transitions. Word has length 60 [2019-09-10 06:36:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:35,583 INFO L475 AbstractCegarLoop]: Abstraction has 5667 states and 7880 transitions. [2019-09-10 06:36:35,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5667 states and 7880 transitions. [2019-09-10 06:36:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:35,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:35,587 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:35,587 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:35,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash -306322079, now seen corresponding path program 1 times [2019-09-10 06:36:35,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:35,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:35,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:35,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:35,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:35,667 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:35,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:35,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:35,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:35,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:35,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:35,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:35,669 INFO L87 Difference]: Start difference. First operand 5667 states and 7880 transitions. Second operand 3 states. [2019-09-10 06:36:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:35,736 INFO L93 Difference]: Finished difference Result 7955 states and 11157 transitions. [2019-09-10 06:36:35,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:35,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:36:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:35,748 INFO L225 Difference]: With dead ends: 7955 [2019-09-10 06:36:35,748 INFO L226 Difference]: Without dead ends: 7955 [2019-09-10 06:36:35,749 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:35,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7955 states. [2019-09-10 06:36:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7955 to 5606. [2019-09-10 06:36:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5606 states. [2019-09-10 06:36:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 7788 transitions. [2019-09-10 06:36:35,823 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 7788 transitions. Word has length 61 [2019-09-10 06:36:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:35,823 INFO L475 AbstractCegarLoop]: Abstraction has 5606 states and 7788 transitions. [2019-09-10 06:36:35,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 7788 transitions. [2019-09-10 06:36:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:35,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:35,827 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:35,827 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:35,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1076067543, now seen corresponding path program 1 times [2019-09-10 06:36:35,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:35,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:35,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:35,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:35,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:35,879 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:35,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:35,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:35,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:35,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:35,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:35,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:35,881 INFO L87 Difference]: Start difference. First operand 5606 states and 7788 transitions. Second operand 3 states. [2019-09-10 06:36:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:35,971 INFO L93 Difference]: Finished difference Result 7868 states and 11023 transitions. [2019-09-10 06:36:35,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:35,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:36:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:35,983 INFO L225 Difference]: With dead ends: 7868 [2019-09-10 06:36:35,984 INFO L226 Difference]: Without dead ends: 7868 [2019-09-10 06:36:35,984 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:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2019-09-10 06:36:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 5517. [2019-09-10 06:36:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5517 states. [2019-09-10 06:36:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5517 states to 5517 states and 7664 transitions. [2019-09-10 06:36:36,068 INFO L78 Accepts]: Start accepts. Automaton has 5517 states and 7664 transitions. Word has length 61 [2019-09-10 06:36:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:36,068 INFO L475 AbstractCegarLoop]: Abstraction has 5517 states and 7664 transitions. [2019-09-10 06:36:36,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5517 states and 7664 transitions. [2019-09-10 06:36:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:36,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:36,073 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:36,074 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:36,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:36,074 INFO L82 PathProgramCache]: Analyzing trace with hash -69771348, now seen corresponding path program 1 times [2019-09-10 06:36:36,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:36,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:36,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:36,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:36,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:36,610 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:36,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:36,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:36:36,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:36,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:36:36,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:36:36,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:36:36,612 INFO L87 Difference]: Start difference. First operand 5517 states and 7664 transitions. Second operand 13 states. [2019-09-10 06:36:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:37,923 INFO L93 Difference]: Finished difference Result 7861 states and 11000 transitions. [2019-09-10 06:36:37,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:36:37,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-10 06:36:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:37,935 INFO L225 Difference]: With dead ends: 7861 [2019-09-10 06:36:37,936 INFO L226 Difference]: Without dead ends: 7861 [2019-09-10 06:36:37,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:36:37,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7861 states. [2019-09-10 06:36:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7861 to 5513. [2019-09-10 06:36:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5513 states. [2019-09-10 06:36:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5513 states to 5513 states and 7659 transitions. [2019-09-10 06:36:38,018 INFO L78 Accepts]: Start accepts. Automaton has 5513 states and 7659 transitions. Word has length 61 [2019-09-10 06:36:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:38,018 INFO L475 AbstractCegarLoop]: Abstraction has 5513 states and 7659 transitions. [2019-09-10 06:36:38,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:36:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5513 states and 7659 transitions. [2019-09-10 06:36:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:38,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:38,021 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:38,022 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:38,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:38,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1711838127, now seen corresponding path program 1 times [2019-09-10 06:36:38,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:38,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:38,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:38,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:38,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:38,762 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:38,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:38,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:36:38,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:38,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:36:38,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:36:38,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:36:38,764 INFO L87 Difference]: Start difference. First operand 5513 states and 7659 transitions. Second operand 12 states. [2019-09-10 06:36:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:40,117 INFO L93 Difference]: Finished difference Result 10158 states and 14256 transitions. [2019-09-10 06:36:40,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:36:40,117 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-10 06:36:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:40,130 INFO L225 Difference]: With dead ends: 10158 [2019-09-10 06:36:40,130 INFO L226 Difference]: Without dead ends: 10158 [2019-09-10 06:36:40,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:36:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10158 states. [2019-09-10 06:36:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10158 to 5512. [2019-09-10 06:36:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5512 states. [2019-09-10 06:36:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5512 states to 5512 states and 7657 transitions. [2019-09-10 06:36:40,200 INFO L78 Accepts]: Start accepts. Automaton has 5512 states and 7657 transitions. Word has length 61 [2019-09-10 06:36:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:40,201 INFO L475 AbstractCegarLoop]: Abstraction has 5512 states and 7657 transitions. [2019-09-10 06:36:40,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:36:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 5512 states and 7657 transitions. [2019-09-10 06:36:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:40,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:40,204 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:40,204 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:40,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:40,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1267518257, now seen corresponding path program 1 times [2019-09-10 06:36:40,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:40,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:40,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:40,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:40,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:41,175 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:41,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:41,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:36:41,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:41,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:36:41,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:36:41,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:36:41,178 INFO L87 Difference]: Start difference. First operand 5512 states and 7657 transitions. Second operand 16 states. [2019-09-10 06:36:41,616 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:36:41,882 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 06:36:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:43,559 INFO L93 Difference]: Finished difference Result 10054 states and 14140 transitions. [2019-09-10 06:36:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:36:43,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2019-09-10 06:36:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:43,574 INFO L225 Difference]: With dead ends: 10054 [2019-09-10 06:36:43,574 INFO L226 Difference]: Without dead ends: 10054 [2019-09-10 06:36:43,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:36:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10054 states. [2019-09-10 06:36:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10054 to 5512. [2019-09-10 06:36:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5512 states. [2019-09-10 06:36:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5512 states to 5512 states and 7656 transitions. [2019-09-10 06:36:43,654 INFO L78 Accepts]: Start accepts. Automaton has 5512 states and 7656 transitions. Word has length 61 [2019-09-10 06:36:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:43,655 INFO L475 AbstractCegarLoop]: Abstraction has 5512 states and 7656 transitions. [2019-09-10 06:36:43,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:36:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5512 states and 7656 transitions. [2019-09-10 06:36:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:43,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:43,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:43,659 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1890999092, now seen corresponding path program 1 times [2019-09-10 06:36:43,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:43,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:43,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:44,187 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:44,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:44,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:36:44,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:44,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:36:44,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:36:44,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:36:44,194 INFO L87 Difference]: Start difference. First operand 5512 states and 7656 transitions. Second operand 14 states. [2019-09-10 06:36:44,916 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 06:36:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:47,042 INFO L93 Difference]: Finished difference Result 17796 states and 25106 transitions. [2019-09-10 06:36:47,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:36:47,046 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-10 06:36:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:47,065 INFO L225 Difference]: With dead ends: 17796 [2019-09-10 06:36:47,066 INFO L226 Difference]: Without dead ends: 17796 [2019-09-10 06:36:47,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:36:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17796 states. [2019-09-10 06:36:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17796 to 5484. [2019-09-10 06:36:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5484 states. [2019-09-10 06:36:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 7624 transitions. [2019-09-10 06:36:47,161 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 7624 transitions. Word has length 61 [2019-09-10 06:36:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:47,161 INFO L475 AbstractCegarLoop]: Abstraction has 5484 states and 7624 transitions. [2019-09-10 06:36:47,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:36:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 7624 transitions. [2019-09-10 06:36:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:36:47,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:47,164 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:47,164 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:47,165 INFO L82 PathProgramCache]: Analyzing trace with hash -171028691, now seen corresponding path program 1 times [2019-09-10 06:36:47,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:47,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:47,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:47,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:47,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:47,520 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:47,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:47,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:36:47,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:47,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:36:47,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:36:47,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:36:47,522 INFO L87 Difference]: Start difference. First operand 5484 states and 7624 transitions. Second operand 11 states. [2019-09-10 06:36:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:48,847 INFO L93 Difference]: Finished difference Result 10648 states and 14985 transitions. [2019-09-10 06:36:48,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:36:48,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-09-10 06:36:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:48,858 INFO L225 Difference]: With dead ends: 10648 [2019-09-10 06:36:48,859 INFO L226 Difference]: Without dead ends: 10648 [2019-09-10 06:36:48,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:36:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10648 states. [2019-09-10 06:36:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10648 to 5480. [2019-09-10 06:36:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5480 states. [2019-09-10 06:36:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 7620 transitions. [2019-09-10 06:36:48,926 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 7620 transitions. Word has length 62 [2019-09-10 06:36:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:48,927 INFO L475 AbstractCegarLoop]: Abstraction has 5480 states and 7620 transitions. [2019-09-10 06:36:48,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:36:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 7620 transitions. [2019-09-10 06:36:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:36:48,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:48,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:48,932 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:48,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1643195361, now seen corresponding path program 1 times [2019-09-10 06:36:48,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:48,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:48,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:48,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:48,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:49,016 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:49,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:49,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:49,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:49,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:49,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:49,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:49,021 INFO L87 Difference]: Start difference. First operand 5480 states and 7620 transitions. Second operand 6 states. [2019-09-10 06:36:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:49,199 INFO L93 Difference]: Finished difference Result 18877 states and 26195 transitions. [2019-09-10 06:36:49,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:36:49,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:36:49,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:49,219 INFO L225 Difference]: With dead ends: 18877 [2019-09-10 06:36:49,219 INFO L226 Difference]: Without dead ends: 18877 [2019-09-10 06:36:49,219 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:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18877 states. [2019-09-10 06:36:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18877 to 14493. [2019-09-10 06:36:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14493 states. [2019-09-10 06:36:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14493 states to 14493 states and 20083 transitions. [2019-09-10 06:36:49,447 INFO L78 Accepts]: Start accepts. Automaton has 14493 states and 20083 transitions. Word has length 70 [2019-09-10 06:36:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:49,447 INFO L475 AbstractCegarLoop]: Abstraction has 14493 states and 20083 transitions. [2019-09-10 06:36:49,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 14493 states and 20083 transitions. [2019-09-10 06:36:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:36:49,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:49,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:49,452 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2116581710, now seen corresponding path program 1 times [2019-09-10 06:36:49,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:49,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:49,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:49,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:49,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:49,558 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:49,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:49,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:49,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:49,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:49,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:49,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:49,560 INFO L87 Difference]: Start difference. First operand 14493 states and 20083 transitions. Second operand 5 states. [2019-09-10 06:36:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:49,704 INFO L93 Difference]: Finished difference Result 13677 states and 18984 transitions. [2019-09-10 06:36:49,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:49,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:36:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:49,716 INFO L225 Difference]: With dead ends: 13677 [2019-09-10 06:36:49,716 INFO L226 Difference]: Without dead ends: 13677 [2019-09-10 06:36:49,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13677 states. [2019-09-10 06:36:49,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13677 to 13673. [2019-09-10 06:36:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13673 states. [2019-09-10 06:36:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13673 states to 13673 states and 18982 transitions. [2019-09-10 06:36:49,818 INFO L78 Accepts]: Start accepts. Automaton has 13673 states and 18982 transitions. Word has length 71 [2019-09-10 06:36:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:49,818 INFO L475 AbstractCegarLoop]: Abstraction has 13673 states and 18982 transitions. [2019-09-10 06:36:49,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 13673 states and 18982 transitions. [2019-09-10 06:36:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:36:49,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:49,823 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:49,824 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:49,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:49,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1570673773, now seen corresponding path program 1 times [2019-09-10 06:36:49,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:49,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:49,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:49,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:49,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:49,939 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:49,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:49,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:49,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:49,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:49,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:49,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:49,940 INFO L87 Difference]: Start difference. First operand 13673 states and 18982 transitions. Second operand 6 states. [2019-09-10 06:36:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:50,067 INFO L93 Difference]: Finished difference Result 25301 states and 34445 transitions. [2019-09-10 06:36:50,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:36:50,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-10 06:36:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:50,092 INFO L225 Difference]: With dead ends: 25301 [2019-09-10 06:36:50,092 INFO L226 Difference]: Without dead ends: 25301 [2019-09-10 06:36:50,093 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:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25301 states. [2019-09-10 06:36:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25301 to 14003. [2019-09-10 06:36:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14003 states. [2019-09-10 06:36:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14003 states to 14003 states and 19202 transitions. [2019-09-10 06:36:50,246 INFO L78 Accepts]: Start accepts. Automaton has 14003 states and 19202 transitions. Word has length 72 [2019-09-10 06:36:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:50,247 INFO L475 AbstractCegarLoop]: Abstraction has 14003 states and 19202 transitions. [2019-09-10 06:36:50,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 14003 states and 19202 transitions. [2019-09-10 06:36:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:36:50,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:50,252 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:50,253 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:50,253 INFO L82 PathProgramCache]: Analyzing trace with hash -274929820, now seen corresponding path program 1 times [2019-09-10 06:36:50,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:50,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:50,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:50,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:50,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:50,306 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:50,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:50,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:50,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:50,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:50,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:50,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:50,308 INFO L87 Difference]: Start difference. First operand 14003 states and 19202 transitions. Second operand 3 states. [2019-09-10 06:36:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:50,390 INFO L93 Difference]: Finished difference Result 23775 states and 32035 transitions. [2019-09-10 06:36:50,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:50,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:36:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:50,430 INFO L225 Difference]: With dead ends: 23775 [2019-09-10 06:36:50,430 INFO L226 Difference]: Without dead ends: 23775 [2019-09-10 06:36:50,430 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:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23775 states. [2019-09-10 06:36:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23775 to 23483. [2019-09-10 06:36:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23483 states. [2019-09-10 06:36:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23483 states to 23483 states and 31744 transitions. [2019-09-10 06:36:50,708 INFO L78 Accepts]: Start accepts. Automaton has 23483 states and 31744 transitions. Word has length 73 [2019-09-10 06:36:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:50,708 INFO L475 AbstractCegarLoop]: Abstraction has 23483 states and 31744 transitions. [2019-09-10 06:36:50,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 23483 states and 31744 transitions. [2019-09-10 06:36:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:36:50,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:50,721 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:50,722 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:50,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:50,722 INFO L82 PathProgramCache]: Analyzing trace with hash 61383844, now seen corresponding path program 1 times [2019-09-10 06:36:50,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:50,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:50,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:50,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:50,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:50,794 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:50,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:50,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:50,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:50,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:50,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:50,795 INFO L87 Difference]: Start difference. First operand 23483 states and 31744 transitions. Second operand 5 states. [2019-09-10 06:36:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:51,340 INFO L93 Difference]: Finished difference Result 70130 states and 92533 transitions. [2019-09-10 06:36:51,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:36:51,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-10 06:36:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:51,428 INFO L225 Difference]: With dead ends: 70130 [2019-09-10 06:36:51,428 INFO L226 Difference]: Without dead ends: 70130 [2019-09-10 06:36:51,428 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:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70130 states. [2019-09-10 06:36:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70130 to 37719. [2019-09-10 06:36:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37719 states. [2019-09-10 06:36:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37719 states to 37719 states and 50333 transitions. [2019-09-10 06:36:51,897 INFO L78 Accepts]: Start accepts. Automaton has 37719 states and 50333 transitions. Word has length 74 [2019-09-10 06:36:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:51,897 INFO L475 AbstractCegarLoop]: Abstraction has 37719 states and 50333 transitions. [2019-09-10 06:36:51,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 37719 states and 50333 transitions. [2019-09-10 06:36:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:36:51,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:51,905 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:51,906 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:51,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1329668181, now seen corresponding path program 1 times [2019-09-10 06:36:51,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:51,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:51,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:51,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:51,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:51,965 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:51,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:51,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:51,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:51,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:51,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:51,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:51,966 INFO L87 Difference]: Start difference. First operand 37719 states and 50333 transitions. Second operand 3 states. [2019-09-10 06:36:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:52,091 INFO L93 Difference]: Finished difference Result 36909 states and 48254 transitions. [2019-09-10 06:36:52,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:52,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:36:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:52,148 INFO L225 Difference]: With dead ends: 36909 [2019-09-10 06:36:52,148 INFO L226 Difference]: Without dead ends: 36909 [2019-09-10 06:36:52,149 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:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36909 states. [2019-09-10 06:36:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36909 to 36637. [2019-09-10 06:36:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36637 states. [2019-09-10 06:36:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36637 states to 36637 states and 47983 transitions. [2019-09-10 06:36:52,618 INFO L78 Accepts]: Start accepts. Automaton has 36637 states and 47983 transitions. Word has length 74 [2019-09-10 06:36:52,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:52,618 INFO L475 AbstractCegarLoop]: Abstraction has 36637 states and 47983 transitions. [2019-09-10 06:36:52,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 36637 states and 47983 transitions. [2019-09-10 06:36:52,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:36:52,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:52,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:52,630 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:52,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:52,630 INFO L82 PathProgramCache]: Analyzing trace with hash 458779300, now seen corresponding path program 1 times [2019-09-10 06:36:52,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:52,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:52,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:52,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:52,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:52,718 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:52,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:52,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:52,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:52,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:52,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:52,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:52,721 INFO L87 Difference]: Start difference. First operand 36637 states and 47983 transitions. Second operand 5 states. [2019-09-10 06:36:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:53,399 INFO L93 Difference]: Finished difference Result 119017 states and 152370 transitions. [2019-09-10 06:36:53,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:36:53,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-10 06:36:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:53,553 INFO L225 Difference]: With dead ends: 119017 [2019-09-10 06:36:53,554 INFO L226 Difference]: Without dead ends: 119017 [2019-09-10 06:36:53,554 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:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119017 states. [2019-09-10 06:36:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119017 to 71241. [2019-09-10 06:36:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71241 states. [2019-09-10 06:36:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71241 states to 71241 states and 93183 transitions. [2019-09-10 06:36:54,412 INFO L78 Accepts]: Start accepts. Automaton has 71241 states and 93183 transitions. Word has length 80 [2019-09-10 06:36:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:54,412 INFO L475 AbstractCegarLoop]: Abstraction has 71241 states and 93183 transitions. [2019-09-10 06:36:54,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 71241 states and 93183 transitions. [2019-09-10 06:36:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 06:36:54,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:54,430 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:54,430 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:54,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:54,431 INFO L82 PathProgramCache]: Analyzing trace with hash 148119732, now seen corresponding path program 1 times [2019-09-10 06:36:54,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:54,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:54,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:54,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:54,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:36:54,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:54,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:54,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:54,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:54,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:54,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:54,494 INFO L87 Difference]: Start difference. First operand 71241 states and 93183 transitions. Second operand 3 states. [2019-09-10 06:36:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:55,057 INFO L93 Difference]: Finished difference Result 133737 states and 170974 transitions. [2019-09-10 06:36:55,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:55,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 06:36:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:55,232 INFO L225 Difference]: With dead ends: 133737 [2019-09-10 06:36:55,232 INFO L226 Difference]: Without dead ends: 133737 [2019-09-10 06:36:55,233 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:55,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133737 states. [2019-09-10 06:36:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133737 to 96437. [2019-09-10 06:36:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96437 states. [2019-09-10 06:36:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96437 states to 96437 states and 124039 transitions. [2019-09-10 06:36:56,279 INFO L78 Accepts]: Start accepts. Automaton has 96437 states and 124039 transitions. Word has length 92 [2019-09-10 06:36:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:56,279 INFO L475 AbstractCegarLoop]: Abstraction has 96437 states and 124039 transitions. [2019-09-10 06:36:56,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 96437 states and 124039 transitions. [2019-09-10 06:36:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:36:56,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:56,297 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] [2019-09-10 06:36:56,298 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:56,298 INFO L82 PathProgramCache]: Analyzing trace with hash -424988470, now seen corresponding path program 1 times [2019-09-10 06:36:56,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:56,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:56,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:56,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:56,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:36:58,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:58,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:58,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:58,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:58,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:58,123 INFO L87 Difference]: Start difference. First operand 96437 states and 124039 transitions. Second operand 3 states. [2019-09-10 06:36:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:58,387 INFO L93 Difference]: Finished difference Result 121685 states and 152478 transitions. [2019-09-10 06:36:58,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:58,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 06:36:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:58,525 INFO L225 Difference]: With dead ends: 121685 [2019-09-10 06:36:58,526 INFO L226 Difference]: Without dead ends: 121685 [2019-09-10 06:36:58,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121685 states. [2019-09-10 06:36:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121685 to 109457. [2019-09-10 06:36:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109457 states. [2019-09-10 06:37:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109457 states to 109457 states and 138937 transitions. [2019-09-10 06:37:02,117 INFO L78 Accepts]: Start accepts. Automaton has 109457 states and 138937 transitions. Word has length 93 [2019-09-10 06:37:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:02,118 INFO L475 AbstractCegarLoop]: Abstraction has 109457 states and 138937 transitions. [2019-09-10 06:37:02,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 109457 states and 138937 transitions. [2019-09-10 06:37:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:37:02,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:02,128 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] [2019-09-10 06:37:02,128 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:02,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:02,128 INFO L82 PathProgramCache]: Analyzing trace with hash 551342129, now seen corresponding path program 1 times [2019-09-10 06:37:02,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:02,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:02,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:02,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:02,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:37:02,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:02,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:37:02,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:02,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:37:02,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:37:02,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:02,274 INFO L87 Difference]: Start difference. First operand 109457 states and 138937 transitions. Second operand 9 states. [2019-09-10 06:37:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:04,285 INFO L93 Difference]: Finished difference Result 421649 states and 532757 transitions. [2019-09-10 06:37:04,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:37:04,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 06:37:04,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:04,998 INFO L225 Difference]: With dead ends: 421649 [2019-09-10 06:37:04,998 INFO L226 Difference]: Without dead ends: 421649 [2019-09-10 06:37:04,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:37:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421649 states. [2019-09-10 06:37:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421649 to 109389. [2019-09-10 06:37:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109389 states. [2019-09-10 06:37:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109389 states to 109389 states and 138854 transitions. [2019-09-10 06:37:12,188 INFO L78 Accepts]: Start accepts. Automaton has 109389 states and 138854 transitions. Word has length 96 [2019-09-10 06:37:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:12,188 INFO L475 AbstractCegarLoop]: Abstraction has 109389 states and 138854 transitions. [2019-09-10 06:37:12,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:37:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 109389 states and 138854 transitions. [2019-09-10 06:37:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:37:12,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:12,198 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] [2019-09-10 06:37:12,199 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:12,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:12,199 INFO L82 PathProgramCache]: Analyzing trace with hash -777403506, now seen corresponding path program 1 times [2019-09-10 06:37:12,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:12,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:12,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:12,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:12,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:37:12,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:12,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:37:12,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:12,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:37:12,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:37:12,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:12,327 INFO L87 Difference]: Start difference. First operand 109389 states and 138854 transitions. Second operand 9 states. [2019-09-10 06:37:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:13,851 INFO L93 Difference]: Finished difference Result 318505 states and 405928 transitions. [2019-09-10 06:37:13,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:37:13,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 06:37:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:14,225 INFO L225 Difference]: With dead ends: 318505 [2019-09-10 06:37:14,226 INFO L226 Difference]: Without dead ends: 318505 [2019-09-10 06:37:14,226 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:37:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318505 states. [2019-09-10 06:37:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318505 to 109252. [2019-09-10 06:37:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109252 states. [2019-09-10 06:37:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109252 states to 109252 states and 138696 transitions. [2019-09-10 06:37:16,657 INFO L78 Accepts]: Start accepts. Automaton has 109252 states and 138696 transitions. Word has length 96 [2019-09-10 06:37:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:16,657 INFO L475 AbstractCegarLoop]: Abstraction has 109252 states and 138696 transitions. [2019-09-10 06:37:16,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:37:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 109252 states and 138696 transitions. [2019-09-10 06:37:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:37:16,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:16,668 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] [2019-09-10 06:37:16,668 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash -370268567, now seen corresponding path program 1 times [2019-09-10 06:37:16,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:16,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:16,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:16,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:16,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:16,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:37:16,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:16,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:37:16,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:37:16,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:37:16,863 INFO L87 Difference]: Start difference. First operand 109252 states and 138696 transitions. Second operand 10 states. [2019-09-10 06:37:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:19,930 INFO L93 Difference]: Finished difference Result 358700 states and 451672 transitions. [2019-09-10 06:37:19,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:37:19,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 06:37:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:20,436 INFO L225 Difference]: With dead ends: 358700 [2019-09-10 06:37:20,437 INFO L226 Difference]: Without dead ends: 358700 [2019-09-10 06:37:20,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:37:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358700 states. [2019-09-10 06:37:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358700 to 145048. [2019-09-10 06:37:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145048 states. [2019-09-10 06:37:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145048 states to 145048 states and 184060 transitions. [2019-09-10 06:37:23,500 INFO L78 Accepts]: Start accepts. Automaton has 145048 states and 184060 transitions. Word has length 97 [2019-09-10 06:37:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:23,501 INFO L475 AbstractCegarLoop]: Abstraction has 145048 states and 184060 transitions. [2019-09-10 06:37:23,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:37:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 145048 states and 184060 transitions. [2019-09-10 06:37:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:37:23,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:23,514 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] [2019-09-10 06:37:23,515 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:23,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1779273042, now seen corresponding path program 1 times [2019-09-10 06:37:23,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:23,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:23,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:23,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:37:23,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:37:23,710 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 06:37:23,713 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [107], [110], [114], [127], [130], [143], [146], [149], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [335], [337], [350], [358], [377], [388], [390], [393], [396], [399], [401], [403], [445], [458], [466], [485], [508], [571], [701], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1464], [1492], [1495], [1498], [1502], [1773], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:37:23,766 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:37:23,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:37:23,927 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:37:24,544 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:37:24,548 INFO L272 AbstractInterpreter]: Visited 91 different actions 370 times. Merged at 33 different actions 249 times. Widened at 13 different actions 37 times. Performed 1448 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1448 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 11 different actions. Largest state had 220 variables. [2019-09-10 06:37:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:24,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:37:24,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:37:24,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:37:24,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:24,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:37:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:24,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:37:24,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:37:24,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:25,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:25,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:37:25,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:25,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:25,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:25,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:25,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:37:25,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2019-09-10 06:37:25,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:37:25,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:37:25,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:37:25,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:37:25,925 INFO L87 Difference]: Start difference. First operand 145048 states and 184060 transitions. Second operand 18 states. [2019-09-10 06:37:26,413 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 06:37:26,565 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 06:37:28,555 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-09-10 06:37:28,901 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-09-10 06:37:30,193 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 06:37:32,723 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 06:37:33,264 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 06:37:33,564 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-09-10 06:37:33,700 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 06:37:34,147 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 06:37:34,523 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 06:37:35,018 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:37:35,454 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-09-10 06:37:35,982 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 06:37:36,953 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:37:38,055 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 06:37:38,572 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 06:37:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:39,531 INFO L93 Difference]: Finished difference Result 452697 states and 567131 transitions. [2019-09-10 06:37:39,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 06:37:39,531 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2019-09-10 06:37:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:40,526 INFO L225 Difference]: With dead ends: 452697 [2019-09-10 06:37:40,526 INFO L226 Difference]: Without dead ends: 452697 [2019-09-10 06:37:40,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 174 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=909, Invalid=2873, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 06:37:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452697 states. [2019-09-10 06:37:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452697 to 182612. [2019-09-10 06:37:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182612 states. [2019-09-10 06:37:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182612 states to 182612 states and 231095 transitions. [2019-09-10 06:37:46,696 INFO L78 Accepts]: Start accepts. Automaton has 182612 states and 231095 transitions. Word has length 97 [2019-09-10 06:37:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:46,696 INFO L475 AbstractCegarLoop]: Abstraction has 182612 states and 231095 transitions. [2019-09-10 06:37:46,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:37:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 182612 states and 231095 transitions. [2019-09-10 06:37:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:37:46,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:46,740 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] [2019-09-10 06:37:46,740 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:46,741 INFO L82 PathProgramCache]: Analyzing trace with hash 143013179, now seen corresponding path program 1 times [2019-09-10 06:37:46,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:46,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:46,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:46,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:46,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:46,953 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:37:46,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:37:46,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:37:46,954 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 06:37:46,955 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [107], [110], [114], [127], [130], [133], [143], [146], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [335], [337], [350], [358], [377], [388], [390], [403], [411], [430], [445], [448], [451], [454], [456], [458], [510], [569], [701], [848], [946], [950], [988], [1016], [1019], [1022], [1026], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:37:46,962 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:37:46,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:37:47,006 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:37:47,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:37:47,327 INFO L272 AbstractInterpreter]: Visited 91 different actions 325 times. Merged at 31 different actions 207 times. Widened at 10 different actions 21 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 29 fixpoints after 7 different actions. Largest state had 220 variables. [2019-09-10 06:37:47,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:47,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:37:47,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:37:47,328 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) [2019-09-10 06:37:47,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:47,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:37:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:47,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:37:47,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:37:47,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:47,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:48,390 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:37:48,390 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:37:48,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:48,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:48,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:48,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-10 06:37:48,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:37:48,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2019-09-10 06:37:48,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:37:48,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:37:48,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:37:48,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:37:48,664 INFO L87 Difference]: Start difference. First operand 182612 states and 231095 transitions. Second operand 18 states. [2019-09-10 06:37:50,698 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-09-10 06:37:52,832 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 06:37:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:57,217 INFO L93 Difference]: Finished difference Result 596891 states and 755648 transitions. [2019-09-10 06:37:57,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:37:57,217 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2019-09-10 06:37:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:58,140 INFO L225 Difference]: With dead ends: 596891 [2019-09-10 06:37:58,141 INFO L226 Difference]: Without dead ends: 596891 [2019-09-10 06:37:58,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 169 SyntacticMatches, 14 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=489, Invalid=1863, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:37:58,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596891 states. [2019-09-10 06:38:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596891 to 183766. [2019-09-10 06:38:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183766 states. [2019-09-10 06:38:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183766 states to 183766 states and 232500 transitions. [2019-09-10 06:38:07,328 INFO L78 Accepts]: Start accepts. Automaton has 183766 states and 232500 transitions. Word has length 97 [2019-09-10 06:38:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:07,328 INFO L475 AbstractCegarLoop]: Abstraction has 183766 states and 232500 transitions. [2019-09-10 06:38:07,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:38:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 183766 states and 232500 transitions. [2019-09-10 06:38:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:38:07,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:07,345 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] [2019-09-10 06:38:07,345 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:07,345 INFO L82 PathProgramCache]: Analyzing trace with hash -96634223, now seen corresponding path program 1 times [2019-09-10 06:38:07,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:07,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:07,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:38:07,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:07,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:07,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:07,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:07,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:07,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:07,403 INFO L87 Difference]: Start difference. First operand 183766 states and 232500 transitions. Second operand 3 states. [2019-09-10 06:38:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:08,058 INFO L93 Difference]: Finished difference Result 176393 states and 221975 transitions. [2019-09-10 06:38:08,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:08,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:38:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:08,347 INFO L225 Difference]: With dead ends: 176393 [2019-09-10 06:38:08,348 INFO L226 Difference]: Without dead ends: 176393 [2019-09-10 06:38:08,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176393 states. [2019-09-10 06:38:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176393 to 176393. [2019-09-10 06:38:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176393 states. [2019-09-10 06:38:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176393 states to 176393 states and 221975 transitions. [2019-09-10 06:38:13,004 INFO L78 Accepts]: Start accepts. Automaton has 176393 states and 221975 transitions. Word has length 98 [2019-09-10 06:38:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:13,005 INFO L475 AbstractCegarLoop]: Abstraction has 176393 states and 221975 transitions. [2019-09-10 06:38:13,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 176393 states and 221975 transitions. [2019-09-10 06:38:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:38:13,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:13,016 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] [2019-09-10 06:38:13,017 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash 34786608, now seen corresponding path program 1 times [2019-09-10 06:38:13,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:13,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:13,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:13,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:13,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:13,144 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:38:13,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:13,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:13,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 06:38:13,146 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [107], [110], [114], [117], [127], [130], [143], [146], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [317], [322], [335], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [430], [445], [458], [466], [485], [510], [571], [699], [1395], [1409], [1413], [1591], [1689], [1693], [1696], [1699], [1702], [1705], [1708], [1712], [1773], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:38:13,151 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:13,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:13,197 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:13,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:13,423 INFO L272 AbstractInterpreter]: Visited 92 different actions 272 times. Merged at 34 different actions 163 times. Widened at 8 different actions 16 times. Performed 1132 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1132 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 16 fixpoints after 8 different actions. Largest state had 220 variables. [2019-09-10 06:38:13,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:13,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:13,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:13,424 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:38:13,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:13,443 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:38:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:13,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 06:38:13,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:38:13,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:38:14,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:38:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:38:14,257 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:38:14,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [5] total 19 [2019-09-10 06:38:14,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:14,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:38:14,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:38:14,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:38:14,259 INFO L87 Difference]: Start difference. First operand 176393 states and 221975 transitions. Second operand 9 states. [2019-09-10 06:38:14,878 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:38:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:17,035 INFO L93 Difference]: Finished difference Result 280253 states and 352246 transitions. [2019-09-10 06:38:17,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:38:17,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 06:38:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:17,386 INFO L225 Difference]: With dead ends: 280253 [2019-09-10 06:38:17,387 INFO L226 Difference]: Without dead ends: 280253 [2019-09-10 06:38:17,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 178 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:38:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280253 states. [2019-09-10 06:38:22,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280253 to 199837. [2019-09-10 06:38:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199837 states. [2019-09-10 06:38:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199837 states to 199837 states and 251237 transitions. [2019-09-10 06:38:22,789 INFO L78 Accepts]: Start accepts. Automaton has 199837 states and 251237 transitions. Word has length 98 [2019-09-10 06:38:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:22,789 INFO L475 AbstractCegarLoop]: Abstraction has 199837 states and 251237 transitions. [2019-09-10 06:38:22,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:38:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 199837 states and 251237 transitions. [2019-09-10 06:38:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:38:22,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:22,798 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:22,799 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:22,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1616130308, now seen corresponding path program 1 times [2019-09-10 06:38:22,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:22,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:22,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:22,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:22,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:22,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:22,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:22,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:22,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:22,870 INFO L87 Difference]: Start difference. First operand 199837 states and 251237 transitions. Second operand 3 states. [2019-09-10 06:38:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:23,544 INFO L93 Difference]: Finished difference Result 199839 states and 246151 transitions. [2019-09-10 06:38:23,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:23,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:38:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:23,823 INFO L225 Difference]: With dead ends: 199839 [2019-09-10 06:38:23,824 INFO L226 Difference]: Without dead ends: 199839 [2019-09-10 06:38:23,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199839 states. [2019-09-10 06:38:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199839 to 196929. [2019-09-10 06:38:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196929 states. [2019-09-10 06:38:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196929 states to 196929 states and 242596 transitions. [2019-09-10 06:38:26,573 INFO L78 Accepts]: Start accepts. Automaton has 196929 states and 242596 transitions. Word has length 98 [2019-09-10 06:38:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:26,574 INFO L475 AbstractCegarLoop]: Abstraction has 196929 states and 242596 transitions. [2019-09-10 06:38:26,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 196929 states and 242596 transitions. [2019-09-10 06:38:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:38:26,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:26,581 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] [2019-09-10 06:38:26,581 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1217835554, now seen corresponding path program 1 times [2019-09-10 06:38:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:26,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:26,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:26,717 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:38:26,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:26,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:26,718 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 06:38:26,718 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [107], [110], [114], [127], [130], [143], [146], [149], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [333], [337], [350], [358], [377], [388], [390], [393], [396], [399], [401], [403], [445], [458], [466], [485], [508], [571], [701], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1464], [1492], [1495], [1498], [1502], [1773], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:38:26,725 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:26,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:26,763 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:27,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:27,013 INFO L272 AbstractInterpreter]: Visited 92 different actions 345 times. Merged at 34 different actions 226 times. Widened at 13 different actions 32 times. Performed 1332 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1332 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 10 different actions. Largest state had 220 variables. [2019-09-10 06:38:27,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:27,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:27,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:27,014 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:38:27,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:27,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:38:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:27,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 06:38:27,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:38:27,388 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:38:27,388 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:38:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:38:27,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:38:27,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 17 [2019-09-10 06:38:27,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:38:27,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:38:27,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:38:27,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:38:27,569 INFO L87 Difference]: Start difference. First operand 196929 states and 242596 transitions. Second operand 10 states. [2019-09-10 06:38:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:31,212 INFO L93 Difference]: Finished difference Result 340461 states and 414571 transitions. [2019-09-10 06:38:31,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:38:31,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-09-10 06:38:31,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:31,609 INFO L225 Difference]: With dead ends: 340461 [2019-09-10 06:38:31,609 INFO L226 Difference]: Without dead ends: 340461 [2019-09-10 06:38:31,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:38:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340461 states. [2019-09-10 06:38:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340461 to 266231. [2019-09-10 06:38:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266231 states. [2019-09-10 06:38:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266231 states to 266231 states and 326654 transitions. [2019-09-10 06:38:34,338 INFO L78 Accepts]: Start accepts. Automaton has 266231 states and 326654 transitions. Word has length 98 [2019-09-10 06:38:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:34,338 INFO L475 AbstractCegarLoop]: Abstraction has 266231 states and 326654 transitions. [2019-09-10 06:38:34,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:38:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 266231 states and 326654 transitions. [2019-09-10 06:38:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:38:34,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:34,347 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] [2019-09-10 06:38:34,347 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:34,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:34,347 INFO L82 PathProgramCache]: Analyzing trace with hash -735276600, now seen corresponding path program 1 times [2019-09-10 06:38:34,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:34,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:34,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:34,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:34,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:34,412 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:34,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:34,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:34,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:34,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:34,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:34,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:34,413 INFO L87 Difference]: Start difference. First operand 266231 states and 326654 transitions. Second operand 5 states. [2019-09-10 06:38:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:36,224 INFO L93 Difference]: Finished difference Result 280949 states and 341301 transitions. [2019-09-10 06:38:36,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:38:36,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 06:38:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:36,521 INFO L225 Difference]: With dead ends: 280949 [2019-09-10 06:38:36,521 INFO L226 Difference]: Without dead ends: 280949 [2019-09-10 06:38:36,522 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:38:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280949 states. [2019-09-10 06:38:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280949 to 258352. [2019-09-10 06:38:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258352 states. [2019-09-10 06:38:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258352 states to 258352 states and 314183 transitions. [2019-09-10 06:38:43,026 INFO L78 Accepts]: Start accepts. Automaton has 258352 states and 314183 transitions. Word has length 99 [2019-09-10 06:38:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:43,026 INFO L475 AbstractCegarLoop]: Abstraction has 258352 states and 314183 transitions. [2019-09-10 06:38:43,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 258352 states and 314183 transitions. [2019-09-10 06:38:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:38:43,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:43,036 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] [2019-09-10 06:38:43,036 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:43,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1414591540, now seen corresponding path program 1 times [2019-09-10 06:38:43,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:43,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:43,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:43,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:43,094 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,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:43,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:43,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:43,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:43,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:43,097 INFO L87 Difference]: Start difference. First operand 258352 states and 314183 transitions. Second operand 3 states. [2019-09-10 06:38:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:43,655 INFO L93 Difference]: Finished difference Result 274769 states and 332364 transitions. [2019-09-10 06:38:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:43,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:38:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:43,967 INFO L225 Difference]: With dead ends: 274769 [2019-09-10 06:38:43,967 INFO L226 Difference]: Without dead ends: 274769 [2019-09-10 06:38:43,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274769 states. [2019-09-10 06:38:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274769 to 232351. [2019-09-10 06:38:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232351 states. [2019-09-10 06:38:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232351 states to 232351 states and 281006 transitions. [2019-09-10 06:38:51,413 INFO L78 Accepts]: Start accepts. Automaton has 232351 states and 281006 transitions. Word has length 102 [2019-09-10 06:38:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:51,413 INFO L475 AbstractCegarLoop]: Abstraction has 232351 states and 281006 transitions. [2019-09-10 06:38:51,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 232351 states and 281006 transitions. [2019-09-10 06:38:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:38:51,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:51,423 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:51,424 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:51,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1500294752, now seen corresponding path program 1 times [2019-09-10 06:38:51,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:51,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:51,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:51,501 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:51,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:51,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:38:51,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:51,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:38:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:38:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:38:51,503 INFO L87 Difference]: Start difference. First operand 232351 states and 281006 transitions. Second operand 4 states. [2019-09-10 06:38:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:52,561 INFO L93 Difference]: Finished difference Result 407711 states and 492037 transitions. [2019-09-10 06:38:52,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:52,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-10 06:38:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:53,039 INFO L225 Difference]: With dead ends: 407711 [2019-09-10 06:38:53,039 INFO L226 Difference]: Without dead ends: 407711 [2019-09-10 06:38:53,039 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:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407711 states. [2019-09-10 06:39:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407711 to 244761. [2019-09-10 06:39:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244761 states. [2019-09-10 06:39:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244761 states to 244761 states and 295873 transitions. [2019-09-10 06:39:00,830 INFO L78 Accepts]: Start accepts. Automaton has 244761 states and 295873 transitions. Word has length 103 [2019-09-10 06:39:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:00,831 INFO L475 AbstractCegarLoop]: Abstraction has 244761 states and 295873 transitions. [2019-09-10 06:39:00,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:39:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 244761 states and 295873 transitions. [2019-09-10 06:39:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:39:00,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:00,840 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:39:00,841 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:00,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:00,841 INFO L82 PathProgramCache]: Analyzing trace with hash 586799771, now seen corresponding path program 1 times [2019-09-10 06:39:00,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:00,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:00,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:00,926 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:00,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:00,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:39:00,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:00,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:39:00,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:39:00,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:39:00,928 INFO L87 Difference]: Start difference. First operand 244761 states and 295873 transitions. Second operand 5 states. [2019-09-10 06:39:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:02,561 INFO L93 Difference]: Finished difference Result 240059 states and 290159 transitions. [2019-09-10 06:39:02,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:39:02,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 06:39:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:02,867 INFO L225 Difference]: With dead ends: 240059 [2019-09-10 06:39:02,867 INFO L226 Difference]: Without dead ends: 240059 [2019-09-10 06:39:02,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:39:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240059 states. [2019-09-10 06:39:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240059 to 238064. [2019-09-10 06:39:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238064 states. [2019-09-10 06:39:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238064 states to 238064 states and 287976 transitions. [2019-09-10 06:39:05,612 INFO L78 Accepts]: Start accepts. Automaton has 238064 states and 287976 transitions. Word has length 103 [2019-09-10 06:39:05,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:05,612 INFO L475 AbstractCegarLoop]: Abstraction has 238064 states and 287976 transitions. [2019-09-10 06:39:05,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:39:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 238064 states and 287976 transitions. [2019-09-10 06:39:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:39:05,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:05,621 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:39:05,621 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:05,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1373495166, now seen corresponding path program 1 times [2019-09-10 06:39:05,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:05,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:05,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:05,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:05,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:05,717 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:39:05,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:05,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:39:05,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:05,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:39:05,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:39:05,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:39:05,718 INFO L87 Difference]: Start difference. First operand 238064 states and 287976 transitions. Second operand 4 states. [2019-09-10 06:39:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:10,805 INFO L93 Difference]: Finished difference Result 405363 states and 490171 transitions. [2019-09-10 06:39:10,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:39:10,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-10 06:39:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:11,359 INFO L225 Difference]: With dead ends: 405363 [2019-09-10 06:39:11,359 INFO L226 Difference]: Without dead ends: 405363 [2019-09-10 06:39:11,359 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:39:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405363 states. [2019-09-10 06:39:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405363 to 237889. [2019-09-10 06:39:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237889 states. [2019-09-10 06:39:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237889 states to 237889 states and 287755 transitions. [2019-09-10 06:39:14,562 INFO L78 Accepts]: Start accepts. Automaton has 237889 states and 287755 transitions. Word has length 103 [2019-09-10 06:39:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:14,563 INFO L475 AbstractCegarLoop]: Abstraction has 237889 states and 287755 transitions. [2019-09-10 06:39:14,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:39:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 237889 states and 287755 transitions. [2019-09-10 06:39:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:39:14,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:14,569 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:39:14,569 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:14,569 INFO L82 PathProgramCache]: Analyzing trace with hash 347835709, now seen corresponding path program 1 times [2019-09-10 06:39:14,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:14,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:14,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:14,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:14,668 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:14,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:14,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:39:14,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:14,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:39:14,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:39:14,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:39:14,670 INFO L87 Difference]: Start difference. First operand 237889 states and 287755 transitions. Second operand 5 states. [2019-09-10 06:39:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:15,524 INFO L93 Difference]: Finished difference Result 263468 states and 315514 transitions. [2019-09-10 06:39:15,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:39:15,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 06:39:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:15,818 INFO L225 Difference]: With dead ends: 263468 [2019-09-10 06:39:15,818 INFO L226 Difference]: Without dead ends: 263468 [2019-09-10 06:39:15,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:39:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263468 states. [2019-09-10 06:39:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263468 to 237664. [2019-09-10 06:39:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237664 states. [2019-09-10 06:39:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237664 states to 237664 states and 287491 transitions. [2019-09-10 06:39:19,609 INFO L78 Accepts]: Start accepts. Automaton has 237664 states and 287491 transitions. Word has length 103 [2019-09-10 06:39:19,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:19,609 INFO L475 AbstractCegarLoop]: Abstraction has 237664 states and 287491 transitions. [2019-09-10 06:39:19,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:39:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 237664 states and 287491 transitions. [2019-09-10 06:39:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:39:19,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:19,614 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:39:19,615 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:19,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1026526093, now seen corresponding path program 1 times [2019-09-10 06:39:19,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:19,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:19,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:19,683 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:39:19,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:19,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:39:19,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:19,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:39:19,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:39:19,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:39:19,684 INFO L87 Difference]: Start difference. First operand 237664 states and 287491 transitions. Second operand 5 states. [2019-09-10 06:39:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:20,408 INFO L93 Difference]: Finished difference Result 363734 states and 439329 transitions. [2019-09-10 06:39:20,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:39:20,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 06:39:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:20,801 INFO L225 Difference]: With dead ends: 363734 [2019-09-10 06:39:20,801 INFO L226 Difference]: Without dead ends: 363734 [2019-09-10 06:39:20,802 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:39:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363734 states. [2019-09-10 06:39:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363734 to 298334. [2019-09-10 06:39:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298334 states. [2019-09-10 06:39:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298334 states to 298334 states and 360414 transitions. [2019-09-10 06:39:29,093 INFO L78 Accepts]: Start accepts. Automaton has 298334 states and 360414 transitions. Word has length 103 [2019-09-10 06:39:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:29,094 INFO L475 AbstractCegarLoop]: Abstraction has 298334 states and 360414 transitions. [2019-09-10 06:39:29,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:39:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 298334 states and 360414 transitions. [2019-09-10 06:39:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:39:29,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:29,100 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:29,100 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:29,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1622186963, now seen corresponding path program 1 times [2019-09-10 06:39:29,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:29,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:29,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:29,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:29,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:29,168 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:39:29,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:29,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:39:29,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:29,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:39:29,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:39:29,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:39:29,169 INFO L87 Difference]: Start difference. First operand 298334 states and 360414 transitions. Second operand 5 states. [2019-09-10 06:39:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:30,052 INFO L93 Difference]: Finished difference Result 397771 states and 480846 transitions. [2019-09-10 06:39:30,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:39:30,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 06:39:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:30,568 INFO L225 Difference]: With dead ends: 397771 [2019-09-10 06:39:30,569 INFO L226 Difference]: Without dead ends: 397771 [2019-09-10 06:39:30,569 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:39:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397771 states. [2019-09-10 06:39:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397771 to 348283. [2019-09-10 06:39:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348283 states. [2019-09-10 06:39:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348283 states to 348283 states and 420833 transitions. [2019-09-10 06:39:39,472 INFO L78 Accepts]: Start accepts. Automaton has 348283 states and 420833 transitions. Word has length 104 [2019-09-10 06:39:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:39,472 INFO L475 AbstractCegarLoop]: Abstraction has 348283 states and 420833 transitions. [2019-09-10 06:39:39,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:39:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 348283 states and 420833 transitions. [2019-09-10 06:39:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:39:39,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:39,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, 1, 1] [2019-09-10 06:39:39,479 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:39,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:39,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1589621780, now seen corresponding path program 1 times [2019-09-10 06:39:39,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:39,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:39,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:39,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:39,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:39,782 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:39:39,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:39,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:39,782 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 06:39:39,783 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [107], [110], [114], [117], [127], [130], [143], [146], [149], [152], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [458], [466], [469], [472], [475], [477], [489], [492], [495], [498], [502], [571], [699], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:39:39,787 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:39,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:39,823 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:39,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:39:39,964 INFO L272 AbstractInterpreter]: Visited 104 different actions 202 times. Merged at 38 different actions 87 times. Never widened. Performed 959 root evaluator evaluations with a maximum evaluation depth of 5. Performed 959 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 5 different actions. Largest state had 223 variables. [2019-09-10 06:39:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:39,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:39:39,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:39,964 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:39:39,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:39,988 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:39:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:40,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:39:40,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:39:40,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:40,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:40,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:40,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:40,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:40,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:40,651 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:39:40,652 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:40,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:40,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:40,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:40,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:40,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:40,904 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:39:40,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:39:40,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 28 [2019-09-10 06:39:40,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:39:40,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:39:40,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:39:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:39:40,920 INFO L87 Difference]: Start difference. First operand 348283 states and 420833 transitions. Second operand 23 states. [2019-09-10 06:39:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:45,288 INFO L93 Difference]: Finished difference Result 474779 states and 571411 transitions. [2019-09-10 06:39:45,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:39:45,289 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 109 [2019-09-10 06:39:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:45,850 INFO L225 Difference]: With dead ends: 474779 [2019-09-10 06:39:45,850 INFO L226 Difference]: Without dead ends: 474779 [2019-09-10 06:39:45,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=569, Invalid=1981, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:39:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474779 states. [2019-09-10 06:39:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474779 to 353367. [2019-09-10 06:39:56,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353367 states. [2019-09-10 06:39:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353367 states to 353367 states and 426567 transitions. [2019-09-10 06:39:57,155 INFO L78 Accepts]: Start accepts. Automaton has 353367 states and 426567 transitions. Word has length 109 [2019-09-10 06:39:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:57,155 INFO L475 AbstractCegarLoop]: Abstraction has 353367 states and 426567 transitions. [2019-09-10 06:39:57,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:39:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 353367 states and 426567 transitions. [2019-09-10 06:39:57,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:39:57,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:57,165 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:57,165 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:57,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:57,166 INFO L82 PathProgramCache]: Analyzing trace with hash 34609446, now seen corresponding path program 1 times [2019-09-10 06:39:57,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:57,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:57,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:57,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:57,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:57,231 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:39:57,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:57,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:39:57,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:57,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:39:57,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:39:57,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:39:57,234 INFO L87 Difference]: Start difference. First operand 353367 states and 426567 transitions. Second operand 4 states. [2019-09-10 06:39:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:58,389 INFO L93 Difference]: Finished difference Result 469445 states and 566807 transitions. [2019-09-10 06:39:58,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:39:58,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-10 06:39:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:04,510 INFO L225 Difference]: With dead ends: 469445 [2019-09-10 06:40:04,510 INFO L226 Difference]: Without dead ends: 469445 [2019-09-10 06:40:04,510 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:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469445 states. [2019-09-10 06:40:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469445 to 353366. [2019-09-10 06:40:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353366 states. [2019-09-10 06:40:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353366 states to 353366 states and 426565 transitions. [2019-09-10 06:40:08,719 INFO L78 Accepts]: Start accepts. Automaton has 353366 states and 426565 transitions. Word has length 109 [2019-09-10 06:40:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:08,720 INFO L475 AbstractCegarLoop]: Abstraction has 353366 states and 426565 transitions. [2019-09-10 06:40:08,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:40:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 353366 states and 426565 transitions. [2019-09-10 06:40:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:40:08,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:08,727 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:08,728 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash 671171361, now seen corresponding path program 1 times [2019-09-10 06:40:08,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:08,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:08,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:09,099 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:40:09,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:09,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:09,099 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 06:40:09,100 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [107], [110], [114], [127], [130], [133], [136], [171], [192], [195], [198], [201], [204], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [333], [337], [350], [358], [361], [364], [367], [369], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [513], [516], [519], [522], [532], [535], [538], [542], [562], [701], [721], [749], [752], [755], [759], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:40:09,103 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:09,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:09,161 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:09,752 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:09,752 INFO L272 AbstractInterpreter]: Visited 104 different actions 593 times. Merged at 41 different actions 450 times. Widened at 16 different actions 85 times. Performed 2035 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2035 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 11 different actions. Largest state had 223 variables. [2019-09-10 06:40:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:09,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:09,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:09,753 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) [2019-09-10 06:40:09,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:09,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:40:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:09,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:40:09,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:09,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:10,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:10,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:10,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:10,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:10,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:10,335 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:40:10,336 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:10,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:10,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:10,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:10,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:10,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:10,616 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:40:10,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:40:10,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 27 [2019-09-10 06:40:10,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:40:10,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:40:10,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:40:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:40:10,634 INFO L87 Difference]: Start difference. First operand 353366 states and 426565 transitions. Second operand 22 states. [2019-09-10 06:40:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:17,530 INFO L93 Difference]: Finished difference Result 550491 states and 661807 transitions. [2019-09-10 06:40:17,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:40:17,530 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2019-09-10 06:40:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:18,182 INFO L225 Difference]: With dead ends: 550491 [2019-09-10 06:40:18,182 INFO L226 Difference]: Without dead ends: 550491 [2019-09-10 06:40:18,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=336, Invalid=1470, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:40:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550491 states. [2019-09-10 06:40:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550491 to 353382. [2019-09-10 06:40:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353382 states. [2019-09-10 06:40:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353382 states to 353382 states and 426581 transitions. [2019-09-10 06:40:23,542 INFO L78 Accepts]: Start accepts. Automaton has 353382 states and 426581 transitions. Word has length 109 [2019-09-10 06:40:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:23,542 INFO L475 AbstractCegarLoop]: Abstraction has 353382 states and 426581 transitions. [2019-09-10 06:40:23,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:40:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 353382 states and 426581 transitions. [2019-09-10 06:40:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:40:23,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:23,551 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:23,551 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:23,551 INFO L82 PathProgramCache]: Analyzing trace with hash 986654236, now seen corresponding path program 1 times [2019-09-10 06:40:23,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:23,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:23,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:23,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:23,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:23,604 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:23,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:23,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:40:23,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:23,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:40:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:40:23,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:40:23,606 INFO L87 Difference]: Start difference. First operand 353382 states and 426581 transitions. Second operand 3 states. [2019-09-10 06:40:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:23,891 INFO L93 Difference]: Finished difference Result 142393 states and 167078 transitions. [2019-09-10 06:40:23,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:40:23,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 06:40:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:24,040 INFO L225 Difference]: With dead ends: 142393 [2019-09-10 06:40:24,040 INFO L226 Difference]: Without dead ends: 142393 [2019-09-10 06:40:24,040 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:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142393 states. [2019-09-10 06:40:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142393 to 138934. [2019-09-10 06:40:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138934 states. [2019-09-10 06:40:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138934 states to 138934 states and 163354 transitions. [2019-09-10 06:40:26,255 INFO L78 Accepts]: Start accepts. Automaton has 138934 states and 163354 transitions. Word has length 109 [2019-09-10 06:40:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:26,256 INFO L475 AbstractCegarLoop]: Abstraction has 138934 states and 163354 transitions. [2019-09-10 06:40:26,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:40:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 138934 states and 163354 transitions. [2019-09-10 06:40:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:40:26,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:26,261 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:26,261 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1188778943, now seen corresponding path program 1 times [2019-09-10 06:40:26,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:26,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:26,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:26,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:26,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:27,989 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2019-09-10 06:40:28,852 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:40:28,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:28,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:28,853 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:40:28,853 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [107], [110], [114], [117], [127], [130], [143], [146], [149], [152], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [458], [466], [469], [472], [475], [477], [489], [492], [495], [498], [502], [571], [699], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:40:28,858 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:28,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:28,890 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:29,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:29,196 INFO L272 AbstractInterpreter]: Visited 105 different actions 415 times. Merged at 41 different actions 285 times. Widened at 12 different actions 35 times. Performed 1509 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1509 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 12 different actions. Largest state had 223 variables. [2019-09-10 06:40:29,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:29,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:29,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:29,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:40:29,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:29,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:40:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:29,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:40:29,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:29,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:30,049 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:30,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:30,719 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:30,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:40:30,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 13] total 42 [2019-09-10 06:40:30,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:40:30,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 06:40:30,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 06:40:30,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1546, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:40:30,734 INFO L87 Difference]: Start difference. First operand 138934 states and 163354 transitions. Second operand 31 states. [2019-09-10 06:40:31,980 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 06:40:32,267 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 06:40:32,537 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 06:40:33,441 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 06:40:34,218 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 06:40:34,811 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:40:35,085 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:40:35,229 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:40:35,490 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:40:36,235 WARN L188 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-09-10 06:40:37,582 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 06:40:37,965 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 06:40:38,152 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 06:40:38,367 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 06:40:38,577 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 06:40:38,878 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:40:39,200 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 06:40:39,405 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:40:39,930 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 06:40:40,146 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 06:40:40,628 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:40:40,944 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:40:41,670 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:40:41,951 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:40:42,504 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-09-10 06:40:43,066 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:40:43,285 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 06:40:43,890 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:40:44,038 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:40:44,257 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 06:40:44,877 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 06:40:45,042 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 06:40:45,275 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 06:40:45,504 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 06:40:45,737 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:40:45,985 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:40:46,272 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-10 06:40:46,511 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 06:40:46,772 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 06:40:47,095 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:40:47,256 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:40:47,499 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 06:40:47,720 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 06:40:48,008 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 06:40:48,191 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 06:40:48,437 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:40:48,617 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-10 06:40:48,838 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:40:49,072 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 06:40:49,285 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 06:40:49,531 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 06:40:50,063 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:40:50,233 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:40:50,388 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:40:50,572 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:40:51,042 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:40:51,262 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-10 06:40:51,525 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-09-10 06:40:51,679 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:40:52,069 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:40:52,293 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 06:40:52,485 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 06:40:52,691 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 06:40:52,914 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 06:40:53,151 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-10 06:40:53,400 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:40:53,660 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 06:40:54,096 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:40:54,490 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:40:54,656 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:40:54,833 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:40:55,017 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 06:40:55,350 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:40:55,897 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 06:40:56,235 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:40:56,465 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 06:40:56,839 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 06:40:57,003 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:40:57,245 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 06:40:58,131 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:40:58,534 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:40:58,731 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:40:59,242 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:40:59,443 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 06:40:59,759 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 06:41:00,431 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:41:00,581 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:41:01,009 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 06:41:01,193 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:41:01,617 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:41:01,776 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:41:02,315 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:41:02,522 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:41:02,680 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:41:03,039 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 06:41:03,637 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:41:03,864 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:41:04,364 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 06:41:04,568 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:41:05,108 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 06:41:05,783 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 06:41:06,085 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 06:41:06,515 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 06:41:06,707 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:41:06,975 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-09-10 06:41:08,165 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 06:41:08,350 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 06:41:08,532 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:41:08,892 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:41:09,064 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 06:41:09,294 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 06:41:09,635 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:41:09,797 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:41:10,072 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-09-10 06:41:10,424 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:41:10,597 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:41:10,775 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:41:11,199 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 06:41:11,375 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 06:41:11,626 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 06:41:11,929 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 06:41:12,420 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 06:41:12,669 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 06:41:12,886 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 06:41:13,547 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:41:13,779 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:41:14,032 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:41:14,354 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 06:41:14,596 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:41:14,999 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:41:15,209 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 06:41:15,414 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 06:41:15,733 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-09-10 06:41:16,150 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:41:16,550 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 06:41:16,947 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 06:41:17,167 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:41:17,449 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 06:41:18,046 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:41:18,522 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 06:41:18,990 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 06:41:19,184 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:41:19,322 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:41:19,470 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:41:19,923 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 06:41:20,128 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:41:20,547 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:41:20,807 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 06:41:21,110 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 06:41:21,371 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 06:41:21,552 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:41:21,874 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 06:41:22,648 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:41:23,280 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:41:23,452 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:41:23,645 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 06:41:23,819 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:41:24,437 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 06:41:24,841 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:41:25,071 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 06:41:25,428 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:41:25,592 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:41:26,355 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:41:26,556 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 06:41:26,778 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 06:41:27,225 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:41:27,538 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:41:27,897 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 06:41:28,123 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 06:41:28,437 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 06:41:28,670 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:41:29,367 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 06:41:29,786 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:41:30,078 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:41:30,547 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:41:30,912 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 06:41:31,183 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:41:31,774 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 06:41:32,492 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 06:41:32,938 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 06:41:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:34,243 INFO L93 Difference]: Finished difference Result 486038 states and 570574 transitions. [2019-09-10 06:41:34,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 324 states. [2019-09-10 06:41:34,244 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 110 [2019-09-10 06:41:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:34,746 INFO L225 Difference]: With dead ends: 486038 [2019-09-10 06:41:34,746 INFO L226 Difference]: Without dead ends: 486038 [2019-09-10 06:41:34,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51039 ImplicationChecksByTransitivity, 53.7s TimeCoverageRelationStatistics Valid=16220, Invalid=110160, Unknown=0, NotChecked=0, Total=126380 [2019-09-10 06:41:35,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486038 states. [2019-09-10 06:41:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486038 to 131841. [2019-09-10 06:41:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131841 states. [2019-09-10 06:41:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131841 states to 131841 states and 154926 transitions. [2019-09-10 06:41:37,950 INFO L78 Accepts]: Start accepts. Automaton has 131841 states and 154926 transitions. Word has length 110 [2019-09-10 06:41:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:37,950 INFO L475 AbstractCegarLoop]: Abstraction has 131841 states and 154926 transitions. [2019-09-10 06:41:37,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 06:41:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 131841 states and 154926 transitions. [2019-09-10 06:41:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:41:37,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:37,955 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:41:37,956 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1746417373, now seen corresponding path program 1 times [2019-09-10 06:41:37,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:37,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:37,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:37,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:37,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:38,235 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:38,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:38,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:38,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:41:38,236 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [107], [110], [114], [117], [120], [123], [125], [127], [130], [133], [143], [146], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [414], [417], [420], [422], [445], [448], [451], [454], [456], [458], [510], [569], [848], [946], [950], [953], [956], [959], [962], [965], [969], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:41:38,238 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:38,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:38,270 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:38,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:38,548 INFO L272 AbstractInterpreter]: Visited 105 different actions 385 times. Merged at 41 different actions 255 times. Widened at 12 different actions 28 times. Performed 1369 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1369 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 18 fixpoints after 9 different actions. Largest state had 223 variables. [2019-09-10 06:41:38,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:38,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:38,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:38,549 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:41:38,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:38,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:41:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:38,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 06:41:38,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:38,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:38,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:38,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,031 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:41:39,032 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:39,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:39,332 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:41:39,338 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:41:39,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [11] total 27 [2019-09-10 06:41:39,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:39,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:41:39,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:41:39,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:41:39,339 INFO L87 Difference]: Start difference. First operand 131841 states and 154926 transitions. Second operand 10 states. [2019-09-10 06:41:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:41,151 INFO L93 Difference]: Finished difference Result 140766 states and 164910 transitions. [2019-09-10 06:41:41,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:41:41,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2019-09-10 06:41:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:41,289 INFO L225 Difference]: With dead ends: 140766 [2019-09-10 06:41:41,289 INFO L226 Difference]: Without dead ends: 140766 [2019-09-10 06:41:41,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:41:41,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140766 states. [2019-09-10 06:41:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140766 to 138643. [2019-09-10 06:41:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138643 states. [2019-09-10 06:41:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138643 states to 138643 states and 162599 transitions. [2019-09-10 06:41:43,396 INFO L78 Accepts]: Start accepts. Automaton has 138643 states and 162599 transitions. Word has length 110 [2019-09-10 06:41:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:43,396 INFO L475 AbstractCegarLoop]: Abstraction has 138643 states and 162599 transitions. [2019-09-10 06:41:43,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:41:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 138643 states and 162599 transitions. [2019-09-10 06:41:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:41:43,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:43,402 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:41:43,402 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:43,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2053245386, now seen corresponding path program 1 times [2019-09-10 06:41:43,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:43,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:43,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:43,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:43,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:43,835 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,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:43,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:43,836 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:41:43,836 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [107], [110], [114], [127], [130], [133], [136], [171], [192], [195], [198], [201], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [333], [337], [350], [358], [361], [364], [367], [369], [379], [384], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [513], [516], [519], [522], [532], [535], [538], [542], [562], [701], [721], [749], [752], [755], [759], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:41:43,838 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:43,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:43,865 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:44,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:44,043 INFO L272 AbstractInterpreter]: Visited 105 different actions 241 times. Merged at 42 different actions 123 times. Never widened. Performed 1072 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1072 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 8 different actions. Largest state had 223 variables. [2019-09-10 06:41:44,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:44,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:44,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:44,044 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) [2019-09-10 06:41:44,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:44,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:41:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:44,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:41:44,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:44,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:44,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:44,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:44,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:45,413 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,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:45,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:41:45,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:41:45,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:41:45,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:41:45,614 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,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:41:45,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 28 [2019-09-10 06:41:45,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:41:45,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:41:45,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:41:45,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:41:45,619 INFO L87 Difference]: Start difference. First operand 138643 states and 162599 transitions. Second operand 25 states. [2019-09-10 06:41:49,592 WARN L188 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 9 [2019-09-10 06:41:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:50,630 INFO L93 Difference]: Finished difference Result 215387 states and 252272 transitions. [2019-09-10 06:41:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 06:41:50,630 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2019-09-10 06:41:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:50,852 INFO L225 Difference]: With dead ends: 215387 [2019-09-10 06:41:50,852 INFO L226 Difference]: Without dead ends: 215387 [2019-09-10 06:41:50,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 191 SyntacticMatches, 19 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=502, Invalid=2578, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 06:41:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215387 states. [2019-09-10 06:41:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215387 to 138596. [2019-09-10 06:41:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138596 states. [2019-09-10 06:41:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138596 states to 138596 states and 162537 transitions. [2019-09-10 06:41:52,932 INFO L78 Accepts]: Start accepts. Automaton has 138596 states and 162537 transitions. Word has length 110 [2019-09-10 06:41:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:52,932 INFO L475 AbstractCegarLoop]: Abstraction has 138596 states and 162537 transitions. [2019-09-10 06:41:52,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:41:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 138596 states and 162537 transitions. [2019-09-10 06:41:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:41:52,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:52,937 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:41:52,937 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:52,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1654915896, now seen corresponding path program 1 times [2019-09-10 06:41:52,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:52,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:52,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:53,397 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:41:53,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:53,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:41:53,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:53,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:41:53,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:41:53,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:41:53,398 INFO L87 Difference]: Start difference. First operand 138596 states and 162537 transitions. Second operand 12 states. [2019-09-10 06:41:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:55,290 INFO L93 Difference]: Finished difference Result 196194 states and 230469 transitions. [2019-09-10 06:41:55,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:41:55,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2019-09-10 06:41:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:55,475 INFO L225 Difference]: With dead ends: 196194 [2019-09-10 06:41:55,475 INFO L226 Difference]: Without dead ends: 196194 [2019-09-10 06:41:55,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:41:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196194 states. [2019-09-10 06:41:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196194 to 135874. [2019-09-10 06:41:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135874 states. [2019-09-10 06:41:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135874 states to 135874 states and 159434 transitions. [2019-09-10 06:41:57,128 INFO L78 Accepts]: Start accepts. Automaton has 135874 states and 159434 transitions. Word has length 110 [2019-09-10 06:41:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:57,128 INFO L475 AbstractCegarLoop]: Abstraction has 135874 states and 159434 transitions. [2019-09-10 06:41:57,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:41:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 135874 states and 159434 transitions. [2019-09-10 06:41:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:41:57,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:57,132 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:41:57,133 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:57,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1909148399, now seen corresponding path program 1 times [2019-09-10 06:41:57,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:57,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:57,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:57,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:57,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:57,183 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:41:57,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:57,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:41:57,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:57,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:41:57,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:41:57,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:41:57,184 INFO L87 Difference]: Start difference. First operand 135874 states and 159434 transitions. Second operand 4 states. [2019-09-10 06:41:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:57,718 INFO L93 Difference]: Finished difference Result 194328 states and 227502 transitions. [2019-09-10 06:41:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:41:57,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-10 06:41:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:57,894 INFO L225 Difference]: With dead ends: 194328 [2019-09-10 06:41:57,895 INFO L226 Difference]: Without dead ends: 194328 [2019-09-10 06:41:57,895 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:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194328 states. [2019-09-10 06:41:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194328 to 134671. [2019-09-10 06:41:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134671 states. [2019-09-10 06:41:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134671 states to 134671 states and 157977 transitions. [2019-09-10 06:41:59,720 INFO L78 Accepts]: Start accepts. Automaton has 134671 states and 157977 transitions. Word has length 110 [2019-09-10 06:41:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:59,720 INFO L475 AbstractCegarLoop]: Abstraction has 134671 states and 157977 transitions. [2019-09-10 06:41:59,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:41:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 134671 states and 157977 transitions. [2019-09-10 06:41:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:41:59,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:59,725 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:41:59,725 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1363645364, now seen corresponding path program 1 times [2019-09-10 06:41:59,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:59,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:59,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:59,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:59,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:00,023 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:00,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:00,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:00,024 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:42:00,024 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [107], [110], [114], [127], [130], [133], [136], [139], [141], [143], [146], [149], [159], [162], [165], [169], [171], [192], [195], [198], [201], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [335], [337], [350], [358], [361], [364], [367], [369], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [508], [701], [721], [749], [752], [755], [759], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:42:00,026 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:00,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:00,065 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:00,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:00,478 INFO L272 AbstractInterpreter]: Visited 105 different actions 399 times. Merged at 41 different actions 268 times. Widened at 13 different actions 42 times. Performed 1500 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1500 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 11 different actions. Largest state had 223 variables. [2019-09-10 06:42:00,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:00,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:00,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:00,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:42:00,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:00,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:00,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:42:00,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:00,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:00,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:00,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:01,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:02,239 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:02,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:02,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:02,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:02,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:02,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:02,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:02,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:02,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:02,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:02,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:02,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:02,659 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:02,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:02,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2019-09-10 06:42:02,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:02,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:42:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:42:02,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:42:02,674 INFO L87 Difference]: Start difference. First operand 134671 states and 157977 transitions. Second operand 24 states. [2019-09-10 06:42:04,957 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 06:42:05,125 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 06:42:05,616 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:42:06,295 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 06:42:07,034 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 06:42:07,470 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:42:07,675 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 06:42:08,337 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 06:42:09,635 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2019-09-10 06:42:10,175 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 06:42:10,464 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:42:10,657 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 06:42:11,697 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:42:11,848 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 06:42:12,177 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:42:12,549 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 06:42:12,908 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:42:14,518 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 06:42:16,726 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 06:42:17,223 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:42:17,742 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-09-10 06:42:17,900 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:42:18,083 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:42:18,482 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-09-10 06:42:18,755 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:42:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:21,994 INFO L93 Difference]: Finished difference Result 352978 states and 411087 transitions. [2019-09-10 06:42:21,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-10 06:42:21,995 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 110 [2019-09-10 06:42:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:22,441 INFO L225 Difference]: With dead ends: 352978 [2019-09-10 06:42:22,442 INFO L226 Difference]: Without dead ends: 352978 [2019-09-10 06:42:22,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7897 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=4198, Invalid=20608, Unknown=0, NotChecked=0, Total=24806 [2019-09-10 06:42:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352978 states. [2019-09-10 06:42:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352978 to 146240. [2019-09-10 06:42:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146240 states. [2019-09-10 06:42:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146240 states to 146240 states and 171345 transitions. [2019-09-10 06:42:25,747 INFO L78 Accepts]: Start accepts. Automaton has 146240 states and 171345 transitions. Word has length 110 [2019-09-10 06:42:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:25,747 INFO L475 AbstractCegarLoop]: Abstraction has 146240 states and 171345 transitions. [2019-09-10 06:42:25,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:42:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 146240 states and 171345 transitions. [2019-09-10 06:42:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:42:25,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:25,751 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] [2019-09-10 06:42:25,751 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:25,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1615917979, now seen corresponding path program 1 times [2019-09-10 06:42:25,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:25,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:25,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:25,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:25,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:26,054 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:26,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:26,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:26,055 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 06:42:26,055 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [107], [110], [114], [117], [120], [125], [127], [130], [133], [143], [146], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [414], [417], [420], [422], [445], [448], [451], [454], [456], [458], [510], [569], [574], [697], [848], [946], [950], [953], [956], [959], [962], [965], [969], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:42:26,057 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:26,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:26,086 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:26,313 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:26,313 INFO L272 AbstractInterpreter]: Visited 106 different actions 404 times. Merged at 41 different actions 271 times. Widened at 13 different actions 37 times. Performed 1475 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1475 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 9 different actions. Largest state had 223 variables. [2019-09-10 06:42:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:26,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:26,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:26,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:42:26,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:26,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:26,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:42:26,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:26,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:26,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:27,153 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:27,153 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:27,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:27,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:27,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:27,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:27,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:42:27,577 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:42:27,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [13] total 30 [2019-09-10 06:42:27,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:27,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:42:27,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:42:27,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:42:27,579 INFO L87 Difference]: Start difference. First operand 146240 states and 171345 transitions. Second operand 11 states. [2019-09-10 06:42:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:28,746 INFO L93 Difference]: Finished difference Result 138722 states and 161969 transitions. [2019-09-10 06:42:28,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:42:28,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2019-09-10 06:42:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:28,877 INFO L225 Difference]: With dead ends: 138722 [2019-09-10 06:42:28,877 INFO L226 Difference]: Without dead ends: 138722 [2019-09-10 06:42:28,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:42:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138722 states. [2019-09-10 06:42:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138722 to 130792. [2019-09-10 06:42:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130792 states. [2019-09-10 06:42:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130792 states to 130792 states and 153244 transitions. [2019-09-10 06:42:30,313 INFO L78 Accepts]: Start accepts. Automaton has 130792 states and 153244 transitions. Word has length 111 [2019-09-10 06:42:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:30,313 INFO L475 AbstractCegarLoop]: Abstraction has 130792 states and 153244 transitions. [2019-09-10 06:42:30,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:42:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 130792 states and 153244 transitions. [2019-09-10 06:42:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:42:30,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:30,317 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:30,317 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1659135805, now seen corresponding path program 1 times [2019-09-10 06:42:30,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:30,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:30,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:30,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:30,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:30,733 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:30,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:30,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:30,734 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:42:30,735 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [107], [110], [114], [127], [130], [133], [136], [141], [143], [146], [149], [159], [162], [165], [169], [171], [192], [195], [198], [201], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [333], [337], [350], [358], [361], [364], [367], [369], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [508], [513], [567], [701], [721], [749], [752], [755], [759], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:42:30,737 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:30,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:30,784 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:31,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:31,025 INFO L272 AbstractInterpreter]: Visited 107 different actions 234 times. Merged at 42 different actions 116 times. Never widened. Performed 1042 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1042 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 7 different actions. Largest state had 223 variables. [2019-09-10 06:42:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:31,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:31,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:31,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:42:31,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:31,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:31,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:42:31,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:31,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:31,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:31,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:31,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:33,236 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:33,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:33,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:33,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:33,429 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:33,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:33,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 27 [2019-09-10 06:42:33,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:33,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:42:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:42:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:42:33,435 INFO L87 Difference]: Start difference. First operand 130792 states and 153244 transitions. Second operand 24 states. [2019-09-10 06:42:36,029 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-10 06:42:36,227 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 06:42:36,554 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:42:36,737 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 06:42:36,960 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 06:42:37,279 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 06:42:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:39,429 INFO L93 Difference]: Finished difference Result 176975 states and 207181 transitions. [2019-09-10 06:42:39,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:42:39,430 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 112 [2019-09-10 06:42:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:39,616 INFO L225 Difference]: With dead ends: 176975 [2019-09-10 06:42:39,616 INFO L226 Difference]: Without dead ends: 176975 [2019-09-10 06:42:39,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 195 SyntacticMatches, 19 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=322, Invalid=1840, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:42:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176975 states. [2019-09-10 06:42:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176975 to 130725. [2019-09-10 06:42:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130725 states. [2019-09-10 06:42:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130725 states to 130725 states and 153166 transitions. [2019-09-10 06:42:41,282 INFO L78 Accepts]: Start accepts. Automaton has 130725 states and 153166 transitions. Word has length 112 [2019-09-10 06:42:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:41,282 INFO L475 AbstractCegarLoop]: Abstraction has 130725 states and 153166 transitions. [2019-09-10 06:42:41,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:42:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 130725 states and 153166 transitions. [2019-09-10 06:42:41,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:42:41,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:41,286 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:42:41,286 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:41,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:41,287 INFO L82 PathProgramCache]: Analyzing trace with hash 521826919, now seen corresponding path program 1 times [2019-09-10 06:42:41,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:41,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:41,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:41,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:41,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:41,577 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:41,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:41,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:41,577 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:42:41,578 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [123], [125], [127], [130], [133], [136], [139], [141], [143], [146], [149], [152], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [257], [259], [273], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [489], [492], [495], [498], [502], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:42:41,582 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:41,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:41,605 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:41,677 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:41,678 INFO L272 AbstractInterpreter]: Visited 110 different actions 194 times. Merged at 39 different actions 75 times. Never widened. Performed 929 root evaluator evaluations with a maximum evaluation depth of 5. Performed 929 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 4 different actions. Largest state had 224 variables. [2019-09-10 06:42:41,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:41,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:41,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:41,678 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:42:41,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:41,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:41,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-10 06:42:41,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:42,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:42,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:42,830 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:42,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:43,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:44,222 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:44,227 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:42:44,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17, 22] imperfect sequences [16] total 51 [2019-09-10 06:42:44,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:44,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:42:44,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:42:44,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2303, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:42:44,228 INFO L87 Difference]: Start difference. First operand 130725 states and 153166 transitions. Second operand 17 states. [2019-09-10 06:42:47,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:47,033 INFO L93 Difference]: Finished difference Result 134857 states and 157809 transitions. [2019-09-10 06:42:47,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:42:47,034 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 115 [2019-09-10 06:42:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:47,153 INFO L225 Difference]: With dead ends: 134857 [2019-09-10 06:42:47,153 INFO L226 Difference]: Without dead ends: 134857 [2019-09-10 06:42:47,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 193 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=395, Invalid=2911, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 06:42:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134857 states. [2019-09-10 06:42:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134857 to 130638. [2019-09-10 06:42:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130638 states. [2019-09-10 06:42:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130638 states to 130638 states and 153065 transitions. [2019-09-10 06:42:48,084 INFO L78 Accepts]: Start accepts. Automaton has 130638 states and 153065 transitions. Word has length 115 [2019-09-10 06:42:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:48,085 INFO L475 AbstractCegarLoop]: Abstraction has 130638 states and 153065 transitions. [2019-09-10 06:42:48,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:42:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 130638 states and 153065 transitions. [2019-09-10 06:42:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:42:48,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:48,089 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:48,089 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:48,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash 326126771, now seen corresponding path program 1 times [2019-09-10 06:42:48,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:48,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:48,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:48,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:48,607 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:48,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:48,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:48,608 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 06:42:48,608 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [125], [127], [130], [133], [136], [139], [141], [143], [146], [149], [152], [155], [157], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [574], [697], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:42:48,610 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:48,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:48,640 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:49,350 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:49,350 INFO L272 AbstractInterpreter]: Visited 111 different actions 409 times. Merged at 40 different actions 271 times. Widened at 14 different actions 28 times. Performed 1453 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1453 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 13 different actions. Largest state had 224 variables. [2019-09-10 06:42:49,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:49,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:49,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:49,351 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:42:49,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:49,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:49,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 06:42:49,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:49,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:51,295 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:51,296 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:51,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:51,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:51,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:51,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:59,784 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:59,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:59,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 12] total 34 [2019-09-10 06:42:59,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:59,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:42:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:42:59,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:42:59,793 INFO L87 Difference]: Start difference. First operand 130638 states and 153065 transitions. Second operand 28 states. [2019-09-10 06:43:00,444 WARN L188 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-10 06:43:01,001 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 06:43:01,609 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 06:43:02,177 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:43:02,496 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:43:02,689 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 06:43:03,116 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 06:43:03,992 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:43:04,458 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 06:43:05,269 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 06:43:05,634 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 06:43:06,194 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 06:43:06,708 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 06:43:07,027 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 06:43:07,680 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:43:08,024 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 06:43:08,475 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 06:43:09,098 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 06:43:09,427 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 06:43:09,606 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 06:43:09,783 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 06:43:10,083 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 06:43:10,294 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:43:10,616 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 06:43:10,878 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 06:43:11,430 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 06:43:11,660 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 06:43:12,048 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-09-10 06:43:12,176 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 06:43:12,785 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 06:43:13,269 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 06:43:13,440 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 06:43:14,131 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:43:15,504 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 06:43:15,933 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 06:43:16,483 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 06:43:17,092 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 06:43:17,550 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 06:43:18,285 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 06:43:18,613 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 06:43:20,416 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-10 06:43:20,920 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 06:43:21,287 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-10 06:43:21,603 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 06:43:22,690 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-09-10 06:43:23,349 WARN L188 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-09-10 06:43:23,691 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 06:43:24,443 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:43:24,941 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 06:43:25,690 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-10 06:43:28,167 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 06:43:28,427 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:43:28,894 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 06:43:29,511 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 06:43:29,995 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 06:43:30,420 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-09-10 06:43:30,863 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 06:43:31,276 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 06:43:31,927 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 06:43:32,505 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 06:43:33,702 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 06:43:34,165 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 06:43:34,598 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-10 06:43:34,871 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 06:43:35,285 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 06:43:35,912 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 06:43:36,536 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 06:43:37,216 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 06:43:38,031 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 06:43:38,893 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-10 06:43:40,312 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 06:43:41,008 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 06:43:42,048 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 06:43:42,532 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 06:43:42,864 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-09-10 06:43:43,409 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 06:43:43,814 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 06:43:44,086 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 06:43:44,511 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 06:43:44,832 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 06:43:45,978 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 06:43:47,146 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 06:43:47,445 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 06:43:47,931 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 06:43:48,631 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 06:43:49,616 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:43:49,858 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 06:43:50,088 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:43:50,602 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:43:52,283 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 06:43:52,566 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:43:54,153 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 06:43:54,476 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 06:43:55,321 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 06:43:56,061 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 06:43:56,501 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 06:43:59,139 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:44:01,137 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:44:01,863 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 06:44:02,067 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 06:44:02,571 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 06:44:02,798 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-10 06:44:02,967 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 06:44:03,483 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 06:44:03,887 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 06:44:04,087 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 06:44:04,701 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 06:44:04,895 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 06:44:05,295 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:44:05,645 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 06:44:05,827 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 06:44:06,111 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 06:44:06,422 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:44:06,712 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 06:44:06,962 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 06:44:07,174 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:44:07,365 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:44:07,724 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 06:44:07,956 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 06:44:08,180 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:44:09,361 WARN L188 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 06:44:09,780 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 06:44:10,257 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 06:44:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:12,339 INFO L93 Difference]: Finished difference Result 429505 states and 502704 transitions. [2019-09-10 06:44:12,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2019-09-10 06:44:12,339 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 116 [2019-09-10 06:44:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:12,823 INFO L225 Difference]: With dead ends: 429505 [2019-09-10 06:44:12,823 INFO L226 Difference]: Without dead ends: 429505 [2019-09-10 06:44:12,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 164 SyntacticMatches, 53 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36880 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=12166, Invalid=75154, Unknown=0, NotChecked=0, Total=87320 [2019-09-10 06:44:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429505 states. [2019-09-10 06:44:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429505 to 130662. [2019-09-10 06:44:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130662 states. [2019-09-10 06:44:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130662 states to 130662 states and 153083 transitions. [2019-09-10 06:44:15,554 INFO L78 Accepts]: Start accepts. Automaton has 130662 states and 153083 transitions. Word has length 116 [2019-09-10 06:44:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:15,554 INFO L475 AbstractCegarLoop]: Abstraction has 130662 states and 153083 transitions. [2019-09-10 06:44:15,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:44:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 130662 states and 153083 transitions. [2019-09-10 06:44:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:44:15,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:15,558 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:15,558 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:15,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:15,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1190214476, now seen corresponding path program 1 times [2019-09-10 06:44:15,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:15,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:15,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:15,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:15,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:15,845 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:15,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:15,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:44:15,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:15,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:44:15,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:44:15,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:44:15,848 INFO L87 Difference]: Start difference. First operand 130662 states and 153083 transitions. Second operand 12 states. [2019-09-10 06:44:16,901 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-10 06:44:17,036 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 06:44:17,185 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 06:44:17,501 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 06:44:17,857 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-09-10 06:44:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:18,666 INFO L93 Difference]: Finished difference Result 179346 states and 210173 transitions. [2019-09-10 06:44:18,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:44:18,667 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 116 [2019-09-10 06:44:18,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:18,833 INFO L225 Difference]: With dead ends: 179346 [2019-09-10 06:44:18,833 INFO L226 Difference]: Without dead ends: 179346 [2019-09-10 06:44:18,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:44:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179346 states. [2019-09-10 06:44:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179346 to 144401. [2019-09-10 06:44:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144401 states. [2019-09-10 06:44:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144401 states to 144401 states and 169019 transitions. [2019-09-10 06:44:20,423 INFO L78 Accepts]: Start accepts. Automaton has 144401 states and 169019 transitions. Word has length 116 [2019-09-10 06:44:20,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:20,423 INFO L475 AbstractCegarLoop]: Abstraction has 144401 states and 169019 transitions. [2019-09-10 06:44:20,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:44:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 144401 states and 169019 transitions. [2019-09-10 06:44:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:44:20,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:20,428 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:20,429 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:20,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:20,429 INFO L82 PathProgramCache]: Analyzing trace with hash 214099653, now seen corresponding path program 1 times [2019-09-10 06:44:20,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:20,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:20,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:20,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:20,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:21,019 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:44:21,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:21,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:44:21,020 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2019-09-10 06:44:21,020 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [123], [125], [127], [130], [133], [136], [141], [143], [146], [149], [152], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [257], [259], [273], [324], [326], [331], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [489], [492], [495], [498], [502], [513], [567], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:44:21,023 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:44:21,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:44:21,043 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:44:21,166 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:44:21,166 INFO L272 AbstractInterpreter]: Visited 112 different actions 241 times. Merged at 42 different actions 117 times. Never widened. Performed 1014 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1014 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 7 different actions. Largest state had 224 variables. [2019-09-10 06:44:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:21,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:44:21,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:21,167 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:44:21,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:21,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:44:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:21,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 06:44:21,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:44:21,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:21,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:21,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:21,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:22,629 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-09-10 06:44:22,722 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:44:22,723 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:44:22,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:23,043 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:44:23,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:44:23,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 12] total 33 [2019-09-10 06:44:23,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:44:23,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:44:23,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:44:23,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:44:23,055 INFO L87 Difference]: Start difference. First operand 144401 states and 169019 transitions. Second operand 26 states. [2019-09-10 06:44:24,905 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 27 [2019-09-10 06:44:25,345 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 27 [2019-09-10 06:44:26,073 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 28 [2019-09-10 06:44:26,256 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 31 [2019-09-10 06:44:27,106 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 31 [2019-09-10 06:44:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:29,224 INFO L93 Difference]: Finished difference Result 187296 states and 218093 transitions. [2019-09-10 06:44:29,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 06:44:29,224 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2019-09-10 06:44:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:29,544 INFO L225 Difference]: With dead ends: 187296 [2019-09-10 06:44:29,544 INFO L226 Difference]: Without dead ends: 186900 [2019-09-10 06:44:29,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 208 SyntacticMatches, 11 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=850, Invalid=3842, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 06:44:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186900 states. [2019-09-10 06:44:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186900 to 135352. [2019-09-10 06:44:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135352 states. [2019-09-10 06:44:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135352 states to 135352 states and 158629 transitions. [2019-09-10 06:44:31,197 INFO L78 Accepts]: Start accepts. Automaton has 135352 states and 158629 transitions. Word has length 117 [2019-09-10 06:44:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:31,197 INFO L475 AbstractCegarLoop]: Abstraction has 135352 states and 158629 transitions. [2019-09-10 06:44:31,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:44:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 135352 states and 158629 transitions. [2019-09-10 06:44:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:44:31,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:31,201 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:31,201 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:31,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash -977133463, now seen corresponding path program 1 times [2019-09-10 06:44:31,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:31,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:31,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:31,731 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:31,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:31,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:44:31,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:31,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:44:31,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:44:31,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:44:31,733 INFO L87 Difference]: Start difference. First operand 135352 states and 158629 transitions. Second operand 11 states. [2019-09-10 06:44:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:33,494 INFO L93 Difference]: Finished difference Result 204106 states and 239244 transitions. [2019-09-10 06:44:33,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:44:33,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 117 [2019-09-10 06:44:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:33,731 INFO L225 Difference]: With dead ends: 204106 [2019-09-10 06:44:33,731 INFO L226 Difference]: Without dead ends: 204106 [2019-09-10 06:44:33,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:44:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204106 states. [2019-09-10 06:44:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204106 to 135220. [2019-09-10 06:44:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135220 states. [2019-09-10 06:44:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135220 states to 135220 states and 158477 transitions. [2019-09-10 06:44:35,480 INFO L78 Accepts]: Start accepts. Automaton has 135220 states and 158477 transitions. Word has length 117 [2019-09-10 06:44:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:35,481 INFO L475 AbstractCegarLoop]: Abstraction has 135220 states and 158477 transitions. [2019-09-10 06:44:35,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:44:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 135220 states and 158477 transitions. [2019-09-10 06:44:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:44:35,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:35,484 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:35,484 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:35,485 INFO L82 PathProgramCache]: Analyzing trace with hash 364316989, now seen corresponding path program 1 times [2019-09-10 06:44:35,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:35,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:35,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:35,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:35,900 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:35,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:35,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:44:35,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:35,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:44:35,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:44:35,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:44:35,902 INFO L87 Difference]: Start difference. First operand 135220 states and 158477 transitions. Second operand 17 states. [2019-09-10 06:44:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:38,176 INFO L93 Difference]: Finished difference Result 160666 states and 188480 transitions. [2019-09-10 06:44:38,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:44:38,177 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 118 [2019-09-10 06:44:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:38,326 INFO L225 Difference]: With dead ends: 160666 [2019-09-10 06:44:38,326 INFO L226 Difference]: Without dead ends: 160666 [2019-09-10 06:44:38,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:44:38,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160666 states. [2019-09-10 06:44:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160666 to 135216. [2019-09-10 06:44:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135216 states. [2019-09-10 06:44:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135216 states to 135216 states and 158470 transitions. [2019-09-10 06:44:39,859 INFO L78 Accepts]: Start accepts. Automaton has 135216 states and 158470 transitions. Word has length 118 [2019-09-10 06:44:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:39,859 INFO L475 AbstractCegarLoop]: Abstraction has 135216 states and 158470 transitions. [2019-09-10 06:44:39,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:44:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 135216 states and 158470 transitions. [2019-09-10 06:44:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:44:39,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:39,863 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:39,863 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:39,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1566393415, now seen corresponding path program 1 times [2019-09-10 06:44:39,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:39,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:39,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:39,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:39,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:40,393 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:44:40,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:40,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:44:40,394 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 06:44:40,394 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [123], [125], [127], [130], [133], [136], [139], [141], [143], [146], [149], [152], [157], [159], [162], [165], [169], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [257], [259], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [489], [506], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:44:40,396 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:44:40,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:44:40,425 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:44:40,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:44:40,530 INFO L272 AbstractInterpreter]: Visited 113 different actions 218 times. Merged at 40 different actions 93 times. Never widened. Performed 998 root evaluator evaluations with a maximum evaluation depth of 5. Performed 998 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 6 different actions. Largest state had 224 variables. [2019-09-10 06:44:40,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:40,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:44:40,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:40,530 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:44:40,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:40,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:44:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:40,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-10 06:44:40,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:44:43,207 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-09-10 06:44:43,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:44,939 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:44,940 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:44:45,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:46,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:46,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:46,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:46,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:47,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:47,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:48,580 WARN L188 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 06:44:50,164 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 06:44:50,437 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-09-10 06:44:50,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:50,765 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-09-10 06:44:51,505 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 24 [2019-09-10 06:44:52,026 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-10 06:44:52,134 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:52,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:44:52,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27, 27] total 69 [2019-09-10 06:44:52,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:44:52,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 06:44:52,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 06:44:52,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=4233, Unknown=2, NotChecked=0, Total=4692 [2019-09-10 06:44:52,140 INFO L87 Difference]: Start difference. First operand 135216 states and 158470 transitions. Second operand 44 states. [2019-09-10 06:44:55,584 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 06:45:06,837 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:45:07,239 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 06:45:07,983 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 06:45:08,548 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 06:45:09,021 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 06:45:09,401 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-09-10 06:45:10,478 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-09-10 06:45:11,262 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 06:45:12,568 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 06:45:13,105 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 06:45:14,072 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-09-10 06:45:14,633 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 06:45:14,933 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:45:15,649 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-09-10 06:45:16,029 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 06:45:16,295 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 06:45:16,610 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:45:17,271 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-10 06:45:17,513 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-09-10 06:45:18,049 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 06:45:18,396 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 06:45:19,142 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:45:19,739 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 06:45:20,515 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:45:20,809 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 06:45:21,249 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 06:45:21,677 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 06:45:22,222 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:45:22,917 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 06:45:23,333 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:45:23,824 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:45:24,052 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 06:45:24,273 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 06:45:24,557 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 06:45:24,848 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 06:45:25,275 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:45:25,584 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 06:45:26,294 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:45:27,803 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 06:45:28,837 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 06:45:29,564 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 06:45:30,326 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 06:45:30,821 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 06:45:31,086 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 06:45:31,303 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:45:31,908 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:45:33,570 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 06:45:33,764 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 06:45:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:34,437 INFO L93 Difference]: Finished difference Result 338232 states and 396158 transitions. [2019-09-10 06:45:34,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-10 06:45:34,437 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 118 [2019-09-10 06:45:34,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:35,493 INFO L225 Difference]: With dead ends: 338232 [2019-09-10 06:45:35,494 INFO L226 Difference]: Without dead ends: 338232 [2019-09-10 06:45:35,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 180 SyntacticMatches, 7 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10627 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=3895, Invalid=33541, Unknown=6, NotChecked=0, Total=37442 [2019-09-10 06:45:35,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338232 states. [2019-09-10 06:45:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338232 to 139874. [2019-09-10 06:45:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139874 states. [2019-09-10 06:45:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139874 states to 139874 states and 163920 transitions. [2019-09-10 06:45:37,081 INFO L78 Accepts]: Start accepts. Automaton has 139874 states and 163920 transitions. Word has length 118 [2019-09-10 06:45:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:37,082 INFO L475 AbstractCegarLoop]: Abstraction has 139874 states and 163920 transitions. [2019-09-10 06:45:37,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 06:45:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 139874 states and 163920 transitions. [2019-09-10 06:45:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:45:37,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:37,085 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:37,085 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1112454525, now seen corresponding path program 1 times [2019-09-10 06:45:37,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:37,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:37,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:37,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:37,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:37,541 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:45:37,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:37,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:45:37,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:37,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:45:37,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:45:37,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:45:37,543 INFO L87 Difference]: Start difference. First operand 139874 states and 163920 transitions. Second operand 18 states. [2019-09-10 06:45:37,949 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:45:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:42,005 INFO L93 Difference]: Finished difference Result 201810 states and 236111 transitions. [2019-09-10 06:45:42,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:45:42,005 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2019-09-10 06:45:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:42,203 INFO L225 Difference]: With dead ends: 201810 [2019-09-10 06:45:42,204 INFO L226 Difference]: Without dead ends: 201810 [2019-09-10 06:45:42,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=233, Invalid=1249, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:45:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201810 states. [2019-09-10 06:45:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201810 to 129305. [2019-09-10 06:45:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129305 states. [2019-09-10 06:45:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129305 states to 129305 states and 151594 transitions. [2019-09-10 06:45:44,152 INFO L78 Accepts]: Start accepts. Automaton has 129305 states and 151594 transitions. Word has length 118 [2019-09-10 06:45:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:44,153 INFO L475 AbstractCegarLoop]: Abstraction has 129305 states and 151594 transitions. [2019-09-10 06:45:44,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:45:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 129305 states and 151594 transitions. [2019-09-10 06:45:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 06:45:44,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:44,156 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:44,156 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash -343133627, now seen corresponding path program 1 times [2019-09-10 06:45:44,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:44,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:44,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:44,770 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:44,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:44,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:44,771 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-09-10 06:45:44,771 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [125], [127], [130], [133], [136], [141], [143], [146], [149], [152], [155], [157], [159], [162], [165], [169], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [513], [567], [574], [697], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:45:44,773 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:44,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:44,795 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:44,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:44,870 INFO L272 AbstractInterpreter]: Visited 114 different actions 199 times. Merged at 40 different actions 76 times. Never widened. Performed 932 root evaluator evaluations with a maximum evaluation depth of 5. Performed 932 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 4 different actions. Largest state had 224 variables. [2019-09-10 06:45:44,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:44,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:44,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:44,871 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:45:44,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:44,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:45:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:45,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 06:45:45,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:45:45,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:51,743 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:51,743 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:45:52,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:52,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:52,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:53,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:53,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:53,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:54,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:54,698 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-09-10 06:45:55,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:55,326 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:55,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:45:55,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 50 [2019-09-10 06:45:55,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:45:55,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 06:45:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 06:45:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2224, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:45:55,331 INFO L87 Difference]: Start difference. First operand 129305 states and 151594 transitions. Second operand 37 states. [2019-09-10 06:46:07,277 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 06:46:15,556 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 06:46:15,932 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 06:46:17,103 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 06:46:24,433 WARN L188 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 06:46:37,988 WARN L188 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-09-10 06:47:17,259 WARN L188 SmtUtils]: Spent 10.73 s on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-09-10 06:47:25,231 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65