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.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:37:52,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:37:52,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:37:52,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:37:52,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:37:52,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:37:52,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:37:52,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:37:52,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:37:52,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:37:52,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:37:52,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:37:52,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:37:52,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:37:52,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:37:52,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:37:52,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:37:52,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:37:52,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:37:52,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:37:52,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:37:52,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:37:52,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:37:52,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:37:52,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:37:52,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:37:52,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:37:52,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:37:52,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:37:52,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:37:52,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:37:52,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:37:52,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:37:52,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:37:52,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:37:52,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:37:52,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:37:52,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:37:52,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:37:52,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:37:52,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:37:52,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:37:52,495 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:37:52,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:37:52,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:37:52,496 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:37:52,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:37:52,497 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:37:52,497 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:37:52,497 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:37:52,497 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:37:52,498 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:37:52,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:37:52,499 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:37:52,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:37:52,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:37:52,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:37:52,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:37:52,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:37:52,500 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:37:52,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:37:52,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:37:52,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:37:52,500 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:37:52,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:37:52,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:37:52,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:37:52,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:37:52,502 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:37:52,502 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:37:52,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:37:52,502 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:37:52,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:37:52,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:37:52,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:37:52,548 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:37:52,548 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:37:52,549 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.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 06:37:52,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd74642c/6042ba921cdb468b94be730b5ac6dd31/FLAG1872d0895 [2019-09-10 06:37:53,347 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:37:53,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 06:37:53,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd74642c/6042ba921cdb468b94be730b5ac6dd31/FLAG1872d0895 [2019-09-10 06:37:53,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd74642c/6042ba921cdb468b94be730b5ac6dd31 [2019-09-10 06:37:53,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:37:53,455 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:37:53,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:37:53,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:37:53,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:37:53,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:37:53" (1/1) ... [2019-09-10 06:37:53,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9b58fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:53, skipping insertion in model container [2019-09-10 06:37:53,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:37:53" (1/1) ... [2019-09-10 06:37:53,473 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:37:53,654 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:37:54,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:37:54,764 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:37:55,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:37:55,162 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:37:55,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:55 WrapperNode [2019-09-10 06:37:55,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:37:55,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:37:55,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:37:55,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:37:55,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:55" (1/1) ... [2019-09-10 06:37:55,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:55" (1/1) ... [2019-09-10 06:37:55,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:55" (1/1) ... [2019-09-10 06:37:55,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:55" (1/1) ... [2019-09-10 06:37:55,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:55" (1/1) ... [2019-09-10 06:37:55,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:55" (1/1) ... [2019-09-10 06:37:55,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:55" (1/1) ... [2019-09-10 06:37:55,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:37:55,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:37:55,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:37:55,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:37:55,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:37:55,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:37:55,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:37:55,552 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:37:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:37:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:37:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:37:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:37:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:37:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:37:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:37:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:37:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:37:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:37:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:37:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:37:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:37:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:37:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:37:59,398 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:37:59,400 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:37:59,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:37:59 BoogieIcfgContainer [2019-09-10 06:37:59,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:37:59,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:37:59,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:37:59,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:37:59,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:37:53" (1/3) ... [2019-09-10 06:37:59,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcd342a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:37:59, skipping insertion in model container [2019-09-10 06:37:59,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:55" (2/3) ... [2019-09-10 06:37:59,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcd342a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:37:59, skipping insertion in model container [2019-09-10 06:37:59,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:37:59" (3/3) ... [2019-09-10 06:37:59,416 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 06:37:59,429 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:37:59,452 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-10 06:37:59,469 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-10 06:37:59,497 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:37:59,497 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:37:59,498 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:37:59,498 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:37:59,498 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:37:59,498 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:37:59,498 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:37:59,499 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:37:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states. [2019-09-10 06:37:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:37:59,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:59,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:59,576 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:59,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:59,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1212138476, now seen corresponding path program 1 times [2019-09-10 06:37:59,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:59,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:59,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:59,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:59,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:00,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:00,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:38:00,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:00,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:38:00,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:38:00,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:38:00,219 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand 6 states. [2019-09-10 06:38:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:02,379 INFO L93 Difference]: Finished difference Result 1629 states and 2742 transitions. [2019-09-10 06:38:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:02,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:38:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:02,414 INFO L225 Difference]: With dead ends: 1629 [2019-09-10 06:38:02,414 INFO L226 Difference]: Without dead ends: 1617 [2019-09-10 06:38:02,416 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:38:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-10 06:38:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1594. [2019-09-10 06:38:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2019-09-10 06:38:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2070 transitions. [2019-09-10 06:38:02,558 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2070 transitions. Word has length 56 [2019-09-10 06:38:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:02,558 INFO L475 AbstractCegarLoop]: Abstraction has 1594 states and 2070 transitions. [2019-09-10 06:38:02,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:38:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2070 transitions. [2019-09-10 06:38:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:38:02,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:02,564 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:38:02,564 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:02,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1633149148, now seen corresponding path program 1 times [2019-09-10 06:38:02,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:02,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:02,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:02,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:02,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:02,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:02,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:38:02,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:02,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:38:02,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:38:02,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:38:02,788 INFO L87 Difference]: Start difference. First operand 1594 states and 2070 transitions. Second operand 6 states. [2019-09-10 06:38:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:04,100 INFO L93 Difference]: Finished difference Result 2530 states and 3365 transitions. [2019-09-10 06:38:04,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:04,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:38:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:04,115 INFO L225 Difference]: With dead ends: 2530 [2019-09-10 06:38:04,116 INFO L226 Difference]: Without dead ends: 2530 [2019-09-10 06:38:04,117 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:38:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-09-10 06:38:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2514. [2019-09-10 06:38:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-09-10 06:38:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3354 transitions. [2019-09-10 06:38:04,217 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3354 transitions. Word has length 56 [2019-09-10 06:38:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:04,218 INFO L475 AbstractCegarLoop]: Abstraction has 2514 states and 3354 transitions. [2019-09-10 06:38:04,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:38:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3354 transitions. [2019-09-10 06:38:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:38:04,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:04,225 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:38:04,226 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:04,227 INFO L82 PathProgramCache]: Analyzing trace with hash -755922083, now seen corresponding path program 1 times [2019-09-10 06:38:04,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:04,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:04,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:04,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:04,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:04,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:04,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:04,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:04,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:04,520 INFO L87 Difference]: Start difference. First operand 2514 states and 3354 transitions. Second operand 5 states. [2019-09-10 06:38:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:05,857 INFO L93 Difference]: Finished difference Result 3904 states and 5178 transitions. [2019-09-10 06:38:05,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:05,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 06:38:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:05,878 INFO L225 Difference]: With dead ends: 3904 [2019-09-10 06:38:05,887 INFO L226 Difference]: Without dead ends: 3904 [2019-09-10 06:38:05,887 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:38:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2019-09-10 06:38:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3898. [2019-09-10 06:38:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-09-10 06:38:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5174 transitions. [2019-09-10 06:38:05,984 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5174 transitions. Word has length 56 [2019-09-10 06:38:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:05,986 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5174 transitions. [2019-09-10 06:38:05,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5174 transitions. [2019-09-10 06:38:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:38:05,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:05,991 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:38:05,991 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash -418972447, now seen corresponding path program 1 times [2019-09-10 06:38:05,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:05,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:05,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:05,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:05,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:06,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:06,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:38:06,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:06,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:38:06,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:38:06,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:38:06,231 INFO L87 Difference]: Start difference. First operand 3898 states and 5174 transitions. Second operand 8 states. [2019-09-10 06:38:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:08,461 INFO L93 Difference]: Finished difference Result 8853 states and 12734 transitions. [2019-09-10 06:38:08,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:38:08,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-09-10 06:38:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:08,501 INFO L225 Difference]: With dead ends: 8853 [2019-09-10 06:38:08,502 INFO L226 Difference]: Without dead ends: 8853 [2019-09-10 06:38:08,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:38:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2019-09-10 06:38:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 3898. [2019-09-10 06:38:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-09-10 06:38:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5173 transitions. [2019-09-10 06:38:08,646 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5173 transitions. Word has length 58 [2019-09-10 06:38:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:08,648 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5173 transitions. [2019-09-10 06:38:08,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:38:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5173 transitions. [2019-09-10 06:38:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:38:08,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:08,653 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:38:08,654 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1952539007, now seen corresponding path program 1 times [2019-09-10 06:38:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:08,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:08,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:08,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:08,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:08,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:08,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:38:08,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:08,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:38:08,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:38:08,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:38:08,920 INFO L87 Difference]: Start difference. First operand 3898 states and 5173 transitions. Second operand 9 states. [2019-09-10 06:38:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:12,298 INFO L93 Difference]: Finished difference Result 9554 states and 13660 transitions. [2019-09-10 06:38:12,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:38:12,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-10 06:38:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:12,342 INFO L225 Difference]: With dead ends: 9554 [2019-09-10 06:38:12,342 INFO L226 Difference]: Without dead ends: 9554 [2019-09-10 06:38:12,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:38:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9554 states. [2019-09-10 06:38:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9554 to 3898. [2019-09-10 06:38:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-09-10 06:38:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5172 transitions. [2019-09-10 06:38:12,544 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5172 transitions. Word has length 58 [2019-09-10 06:38:12,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:12,545 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5172 transitions. [2019-09-10 06:38:12,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:38:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5172 transitions. [2019-09-10 06:38:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:38:12,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:12,549 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:38:12,549 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:12,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:12,550 INFO L82 PathProgramCache]: Analyzing trace with hash -215970595, now seen corresponding path program 1 times [2019-09-10 06:38:12,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:12,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:12,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:12,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:12,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:38:12,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:12,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:38:12,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:38:12,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:38:12,773 INFO L87 Difference]: Start difference. First operand 3898 states and 5172 transitions. Second operand 9 states. [2019-09-10 06:38:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:15,953 INFO L93 Difference]: Finished difference Result 9285 states and 12952 transitions. [2019-09-10 06:38:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:38:15,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-10 06:38:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:15,976 INFO L225 Difference]: With dead ends: 9285 [2019-09-10 06:38:15,976 INFO L226 Difference]: Without dead ends: 9285 [2019-09-10 06:38:15,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:38:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9285 states. [2019-09-10 06:38:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9285 to 3898. [2019-09-10 06:38:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-09-10 06:38:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5171 transitions. [2019-09-10 06:38:16,128 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5171 transitions. Word has length 58 [2019-09-10 06:38:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:16,129 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5171 transitions. [2019-09-10 06:38:16,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:38:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5171 transitions. [2019-09-10 06:38:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:38:16,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:16,138 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:38:16,138 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:16,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:16,140 INFO L82 PathProgramCache]: Analyzing trace with hash 834918715, now seen corresponding path program 1 times [2019-09-10 06:38:16,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:16,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:16,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:16,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:16,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:16,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:16,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:16,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:16,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:16,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:16,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:16,252 INFO L87 Difference]: Start difference. First operand 3898 states and 5171 transitions. Second operand 3 states. [2019-09-10 06:38:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:16,332 INFO L93 Difference]: Finished difference Result 4287 states and 5786 transitions. [2019-09-10 06:38:16,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:16,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:38:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:16,350 INFO L225 Difference]: With dead ends: 4287 [2019-09-10 06:38:16,351 INFO L226 Difference]: Without dead ends: 4287 [2019-09-10 06:38:16,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-09-10 06:38:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3971. [2019-09-10 06:38:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-09-10 06:38:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5314 transitions. [2019-09-10 06:38:16,427 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5314 transitions. Word has length 59 [2019-09-10 06:38:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:16,428 INFO L475 AbstractCegarLoop]: Abstraction has 3971 states and 5314 transitions. [2019-09-10 06:38:16,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5314 transitions. [2019-09-10 06:38:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:38:16,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:16,433 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:38:16,433 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:16,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:16,434 INFO L82 PathProgramCache]: Analyzing trace with hash 132280932, now seen corresponding path program 1 times [2019-09-10 06:38:16,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:16,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:16,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:16,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:16,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:16,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:16,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:16,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:16,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:16,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:16,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:16,569 INFO L87 Difference]: Start difference. First operand 3971 states and 5314 transitions. Second operand 3 states. [2019-09-10 06:38:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:16,666 INFO L93 Difference]: Finished difference Result 4943 states and 6772 transitions. [2019-09-10 06:38:16,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:16,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:38:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:16,677 INFO L225 Difference]: With dead ends: 4943 [2019-09-10 06:38:16,677 INFO L226 Difference]: Without dead ends: 4943 [2019-09-10 06:38:16,678 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:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4943 states. [2019-09-10 06:38:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 4463. [2019-09-10 06:38:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4463 states. [2019-09-10 06:38:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 6066 transitions. [2019-09-10 06:38:16,748 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 6066 transitions. Word has length 59 [2019-09-10 06:38:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:16,748 INFO L475 AbstractCegarLoop]: Abstraction has 4463 states and 6066 transitions. [2019-09-10 06:38:16,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 6066 transitions. [2019-09-10 06:38:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:38:16,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:16,752 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:38:16,752 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1642469980, now seen corresponding path program 1 times [2019-09-10 06:38:16,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:16,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:16,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:16,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:16,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:16,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:16,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:16,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:16,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:16,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:16,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:16,845 INFO L87 Difference]: Start difference. First operand 4463 states and 6066 transitions. Second operand 3 states. [2019-09-10 06:38:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:16,962 INFO L93 Difference]: Finished difference Result 5699 states and 7849 transitions. [2019-09-10 06:38:16,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:16,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:38:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:16,973 INFO L225 Difference]: With dead ends: 5699 [2019-09-10 06:38:16,973 INFO L226 Difference]: Without dead ends: 5699 [2019-09-10 06:38:16,974 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:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2019-09-10 06:38:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5697. [2019-09-10 06:38:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-09-10 06:38:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7848 transitions. [2019-09-10 06:38:17,052 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7848 transitions. Word has length 59 [2019-09-10 06:38:17,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:17,052 INFO L475 AbstractCegarLoop]: Abstraction has 5697 states and 7848 transitions. [2019-09-10 06:38:17,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7848 transitions. [2019-09-10 06:38:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:38:17,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:17,056 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:38:17,056 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:17,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:17,056 INFO L82 PathProgramCache]: Analyzing trace with hash 11887072, now seen corresponding path program 1 times [2019-09-10 06:38:17,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:17,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:17,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:17,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:17,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:17,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:17,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:17,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:17,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:17,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:17,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:17,134 INFO L87 Difference]: Start difference. First operand 5697 states and 7848 transitions. Second operand 3 states. [2019-09-10 06:38:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:17,248 INFO L93 Difference]: Finished difference Result 8543 states and 12087 transitions. [2019-09-10 06:38:17,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:17,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:38:17,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:17,265 INFO L225 Difference]: With dead ends: 8543 [2019-09-10 06:38:17,265 INFO L226 Difference]: Without dead ends: 8543 [2019-09-10 06:38:17,265 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:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2019-09-10 06:38:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 6757. [2019-09-10 06:38:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2019-09-10 06:38:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 9505 transitions. [2019-09-10 06:38:17,411 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 9505 transitions. Word has length 60 [2019-09-10 06:38:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:17,412 INFO L475 AbstractCegarLoop]: Abstraction has 6757 states and 9505 transitions. [2019-09-10 06:38:17,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 9505 transitions. [2019-09-10 06:38:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:38:17,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:17,416 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:17,416 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:17,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:17,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2065078364, now seen corresponding path program 1 times [2019-09-10 06:38:17,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:17,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:17,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:17,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:17,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:17,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:17,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:17,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:17,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:17,586 INFO L87 Difference]: Start difference. First operand 6757 states and 9505 transitions. Second operand 3 states. [2019-09-10 06:38:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:17,784 INFO L93 Difference]: Finished difference Result 10944 states and 15634 transitions. [2019-09-10 06:38:17,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:17,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:38:17,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:17,806 INFO L225 Difference]: With dead ends: 10944 [2019-09-10 06:38:17,806 INFO L226 Difference]: Without dead ends: 10944 [2019-09-10 06:38:17,806 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:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10944 states. [2019-09-10 06:38:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10944 to 8515. [2019-09-10 06:38:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8515 states. [2019-09-10 06:38:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8515 states to 8515 states and 12125 transitions. [2019-09-10 06:38:17,958 INFO L78 Accepts]: Start accepts. Automaton has 8515 states and 12125 transitions. Word has length 60 [2019-09-10 06:38:17,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:17,958 INFO L475 AbstractCegarLoop]: Abstraction has 8515 states and 12125 transitions. [2019-09-10 06:38:17,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 8515 states and 12125 transitions. [2019-09-10 06:38:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:38:17,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:17,960 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:38:17,961 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:17,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:17,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1780702045, now seen corresponding path program 1 times [2019-09-10 06:38:17,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:17,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:17,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:18,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:18,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:38:18,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:18,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:38:18,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:38:18,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:38:18,465 INFO L87 Difference]: Start difference. First operand 8515 states and 12125 transitions. Second operand 12 states. [2019-09-10 06:38:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:20,098 INFO L93 Difference]: Finished difference Result 22129 states and 31686 transitions. [2019-09-10 06:38:20,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:38:20,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-09-10 06:38:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:20,144 INFO L225 Difference]: With dead ends: 22129 [2019-09-10 06:38:20,144 INFO L226 Difference]: Without dead ends: 22129 [2019-09-10 06:38:20,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:38:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22129 states. [2019-09-10 06:38:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22129 to 8514. [2019-09-10 06:38:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8514 states. [2019-09-10 06:38:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8514 states to 8514 states and 12123 transitions. [2019-09-10 06:38:20,445 INFO L78 Accepts]: Start accepts. Automaton has 8514 states and 12123 transitions. Word has length 60 [2019-09-10 06:38:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:20,445 INFO L475 AbstractCegarLoop]: Abstraction has 8514 states and 12123 transitions. [2019-09-10 06:38:20,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:38:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 8514 states and 12123 transitions. [2019-09-10 06:38:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:38:20,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:20,448 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:38:20,448 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1604028375, now seen corresponding path program 1 times [2019-09-10 06:38:20,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:20,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:20,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:20,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:20,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:21,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:21,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:38:21,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:21,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:38:21,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:38:21,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:38:21,158 INFO L87 Difference]: Start difference. First operand 8514 states and 12123 transitions. Second operand 13 states. [2019-09-10 06:38:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:23,481 INFO L93 Difference]: Finished difference Result 13116 states and 18657 transitions. [2019-09-10 06:38:23,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:38:23,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-10 06:38:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:23,508 INFO L225 Difference]: With dead ends: 13116 [2019-09-10 06:38:23,508 INFO L226 Difference]: Without dead ends: 13116 [2019-09-10 06:38:23,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:38:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13116 states. [2019-09-10 06:38:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13116 to 8510. [2019-09-10 06:38:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8510 states. [2019-09-10 06:38:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8510 states to 8510 states and 12119 transitions. [2019-09-10 06:38:23,677 INFO L78 Accepts]: Start accepts. Automaton has 8510 states and 12119 transitions. Word has length 61 [2019-09-10 06:38:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:23,678 INFO L475 AbstractCegarLoop]: Abstraction has 8510 states and 12119 transitions. [2019-09-10 06:38:23,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:38:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 8510 states and 12119 transitions. [2019-09-10 06:38:23,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:38:23,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:23,680 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:38:23,681 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:23,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1495356554, now seen corresponding path program 1 times [2019-09-10 06:38:23,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:23,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:23,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:23,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:23,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:24,047 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-09-10 06:38:24,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:24,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:24,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:38:24,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:24,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:38:24,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:38:24,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:38:24,352 INFO L87 Difference]: Start difference. First operand 8510 states and 12119 transitions. Second operand 14 states. [2019-09-10 06:38:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:26,638 INFO L93 Difference]: Finished difference Result 10787 states and 15285 transitions. [2019-09-10 06:38:26,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:38:26,639 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-10 06:38:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:26,658 INFO L225 Difference]: With dead ends: 10787 [2019-09-10 06:38:26,659 INFO L226 Difference]: Without dead ends: 10787 [2019-09-10 06:38:26,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:38:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10787 states. [2019-09-10 06:38:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10787 to 8450. [2019-09-10 06:38:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8450 states. [2019-09-10 06:38:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8450 states to 8450 states and 12044 transitions. [2019-09-10 06:38:26,805 INFO L78 Accepts]: Start accepts. Automaton has 8450 states and 12044 transitions. Word has length 61 [2019-09-10 06:38:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:26,806 INFO L475 AbstractCegarLoop]: Abstraction has 8450 states and 12044 transitions. [2019-09-10 06:38:26,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:38:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 8450 states and 12044 transitions. [2019-09-10 06:38:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:38:26,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:26,808 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:38:26,809 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:26,809 INFO L82 PathProgramCache]: Analyzing trace with hash 113151698, now seen corresponding path program 1 times [2019-09-10 06:38:26,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:26,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:26,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:26,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:26,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:27,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:27,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:38:27,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:27,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:38:27,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:38:27,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:38:27,242 INFO L87 Difference]: Start difference. First operand 8450 states and 12044 transitions. Second operand 11 states. [2019-09-10 06:38:28,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:28,655 INFO L93 Difference]: Finished difference Result 23485 states and 33688 transitions. [2019-09-10 06:38:28,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:38:28,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-09-10 06:38:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:28,684 INFO L225 Difference]: With dead ends: 23485 [2019-09-10 06:38:28,684 INFO L226 Difference]: Without dead ends: 23485 [2019-09-10 06:38:28,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:38:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23485 states. [2019-09-10 06:38:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23485 to 8446. [2019-09-10 06:38:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8446 states. [2019-09-10 06:38:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8446 states to 8446 states and 12040 transitions. [2019-09-10 06:38:28,917 INFO L78 Accepts]: Start accepts. Automaton has 8446 states and 12040 transitions. Word has length 62 [2019-09-10 06:38:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:28,917 INFO L475 AbstractCegarLoop]: Abstraction has 8446 states and 12040 transitions. [2019-09-10 06:38:28,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:38:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8446 states and 12040 transitions. [2019-09-10 06:38:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:38:28,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:28,920 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] [2019-09-10 06:38:28,921 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash -287029914, now seen corresponding path program 1 times [2019-09-10 06:38:28,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:28,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:28,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:28,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:28,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:29,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:29,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:38:29,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:29,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:38:29,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:38:29,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:38:29,049 INFO L87 Difference]: Start difference. First operand 8446 states and 12040 transitions. Second operand 6 states. [2019-09-10 06:38:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:29,324 INFO L93 Difference]: Finished difference Result 30096 states and 42050 transitions. [2019-09-10 06:38:29,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:38:29,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-10 06:38:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:29,361 INFO L225 Difference]: With dead ends: 30096 [2019-09-10 06:38:29,361 INFO L226 Difference]: Without dead ends: 30096 [2019-09-10 06:38:29,362 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:38:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30096 states. [2019-09-10 06:38:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30096 to 26340. [2019-09-10 06:38:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26340 states. [2019-09-10 06:38:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26340 states to 26340 states and 36839 transitions. [2019-09-10 06:38:29,751 INFO L78 Accepts]: Start accepts. Automaton has 26340 states and 36839 transitions. Word has length 65 [2019-09-10 06:38:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:29,751 INFO L475 AbstractCegarLoop]: Abstraction has 26340 states and 36839 transitions. [2019-09-10 06:38:29,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:38:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 26340 states and 36839 transitions. [2019-09-10 06:38:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:38:29,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:29,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:29,755 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash -586005098, now seen corresponding path program 1 times [2019-09-10 06:38:29,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:29,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:29,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:29,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:29,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:29,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:29,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:29,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:29,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:29,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:29,879 INFO L87 Difference]: Start difference. First operand 26340 states and 36839 transitions. Second operand 5 states. [2019-09-10 06:38:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:30,100 INFO L93 Difference]: Finished difference Result 15737 states and 21497 transitions. [2019-09-10 06:38:30,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:30,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-10 06:38:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:30,121 INFO L225 Difference]: With dead ends: 15737 [2019-09-10 06:38:30,122 INFO L226 Difference]: Without dead ends: 15737 [2019-09-10 06:38:30,122 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:38:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15737 states. [2019-09-10 06:38:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15737 to 12568. [2019-09-10 06:38:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12568 states. [2019-09-10 06:38:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 17213 transitions. [2019-09-10 06:38:31,037 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 17213 transitions. Word has length 66 [2019-09-10 06:38:31,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:31,037 INFO L475 AbstractCegarLoop]: Abstraction has 12568 states and 17213 transitions. [2019-09-10 06:38:31,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:31,037 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 17213 transitions. [2019-09-10 06:38:31,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:38:31,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:31,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:31,041 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:31,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:31,042 INFO L82 PathProgramCache]: Analyzing trace with hash -584887692, now seen corresponding path program 1 times [2019-09-10 06:38:31,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:31,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:31,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:31,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:31,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:31,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:31,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:38:31,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:31,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:38:31,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:38:31,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:38:31,161 INFO L87 Difference]: Start difference. First operand 12568 states and 17213 transitions. Second operand 6 states. [2019-09-10 06:38:31,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:31,370 INFO L93 Difference]: Finished difference Result 22434 states and 30222 transitions. [2019-09-10 06:38:31,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:38:31,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:38:31,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:31,391 INFO L225 Difference]: With dead ends: 22434 [2019-09-10 06:38:31,392 INFO L226 Difference]: Without dead ends: 22434 [2019-09-10 06:38:31,392 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:38:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2019-09-10 06:38:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 12976. [2019-09-10 06:38:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12976 states. [2019-09-10 06:38:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12976 states to 12976 states and 17530 transitions. [2019-09-10 06:38:31,598 INFO L78 Accepts]: Start accepts. Automaton has 12976 states and 17530 transitions. Word has length 70 [2019-09-10 06:38:31,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:31,599 INFO L475 AbstractCegarLoop]: Abstraction has 12976 states and 17530 transitions. [2019-09-10 06:38:31,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:38:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 12976 states and 17530 transitions. [2019-09-10 06:38:31,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:38:31,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:31,602 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:38:31,602 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:31,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash -793759712, now seen corresponding path program 1 times [2019-09-10 06:38:31,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:31,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:31,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:31,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:31,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:31,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:31,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:31,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:31,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:31,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:31,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:31,685 INFO L87 Difference]: Start difference. First operand 12976 states and 17530 transitions. Second operand 3 states. [2019-09-10 06:38:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:31,798 INFO L93 Difference]: Finished difference Result 22178 states and 29727 transitions. [2019-09-10 06:38:31,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:31,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-10 06:38:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:31,827 INFO L225 Difference]: With dead ends: 22178 [2019-09-10 06:38:31,827 INFO L226 Difference]: Without dead ends: 22178 [2019-09-10 06:38:31,827 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:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22178 states. [2019-09-10 06:38:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22178 to 22176. [2019-09-10 06:38:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22176 states. [2019-09-10 06:38:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22176 states to 22176 states and 29726 transitions. [2019-09-10 06:38:32,184 INFO L78 Accepts]: Start accepts. Automaton has 22176 states and 29726 transitions. Word has length 71 [2019-09-10 06:38:32,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:32,186 INFO L475 AbstractCegarLoop]: Abstraction has 22176 states and 29726 transitions. [2019-09-10 06:38:32,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 22176 states and 29726 transitions. [2019-09-10 06:38:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:38:32,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:32,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:32,191 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:32,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1879683765, now seen corresponding path program 1 times [2019-09-10 06:38:32,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:32,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:32,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:32,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:32,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:32,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:32,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:32,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:32,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:32,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:32,310 INFO L87 Difference]: Start difference. First operand 22176 states and 29726 transitions. Second operand 5 states. [2019-09-10 06:38:33,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:33,266 INFO L93 Difference]: Finished difference Result 48617 states and 63900 transitions. [2019-09-10 06:38:33,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:38:33,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 06:38:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:33,318 INFO L225 Difference]: With dead ends: 48617 [2019-09-10 06:38:33,318 INFO L226 Difference]: Without dead ends: 48617 [2019-09-10 06:38:33,318 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:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48617 states. [2019-09-10 06:38:33,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48617 to 29368. [2019-09-10 06:38:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29368 states. [2019-09-10 06:38:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29368 states to 29368 states and 38726 transitions. [2019-09-10 06:38:33,769 INFO L78 Accepts]: Start accepts. Automaton has 29368 states and 38726 transitions. Word has length 75 [2019-09-10 06:38:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:33,769 INFO L475 AbstractCegarLoop]: Abstraction has 29368 states and 38726 transitions. [2019-09-10 06:38:33,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:33,770 INFO L276 IsEmpty]: Start isEmpty. Operand 29368 states and 38726 transitions. [2019-09-10 06:38:33,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:38:33,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:33,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:33,776 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:33,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:33,776 INFO L82 PathProgramCache]: Analyzing trace with hash 435599465, now seen corresponding path program 1 times [2019-09-10 06:38:33,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:33,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:33,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:33,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:33,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:33,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:33,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:33,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:33,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:33,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:33,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:33,877 INFO L87 Difference]: Start difference. First operand 29368 states and 38726 transitions. Second operand 5 states. [2019-09-10 06:38:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:34,749 INFO L93 Difference]: Finished difference Result 73391 states and 94624 transitions. [2019-09-10 06:38:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:38:34,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 06:38:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:34,860 INFO L225 Difference]: With dead ends: 73391 [2019-09-10 06:38:34,860 INFO L226 Difference]: Without dead ends: 73391 [2019-09-10 06:38:34,861 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:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73391 states. [2019-09-10 06:38:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73391 to 49927. [2019-09-10 06:38:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49927 states. [2019-09-10 06:38:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49927 states to 49927 states and 65280 transitions. [2019-09-10 06:38:36,526 INFO L78 Accepts]: Start accepts. Automaton has 49927 states and 65280 transitions. Word has length 81 [2019-09-10 06:38:36,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:36,526 INFO L475 AbstractCegarLoop]: Abstraction has 49927 states and 65280 transitions. [2019-09-10 06:38:36,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 49927 states and 65280 transitions. [2019-09-10 06:38:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:38:36,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:36,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:36,531 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:36,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:36,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1991987475, now seen corresponding path program 1 times [2019-09-10 06:38:36,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:36,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:36,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:36,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:36,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:36,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:36,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:36,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:36,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:36,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:36,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:36,616 INFO L87 Difference]: Start difference. First operand 49927 states and 65280 transitions. Second operand 3 states. [2019-09-10 06:38:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:36,933 INFO L93 Difference]: Finished difference Result 88998 states and 113938 transitions. [2019-09-10 06:38:36,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:36,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 06:38:36,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:37,026 INFO L225 Difference]: With dead ends: 88998 [2019-09-10 06:38:37,026 INFO L226 Difference]: Without dead ends: 88998 [2019-09-10 06:38:37,026 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:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88998 states. [2019-09-10 06:38:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88998 to 67002. [2019-09-10 06:38:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67002 states. [2019-09-10 06:38:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67002 states to 67002 states and 86073 transitions. [2019-09-10 06:38:38,095 INFO L78 Accepts]: Start accepts. Automaton has 67002 states and 86073 transitions. Word has length 83 [2019-09-10 06:38:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:38,095 INFO L475 AbstractCegarLoop]: Abstraction has 67002 states and 86073 transitions. [2019-09-10 06:38:38,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 67002 states and 86073 transitions. [2019-09-10 06:38:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 06:38:38,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:38,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:38,100 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash -530585101, now seen corresponding path program 1 times [2019-09-10 06:38:38,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:38,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:38,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:38,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:38,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:38,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:38,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:38,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:38,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:38,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:38,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:38,199 INFO L87 Difference]: Start difference. First operand 67002 states and 86073 transitions. Second operand 3 states. [2019-09-10 06:38:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:38,436 INFO L93 Difference]: Finished difference Result 89482 states and 112123 transitions. [2019-09-10 06:38:38,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:38,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 06:38:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:38,546 INFO L225 Difference]: With dead ends: 89482 [2019-09-10 06:38:38,547 INFO L226 Difference]: Without dead ends: 89482 [2019-09-10 06:38:38,547 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:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89482 states. [2019-09-10 06:38:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89482 to 67569. [2019-09-10 06:38:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67569 states. [2019-09-10 06:38:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67569 states to 67569 states and 85027 transitions. [2019-09-10 06:38:40,889 INFO L78 Accepts]: Start accepts. Automaton has 67569 states and 85027 transitions. Word has length 86 [2019-09-10 06:38:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:40,890 INFO L475 AbstractCegarLoop]: Abstraction has 67569 states and 85027 transitions. [2019-09-10 06:38:40,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 67569 states and 85027 transitions. [2019-09-10 06:38:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:38:40,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:40,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:40,894 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2116981400, now seen corresponding path program 1 times [2019-09-10 06:38:40,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:40,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:40,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:40,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:40,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:40,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:40,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:40,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:40,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:40,978 INFO L87 Difference]: Start difference. First operand 67569 states and 85027 transitions. Second operand 3 states. [2019-09-10 06:38:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:41,223 INFO L93 Difference]: Finished difference Result 79131 states and 97302 transitions. [2019-09-10 06:38:41,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:41,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 06:38:41,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:41,300 INFO L225 Difference]: With dead ends: 79131 [2019-09-10 06:38:41,300 INFO L226 Difference]: Without dead ends: 79131 [2019-09-10 06:38:41,301 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:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79131 states. [2019-09-10 06:38:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79131 to 75582. [2019-09-10 06:38:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75582 states. [2019-09-10 06:38:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75582 states to 75582 states and 93754 transitions. [2019-09-10 06:38:42,457 INFO L78 Accepts]: Start accepts. Automaton has 75582 states and 93754 transitions. Word has length 89 [2019-09-10 06:38:42,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:42,457 INFO L475 AbstractCegarLoop]: Abstraction has 75582 states and 93754 transitions. [2019-09-10 06:38:42,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:42,457 INFO L276 IsEmpty]: Start isEmpty. Operand 75582 states and 93754 transitions. [2019-09-10 06:38:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:38:42,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:42,463 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] [2019-09-10 06:38:42,464 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:42,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1675942405, now seen corresponding path program 1 times [2019-09-10 06:38:42,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:42,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:42,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:42,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:42,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:42,642 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:42,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:42,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:38:42,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:42,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:38:42,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:38:42,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:38:42,644 INFO L87 Difference]: Start difference. First operand 75582 states and 93754 transitions. Second operand 9 states. [2019-09-10 06:38:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:44,204 INFO L93 Difference]: Finished difference Result 173009 states and 214574 transitions. [2019-09-10 06:38:44,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:38:44,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 06:38:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:44,393 INFO L225 Difference]: With dead ends: 173009 [2019-09-10 06:38:44,394 INFO L226 Difference]: Without dead ends: 173009 [2019-09-10 06:38:44,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:38:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173009 states. [2019-09-10 06:38:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173009 to 75567. [2019-09-10 06:38:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75567 states. [2019-09-10 06:38:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75567 states to 75567 states and 93738 transitions. [2019-09-10 06:38:47,595 INFO L78 Accepts]: Start accepts. Automaton has 75567 states and 93738 transitions. Word has length 95 [2019-09-10 06:38:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:47,596 INFO L475 AbstractCegarLoop]: Abstraction has 75567 states and 93738 transitions. [2019-09-10 06:38:47,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:38:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 75567 states and 93738 transitions. [2019-09-10 06:38:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:38:47,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:47,603 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] [2019-09-10 06:38:47,603 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:47,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:47,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1439804858, now seen corresponding path program 1 times [2019-09-10 06:38:47,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:47,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:47,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:47,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:47,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:47,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:47,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:47,757 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-09-10 06:38:47,759 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [166], [169], [170], [172], [175], [178], [199], [201], [203], [3199], [3203], [3328], [3331], [3352], [3354], [3356], [3651], [3654], [3675], [3677], [3679], [3681], [3684], [3687], [3689], [3694], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [3930], [4177], [4181], [4184], [4187], [4190], [4193], [4196], [4200], [4203], [4206], [4215], [4217], [4246], [4249], [4253], [4256], [4260], [4262], [4265], [4268], [4272], [4275], [4279], [4283], [4285], [4289], [4293], [4309], [4311], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:38:47,805 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:47,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:48,105 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:48,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:48,642 INFO L272 AbstractInterpreter]: Visited 89 different actions 307 times. Merged at 31 different actions 198 times. Widened at 13 different actions 37 times. Performed 1642 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1642 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 18 fixpoints after 6 different actions. Largest state had 390 variables. [2019-09-10 06:38:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:48,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:48,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:48,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:38:48,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:48,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:38:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:49,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 06:38:49,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:38:49,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:49,400 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:49,400 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:38:49,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:49,748 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:49,764 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:38:49,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [5] total 21 [2019-09-10 06:38:49,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:49,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:38:49,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:38:49,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:38:49,767 INFO L87 Difference]: Start difference. First operand 75567 states and 93738 transitions. Second operand 10 states. [2019-09-10 06:38:53,483 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-09-10 06:38:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:54,104 INFO L93 Difference]: Finished difference Result 164852 states and 203669 transitions. [2019-09-10 06:38:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:38:54,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-09-10 06:38:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:54,484 INFO L225 Difference]: With dead ends: 164852 [2019-09-10 06:38:54,484 INFO L226 Difference]: Without dead ends: 164852 [2019-09-10 06:38:54,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=300, Invalid=960, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:38:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164852 states. [2019-09-10 06:38:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164852 to 101761. [2019-09-10 06:38:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101761 states. [2019-09-10 06:38:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101761 states to 101761 states and 126085 transitions. [2019-09-10 06:38:59,171 INFO L78 Accepts]: Start accepts. Automaton has 101761 states and 126085 transitions. Word has length 95 [2019-09-10 06:38:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:59,171 INFO L475 AbstractCegarLoop]: Abstraction has 101761 states and 126085 transitions. [2019-09-10 06:38:59,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:38:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 101761 states and 126085 transitions. [2019-09-10 06:38:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:38:59,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:59,192 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:38:59,192 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:59,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2137474406, now seen corresponding path program 1 times [2019-09-10 06:38:59,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:59,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:59,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:59,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:59,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:59,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 97 with the following transitions: [2019-09-10 06:38:59,384 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [166], [169], [170], [172], [175], [178], [199], [201], [203], [3199], [3203], [3206], [3209], [3212], [3216], [3328], [3331], [3352], [3354], [3356], [3419], [3466], [3469], [3472], [3476], [3479], [3482], [3486], [3488], [3491], [3495], [3498], [3501], [3505], [3509], [3651], [3654], [3675], [3677], [3679], [3681], [3684], [3687], [3689], [3694], [3699], [3701], [3720], [3722], [3741], [3858], [3861], [3864], [3868], [3871], [3875], [3879], [3881], [3885], [3888], [3891], [3894], [3899], [3901], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:38:59,392 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:59,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:59,510 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:59,846 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:59,847 INFO L272 AbstractInterpreter]: Visited 90 different actions 297 times. Merged at 29 different actions 189 times. Widened at 12 different actions 28 times. Performed 1636 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1636 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 8 different actions. Largest state had 390 variables. [2019-09-10 06:38:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:59,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:59,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:59,848 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:38:59,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:59,863 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:39:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:00,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 2050 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:39:00,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:39:00,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:00,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:00,906 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:01,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:01,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:01,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:01,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:01,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:39:01,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 9] total 20 [2019-09-10 06:39:01,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:39:01,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:39:01,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:39:01,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:39:01,197 INFO L87 Difference]: Start difference. First operand 101761 states and 126085 transitions. Second operand 13 states. [2019-09-10 06:39:01,351 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:39:05,497 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 06:39:06,131 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:39:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:08,822 INFO L93 Difference]: Finished difference Result 149117 states and 185039 transitions. [2019-09-10 06:39:08,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:39:08,822 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-09-10 06:39:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:09,053 INFO L225 Difference]: With dead ends: 149117 [2019-09-10 06:39:09,054 INFO L226 Difference]: Without dead ends: 149117 [2019-09-10 06:39:09,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 169 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=295, Invalid=1111, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:39:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149117 states. [2019-09-10 06:39:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149117 to 142008. [2019-09-10 06:39:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142008 states. [2019-09-10 06:39:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142008 states to 142008 states and 176413 transitions. [2019-09-10 06:39:10,892 INFO L78 Accepts]: Start accepts. Automaton has 142008 states and 176413 transitions. Word has length 96 [2019-09-10 06:39:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:10,893 INFO L475 AbstractCegarLoop]: Abstraction has 142008 states and 176413 transitions. [2019-09-10 06:39:10,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:39:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 142008 states and 176413 transitions. [2019-09-10 06:39:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:39:10,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:10,906 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:10,906 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:10,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash 106004821, now seen corresponding path program 1 times [2019-09-10 06:39:10,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:10,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:10,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:11,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:11,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:11,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:39:11,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:11,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:39:11,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:39:11,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:39:11,002 INFO L87 Difference]: Start difference. First operand 142008 states and 176413 transitions. Second operand 5 states. [2019-09-10 06:39:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:12,571 INFO L93 Difference]: Finished difference Result 159871 states and 194736 transitions. [2019-09-10 06:39:12,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:39:12,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 06:39:12,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:12,779 INFO L225 Difference]: With dead ends: 159871 [2019-09-10 06:39:12,780 INFO L226 Difference]: Without dead ends: 159871 [2019-09-10 06:39:12,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:39:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159871 states. [2019-09-10 06:39:13,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159871 to 129052. [2019-09-10 06:39:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129052 states. [2019-09-10 06:39:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129052 states to 129052 states and 157455 transitions. [2019-09-10 06:39:14,123 INFO L78 Accepts]: Start accepts. Automaton has 129052 states and 157455 transitions. Word has length 99 [2019-09-10 06:39:14,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:14,123 INFO L475 AbstractCegarLoop]: Abstraction has 129052 states and 157455 transitions. [2019-09-10 06:39:14,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:39:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 129052 states and 157455 transitions. [2019-09-10 06:39:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:39:14,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:14,133 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:14,133 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash -291839216, now seen corresponding path program 1 times [2019-09-10 06:39:14,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:14,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:14,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:14,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:14,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:39:14,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:14,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:39:14,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:14,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:39:14,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:39:14,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:39:14,228 INFO L87 Difference]: Start difference. First operand 129052 states and 157455 transitions. Second operand 3 states. [2019-09-10 06:39:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:16,409 INFO L93 Difference]: Finished difference Result 127096 states and 152228 transitions. [2019-09-10 06:39:16,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:39:16,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 06:39:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:16,546 INFO L225 Difference]: With dead ends: 127096 [2019-09-10 06:39:16,546 INFO L226 Difference]: Without dead ends: 127096 [2019-09-10 06:39:16,546 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:39:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127096 states. [2019-09-10 06:39:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127096 to 104404. [2019-09-10 06:39:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104404 states. [2019-09-10 06:39:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104404 states to 104404 states and 125687 transitions. [2019-09-10 06:39:17,577 INFO L78 Accepts]: Start accepts. Automaton has 104404 states and 125687 transitions. Word has length 99 [2019-09-10 06:39:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:17,578 INFO L475 AbstractCegarLoop]: Abstraction has 104404 states and 125687 transitions. [2019-09-10 06:39:17,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:39:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 104404 states and 125687 transitions. [2019-09-10 06:39:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:39:17,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:17,586 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:17,586 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:17,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1348348173, now seen corresponding path program 1 times [2019-09-10 06:39:17,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:17,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:17,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:39:17,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:17,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:39:17,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:17,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:39:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:39:17,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:39:17,677 INFO L87 Difference]: Start difference. First operand 104404 states and 125687 transitions. Second operand 3 states. [2019-09-10 06:39:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:17,909 INFO L93 Difference]: Finished difference Result 104299 states and 124208 transitions. [2019-09-10 06:39:17,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:39:17,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 06:39:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:18,013 INFO L225 Difference]: With dead ends: 104299 [2019-09-10 06:39:18,013 INFO L226 Difference]: Without dead ends: 104299 [2019-09-10 06:39:18,014 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:39:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104299 states. [2019-09-10 06:39:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104299 to 76776. [2019-09-10 06:39:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76776 states. [2019-09-10 06:39:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76776 states to 76776 states and 91896 transitions. [2019-09-10 06:39:19,239 INFO L78 Accepts]: Start accepts. Automaton has 76776 states and 91896 transitions. Word has length 101 [2019-09-10 06:39:19,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:19,239 INFO L475 AbstractCegarLoop]: Abstraction has 76776 states and 91896 transitions. [2019-09-10 06:39:19,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:39:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 76776 states and 91896 transitions. [2019-09-10 06:39:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:39:19,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:19,244 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:19,245 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash 170954536, now seen corresponding path program 1 times [2019-09-10 06:39:19,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:19,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:19,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:19,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:19,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:19,374 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:19,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:19,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:39:19,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:19,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:39:19,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:39:19,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:39:19,375 INFO L87 Difference]: Start difference. First operand 76776 states and 91896 transitions. Second operand 5 states. [2019-09-10 06:39:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:19,720 INFO L93 Difference]: Finished difference Result 122273 states and 146335 transitions. [2019-09-10 06:39:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:39:19,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 06:39:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:19,842 INFO L225 Difference]: With dead ends: 122273 [2019-09-10 06:39:19,843 INFO L226 Difference]: Without dead ends: 122273 [2019-09-10 06:39:19,843 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:19,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122273 states. [2019-09-10 06:39:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122273 to 101699. [2019-09-10 06:39:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101699 states. [2019-09-10 06:39:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101699 states to 101699 states and 121543 transitions. [2019-09-10 06:39:20,880 INFO L78 Accepts]: Start accepts. Automaton has 101699 states and 121543 transitions. Word has length 104 [2019-09-10 06:39:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:20,880 INFO L475 AbstractCegarLoop]: Abstraction has 101699 states and 121543 transitions. [2019-09-10 06:39:20,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:39:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 101699 states and 121543 transitions. [2019-09-10 06:39:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:39:20,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:20,886 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:20,887 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:20,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:20,887 INFO L82 PathProgramCache]: Analyzing trace with hash -240157060, now seen corresponding path program 1 times [2019-09-10 06:39:20,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:20,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:20,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:20,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:20,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:39:20,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:20,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:39:20,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:20,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:39:20,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:39:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:39:20,997 INFO L87 Difference]: Start difference. First operand 101699 states and 121543 transitions. Second operand 5 states. [2019-09-10 06:39:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:21,415 INFO L93 Difference]: Finished difference Result 131908 states and 157758 transitions. [2019-09-10 06:39:21,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:39:21,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 06:39:21,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:21,980 INFO L225 Difference]: With dead ends: 131908 [2019-09-10 06:39:21,981 INFO L226 Difference]: Without dead ends: 131908 [2019-09-10 06:39:21,981 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,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131908 states. [2019-09-10 06:39:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131908 to 115095. [2019-09-10 06:39:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115095 states. [2019-09-10 06:39:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115095 states to 115095 states and 137530 transitions. [2019-09-10 06:39:23,005 INFO L78 Accepts]: Start accepts. Automaton has 115095 states and 137530 transitions. Word has length 104 [2019-09-10 06:39:23,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:23,005 INFO L475 AbstractCegarLoop]: Abstraction has 115095 states and 137530 transitions. [2019-09-10 06:39:23,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:39:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 115095 states and 137530 transitions. [2019-09-10 06:39:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:39:23,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:23,014 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:23,014 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash 812250873, now seen corresponding path program 1 times [2019-09-10 06:39:23,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:23,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:23,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:23,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:23,354 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:39:23,356 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [359], [462], [465], [468], [472], [475], [478], [482], [484], [487], [490], [493], [498], [501], [504], [507], [511], [515], [929], [932], [935], [939], [942], [946], [949], [952], [955], [963], [967], [3328], [3331], [3352], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3675], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3720], [3722], [3725], [3728], [3731], [3739], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:39:23,366 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:23,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:23,551 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:24,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:39:24,041 INFO L272 AbstractInterpreter]: Visited 103 different actions 342 times. Merged at 40 different actions 218 times. Widened at 11 different actions 26 times. Performed 1737 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1737 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 17 fixpoints after 11 different actions. Largest state had 392 variables. [2019-09-10 06:39:24,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:24,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:39:24,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:24,042 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:39:24,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:24,065 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:39:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:24,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 2076 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:39:24,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:39:24,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:24,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:25,329 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:25,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:25,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:25,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:25,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:25,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:39:25,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2019-09-10 06:39:25,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:39:25,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:39:25,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:39:25,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:39:25,687 INFO L87 Difference]: Start difference. First operand 115095 states and 137530 transitions. Second operand 18 states. [2019-09-10 06:39:25,891 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 06:39:26,112 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:39:26,260 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 06:39:26,433 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:39:34,099 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 06:39:35,141 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:39:37,012 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:39:37,554 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 06:39:37,942 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:39:38,857 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 06:39:39,683 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 06:39:39,949 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 06:39:40,261 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 06:39:41,179 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 06:39:41,725 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 06:39:42,218 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:39:42,884 WARN L188 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 06:39:43,334 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 06:39:43,750 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 06:39:44,575 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 06:39:45,097 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 06:39:45,753 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:39:46,184 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 06:39:47,240 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:39:47,650 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 06:39:49,484 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 06:39:50,051 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:39:50,510 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 06:39:51,079 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:39:51,278 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:39:51,780 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 06:39:52,652 WARN L188 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 06:39:53,026 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-09-10 06:39:53,506 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:39:54,092 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:39:54,995 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 06:39:55,666 WARN L188 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 06:39:56,279 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 06:39:57,091 WARN L188 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 06:39:57,457 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-09-10 06:39:58,022 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:39:58,185 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:39:58,567 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 06:39:59,028 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:39:59,738 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:40:00,227 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:40:00,793 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 06:40:01,760 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 06:40:02,240 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 06:40:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:04,433 INFO L93 Difference]: Finished difference Result 352297 states and 418227 transitions. [2019-09-10 06:40:04,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-10 06:40:04,433 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 110 [2019-09-10 06:40:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:04,872 INFO L225 Difference]: With dead ends: 352297 [2019-09-10 06:40:04,872 INFO L226 Difference]: Without dead ends: 352297 [2019-09-10 06:40:04,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 192 SyntacticMatches, 13 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3635 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=1983, Invalid=10007, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 06:40:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352297 states. [2019-09-10 06:40:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352297 to 122741. [2019-09-10 06:40:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122741 states. [2019-09-10 06:40:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122741 states to 122741 states and 146538 transitions. [2019-09-10 06:40:08,092 INFO L78 Accepts]: Start accepts. Automaton has 122741 states and 146538 transitions. Word has length 110 [2019-09-10 06:40:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:08,092 INFO L475 AbstractCegarLoop]: Abstraction has 122741 states and 146538 transitions. [2019-09-10 06:40:08,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:40:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 122741 states and 146538 transitions. [2019-09-10 06:40:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:40:08,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:08,101 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:08,102 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash -500839479, now seen corresponding path program 1 times [2019-09-10 06:40:08,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:08,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:08,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:08,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:08,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:40:08,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:08,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:40:08,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:08,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:40:08,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:40:08,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:40:08,272 INFO L87 Difference]: Start difference. First operand 122741 states and 146538 transitions. Second operand 9 states. [2019-09-10 06:40:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:10,616 INFO L93 Difference]: Finished difference Result 234199 states and 279740 transitions. [2019-09-10 06:40:10,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:40:10,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-10 06:40:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:10,919 INFO L225 Difference]: With dead ends: 234199 [2019-09-10 06:40:10,919 INFO L226 Difference]: Without dead ends: 234199 [2019-09-10 06:40:10,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:40:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234199 states. [2019-09-10 06:40:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234199 to 122741. [2019-09-10 06:40:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122741 states. [2019-09-10 06:40:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122741 states to 122741 states and 146537 transitions. [2019-09-10 06:40:16,505 INFO L78 Accepts]: Start accepts. Automaton has 122741 states and 146537 transitions. Word has length 111 [2019-09-10 06:40:16,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:16,505 INFO L475 AbstractCegarLoop]: Abstraction has 122741 states and 146537 transitions. [2019-09-10 06:40:16,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:40:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 122741 states and 146537 transitions. [2019-09-10 06:40:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:40:16,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:16,515 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:16,515 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash -221663094, now seen corresponding path program 1 times [2019-09-10 06:40:16,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:16,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:16,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:16,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:16,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:40:16,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:16,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:40:16,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:16,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:40:16,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:40:16,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:40:16,606 INFO L87 Difference]: Start difference. First operand 122741 states and 146537 transitions. Second operand 4 states. [2019-09-10 06:40:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:17,511 INFO L93 Difference]: Finished difference Result 171369 states and 204057 transitions. [2019-09-10 06:40:17,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:40:17,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 06:40:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:17,707 INFO L225 Difference]: With dead ends: 171369 [2019-09-10 06:40:17,707 INFO L226 Difference]: Without dead ends: 171369 [2019-09-10 06:40:17,708 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:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171369 states. [2019-09-10 06:40:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171369 to 122741. [2019-09-10 06:40:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122741 states. [2019-09-10 06:40:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122741 states to 122741 states and 146537 transitions. [2019-09-10 06:40:19,066 INFO L78 Accepts]: Start accepts. Automaton has 122741 states and 146537 transitions. Word has length 112 [2019-09-10 06:40:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:19,066 INFO L475 AbstractCegarLoop]: Abstraction has 122741 states and 146537 transitions. [2019-09-10 06:40:19,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:40:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 122741 states and 146537 transitions. [2019-09-10 06:40:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:40:19,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:19,078 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:19,078 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:19,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:19,079 INFO L82 PathProgramCache]: Analyzing trace with hash 651814601, now seen corresponding path program 1 times [2019-09-10 06:40:19,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:19,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:19,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:19,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:19,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:19,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:19,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:19,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:40:19,315 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [166], [169], [170], [172], [175], [178], [181], [184], [187], [201], [203], [988], [1238], [1242], [1245], [1248], [1251], [1254], [1257], [1261], [1264], [1267], [1270], [1273], [1278], [1281], [1284], [1287], [1291], [1295], [2773], [2776], [2780], [2782], [2785], [2788], [2792], [2795], [2799], [2802], [2805], [2808], [2816], [2820], [3328], [3331], [3352], [3354], [3356], [3358], [3377], [3379], [3382], [3385], [3388], [3396], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:40:19,320 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:19,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:19,452 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:20,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:20,046 INFO L272 AbstractInterpreter]: Visited 105 different actions 458 times. Merged at 42 different actions 324 times. Widened at 16 different actions 59 times. Performed 2021 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2021 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 10 different actions. Largest state had 392 variables. [2019-09-10 06:40:20,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:20,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:20,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:20,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:40:20,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:20,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:40:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:20,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 2077 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 06:40:20,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:20,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:20,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:21,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:21,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:21,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:21,172 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:21,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:21,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:21,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:21,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:21,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:21,452 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:40:21,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [10] total 25 [2019-09-10 06:40:21,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:21,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:40:21,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:40:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:40:21,454 INFO L87 Difference]: Start difference. First operand 122741 states and 146537 transitions. Second operand 10 states. [2019-09-10 06:40:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:23,220 INFO L93 Difference]: Finished difference Result 141913 states and 168626 transitions. [2019-09-10 06:40:23,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:40:23,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2019-09-10 06:40:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:23,366 INFO L225 Difference]: With dead ends: 141913 [2019-09-10 06:40:23,366 INFO L226 Difference]: Without dead ends: 141913 [2019-09-10 06:40:23,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:40:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141913 states. [2019-09-10 06:40:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141913 to 134899. [2019-09-10 06:40:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134899 states. [2019-09-10 06:40:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134899 states to 134899 states and 160861 transitions. [2019-09-10 06:40:24,524 INFO L78 Accepts]: Start accepts. Automaton has 134899 states and 160861 transitions. Word has length 112 [2019-09-10 06:40:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:24,524 INFO L475 AbstractCegarLoop]: Abstraction has 134899 states and 160861 transitions. [2019-09-10 06:40:24,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:40:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 134899 states and 160861 transitions. [2019-09-10 06:40:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:40:24,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:24,534 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:24,534 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:24,535 INFO L82 PathProgramCache]: Analyzing trace with hash 34603032, now seen corresponding path program 1 times [2019-09-10 06:40:24,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:24,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:24,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:24,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:24,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:40:24,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:24,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:40:24,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:24,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:40:24,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:40:24,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:40:24,627 INFO L87 Difference]: Start difference. First operand 134899 states and 160861 transitions. Second operand 4 states. [2019-09-10 06:40:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:26,026 INFO L93 Difference]: Finished difference Result 217260 states and 257911 transitions. [2019-09-10 06:40:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:40:26,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 06:40:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:26,254 INFO L225 Difference]: With dead ends: 217260 [2019-09-10 06:40:26,254 INFO L226 Difference]: Without dead ends: 217260 [2019-09-10 06:40:26,254 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:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217260 states. [2019-09-10 06:40:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217260 to 134819. [2019-09-10 06:40:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134819 states. [2019-09-10 06:40:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134819 states to 134819 states and 160768 transitions. [2019-09-10 06:40:27,599 INFO L78 Accepts]: Start accepts. Automaton has 134819 states and 160768 transitions. Word has length 112 [2019-09-10 06:40:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:27,599 INFO L475 AbstractCegarLoop]: Abstraction has 134819 states and 160768 transitions. [2019-09-10 06:40:27,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:40:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 134819 states and 160768 transitions. [2019-09-10 06:40:27,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:40:27,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:27,609 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:27,609 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:27,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:27,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1928045207, now seen corresponding path program 1 times [2019-09-10 06:40:27,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:27,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:27,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:27,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:27,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:40:27,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:27,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:40:27,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:27,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:40:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:40:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:40:27,768 INFO L87 Difference]: Start difference. First operand 134819 states and 160768 transitions. Second operand 8 states. [2019-09-10 06:40:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:28,954 INFO L93 Difference]: Finished difference Result 153673 states and 182734 transitions. [2019-09-10 06:40:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:40:28,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-09-10 06:40:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:29,114 INFO L225 Difference]: With dead ends: 153673 [2019-09-10 06:40:29,115 INFO L226 Difference]: Without dead ends: 153673 [2019-09-10 06:40:29,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:40:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153673 states. [2019-09-10 06:40:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153673 to 134693. [2019-09-10 06:40:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134693 states. [2019-09-10 06:40:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134693 states to 134693 states and 160627 transitions. [2019-09-10 06:40:30,955 INFO L78 Accepts]: Start accepts. Automaton has 134693 states and 160627 transitions. Word has length 112 [2019-09-10 06:40:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:30,956 INFO L475 AbstractCegarLoop]: Abstraction has 134693 states and 160627 transitions. [2019-09-10 06:40:30,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:40:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 134693 states and 160627 transitions. [2019-09-10 06:40:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:40:30,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:30,965 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:30,965 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1637379935, now seen corresponding path program 1 times [2019-09-10 06:40:30,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:30,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:30,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:31,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:31,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:31,198 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:40:31,199 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [988], [1238], [1242], [1245], [1248], [1251], [1254], [1257], [1261], [1264], [1267], [1270], [1273], [1278], [1281], [1284], [1287], [1291], [1295], [2773], [2776], [2780], [2782], [2785], [2788], [2792], [2795], [2799], [2802], [2805], [2808], [2816], [2820], [3328], [3331], [3352], [3354], [3356], [3358], [3377], [3379], [3382], [3385], [3388], [3396], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:40:31,201 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:31,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:31,300 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:31,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:32,000 INFO L272 AbstractInterpreter]: Visited 106 different actions 500 times. Merged at 43 different actions 362 times. Widened at 15 different actions 70 times. Performed 2109 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2109 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 392 variables. [2019-09-10 06:40:32,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:32,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:32,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:32,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:40:32,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:32,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:40:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:32,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 2079 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:40:32,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:32,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:32,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:33,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:33,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:33,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:33,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:33,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:33,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:40:33,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2019-09-10 06:40:33,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:40:33,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:40:33,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:40:33,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:40:33,867 INFO L87 Difference]: Start difference. First operand 134693 states and 160627 transitions. Second operand 18 states. [2019-09-10 06:40:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:41,693 INFO L93 Difference]: Finished difference Result 335658 states and 398798 transitions. [2019-09-10 06:40:41,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:40:41,694 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 113 [2019-09-10 06:40:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:42,075 INFO L225 Difference]: With dead ends: 335658 [2019-09-10 06:40:42,076 INFO L226 Difference]: Without dead ends: 335658 [2019-09-10 06:40:42,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 194 SyntacticMatches, 21 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=323, Invalid=1159, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:40:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335658 states. [2019-09-10 06:40:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335658 to 134747. [2019-09-10 06:40:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134747 states. [2019-09-10 06:40:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134747 states to 134747 states and 160687 transitions. [2019-09-10 06:40:44,962 INFO L78 Accepts]: Start accepts. Automaton has 134747 states and 160687 transitions. Word has length 113 [2019-09-10 06:40:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:44,962 INFO L475 AbstractCegarLoop]: Abstraction has 134747 states and 160687 transitions. [2019-09-10 06:40:44,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:40:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 134747 states and 160687 transitions. [2019-09-10 06:40:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:40:44,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:44,972 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:44,972 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1997250102, now seen corresponding path program 1 times [2019-09-10 06:40:44,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:44,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:44,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:45,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:45,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:40:45,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:45,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:40:45,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:40:45,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:40:45,062 INFO L87 Difference]: Start difference. First operand 134747 states and 160687 transitions. Second operand 3 states. [2019-09-10 06:40:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:45,382 INFO L93 Difference]: Finished difference Result 140627 states and 167096 transitions. [2019-09-10 06:40:45,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:40:45,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-10 06:40:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:45,517 INFO L225 Difference]: With dead ends: 140627 [2019-09-10 06:40:45,517 INFO L226 Difference]: Without dead ends: 140627 [2019-09-10 06:40:45,517 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:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140627 states. [2019-09-10 06:40:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140627 to 140374. [2019-09-10 06:40:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140374 states. [2019-09-10 06:40:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140374 states to 140374 states and 166844 transitions. [2019-09-10 06:40:47,203 INFO L78 Accepts]: Start accepts. Automaton has 140374 states and 166844 transitions. Word has length 113 [2019-09-10 06:40:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:47,204 INFO L475 AbstractCegarLoop]: Abstraction has 140374 states and 166844 transitions. [2019-09-10 06:40:47,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:40:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 140374 states and 166844 transitions. [2019-09-10 06:40:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:40:47,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:47,212 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:47,212 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:47,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1164512815, now seen corresponding path program 1 times [2019-09-10 06:40:47,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:47,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:47,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:47,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:47,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:47,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:47,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:40:47,569 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [359], [462], [465], [468], [472], [475], [478], [482], [484], [487], [490], [493], [498], [501], [504], [507], [511], [515], [929], [932], [935], [939], [942], [946], [949], [952], [955], [963], [967], [3328], [3331], [3334], [3337], [3340], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3657], [3673], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3720], [3722], [3725], [3728], [3731], [3739], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:40:47,573 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:47,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:47,654 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:48,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:48,234 INFO L272 AbstractInterpreter]: Visited 106 different actions 508 times. Merged at 43 different actions 374 times. Widened at 17 different actions 68 times. Performed 2222 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2222 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 12 different actions. Largest state had 392 variables. [2019-09-10 06:40:48,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:48,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:48,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:48,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:40:48,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:48,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:40:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:48,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:40:48,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:48,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:48,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:48,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:48,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:48,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:48,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:48,982 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:49,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:49,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:49,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:49,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:49,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:49,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:40:49,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 27 [2019-09-10 06:40:49,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:40:49,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:40:49,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:40:49,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:40:49,231 INFO L87 Difference]: Start difference. First operand 140374 states and 166844 transitions. Second operand 22 states. [2019-09-10 06:40:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:53,229 INFO L93 Difference]: Finished difference Result 373196 states and 441002 transitions. [2019-09-10 06:40:53,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:40:53,229 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 113 [2019-09-10 06:40:53,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:53,603 INFO L225 Difference]: With dead ends: 373196 [2019-09-10 06:40:53,604 INFO L226 Difference]: Without dead ends: 373196 [2019-09-10 06:40:53,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=474, Invalid=1976, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:40:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373196 states. [2019-09-10 06:40:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373196 to 140522. [2019-09-10 06:40:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140522 states. [2019-09-10 06:40:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140522 states to 140522 states and 167011 transitions. [2019-09-10 06:40:57,412 INFO L78 Accepts]: Start accepts. Automaton has 140522 states and 167011 transitions. Word has length 113 [2019-09-10 06:40:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:57,412 INFO L475 AbstractCegarLoop]: Abstraction has 140522 states and 167011 transitions. [2019-09-10 06:40:57,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:40:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 140522 states and 167011 transitions. [2019-09-10 06:40:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:40:57,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:57,421 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:57,422 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:57,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:57,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1888162720, now seen corresponding path program 1 times [2019-09-10 06:40:57,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:57,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:57,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:57,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:57,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:57,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:57,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:57,641 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:40:57,642 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [988], [1238], [1242], [1245], [1248], [1251], [1254], [1257], [1261], [1264], [1267], [1270], [1273], [1276], [1300], [1306], [1335], [1338], [1341], [1345], [1349], [2873], [2876], [2880], [2882], [2885], [2888], [2892], [2895], [2899], [2902], [2905], [2908], [2913], [3328], [3331], [3352], [3354], [3356], [3358], [3377], [3379], [3382], [3385], [3388], [3396], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:40:57,644 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:57,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:57,723 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:58,360 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:58,362 INFO L272 AbstractInterpreter]: Visited 107 different actions 498 times. Merged at 43 different actions 359 times. Widened at 15 different actions 67 times. Performed 2102 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2102 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 10 different actions. Largest state had 393 variables. [2019-09-10 06:40:58,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:58,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:58,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:58,364 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:58,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:58,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:40:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:58,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 06:40:58,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:58,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:58,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:58,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:59,021 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:59,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:59,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:59,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:59,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:59,340 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:40:59,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [10] total 26 [2019-09-10 06:40:59,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:59,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:40:59,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:40:59,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:40:59,341 INFO L87 Difference]: Start difference. First operand 140522 states and 167011 transitions. Second operand 10 states. [2019-09-10 06:41:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:00,940 INFO L93 Difference]: Finished difference Result 136415 states and 161817 transitions. [2019-09-10 06:41:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:41:00,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-09-10 06:41:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:01,076 INFO L225 Difference]: With dead ends: 136415 [2019-09-10 06:41:01,076 INFO L226 Difference]: Without dead ends: 136415 [2019-09-10 06:41:01,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:41:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136415 states. [2019-09-10 06:41:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136415 to 133702. [2019-09-10 06:41:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133702 states. [2019-09-10 06:41:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133702 states to 133702 states and 158839 transitions. [2019-09-10 06:41:02,754 INFO L78 Accepts]: Start accepts. Automaton has 133702 states and 158839 transitions. Word has length 114 [2019-09-10 06:41:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:02,755 INFO L475 AbstractCegarLoop]: Abstraction has 133702 states and 158839 transitions. [2019-09-10 06:41:02,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:41:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 133702 states and 158839 transitions. [2019-09-10 06:41:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:41:02,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:02,764 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:02,765 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:02,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:02,765 INFO L82 PathProgramCache]: Analyzing trace with hash -134197463, now seen corresponding path program 1 times [2019-09-10 06:41:02,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:02,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:02,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:02,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:02,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:03,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:03,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:03,914 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:41:03,914 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [988], [1238], [1242], [1245], [1248], [1251], [1254], [1257], [1261], [1264], [1267], [1270], [1273], [1278], [1281], [1284], [1287], [1291], [1295], [2773], [2776], [2780], [2782], [2785], [2788], [2792], [2795], [2799], [2802], [2805], [2808], [2816], [2820], [3328], [3331], [3334], [3350], [3354], [3356], [3358], [3377], [3379], [3382], [3385], [3388], [3396], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:41:03,916 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:03,916 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:03,990 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:04,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:04,354 INFO L272 AbstractInterpreter]: Visited 107 different actions 414 times. Merged at 44 different actions 284 times. Widened at 14 different actions 38 times. Performed 1883 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1883 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 10 different actions. Largest state had 392 variables. [2019-09-10 06:41:04,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:04,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:04,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:04,354 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:04,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:04,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:41:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:04,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:41:04,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:04,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:05,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:05,948 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:41:05,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [21] total 39 [2019-09-10 06:41:05,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:05,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:41:05,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:41:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1360, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:41:05,950 INFO L87 Difference]: Start difference. First operand 133702 states and 158839 transitions. Second operand 11 states. [2019-09-10 06:41:06,941 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-10 06:41:07,788 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 06:41:08,019 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 06:41:08,564 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:41:09,372 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:41:09,773 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 06:41:10,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:10,088 INFO L93 Difference]: Finished difference Result 157858 states and 186065 transitions. [2019-09-10 06:41:10,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:41:10,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 114 [2019-09-10 06:41:10,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:10,284 INFO L225 Difference]: With dead ends: 157858 [2019-09-10 06:41:10,284 INFO L226 Difference]: Without dead ends: 157858 [2019-09-10 06:41:10,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=437, Invalid=2643, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 06:41:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157858 states. [2019-09-10 06:41:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157858 to 133692. [2019-09-10 06:41:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133692 states. [2019-09-10 06:41:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133692 states to 133692 states and 158679 transitions. [2019-09-10 06:41:11,652 INFO L78 Accepts]: Start accepts. Automaton has 133692 states and 158679 transitions. Word has length 114 [2019-09-10 06:41:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:11,653 INFO L475 AbstractCegarLoop]: Abstraction has 133692 states and 158679 transitions. [2019-09-10 06:41:11,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:41:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 133692 states and 158679 transitions. [2019-09-10 06:41:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:41:11,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:11,662 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:11,663 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:11,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1939635797, now seen corresponding path program 1 times [2019-09-10 06:41:11,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:11,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:11,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:11,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:11,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:14,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:14,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:41:14,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:14,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:41:14,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:41:14,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:41:14,530 INFO L87 Difference]: Start difference. First operand 133692 states and 158679 transitions. Second operand 14 states. [2019-09-10 06:41:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:16,518 INFO L93 Difference]: Finished difference Result 172022 states and 204066 transitions. [2019-09-10 06:41:16,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:41:16,518 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 114 [2019-09-10 06:41:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:16,796 INFO L225 Difference]: With dead ends: 172022 [2019-09-10 06:41:16,796 INFO L226 Difference]: Without dead ends: 171822 [2019-09-10 06:41:16,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=280, Invalid=842, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:41:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171822 states. [2019-09-10 06:41:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171822 to 131232. [2019-09-10 06:41:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131232 states. [2019-09-10 06:41:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131232 states to 131232 states and 155679 transitions. [2019-09-10 06:41:18,702 INFO L78 Accepts]: Start accepts. Automaton has 131232 states and 155679 transitions. Word has length 114 [2019-09-10 06:41:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:18,702 INFO L475 AbstractCegarLoop]: Abstraction has 131232 states and 155679 transitions. [2019-09-10 06:41:18,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:41:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 131232 states and 155679 transitions. [2019-09-10 06:41:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:41:18,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:18,711 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:18,711 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:18,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1751705136, now seen corresponding path program 1 times [2019-09-10 06:41:18,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:18,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:18,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:18,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:18,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:18,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:18,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:18,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:18,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:18,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:18,804 INFO L87 Difference]: Start difference. First operand 131232 states and 155679 transitions. Second operand 3 states. [2019-09-10 06:41:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:19,032 INFO L93 Difference]: Finished difference Result 90177 states and 104198 transitions. [2019-09-10 06:41:19,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:19,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 06:41:19,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:19,123 INFO L225 Difference]: With dead ends: 90177 [2019-09-10 06:41:19,124 INFO L226 Difference]: Without dead ends: 90116 [2019-09-10 06:41:19,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90116 states. [2019-09-10 06:41:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90116 to 87156. [2019-09-10 06:41:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87156 states. [2019-09-10 06:41:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87156 states to 87156 states and 101125 transitions. [2019-09-10 06:41:19,942 INFO L78 Accepts]: Start accepts. Automaton has 87156 states and 101125 transitions. Word has length 114 [2019-09-10 06:41:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:19,942 INFO L475 AbstractCegarLoop]: Abstraction has 87156 states and 101125 transitions. [2019-09-10 06:41:19,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 87156 states and 101125 transitions. [2019-09-10 06:41:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:41:19,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:19,949 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:19,949 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:19,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1746006088, now seen corresponding path program 1 times [2019-09-10 06:41:19,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:19,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:19,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:19,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:19,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:20,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:20,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:20,272 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:41:20,272 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [359], [462], [465], [468], [472], [475], [478], [482], [484], [487], [490], [493], [496], [520], [526], [1844], [1847], [1850], [1854], [1858], [2285], [2288], [2291], [2295], [2298], [2302], [2305], [2308], [2311], [2316], [3328], [3331], [3334], [3337], [3342], [3345], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3675], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3720], [3722], [3725], [3728], [3731], [3739], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:41:20,275 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:20,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:20,333 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:20,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:20,655 INFO L272 AbstractInterpreter]: Visited 107 different actions 416 times. Merged at 43 different actions 285 times. Widened at 13 different actions 38 times. Performed 1900 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1900 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 8 different actions. Largest state had 393 variables. [2019-09-10 06:41:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:20,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:20,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:20,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:41:20,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:20,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:41:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:21,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 2083 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:41:21,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:21,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:21,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:21,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:21,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:21,925 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:22,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:22,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:22,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:22,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:22,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:22,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:41:22,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2019-09-10 06:41:22,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:41:22,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:41:22,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:41:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:41:22,372 INFO L87 Difference]: Start difference. First operand 87156 states and 101125 transitions. Second operand 20 states. [2019-09-10 06:41:27,142 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-10 06:41:27,899 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-10 06:41:28,660 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2019-09-10 06:41:28,999 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-10 06:41:29,317 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2019-09-10 06:41:29,951 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2019-09-10 06:41:30,309 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-10 06:41:31,706 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 06:41:33,621 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 06:41:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:40,472 INFO L93 Difference]: Finished difference Result 169556 states and 194246 transitions. [2019-09-10 06:41:40,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-10 06:41:40,472 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 114 [2019-09-10 06:41:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:40,642 INFO L225 Difference]: With dead ends: 169556 [2019-09-10 06:41:40,642 INFO L226 Difference]: Without dead ends: 169556 [2019-09-10 06:41:40,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3953 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=2821, Invalid=11459, Unknown=0, NotChecked=0, Total=14280 [2019-09-10 06:41:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169556 states. [2019-09-10 06:41:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169556 to 90055. [2019-09-10 06:41:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90055 states. [2019-09-10 06:41:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90055 states to 90055 states and 104363 transitions. [2019-09-10 06:41:42,184 INFO L78 Accepts]: Start accepts. Automaton has 90055 states and 104363 transitions. Word has length 114 [2019-09-10 06:41:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:42,185 INFO L475 AbstractCegarLoop]: Abstraction has 90055 states and 104363 transitions. [2019-09-10 06:41:42,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:41:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 90055 states and 104363 transitions. [2019-09-10 06:41:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:41:42,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:42,191 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:42,191 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:42,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1420870122, now seen corresponding path program 1 times [2019-09-10 06:41:42,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:42,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:42,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:42,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:42,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:41:42,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:42,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:41:42,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:42,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:41:42,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:41:42,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:41:42,691 INFO L87 Difference]: Start difference. First operand 90055 states and 104363 transitions. Second operand 11 states. [2019-09-10 06:41:43,598 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-09-10 06:41:43,901 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-09-10 06:41:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:44,918 INFO L93 Difference]: Finished difference Result 207530 states and 240313 transitions. [2019-09-10 06:41:44,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:41:44,918 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 114 [2019-09-10 06:41:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:45,139 INFO L225 Difference]: With dead ends: 207530 [2019-09-10 06:41:45,139 INFO L226 Difference]: Without dead ends: 207530 [2019-09-10 06:41:45,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:41:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207530 states. [2019-09-10 06:41:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207530 to 89489. [2019-09-10 06:41:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89489 states. [2019-09-10 06:41:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89489 states to 89489 states and 103724 transitions. [2019-09-10 06:41:47,178 INFO L78 Accepts]: Start accepts. Automaton has 89489 states and 103724 transitions. Word has length 114 [2019-09-10 06:41:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:47,179 INFO L475 AbstractCegarLoop]: Abstraction has 89489 states and 103724 transitions. [2019-09-10 06:41:47,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:41:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 89489 states and 103724 transitions. [2019-09-10 06:41:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:41:47,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:47,184 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:47,184 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:47,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:47,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1698734734, now seen corresponding path program 1 times [2019-09-10 06:41:47,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:47,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:47,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:47,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:47,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:47,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:47,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:41:47,537 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [359], [462], [465], [468], [472], [475], [478], [482], [484], [487], [490], [493], [498], [518], [520], [526], [1844], [1847], [1850], [1854], [1858], [2285], [2288], [2291], [2295], [2298], [2302], [2305], [2308], [2311], [2316], [3328], [3331], [3334], [3337], [3342], [3345], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3675], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3720], [3722], [3725], [3728], [3731], [3739], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:41:47,540 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:47,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:47,607 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:47,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:47,929 INFO L272 AbstractInterpreter]: Visited 108 different actions 427 times. Merged at 43 different actions 294 times. Widened at 14 different actions 39 times. Performed 1973 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1973 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 14 different actions. Largest state had 393 variables. [2019-09-10 06:41:47,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:47,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:47,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:47,930 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:41:47,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:47,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:41:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:48,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:41:48,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:48,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:49,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:49,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:49,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:49,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:49,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:49,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:41:49,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 25 [2019-09-10 06:41:49,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:41:49,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:41:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:41:49,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:41:49,449 INFO L87 Difference]: Start difference. First operand 89489 states and 103724 transitions. Second operand 19 states. [2019-09-10 06:41:49,797 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 06:41:50,057 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 06:41:50,227 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 06:41:53,444 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-09-10 06:41:54,064 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-09-10 06:41:54,307 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 06:41:54,737 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-10 06:41:55,227 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2019-09-10 06:41:55,835 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 06:41:56,190 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 06:41:56,387 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 06:41:57,128 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 06:41:57,430 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 06:41:57,987 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-10 06:41:58,661 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 06:41:58,857 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 06:41:59,035 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 06:41:59,237 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 06:41:59,522 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 06:41:59,978 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 06:42:01,312 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 06:42:02,016 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 06:42:02,677 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 06:42:03,237 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 06:42:03,747 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-09-10 06:42:04,549 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 06:42:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:04,855 INFO L93 Difference]: Finished difference Result 149666 states and 170825 transitions. [2019-09-10 06:42:04,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 06:42:04,856 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 115 [2019-09-10 06:42:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:05,067 INFO L225 Difference]: With dead ends: 149666 [2019-09-10 06:42:05,067 INFO L226 Difference]: Without dead ends: 149666 [2019-09-10 06:42:05,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 204 SyntacticMatches, 13 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1208, Invalid=3904, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 06:42:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149666 states. [2019-09-10 06:42:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149666 to 101178. [2019-09-10 06:42:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101178 states. [2019-09-10 06:42:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101178 states to 101178 states and 117121 transitions. [2019-09-10 06:42:06,147 INFO L78 Accepts]: Start accepts. Automaton has 101178 states and 117121 transitions. Word has length 115 [2019-09-10 06:42:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:06,147 INFO L475 AbstractCegarLoop]: Abstraction has 101178 states and 117121 transitions. [2019-09-10 06:42:06,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:42:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 101178 states and 117121 transitions. [2019-09-10 06:42:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:42:06,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:06,152 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:06,152 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:06,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:06,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1977970217, now seen corresponding path program 1 times [2019-09-10 06:42:06,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:06,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:06,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:06,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:06,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:06,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 06:42:06,888 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [359], [462], [465], [468], [472], [475], [478], [482], [484], [487], [490], [493], [498], [518], [520], [526], [1844], [1847], [1850], [1854], [1858], [2285], [2288], [2291], [2295], [2298], [2302], [2305], [2308], [2311], [2316], [3328], [3331], [3334], [3337], [3342], [3345], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3657], [3673], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3720], [3722], [3725], [3728], [3731], [3739], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:42:06,891 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:06,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:06,980 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:07,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:07,780 INFO L272 AbstractInterpreter]: Visited 109 different actions 527 times. Merged at 44 different actions 387 times. Widened at 17 different actions 74 times. Performed 2298 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2298 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 14 different actions. Largest state had 393 variables. [2019-09-10 06:42:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:07,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:07,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:07,781 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:07,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:07,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:08,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 2085 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:42:08,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:08,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:08,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:08,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:08,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:10,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:10,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:10,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:10,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:10,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:10,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 26 [2019-09-10 06:42:10,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:10,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:42:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:42:10,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:42:10,473 INFO L87 Difference]: Start difference. First operand 101178 states and 117121 transitions. Second operand 23 states. [2019-09-10 06:42:15,224 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-09-10 06:42:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:16,627 INFO L93 Difference]: Finished difference Result 220585 states and 255058 transitions. [2019-09-10 06:42:16,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:42:16,628 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 116 [2019-09-10 06:42:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:16,846 INFO L225 Difference]: With dead ends: 220585 [2019-09-10 06:42:16,846 INFO L226 Difference]: Without dead ends: 220585 [2019-09-10 06:42:16,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 202 SyntacticMatches, 21 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=289, Invalid=1433, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:42:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220585 states. [2019-09-10 06:42:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220585 to 101000. [2019-09-10 06:42:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101000 states. [2019-09-10 06:42:18,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101000 states to 101000 states and 116916 transitions. [2019-09-10 06:42:18,800 INFO L78 Accepts]: Start accepts. Automaton has 101000 states and 116916 transitions. Word has length 116 [2019-09-10 06:42:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:18,801 INFO L475 AbstractCegarLoop]: Abstraction has 101000 states and 116916 transitions. [2019-09-10 06:42:18,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:42:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 101000 states and 116916 transitions. [2019-09-10 06:42:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:42:18,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:18,806 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:18,806 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1376102527, now seen corresponding path program 1 times [2019-09-10 06:42:18,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:18,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:18,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:42:18,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:18,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:42:18,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:18,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:42:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:42:18,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:42:18,986 INFO L87 Difference]: Start difference. First operand 101000 states and 116916 transitions. Second operand 9 states. [2019-09-10 06:42:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:20,642 INFO L93 Difference]: Finished difference Result 195900 states and 226138 transitions. [2019-09-10 06:42:20,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:42:20,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 06:42:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:20,836 INFO L225 Difference]: With dead ends: 195900 [2019-09-10 06:42:20,836 INFO L226 Difference]: Without dead ends: 195900 [2019-09-10 06:42:20,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:42:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195900 states. [2019-09-10 06:42:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195900 to 101000. [2019-09-10 06:42:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101000 states. [2019-09-10 06:42:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101000 states to 101000 states and 116915 transitions. [2019-09-10 06:42:22,568 INFO L78 Accepts]: Start accepts. Automaton has 101000 states and 116915 transitions. Word has length 116 [2019-09-10 06:42:22,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:22,568 INFO L475 AbstractCegarLoop]: Abstraction has 101000 states and 116915 transitions. [2019-09-10 06:42:22,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:42:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 101000 states and 116915 transitions. [2019-09-10 06:42:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:42:22,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:22,574 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:22,574 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1717006596, now seen corresponding path program 1 times [2019-09-10 06:42:22,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:22,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:22,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:22,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:22,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:42:22,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:22,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:42:22,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:22,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:42:22,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:42:22,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:42:22,735 INFO L87 Difference]: Start difference. First operand 101000 states and 116915 transitions. Second operand 9 states. [2019-09-10 06:42:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:24,602 INFO L93 Difference]: Finished difference Result 221129 states and 256565 transitions. [2019-09-10 06:42:24,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:42:24,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 06:42:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:24,832 INFO L225 Difference]: With dead ends: 221129 [2019-09-10 06:42:24,832 INFO L226 Difference]: Without dead ends: 221129 [2019-09-10 06:42:24,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:42:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221129 states. [2019-09-10 06:42:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221129 to 101000. [2019-09-10 06:42:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101000 states. [2019-09-10 06:42:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101000 states to 101000 states and 116913 transitions. [2019-09-10 06:42:26,603 INFO L78 Accepts]: Start accepts. Automaton has 101000 states and 116913 transitions. Word has length 116 [2019-09-10 06:42:26,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:26,603 INFO L475 AbstractCegarLoop]: Abstraction has 101000 states and 116913 transitions. [2019-09-10 06:42:26,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:42:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 101000 states and 116913 transitions. [2019-09-10 06:42:26,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:42:26,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:26,609 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:26,609 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:26,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:26,609 INFO L82 PathProgramCache]: Analyzing trace with hash -273199969, now seen corresponding path program 1 times [2019-09-10 06:42:26,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:26,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:26,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:26,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:26,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:42:26,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:26,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:42:26,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:26,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:42:26,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:42:26,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:42:26,683 INFO L87 Difference]: Start difference. First operand 101000 states and 116913 transitions. Second operand 4 states. [2019-09-10 06:42:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:27,353 INFO L93 Difference]: Finished difference Result 117718 states and 136405 transitions. [2019-09-10 06:42:27,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:42:27,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-10 06:42:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:27,450 INFO L225 Difference]: With dead ends: 117718 [2019-09-10 06:42:27,450 INFO L226 Difference]: Without dead ends: 117718 [2019-09-10 06:42:27,450 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:42:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117718 states. [2019-09-10 06:42:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117718 to 100882. [2019-09-10 06:42:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100882 states. [2019-09-10 06:42:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100882 states to 100882 states and 116764 transitions. [2019-09-10 06:42:28,404 INFO L78 Accepts]: Start accepts. Automaton has 100882 states and 116764 transitions. Word has length 117 [2019-09-10 06:42:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:28,405 INFO L475 AbstractCegarLoop]: Abstraction has 100882 states and 116764 transitions. [2019-09-10 06:42:28,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:42:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 100882 states and 116764 transitions. [2019-09-10 06:42:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:42:28,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:28,411 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:28,411 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:28,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1324649058, now seen corresponding path program 1 times [2019-09-10 06:42:28,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:28,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:28,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:28,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:28,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:28,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:28,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:42:28,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:28,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:42:28,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:42:28,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:42:28,709 INFO L87 Difference]: Start difference. First operand 100882 states and 116764 transitions. Second operand 12 states. [2019-09-10 06:42:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:33,060 INFO L93 Difference]: Finished difference Result 150711 states and 175330 transitions. [2019-09-10 06:42:33,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:42:33,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 117 [2019-09-10 06:42:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:33,211 INFO L225 Difference]: With dead ends: 150711 [2019-09-10 06:42:33,211 INFO L226 Difference]: Without dead ends: 150711 [2019-09-10 06:42:33,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=284, Invalid=708, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:42:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150711 states. [2019-09-10 06:42:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150711 to 106473. [2019-09-10 06:42:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106473 states. [2019-09-10 06:42:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106473 states to 106473 states and 123261 transitions. [2019-09-10 06:42:34,314 INFO L78 Accepts]: Start accepts. Automaton has 106473 states and 123261 transitions. Word has length 117 [2019-09-10 06:42:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:34,314 INFO L475 AbstractCegarLoop]: Abstraction has 106473 states and 123261 transitions. [2019-09-10 06:42:34,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:42:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 106473 states and 123261 transitions. [2019-09-10 06:42:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:42:34,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:34,319 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:34,319 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash 35830377, now seen corresponding path program 1 times [2019-09-10 06:42:34,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:34,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:34,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:34,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:42:34,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:34,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:42:34,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:34,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:42:34,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:42:34,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:42:34,475 INFO L87 Difference]: Start difference. First operand 106473 states and 123261 transitions. Second operand 9 states. [2019-09-10 06:42:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:36,535 INFO L93 Difference]: Finished difference Result 140758 states and 162476 transitions. [2019-09-10 06:42:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:42:36,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 06:42:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:36,686 INFO L225 Difference]: With dead ends: 140758 [2019-09-10 06:42:36,687 INFO L226 Difference]: Without dead ends: 140758 [2019-09-10 06:42:36,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:42:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140758 states. [2019-09-10 06:42:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140758 to 106473. [2019-09-10 06:42:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106473 states. [2019-09-10 06:42:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106473 states to 106473 states and 123260 transitions. [2019-09-10 06:42:37,662 INFO L78 Accepts]: Start accepts. Automaton has 106473 states and 123260 transitions. Word has length 117 [2019-09-10 06:42:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:37,662 INFO L475 AbstractCegarLoop]: Abstraction has 106473 states and 123260 transitions. [2019-09-10 06:42:37,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:42:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 106473 states and 123260 transitions. [2019-09-10 06:42:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:42:37,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:37,668 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:37,668 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:37,668 INFO L82 PathProgramCache]: Analyzing trace with hash 123503400, now seen corresponding path program 1 times [2019-09-10 06:42:37,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:37,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:37,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:37,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:37,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:42:37,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:37,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:42:37,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:37,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:42:37,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:42:37,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:42:37,739 INFO L87 Difference]: Start difference. First operand 106473 states and 123260 transitions. Second operand 4 states. [2019-09-10 06:42:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:38,484 INFO L93 Difference]: Finished difference Result 120909 states and 140137 transitions. [2019-09-10 06:42:38,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:42:38,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-10 06:42:38,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:38,621 INFO L225 Difference]: With dead ends: 120909 [2019-09-10 06:42:38,621 INFO L226 Difference]: Without dead ends: 120909 [2019-09-10 06:42:38,621 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:42:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120909 states. [2019-09-10 06:42:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120909 to 106457. [2019-09-10 06:42:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106457 states. [2019-09-10 06:42:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106457 states to 106457 states and 123240 transitions. [2019-09-10 06:42:40,130 INFO L78 Accepts]: Start accepts. Automaton has 106457 states and 123240 transitions. Word has length 118 [2019-09-10 06:42:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:40,130 INFO L475 AbstractCegarLoop]: Abstraction has 106457 states and 123240 transitions. [2019-09-10 06:42:40,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:42:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 106457 states and 123240 transitions. [2019-09-10 06:42:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:42:40,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:40,136 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:40,136 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash -927945689, now seen corresponding path program 1 times [2019-09-10 06:42:40,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:40,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:40,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:40,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:40,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:40,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:40,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:40,356 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 06:42:40,358 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [90], [93], [96], [99], [102], [106], [109], [112], [115], [118], [123], [126], [129], [132], [135], [140], [166], [169], [170], [172], [175], [178], [199], [201], [203], [240], [242], [248], [1540], [1543], [1546], [1549], [1552], [1570], [1576], [1928], [1931], [1934], [1938], [1941], [1969], [1971], [1974], [1977], [1980], [1988], [1992], [3328], [3331], [3352], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:42:40,361 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:40,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:40,465 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:40,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:40,913 INFO L272 AbstractInterpreter]: Visited 111 different actions 467 times. Merged at 39 different actions 324 times. Widened at 15 different actions 68 times. Performed 2027 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2027 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 393 variables. [2019-09-10 06:42:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:40,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:40,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:40,913 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:40,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:40,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:41,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 2078 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:42:41,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:41,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:41,605 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:41,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:41,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:42,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:42,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2019-09-10 06:42:42,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:42,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:42:42,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:42:42,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:42:42,017 INFO L87 Difference]: Start difference. First operand 106457 states and 123240 transitions. Second operand 19 states. [2019-09-10 06:42:48,160 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 06:42:49,303 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 06:42:50,369 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 06:42:51,100 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-10 06:42:51,711 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 06:42:51,878 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 06:42:52,197 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-10 06:42:52,345 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-10 06:42:52,907 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 06:42:53,193 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 06:42:53,354 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-10 06:42:53,714 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 06:42:54,647 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-09-10 06:42:54,913 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-10 06:42:55,384 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-09-10 06:42:56,031 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 06:42:56,924 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 06:42:57,211 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-10 06:42:57,379 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:42:57,524 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 06:42:57,668 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 06:42:57,953 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 06:42:58,799 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 06:42:58,950 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-10 06:42:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:59,834 INFO L93 Difference]: Finished difference Result 277806 states and 319788 transitions. [2019-09-10 06:42:59,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-10 06:42:59,834 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 118 [2019-09-10 06:42:59,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:00,145 INFO L225 Difference]: With dead ends: 277806 [2019-09-10 06:43:00,145 INFO L226 Difference]: Without dead ends: 277806 [2019-09-10 06:43:00,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4023 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=2178, Invalid=11628, Unknown=0, NotChecked=0, Total=13806 [2019-09-10 06:43:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277806 states. [2019-09-10 06:43:04,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277806 to 109808. [2019-09-10 06:43:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109808 states. [2019-09-10 06:43:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109808 states to 109808 states and 127044 transitions. [2019-09-10 06:43:04,379 INFO L78 Accepts]: Start accepts. Automaton has 109808 states and 127044 transitions. Word has length 118 [2019-09-10 06:43:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:04,380 INFO L475 AbstractCegarLoop]: Abstraction has 109808 states and 127044 transitions. [2019-09-10 06:43:04,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:43:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 109808 states and 127044 transitions. [2019-09-10 06:43:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 06:43:04,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:04,385 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:43:04,385 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:04,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:04,386 INFO L82 PathProgramCache]: Analyzing trace with hash 420279899, now seen corresponding path program 1 times [2019-09-10 06:43:04,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:04,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:04,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:04,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:04,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:04,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:04,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:43:04,717 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-09-10 06:43:04,717 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [90], [93], [96], [99], [102], [106], [109], [112], [115], [118], [121], [166], [169], [170], [172], [175], [178], [181], [184], [187], [201], [203], [253], [259], [288], [291], [294], [297], [300], [346], [352], [1626], [1629], [1632], [1635], [1640], [1643], [1646], [1649], [1653], [1656], [1684], [1686], [1689], [1692], [1695], [1703], [1707], [3328], [3331], [3334], [3337], [3342], [3345], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3675], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:43:04,721 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:43:04,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:43:04,789 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:43:05,079 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:43:05,079 INFO L272 AbstractInterpreter]: Visited 112 different actions 439 times. Merged at 41 different actions 299 times. Widened at 15 different actions 53 times. Performed 2037 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2037 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 13 different actions. Largest state had 393 variables. [2019-09-10 06:43:05,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:05,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:43:05,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:05,080 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:43:05,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:05,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:43:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:05,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:43:05,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:43:05,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:05,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:05,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:43:06,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:07,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:07,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:43:07,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 06:43:07,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:43:07,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:43:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:43:07,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:43:07,544 INFO L87 Difference]: Start difference. First operand 109808 states and 127044 transitions. Second operand 20 states. [2019-09-10 06:43:07,757 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 06:43:09,672 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:43:10,259 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:43:12,453 WARN L188 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:43:12,798 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:43:13,233 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:43:13,537 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:43:14,129 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:43:14,612 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:43:15,022 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 06:43:15,293 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:43:15,603 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:43:15,785 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:43:16,126 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 06:43:16,535 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:43:16,790 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 06:43:17,359 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:43:17,654 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:43:17,993 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:43:18,423 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 06:43:18,894 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:43:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:19,183 INFO L93 Difference]: Finished difference Result 166544 states and 191103 transitions. [2019-09-10 06:43:19,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:43:19,184 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2019-09-10 06:43:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:19,360 INFO L225 Difference]: With dead ends: 166544 [2019-09-10 06:43:19,360 INFO L226 Difference]: Without dead ends: 166544 [2019-09-10 06:43:19,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 208 SyntacticMatches, 17 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:43:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166544 states. [2019-09-10 06:43:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166544 to 108231. [2019-09-10 06:43:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108231 states. [2019-09-10 06:43:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108231 states to 108231 states and 125173 transitions. [2019-09-10 06:43:20,443 INFO L78 Accepts]: Start accepts. Automaton has 108231 states and 125173 transitions. Word has length 119 [2019-09-10 06:43:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:20,444 INFO L475 AbstractCegarLoop]: Abstraction has 108231 states and 125173 transitions. [2019-09-10 06:43:20,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:43:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 108231 states and 125173 transitions. [2019-09-10 06:43:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 06:43:20,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:20,448 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:43:20,448 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1530202173, now seen corresponding path program 1 times [2019-09-10 06:43:20,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:20,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:20,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:20,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:20,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:43:20,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:43:20,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:43:20,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:43:20,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:43:20,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:43:20,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:43:20,596 INFO L87 Difference]: Start difference. First operand 108231 states and 125173 transitions. Second operand 9 states. [2019-09-10 06:43:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:22,538 INFO L93 Difference]: Finished difference Result 160395 states and 185027 transitions. [2019-09-10 06:43:22,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:43:22,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 06:43:22,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:22,680 INFO L225 Difference]: With dead ends: 160395 [2019-09-10 06:43:22,680 INFO L226 Difference]: Without dead ends: 160395 [2019-09-10 06:43:22,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:43:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160395 states. [2019-09-10 06:43:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160395 to 108231. [2019-09-10 06:43:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108231 states. [2019-09-10 06:43:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108231 states to 108231 states and 125171 transitions. [2019-09-10 06:43:23,707 INFO L78 Accepts]: Start accepts. Automaton has 108231 states and 125171 transitions. Word has length 119 [2019-09-10 06:43:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:23,707 INFO L475 AbstractCegarLoop]: Abstraction has 108231 states and 125171 transitions. [2019-09-10 06:43:23,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:43:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 108231 states and 125171 transitions. [2019-09-10 06:43:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 06:43:23,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:23,711 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:43:23,711 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1511226291, now seen corresponding path program 1 times [2019-09-10 06:43:23,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:23,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:23,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:23,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:23,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:43:23,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-09-10 06:43:23,968 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [90], [93], [96], [99], [102], [106], [109], [112], [115], [118], [121], [166], [169], [170], [172], [175], [178], [181], [184], [187], [201], [203], [253], [259], [288], [291], [294], [297], [302], [305], [308], [311], [314], [317], [335], [341], [689], [692], [695], [699], [702], [730], [732], [735], [738], [741], [749], [753], [3328], [3331], [3352], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:43:23,970 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:43:23,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:43:24,034 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:43:24,359 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:43:24,360 INFO L272 AbstractInterpreter]: Visited 112 different actions 486 times. Merged at 41 different actions 342 times. Widened at 15 different actions 68 times. Performed 2091 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2091 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 393 variables. [2019-09-10 06:43:24,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:24,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:43:24,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:24,360 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:43:24,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:24,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:43:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:24,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:43:24,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:43:24,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:24,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:24,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:24,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:25,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:43:25,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:25,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:25,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:25,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:25,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:25,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:25,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:25,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:25,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:25,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:27,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:43:27,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2019-09-10 06:43:27,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:43:27,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:43:27,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:43:27,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:43:27,418 INFO L87 Difference]: Start difference. First operand 108231 states and 125171 transitions. Second operand 20 states. [2019-09-10 06:43:32,147 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-10 06:43:32,833 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 06:43:33,029 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:43:33,971 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 06:43:34,950 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 06:43:35,176 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:43:35,316 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 06:43:35,618 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:43:36,293 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:43:36,560 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:43:36,762 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 06:43:37,185 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 06:43:37,343 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:43:37,497 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 06:43:38,212 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 06:43:38,832 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 06:43:39,167 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 06:43:39,401 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 06:43:39,952 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 06:43:40,145 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 06:43:40,295 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:43:40,805 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-09-10 06:43:41,012 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 06:43:41,223 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:43:41,410 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:43:42,282 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-10 06:43:42,979 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 06:43:43,142 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 06:43:43,667 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 06:43:43,830 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 06:43:44,151 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 06:43:44,344 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 06:43:44,933 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-10 06:43:45,070 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 06:43:45,259 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-10 06:43:45,445 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 06:43:46,935 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 06:43:47,275 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 06:43:47,827 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-09-10 06:43:48,120 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 06:43:48,626 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 06:43:48,784 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 06:43:48,987 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 06:43:49,171 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 06:43:49,778 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 06:43:49,954 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 06:43:50,130 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 06:43:50,733 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 06:43:50,911 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:43:51,107 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 06:43:51,303 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 06:43:51,463 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 06:43:51,607 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 06:43:51,779 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 06:43:51,941 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 06:43:52,103 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 06:43:53,225 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 06:43:53,429 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 06:43:53,741 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 06:43:53,918 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 06:43:54,132 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:43:54,446 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 06:43:54,631 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 06:43:55,029 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 06:43:55,250 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-10 06:43:55,475 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:43:55,787 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 06:43:55,962 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 06:43:56,158 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 06:43:56,325 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 06:43:56,542 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:43:56,716 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 06:43:57,030 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 06:43:57,331 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 06:43:57,560 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 06:43:57,775 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 06:43:57,978 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:43:58,189 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-10 06:43:58,397 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 06:43:58,578 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-10 06:43:58,759 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 06:43:58,955 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 06:43:59,151 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 06:43:59,295 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:43:59,436 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 06:43:59,622 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 06:43:59,799 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:43:59,986 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 06:44:00,259 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 06:44:00,563 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:44:00,777 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:44:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:01,598 INFO L93 Difference]: Finished difference Result 236537 states and 271803 transitions. [2019-09-10 06:44:01,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-09-10 06:44:01,598 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2019-09-10 06:44:01,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:01,852 INFO L225 Difference]: With dead ends: 236537 [2019-09-10 06:44:01,852 INFO L226 Difference]: Without dead ends: 236537 [2019-09-10 06:44:01,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15835 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=6106, Invalid=38204, Unknown=0, NotChecked=0, Total=44310 [2019-09-10 06:44:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236537 states. [2019-09-10 06:44:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236537 to 109169. [2019-09-10 06:44:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109169 states. [2019-09-10 06:44:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109169 states to 109169 states and 126183 transitions. [2019-09-10 06:44:03,252 INFO L78 Accepts]: Start accepts. Automaton has 109169 states and 126183 transitions. Word has length 119 [2019-09-10 06:44:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:03,252 INFO L475 AbstractCegarLoop]: Abstraction has 109169 states and 126183 transitions. [2019-09-10 06:44:03,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:44:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 109169 states and 126183 transitions. [2019-09-10 06:44:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:44:03,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:03,256 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:03,256 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:03,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2029088770, now seen corresponding path program 1 times [2019-09-10 06:44:03,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:03,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:03,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:03,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:03,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:44:03,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:03,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:44:03,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:03,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:44:03,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:44:03,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:44:03,319 INFO L87 Difference]: Start difference. First operand 109169 states and 126183 transitions. Second operand 4 states. [2019-09-10 06:44:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:04,024 INFO L93 Difference]: Finished difference Result 130202 states and 150711 transitions. [2019-09-10 06:44:04,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:44:04,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-10 06:44:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:04,132 INFO L225 Difference]: With dead ends: 130202 [2019-09-10 06:44:04,132 INFO L226 Difference]: Without dead ends: 130202 [2019-09-10 06:44:04,133 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:44:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130202 states. [2019-09-10 06:44:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130202 to 108940. [2019-09-10 06:44:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108940 states. [2019-09-10 06:44:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108940 states to 108940 states and 125904 transitions. [2019-09-10 06:44:05,502 INFO L78 Accepts]: Start accepts. Automaton has 108940 states and 125904 transitions. Word has length 120 [2019-09-10 06:44:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:05,502 INFO L475 AbstractCegarLoop]: Abstraction has 108940 states and 125904 transitions. [2019-09-10 06:44:05,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:44:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 108940 states and 125904 transitions. [2019-09-10 06:44:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:44:05,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:05,506 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:05,506 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:05,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1505768099, now seen corresponding path program 1 times [2019-09-10 06:44:05,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:05,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:05,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:05,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:05,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:05,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:05,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:44:05,809 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2019-09-10 06:44:05,810 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [90], [93], [96], [99], [102], [106], [109], [112], [115], [118], [121], [166], [169], [170], [172], [175], [178], [199], [201], [203], [253], [259], [288], [291], [294], [297], [300], [346], [352], [1626], [1629], [1632], [1635], [1638], [1714], [1720], [2054], [2057], [2060], [2064], [2067], [2071], [2074], [2077], [2080], [2085], [3328], [3331], [3334], [3337], [3342], [3345], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:44:05,811 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:44:05,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:44:05,865 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:44:06,193 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:44:06,194 INFO L272 AbstractInterpreter]: Visited 113 different actions 417 times. Merged at 42 different actions 278 times. Widened at 15 different actions 41 times. Performed 1943 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1943 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 394 variables. [2019-09-10 06:44:06,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:06,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:44:06,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:06,194 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:44:06,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:06,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:44:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:06,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 2086 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 06:44:06,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:44:06,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:06,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:07,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:07,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:07,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:07,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:44:08,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:08,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:08,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:08,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:08,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:08,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:08,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:08,870 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 06:44:09,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:09,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:44:09,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:44:09,877 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-09-10 06:44:10,413 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-09-10 06:44:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:10,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:44:10,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2019-09-10 06:44:10,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:44:10,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:44:10,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:44:10,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:44:10,550 INFO L87 Difference]: Start difference. First operand 108940 states and 125904 transitions. Second operand 28 states. [2019-09-10 06:44:10,720 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 06:44:11,847 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:44:16,255 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 06:44:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:25,151 INFO L93 Difference]: Finished difference Result 284801 states and 329816 transitions. [2019-09-10 06:44:25,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:44:25,152 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 120 [2019-09-10 06:44:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:25,468 INFO L225 Difference]: With dead ends: 284801 [2019-09-10 06:44:25,468 INFO L226 Difference]: Without dead ends: 284801 [2019-09-10 06:44:25,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 198 SyntacticMatches, 18 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=439, Invalid=3101, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:44:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284801 states. [2019-09-10 06:44:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284801 to 109049. [2019-09-10 06:44:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109049 states. [2019-09-10 06:44:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109049 states to 109049 states and 126022 transitions. [2019-09-10 06:44:28,011 INFO L78 Accepts]: Start accepts. Automaton has 109049 states and 126022 transitions. Word has length 120 [2019-09-10 06:44:28,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:28,011 INFO L475 AbstractCegarLoop]: Abstraction has 109049 states and 126022 transitions. [2019-09-10 06:44:28,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:44:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 109049 states and 126022 transitions. [2019-09-10 06:44:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:44:28,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:28,015 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:28,015 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:28,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2082951776, now seen corresponding path program 1 times [2019-09-10 06:44:28,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:28,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:28,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:28,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:28,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:28,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:28,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:44:28,349 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2019-09-10 06:44:28,350 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [90], [93], [96], [99], [102], [106], [109], [112], [115], [118], [123], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [251], [253], [259], [288], [291], [294], [297], [302], [305], [308], [311], [314], [317], [335], [341], [689], [692], [695], [699], [702], [730], [732], [735], [738], [741], [749], [753], [3328], [3331], [3352], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3657], [3660], [3663], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-09-10 06:44:28,352 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:44:28,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:44:28,406 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:44:28,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:44:28,679 INFO L272 AbstractInterpreter]: Visited 113 different actions 437 times. Merged at 41 different actions 297 times. Widened at 16 different actions 52 times. Performed 1940 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1940 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 11 different actions. Largest state had 393 variables. [2019-09-10 06:44:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:28,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:44:28,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:28,679 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:28,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:28,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:44:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:29,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:44:29,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:44:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:29,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:44:30,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:30,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:30,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:30,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:44:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:30,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:44:30,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 29 [2019-09-10 06:44:30,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:44:30,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:44:30,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:44:30,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:44:30,896 INFO L87 Difference]: Start difference. First operand 109049 states and 126022 transitions. Second operand 20 states. [2019-09-10 06:44:31,370 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 06:44:31,531 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 06:44:31,777 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 06:44:32,006 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 06:44:32,319 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 06:44:32,648 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-10 06:44:33,129 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-10 06:44:33,532 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:44:33,765 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-10 06:44:34,326 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 06:44:34,799 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 06:44:35,213 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 06:44:36,220 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-10 06:44:36,540 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-10 06:44:37,324 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 06:44:37,599 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-09-10 06:44:38,390 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 06:44:38,568 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 06:44:38,984 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 06:44:39,450 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:44:39,755 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:44:40,357 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:44:40,748 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 06:44:41,278 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 06:44:41,541 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:44:43,204 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 06:44:43,566 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-09-10 06:44:44,010 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:44:44,332 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-09-10 06:44:44,646 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2019-09-10 06:44:45,037 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-09-10 06:44:45,354 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-09-10 06:44:45,582 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 06:44:45,893 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 62 [2019-09-10 06:44:46,119 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:44:46,788 WARN L188 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-09-10 06:44:47,039 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-10 06:44:47,307 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 06:44:48,475 WARN L188 SmtUtils]: Spent 986.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-10 06:44:48,832 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 06:44:49,163 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:44:49,458 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:44:49,726 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:44:50,573 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 06:44:50,798 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-09-10 06:44:51,523 WARN L188 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 62 [2019-09-10 06:44:51,784 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-09-10 06:44:52,027 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 06:44:52,245 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:44:52,572 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:44:52,920 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 06:44:53,222 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:44:53,556 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:44:53,940 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:44:54,388 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 06:44:54,810 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-09-10 06:44:55,318 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 06:44:55,930 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-09-10 06:44:56,599 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-09-10 06:44:57,258 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 62 [2019-09-10 06:44:57,725 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-10 06:44:58,110 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 06:44:58,541 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2019-09-10 06:45:00,049 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 06:45:00,372 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2019-09-10 06:45:01,027 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 06:45:01,602 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 06:45:02,233 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2019-09-10 06:45:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:03,809 INFO L93 Difference]: Finished difference Result 513698 states and 590358 transitions. [2019-09-10 06:45:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-10 06:45:03,810 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 120 [2019-09-10 06:45:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:03,810 INFO L225 Difference]: With dead ends: 513698 [2019-09-10 06:45:03,810 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 06:45:03,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 254 SyntacticMatches, 16 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=1850, Invalid=7656, Unknown=0, NotChecked=0, Total=9506 [2019-09-10 06:45:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 06:45:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 06:45:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 06:45:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 06:45:03,812 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2019-09-10 06:45:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:03,813 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 06:45:03,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:45:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 06:45:03,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 06:45:03,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 06:45:03 BoogieIcfgContainer [2019-09-10 06:45:03,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 06:45:03,820 INFO L168 Benchmark]: Toolchain (without parser) took 430365.07 ms. Allocated memory was 134.2 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 83.5 MB in the beginning and 593.9 MB in the end (delta: -510.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-09-10 06:45:03,820 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-10 06:45:03,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1708.06 ms. Allocated memory was 134.2 MB in the beginning and 222.8 MB in the end (delta: 88.6 MB). Free memory was 83.3 MB in the beginning and 127.2 MB in the end (delta: -44.0 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-09-10 06:45:03,821 INFO L168 Benchmark]: Boogie Preprocessor took 311.10 ms. Allocated memory is still 222.8 MB. Free memory was 127.2 MB in the beginning and 114.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-09-10 06:45:03,821 INFO L168 Benchmark]: RCFGBuilder took 3925.45 ms. Allocated memory was 222.8 MB in the beginning and 341.3 MB in the end (delta: 118.5 MB). Free memory was 114.1 MB in the beginning and 187.0 MB in the end (delta: -72.9 MB). Peak memory consumption was 84.4 MB. Max. memory is 7.1 GB. [2019-09-10 06:45:03,822 INFO L168 Benchmark]: TraceAbstraction took 424415.86 ms. Allocated memory was 341.3 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 187.0 MB in the beginning and 593.9 MB in the end (delta: -406.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-09-10 06:45:03,823 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1708.06 ms. Allocated memory was 134.2 MB in the beginning and 222.8 MB in the end (delta: 88.6 MB). Free memory was 83.3 MB in the beginning and 127.2 MB in the end (delta: -44.0 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 311.10 ms. Allocated memory is still 222.8 MB. Free memory was 127.2 MB in the beginning and 114.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3925.45 ms. Allocated memory was 222.8 MB in the beginning and 341.3 MB in the end (delta: 118.5 MB). Free memory was 114.1 MB in the beginning and 187.0 MB in the end (delta: -72.9 MB). Peak memory consumption was 84.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 424415.86 ms. Allocated memory was 341.3 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 187.0 MB in the beginning and 593.9 MB in the end (delta: -406.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 766]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1901]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 435]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5437]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3524]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1380]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 1195 locations, 6 error locations. SAFE Result, 424.3s OverallTime, 62 OverallIterations, 2 TraceHistogramMax, 286.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35627 SDtfs, 125547 SDslu, 150003 SDs, 0 SdLazy, 83224 SolverSat, 4665 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 116.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5120 GetRequests, 3387 SyntacticMatches, 146 SemanticMatches, 1587 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36866 ImplicationChecksByTransitivity, 149.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142008occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.1s AbstIntTime, 16 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 81.0s AutomataMinimizationTime, 62 MinimizatonAttempts, 2744928 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.9s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 37.9s InterpolantComputationTime, 7629 NumberOfCodeBlocks, 7629 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 9343 ConstructedInterpolants, 619 QuantifiedInterpolants, 12098031 SizeOfPredicates, 117 NumberOfNonLiveVariables, 33231 ConjunctsInSsa, 319 ConjunctsInUnsatCore, 94 InterpolantComputations, 54 PerfectInterpolantSequences, 620/759 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...