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.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:11:31,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:11:31,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:11:31,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:11:31,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:11:31,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:11:31,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:11:31,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:11:31,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:11:31,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:11:31,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:11:31,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:11:31,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:11:31,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:11:31,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:11:31,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:11:31,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:11:31,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:11:31,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:11:31,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:11:31,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:11:31,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:11:31,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:11:31,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:11:31,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:11:31,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:11:31,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:11:31,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:11:31,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:11:31,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:11:31,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:11:31,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:11:31,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:11:31,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:11:31,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:11:31,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:11:31,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:11:31,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:11:31,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:11:31,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:11:31,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:11:31,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:11:31,654 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:11:31,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:11:31,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:11:31,655 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:11:31,655 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:11:31,656 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:11:31,656 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:11:31,656 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:11:31,656 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:11:31,656 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:11:31,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:11:31,657 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:11:31,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:11:31,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:11:31,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:11:31,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:11:31,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:11:31,658 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:11:31,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:11:31,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:11:31,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:11:31,659 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:11:31,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:11:31,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:11:31,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:11:31,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:11:31,660 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:11:31,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:11:31,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:11:31,661 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:11:31,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:11:31,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:11:31,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:11:31,726 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:11:31,726 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:11:31,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 08:11:31,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f920646f/bc0717967ecb400998214c283f5ef876/FLAG699fbd60f [2019-09-10 08:11:32,336 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:11:32,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 08:11:32,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f920646f/bc0717967ecb400998214c283f5ef876/FLAG699fbd60f [2019-09-10 08:11:32,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f920646f/bc0717967ecb400998214c283f5ef876 [2019-09-10 08:11:32,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:11:32,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:11:32,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:11:32,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:11:32,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:11:32,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:11:32" (1/1) ... [2019-09-10 08:11:32,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a425ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:32, skipping insertion in model container [2019-09-10 08:11:32,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:11:32" (1/1) ... [2019-09-10 08:11:32,717 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:11:32,793 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:11:33,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:11:33,348 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:11:33,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:11:33,512 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:11:33,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:33 WrapperNode [2019-09-10 08:11:33,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:11:33,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:11:33,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:11:33,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:11:33,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:33" (1/1) ... [2019-09-10 08:11:33,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:33" (1/1) ... [2019-09-10 08:11:33,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:33" (1/1) ... [2019-09-10 08:11:33,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:33" (1/1) ... [2019-09-10 08:11:33,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:33" (1/1) ... [2019-09-10 08:11:33,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:33" (1/1) ... [2019-09-10 08:11:33,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:33" (1/1) ... [2019-09-10 08:11:33,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:11:33,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:11:33,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:11:33,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:11:33,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:11:33,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:11:33,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:11:33,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:11:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:11:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:11:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:11:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:11:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:11:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:11:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:11:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:11:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:11:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:11:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:11:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:11:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:11:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:11:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:11:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:11:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:11:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:11:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:11:34,972 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:11:34,972 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:11:34,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:11:34 BoogieIcfgContainer [2019-09-10 08:11:34,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:11:34,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:11:34,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:11:34,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:11:34,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:11:32" (1/3) ... [2019-09-10 08:11:34,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36665da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:11:34, skipping insertion in model container [2019-09-10 08:11:34,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:33" (2/3) ... [2019-09-10 08:11:34,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36665da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:11:34, skipping insertion in model container [2019-09-10 08:11:34,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:11:34" (3/3) ... [2019-09-10 08:11:34,981 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 08:11:34,991 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:11:34,999 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:11:35,016 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:11:35,043 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:11:35,043 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:11:35,043 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:11:35,044 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:11:35,044 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:11:35,044 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:11:35,044 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:11:35,044 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:11:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states. [2019-09-10 08:11:35,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:11:35,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:35,086 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, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:35,088 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:35,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1532113436, now seen corresponding path program 1 times [2019-09-10 08:11:35,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:35,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:35,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:35,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:35,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:35,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:35,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:11:35,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:35,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:11:35,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:11:35,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:11:35,508 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 4 states. [2019-09-10 08:11:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:35,655 INFO L93 Difference]: Finished difference Result 266 states and 434 transitions. [2019-09-10 08:11:35,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:35,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-10 08:11:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:35,676 INFO L225 Difference]: With dead ends: 266 [2019-09-10 08:11:35,677 INFO L226 Difference]: Without dead ends: 258 [2019-09-10 08:11:35,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-10 08:11:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-09-10 08:11:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-10 08:11:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 384 transitions. [2019-09-10 08:11:35,748 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 384 transitions. Word has length 95 [2019-09-10 08:11:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:35,749 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 384 transitions. [2019-09-10 08:11:35,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:11:35,749 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 384 transitions. [2019-09-10 08:11:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:11:35,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:35,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:35,756 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:35,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:35,757 INFO L82 PathProgramCache]: Analyzing trace with hash 490754805, now seen corresponding path program 1 times [2019-09-10 08:11:35,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:35,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:35,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:35,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:35,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:35,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:35,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:35,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:35,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:35,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:35,990 INFO L87 Difference]: Start difference. First operand 258 states and 384 transitions. Second operand 3 states. [2019-09-10 08:11:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:36,053 INFO L93 Difference]: Finished difference Result 366 states and 553 transitions. [2019-09-10 08:11:36,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:36,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-09-10 08:11:36,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:36,058 INFO L225 Difference]: With dead ends: 366 [2019-09-10 08:11:36,058 INFO L226 Difference]: Without dead ends: 366 [2019-09-10 08:11:36,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:36,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-10 08:11:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2019-09-10 08:11:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-10 08:11:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 552 transitions. [2019-09-10 08:11:36,085 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 552 transitions. Word has length 134 [2019-09-10 08:11:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:36,086 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 552 transitions. [2019-09-10 08:11:36,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 552 transitions. [2019-09-10 08:11:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:11:36,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:36,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:36,094 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash 667997316, now seen corresponding path program 1 times [2019-09-10 08:11:36,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:36,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:36,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:36,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:36,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:36,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:36,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:36,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:36,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:36,329 INFO L87 Difference]: Start difference. First operand 364 states and 552 transitions. Second operand 3 states. [2019-09-10 08:11:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:36,364 INFO L93 Difference]: Finished difference Result 554 states and 851 transitions. [2019-09-10 08:11:36,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:36,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:11:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:36,368 INFO L225 Difference]: With dead ends: 554 [2019-09-10 08:11:36,369 INFO L226 Difference]: Without dead ends: 554 [2019-09-10 08:11:36,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-10 08:11:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-09-10 08:11:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-10 08:11:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 850 transitions. [2019-09-10 08:11:36,395 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 850 transitions. Word has length 136 [2019-09-10 08:11:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:36,396 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 850 transitions. [2019-09-10 08:11:36,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 850 transitions. [2019-09-10 08:11:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:11:36,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:36,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:36,401 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:36,401 INFO L82 PathProgramCache]: Analyzing trace with hash -98161070, now seen corresponding path program 1 times [2019-09-10 08:11:36,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:36,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:36,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:36,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:36,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:36,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 08:11:36,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:36,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:36,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:36,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:36,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:36,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:36,570 INFO L87 Difference]: Start difference. First operand 552 states and 850 transitions. Second operand 3 states. [2019-09-10 08:11:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:36,605 INFO L93 Difference]: Finished difference Result 878 states and 1363 transitions. [2019-09-10 08:11:36,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:36,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:11:36,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:36,614 INFO L225 Difference]: With dead ends: 878 [2019-09-10 08:11:36,614 INFO L226 Difference]: Without dead ends: 878 [2019-09-10 08:11:36,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:36,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-09-10 08:11:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 876. [2019-09-10 08:11:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-09-10 08:11:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1362 transitions. [2019-09-10 08:11:36,644 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1362 transitions. Word has length 138 [2019-09-10 08:11:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:36,645 INFO L475 AbstractCegarLoop]: Abstraction has 876 states and 1362 transitions. [2019-09-10 08:11:36,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1362 transitions. [2019-09-10 08:11:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:11:36,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:36,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:36,650 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1548373260, now seen corresponding path program 1 times [2019-09-10 08:11:36,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:36,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:36,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:36,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:36,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:36,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:36,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:36,777 INFO L87 Difference]: Start difference. First operand 876 states and 1362 transitions. Second operand 3 states. [2019-09-10 08:11:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:36,834 INFO L93 Difference]: Finished difference Result 1418 states and 2211 transitions. [2019-09-10 08:11:36,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:36,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-10 08:11:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:36,843 INFO L225 Difference]: With dead ends: 1418 [2019-09-10 08:11:36,843 INFO L226 Difference]: Without dead ends: 1418 [2019-09-10 08:11:36,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2019-09-10 08:11:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1416. [2019-09-10 08:11:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-09-10 08:11:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2210 transitions. [2019-09-10 08:11:36,885 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2210 transitions. Word has length 140 [2019-09-10 08:11:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:36,886 INFO L475 AbstractCegarLoop]: Abstraction has 1416 states and 2210 transitions. [2019-09-10 08:11:36,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2210 transitions. [2019-09-10 08:11:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 08:11:36,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:36,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:36,893 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:36,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1337291477, now seen corresponding path program 1 times [2019-09-10 08:11:36,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:36,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:36,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:36,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:36,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:36,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:36,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:36,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:36,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:36,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:36,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:36,992 INFO L87 Difference]: Start difference. First operand 1416 states and 2210 transitions. Second operand 3 states. [2019-09-10 08:11:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:37,040 INFO L93 Difference]: Finished difference Result 2278 states and 3547 transitions. [2019-09-10 08:11:37,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:37,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-10 08:11:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:37,052 INFO L225 Difference]: With dead ends: 2278 [2019-09-10 08:11:37,053 INFO L226 Difference]: Without dead ends: 2278 [2019-09-10 08:11:37,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-09-10 08:11:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2019-09-10 08:11:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2019-09-10 08:11:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3546 transitions. [2019-09-10 08:11:37,112 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3546 transitions. Word has length 142 [2019-09-10 08:11:37,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:37,112 INFO L475 AbstractCegarLoop]: Abstraction has 2276 states and 3546 transitions. [2019-09-10 08:11:37,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3546 transitions. [2019-09-10 08:11:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:11:37,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:37,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:37,119 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:37,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash 911413393, now seen corresponding path program 1 times [2019-09-10 08:11:37,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:37,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:37,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:37,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:37,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:37,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 08:11:37,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:37,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:37,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:37,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:37,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:37,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:37,200 INFO L87 Difference]: Start difference. First operand 2276 states and 3546 transitions. Second operand 3 states. [2019-09-10 08:11:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:37,619 INFO L93 Difference]: Finished difference Result 4472 states and 6969 transitions. [2019-09-10 08:11:37,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:37,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 08:11:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:37,645 INFO L225 Difference]: With dead ends: 4472 [2019-09-10 08:11:37,645 INFO L226 Difference]: Without dead ends: 4472 [2019-09-10 08:11:37,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4472 states. [2019-09-10 08:11:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4472 to 4470. [2019-09-10 08:11:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4470 states. [2019-09-10 08:11:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 6968 transitions. [2019-09-10 08:11:37,762 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 6968 transitions. Word has length 144 [2019-09-10 08:11:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:37,763 INFO L475 AbstractCegarLoop]: Abstraction has 4470 states and 6968 transitions. [2019-09-10 08:11:37,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 6968 transitions. [2019-09-10 08:11:37,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:11:37,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:37,775 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:37,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:37,776 INFO L82 PathProgramCache]: Analyzing trace with hash -621452074, now seen corresponding path program 1 times [2019-09-10 08:11:37,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:37,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:37,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:37,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:37,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:37,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:37,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:37,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:37,859 INFO L87 Difference]: Start difference. First operand 4470 states and 6968 transitions. Second operand 3 states. [2019-09-10 08:11:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:38,197 INFO L93 Difference]: Finished difference Result 8793 states and 13672 transitions. [2019-09-10 08:11:38,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:38,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 08:11:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:38,238 INFO L225 Difference]: With dead ends: 8793 [2019-09-10 08:11:38,238 INFO L226 Difference]: Without dead ends: 8793 [2019-09-10 08:11:38,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8793 states. [2019-09-10 08:11:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8793 to 8791. [2019-09-10 08:11:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8791 states. [2019-09-10 08:11:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8791 states to 8791 states and 13671 transitions. [2019-09-10 08:11:38,488 INFO L78 Accepts]: Start accepts. Automaton has 8791 states and 13671 transitions. Word has length 144 [2019-09-10 08:11:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:38,489 INFO L475 AbstractCegarLoop]: Abstraction has 8791 states and 13671 transitions. [2019-09-10 08:11:38,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 8791 states and 13671 transitions. [2019-09-10 08:11:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:11:38,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:38,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:38,513 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:38,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash 457459003, now seen corresponding path program 1 times [2019-09-10 08:11:38,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:38,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:38,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:38,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:38,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:38,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:38,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:38,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:38,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:38,658 INFO L87 Difference]: Start difference. First operand 8791 states and 13671 transitions. Second operand 5 states. [2019-09-10 08:11:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:39,166 INFO L93 Difference]: Finished difference Result 17524 states and 27144 transitions. [2019-09-10 08:11:39,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:39,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 08:11:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:39,231 INFO L225 Difference]: With dead ends: 17524 [2019-09-10 08:11:39,232 INFO L226 Difference]: Without dead ends: 17524 [2019-09-10 08:11:39,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:11:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17524 states. [2019-09-10 08:11:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17524 to 17522. [2019-09-10 08:11:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17522 states. [2019-09-10 08:11:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17522 states to 17522 states and 27143 transitions. [2019-09-10 08:11:39,648 INFO L78 Accepts]: Start accepts. Automaton has 17522 states and 27143 transitions. Word has length 144 [2019-09-10 08:11:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:39,648 INFO L475 AbstractCegarLoop]: Abstraction has 17522 states and 27143 transitions. [2019-09-10 08:11:39,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 17522 states and 27143 transitions. [2019-09-10 08:11:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:11:39,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:39,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:39,698 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:39,698 INFO L82 PathProgramCache]: Analyzing trace with hash -633266858, now seen corresponding path program 1 times [2019-09-10 08:11:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:39,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:39,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:39,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:39,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:39,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:39,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:39,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:39,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:39,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:39,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:39,853 INFO L87 Difference]: Start difference. First operand 17522 states and 27143 transitions. Second operand 5 states. [2019-09-10 08:11:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:40,106 INFO L93 Difference]: Finished difference Result 8830 states and 13643 transitions. [2019-09-10 08:11:40,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:40,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 08:11:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:40,124 INFO L225 Difference]: With dead ends: 8830 [2019-09-10 08:11:40,124 INFO L226 Difference]: Without dead ends: 8830 [2019-09-10 08:11:40,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:11:40,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8830 states. [2019-09-10 08:11:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8830 to 8830. [2019-09-10 08:11:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8830 states. [2019-09-10 08:11:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8830 states to 8830 states and 13643 transitions. [2019-09-10 08:11:40,260 INFO L78 Accepts]: Start accepts. Automaton has 8830 states and 13643 transitions. Word has length 144 [2019-09-10 08:11:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:40,260 INFO L475 AbstractCegarLoop]: Abstraction has 8830 states and 13643 transitions. [2019-09-10 08:11:40,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8830 states and 13643 transitions. [2019-09-10 08:11:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:11:40,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:40,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:40,795 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:40,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1477886134, now seen corresponding path program 1 times [2019-09-10 08:11:40,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:40,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:40,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:40,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:40,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:40,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:40,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:40,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:40,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:40,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:40,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:40,944 INFO L87 Difference]: Start difference. First operand 8830 states and 13643 transitions. Second operand 5 states. [2019-09-10 08:11:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:41,196 INFO L93 Difference]: Finished difference Result 8830 states and 13561 transitions. [2019-09-10 08:11:41,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:41,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 08:11:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:41,215 INFO L225 Difference]: With dead ends: 8830 [2019-09-10 08:11:41,215 INFO L226 Difference]: Without dead ends: 8830 [2019-09-10 08:11:41,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:11:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8830 states. [2019-09-10 08:11:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8830 to 8830. [2019-09-10 08:11:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8830 states. [2019-09-10 08:11:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8830 states to 8830 states and 13561 transitions. [2019-09-10 08:11:41,341 INFO L78 Accepts]: Start accepts. Automaton has 8830 states and 13561 transitions. Word has length 144 [2019-09-10 08:11:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:41,341 INFO L475 AbstractCegarLoop]: Abstraction has 8830 states and 13561 transitions. [2019-09-10 08:11:41,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 8830 states and 13561 transitions. [2019-09-10 08:11:41,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:11:41,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:41,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:41,361 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:41,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:41,362 INFO L82 PathProgramCache]: Analyzing trace with hash -487303850, now seen corresponding path program 1 times [2019-09-10 08:11:41,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:41,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:41,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:41,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:41,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:41,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:41,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:41,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:41,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:41,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:41,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:41,492 INFO L87 Difference]: Start difference. First operand 8830 states and 13561 transitions. Second operand 5 states. [2019-09-10 08:11:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:41,734 INFO L93 Difference]: Finished difference Result 8830 states and 13429 transitions. [2019-09-10 08:11:41,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:41,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 08:11:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:41,792 INFO L225 Difference]: With dead ends: 8830 [2019-09-10 08:11:41,792 INFO L226 Difference]: Without dead ends: 8830 [2019-09-10 08:11:41,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:11:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8830 states. [2019-09-10 08:11:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8830 to 8830. [2019-09-10 08:11:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8830 states. [2019-09-10 08:11:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8830 states to 8830 states and 13429 transitions. [2019-09-10 08:11:41,903 INFO L78 Accepts]: Start accepts. Automaton has 8830 states and 13429 transitions. Word has length 144 [2019-09-10 08:11:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:41,904 INFO L475 AbstractCegarLoop]: Abstraction has 8830 states and 13429 transitions. [2019-09-10 08:11:41,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8830 states and 13429 transitions. [2019-09-10 08:11:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:11:41,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:41,921 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:41,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:41,921 INFO L82 PathProgramCache]: Analyzing trace with hash 357859424, now seen corresponding path program 1 times [2019-09-10 08:11:41,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:41,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:41,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:41,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:41,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:42,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:42,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:42,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:42,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:42,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:42,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:42,014 INFO L87 Difference]: Start difference. First operand 8830 states and 13429 transitions. Second operand 3 states. [2019-09-10 08:11:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:42,057 INFO L93 Difference]: Finished difference Result 7712 states and 11614 transitions. [2019-09-10 08:11:42,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:42,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 08:11:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:42,074 INFO L225 Difference]: With dead ends: 7712 [2019-09-10 08:11:42,074 INFO L226 Difference]: Without dead ends: 7712 [2019-09-10 08:11:42,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7712 states. [2019-09-10 08:11:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7712 to 7710. [2019-09-10 08:11:42,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7710 states. [2019-09-10 08:11:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7710 states to 7710 states and 11613 transitions. [2019-09-10 08:11:42,164 INFO L78 Accepts]: Start accepts. Automaton has 7710 states and 11613 transitions. Word has length 144 [2019-09-10 08:11:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:42,165 INFO L475 AbstractCegarLoop]: Abstraction has 7710 states and 11613 transitions. [2019-09-10 08:11:42,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 7710 states and 11613 transitions. [2019-09-10 08:11:42,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:11:42,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:42,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:42,174 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:42,174 INFO L82 PathProgramCache]: Analyzing trace with hash -35682098, now seen corresponding path program 1 times [2019-09-10 08:11:42,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:42,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:42,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:42,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:42,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:42,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:42,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:11:42,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:42,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:11:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:11:42,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:11:42,367 INFO L87 Difference]: Start difference. First operand 7710 states and 11613 transitions. Second operand 8 states. [2019-09-10 08:11:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:43,109 INFO L93 Difference]: Finished difference Result 69495 states and 103395 transitions. [2019-09-10 08:11:43,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:11:43,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 144 [2019-09-10 08:11:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:43,228 INFO L225 Difference]: With dead ends: 69495 [2019-09-10 08:11:43,228 INFO L226 Difference]: Without dead ends: 69495 [2019-09-10 08:11:43,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:11:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69495 states. [2019-09-10 08:11:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69495 to 22583. [2019-09-10 08:11:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22583 states. [2019-09-10 08:11:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22583 states to 22583 states and 33680 transitions. [2019-09-10 08:11:43,774 INFO L78 Accepts]: Start accepts. Automaton has 22583 states and 33680 transitions. Word has length 144 [2019-09-10 08:11:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:43,775 INFO L475 AbstractCegarLoop]: Abstraction has 22583 states and 33680 transitions. [2019-09-10 08:11:43,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:11:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 22583 states and 33680 transitions. [2019-09-10 08:11:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:11:43,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:43,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:43,791 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:43,792 INFO L82 PathProgramCache]: Analyzing trace with hash -181181800, now seen corresponding path program 1 times [2019-09-10 08:11:43,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:43,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:43,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:43,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:43,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:43,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:43,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:43,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:43,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:43,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:43,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:43,950 INFO L87 Difference]: Start difference. First operand 22583 states and 33680 transitions. Second operand 3 states. [2019-09-10 08:11:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:44,064 INFO L93 Difference]: Finished difference Result 39264 states and 57965 transitions. [2019-09-10 08:11:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:44,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-10 08:11:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:44,113 INFO L225 Difference]: With dead ends: 39264 [2019-09-10 08:11:44,113 INFO L226 Difference]: Without dead ends: 39264 [2019-09-10 08:11:44,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39264 states. [2019-09-10 08:11:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39264 to 39262. [2019-09-10 08:11:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39262 states. [2019-09-10 08:11:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39262 states to 39262 states and 57964 transitions. [2019-09-10 08:11:44,590 INFO L78 Accepts]: Start accepts. Automaton has 39262 states and 57964 transitions. Word has length 147 [2019-09-10 08:11:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:44,591 INFO L475 AbstractCegarLoop]: Abstraction has 39262 states and 57964 transitions. [2019-09-10 08:11:44,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 39262 states and 57964 transitions. [2019-09-10 08:11:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:11:44,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:44,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:44,616 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:44,617 INFO L82 PathProgramCache]: Analyzing trace with hash 572183116, now seen corresponding path program 1 times [2019-09-10 08:11:44,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:44,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:44,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:44,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:44,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:44,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:44,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:44,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:44,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:44,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:44,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:44,717 INFO L87 Difference]: Start difference. First operand 39262 states and 57964 transitions. Second operand 3 states. [2019-09-10 08:11:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:44,796 INFO L93 Difference]: Finished difference Result 20489 states and 30072 transitions. [2019-09-10 08:11:44,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:44,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-10 08:11:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:44,948 INFO L225 Difference]: With dead ends: 20489 [2019-09-10 08:11:44,948 INFO L226 Difference]: Without dead ends: 20489 [2019-09-10 08:11:44,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20489 states. [2019-09-10 08:11:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20489 to 20487. [2019-09-10 08:11:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20487 states. [2019-09-10 08:11:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20487 states to 20487 states and 30071 transitions. [2019-09-10 08:11:45,170 INFO L78 Accepts]: Start accepts. Automaton has 20487 states and 30071 transitions. Word has length 148 [2019-09-10 08:11:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:45,170 INFO L475 AbstractCegarLoop]: Abstraction has 20487 states and 30071 transitions. [2019-09-10 08:11:45,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 20487 states and 30071 transitions. [2019-09-10 08:11:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:11:45,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:45,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:45,185 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:45,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:45,185 INFO L82 PathProgramCache]: Analyzing trace with hash -418639672, now seen corresponding path program 1 times [2019-09-10 08:11:45,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:45,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:45,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:45,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:45,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:45,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:45,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:45,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:45,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:45,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:45,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:45,280 INFO L87 Difference]: Start difference. First operand 20487 states and 30071 transitions. Second operand 3 states. [2019-09-10 08:11:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:45,357 INFO L93 Difference]: Finished difference Result 20485 states and 30063 transitions. [2019-09-10 08:11:45,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:45,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-10 08:11:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:45,380 INFO L225 Difference]: With dead ends: 20485 [2019-09-10 08:11:45,380 INFO L226 Difference]: Without dead ends: 20485 [2019-09-10 08:11:45,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:45,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20485 states. [2019-09-10 08:11:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20485 to 20485. [2019-09-10 08:11:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20485 states. [2019-09-10 08:11:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20485 states to 20485 states and 30063 transitions. [2019-09-10 08:11:45,588 INFO L78 Accepts]: Start accepts. Automaton has 20485 states and 30063 transitions. Word has length 149 [2019-09-10 08:11:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:45,588 INFO L475 AbstractCegarLoop]: Abstraction has 20485 states and 30063 transitions. [2019-09-10 08:11:45,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 20485 states and 30063 transitions. [2019-09-10 08:11:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:11:45,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:45,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:45,599 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1661340980, now seen corresponding path program 1 times [2019-09-10 08:11:45,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:45,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:45,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:45,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:45,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:46,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:46,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:11:46,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:46,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:11:46,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:11:46,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:11:46,104 INFO L87 Difference]: Start difference. First operand 20485 states and 30063 transitions. Second operand 8 states. [2019-09-10 08:11:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:46,581 INFO L93 Difference]: Finished difference Result 33204 states and 48402 transitions. [2019-09-10 08:11:46,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:11:46,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 149 [2019-09-10 08:11:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:46,618 INFO L225 Difference]: With dead ends: 33204 [2019-09-10 08:11:46,618 INFO L226 Difference]: Without dead ends: 33204 [2019-09-10 08:11:46,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:11:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33204 states. [2019-09-10 08:11:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33204 to 26453. [2019-09-10 08:11:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26453 states. [2019-09-10 08:11:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26453 states to 26453 states and 38361 transitions. [2019-09-10 08:11:46,903 INFO L78 Accepts]: Start accepts. Automaton has 26453 states and 38361 transitions. Word has length 149 [2019-09-10 08:11:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:46,903 INFO L475 AbstractCegarLoop]: Abstraction has 26453 states and 38361 transitions. [2019-09-10 08:11:46,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:11:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 26453 states and 38361 transitions. [2019-09-10 08:11:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:11:46,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:46,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:46,919 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1966780748, now seen corresponding path program 1 times [2019-09-10 08:11:46,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:46,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:46,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:46,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:47,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:47,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:11:47,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:47,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:11:47,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:11:47,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:11:47,126 INFO L87 Difference]: Start difference. First operand 26453 states and 38361 transitions. Second operand 8 states. [2019-09-10 08:11:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:47,680 INFO L93 Difference]: Finished difference Result 92881 states and 135563 transitions. [2019-09-10 08:11:47,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:11:47,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-10 08:11:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:47,792 INFO L225 Difference]: With dead ends: 92881 [2019-09-10 08:11:47,792 INFO L226 Difference]: Without dead ends: 92881 [2019-09-10 08:11:47,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:11:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92881 states. [2019-09-10 08:11:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92881 to 33200. [2019-09-10 08:11:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33200 states. [2019-09-10 08:11:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33200 states to 33200 states and 48208 transitions. [2019-09-10 08:11:48,554 INFO L78 Accepts]: Start accepts. Automaton has 33200 states and 48208 transitions. Word has length 150 [2019-09-10 08:11:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:48,555 INFO L475 AbstractCegarLoop]: Abstraction has 33200 states and 48208 transitions. [2019-09-10 08:11:48,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:11:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 33200 states and 48208 transitions. [2019-09-10 08:11:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:11:48,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:48,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:48,572 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:48,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:48,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1982869934, now seen corresponding path program 1 times [2019-09-10 08:11:48,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:48,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:48,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:48,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:48,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:48,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:48,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:11:48,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:48,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:11:48,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:11:48,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:11:48,770 INFO L87 Difference]: Start difference. First operand 33200 states and 48208 transitions. Second operand 8 states. [2019-09-10 08:11:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:49,206 INFO L93 Difference]: Finished difference Result 74871 states and 108773 transitions. [2019-09-10 08:11:49,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:11:49,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-10 08:11:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:49,293 INFO L225 Difference]: With dead ends: 74871 [2019-09-10 08:11:49,294 INFO L226 Difference]: Without dead ends: 74871 [2019-09-10 08:11:49,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:11:49,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74871 states. [2019-09-10 08:11:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74871 to 45162. [2019-09-10 08:11:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45162 states. [2019-09-10 08:11:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45162 states to 45162 states and 65442 transitions. [2019-09-10 08:11:50,793 INFO L78 Accepts]: Start accepts. Automaton has 45162 states and 65442 transitions. Word has length 150 [2019-09-10 08:11:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:50,793 INFO L475 AbstractCegarLoop]: Abstraction has 45162 states and 65442 transitions. [2019-09-10 08:11:50,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:11:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 45162 states and 65442 transitions. [2019-09-10 08:11:50,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:11:50,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:50,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:50,810 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:50,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:50,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1240478424, now seen corresponding path program 1 times [2019-09-10 08:11:50,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:50,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:50,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:50,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:50,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:50,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:50,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:50,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:50,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:50,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:50,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:50,892 INFO L87 Difference]: Start difference. First operand 45162 states and 65442 transitions. Second operand 3 states. [2019-09-10 08:11:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:50,964 INFO L93 Difference]: Finished difference Result 23037 states and 33148 transitions. [2019-09-10 08:11:50,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:50,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 08:11:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:50,989 INFO L225 Difference]: With dead ends: 23037 [2019-09-10 08:11:50,990 INFO L226 Difference]: Without dead ends: 23037 [2019-09-10 08:11:50,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:51,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23037 states. [2019-09-10 08:11:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23037 to 23035. [2019-09-10 08:11:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23035 states. [2019-09-10 08:11:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23035 states to 23035 states and 33147 transitions. [2019-09-10 08:11:51,270 INFO L78 Accepts]: Start accepts. Automaton has 23035 states and 33147 transitions. Word has length 150 [2019-09-10 08:11:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:51,272 INFO L475 AbstractCegarLoop]: Abstraction has 23035 states and 33147 transitions. [2019-09-10 08:11:51,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 23035 states and 33147 transitions. [2019-09-10 08:11:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:11:51,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:51,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:51,285 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:51,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1230890516, now seen corresponding path program 1 times [2019-09-10 08:11:51,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:51,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:51,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:51,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:51,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:51,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:51,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:51,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:51,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:51,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:51,399 INFO L87 Difference]: Start difference. First operand 23035 states and 33147 transitions. Second operand 5 states. [2019-09-10 08:11:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:51,623 INFO L93 Difference]: Finished difference Result 37919 states and 54609 transitions. [2019-09-10 08:11:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:51,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 08:11:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:51,658 INFO L225 Difference]: With dead ends: 37919 [2019-09-10 08:11:51,658 INFO L226 Difference]: Without dead ends: 37919 [2019-09-10 08:11:51,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:11:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37919 states. [2019-09-10 08:11:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37919 to 34987. [2019-09-10 08:11:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34987 states. [2019-09-10 08:11:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34987 states to 34987 states and 50463 transitions. [2019-09-10 08:11:52,182 INFO L78 Accepts]: Start accepts. Automaton has 34987 states and 50463 transitions. Word has length 150 [2019-09-10 08:11:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:52,182 INFO L475 AbstractCegarLoop]: Abstraction has 34987 states and 50463 transitions. [2019-09-10 08:11:52,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 34987 states and 50463 transitions. [2019-09-10 08:11:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:11:52,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:52,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:52,195 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:52,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:52,196 INFO L82 PathProgramCache]: Analyzing trace with hash -736590432, now seen corresponding path program 1 times [2019-09-10 08:11:52,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:52,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:52,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:52,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:52,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:52,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:52,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:52,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:52,304 INFO L87 Difference]: Start difference. First operand 34987 states and 50463 transitions. Second operand 5 states. [2019-09-10 08:11:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:52,619 INFO L93 Difference]: Finished difference Result 49519 states and 71329 transitions. [2019-09-10 08:11:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:52,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 08:11:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:52,661 INFO L225 Difference]: With dead ends: 49519 [2019-09-10 08:11:52,662 INFO L226 Difference]: Without dead ends: 49519 [2019-09-10 08:11:52,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:11:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49519 states. [2019-09-10 08:11:52,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49519 to 43723. [2019-09-10 08:11:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43723 states. [2019-09-10 08:11:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43723 states to 43723 states and 63055 transitions. [2019-09-10 08:11:53,022 INFO L78 Accepts]: Start accepts. Automaton has 43723 states and 63055 transitions. Word has length 150 [2019-09-10 08:11:53,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:53,023 INFO L475 AbstractCegarLoop]: Abstraction has 43723 states and 63055 transitions. [2019-09-10 08:11:53,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 43723 states and 63055 transitions. [2019-09-10 08:11:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:11:53,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:53,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:53,036 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:53,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:53,036 INFO L82 PathProgramCache]: Analyzing trace with hash -621309414, now seen corresponding path program 1 times [2019-09-10 08:11:53,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:53,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:53,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:53,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:53,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:53,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:53,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:53,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:53,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:53,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:53,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:53,153 INFO L87 Difference]: Start difference. First operand 43723 states and 63055 transitions. Second operand 5 states. [2019-09-10 08:11:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:53,481 INFO L93 Difference]: Finished difference Result 55655 states and 80173 transitions. [2019-09-10 08:11:53,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:53,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 08:11:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:53,547 INFO L225 Difference]: With dead ends: 55655 [2019-09-10 08:11:53,548 INFO L226 Difference]: Without dead ends: 55655 [2019-09-10 08:11:53,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:11:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55655 states. [2019-09-10 08:11:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55655 to 49811. [2019-09-10 08:11:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49811 states. [2019-09-10 08:11:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49811 states to 49811 states and 71839 transitions. [2019-09-10 08:11:55,036 INFO L78 Accepts]: Start accepts. Automaton has 49811 states and 71839 transitions. Word has length 150 [2019-09-10 08:11:55,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:55,036 INFO L475 AbstractCegarLoop]: Abstraction has 49811 states and 71839 transitions. [2019-09-10 08:11:55,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:55,036 INFO L276 IsEmpty]: Start isEmpty. Operand 49811 states and 71839 transitions. [2019-09-10 08:11:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:11:55,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:55,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:55,050 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1244623102, now seen corresponding path program 1 times [2019-09-10 08:11:55,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:55,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:55,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:55,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:55,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:55,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:55,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:11:55,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:55,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:11:55,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:11:55,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:11:55,250 INFO L87 Difference]: Start difference. First operand 49811 states and 71839 transitions. Second operand 8 states. [2019-09-10 08:11:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:55,989 INFO L93 Difference]: Finished difference Result 148719 states and 214919 transitions. [2019-09-10 08:11:55,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:11:55,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-10 08:11:55,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:56,134 INFO L225 Difference]: With dead ends: 148719 [2019-09-10 08:11:56,134 INFO L226 Difference]: Without dead ends: 148719 [2019-09-10 08:11:56,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:11:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148719 states. [2019-09-10 08:11:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148719 to 55921. [2019-09-10 08:11:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55921 states. [2019-09-10 08:11:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55921 states to 55921 states and 80669 transitions. [2019-09-10 08:11:57,420 INFO L78 Accepts]: Start accepts. Automaton has 55921 states and 80669 transitions. Word has length 150 [2019-09-10 08:11:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:57,420 INFO L475 AbstractCegarLoop]: Abstraction has 55921 states and 80669 transitions. [2019-09-10 08:11:57,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:11:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 55921 states and 80669 transitions. [2019-09-10 08:11:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:11:57,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:57,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:57,436 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:57,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:57,437 INFO L82 PathProgramCache]: Analyzing trace with hash -25005510, now seen corresponding path program 1 times [2019-09-10 08:11:57,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:57,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:57,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:57,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:57,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:57,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:57,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:11:57,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:57,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:11:57,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:11:57,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:11:57,756 INFO L87 Difference]: Start difference. First operand 55921 states and 80669 transitions. Second operand 10 states. [2019-09-10 08:11:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:59,701 INFO L93 Difference]: Finished difference Result 326413 states and 468782 transitions. [2019-09-10 08:11:59,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:11:59,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-10 08:11:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:02,501 INFO L225 Difference]: With dead ends: 326413 [2019-09-10 08:12:02,501 INFO L226 Difference]: Without dead ends: 326413 [2019-09-10 08:12:02,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:12:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326413 states. [2019-09-10 08:12:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326413 to 55945. [2019-09-10 08:12:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55945 states. [2019-09-10 08:12:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55945 states to 55945 states and 80693 transitions. [2019-09-10 08:12:03,996 INFO L78 Accepts]: Start accepts. Automaton has 55945 states and 80693 transitions. Word has length 152 [2019-09-10 08:12:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:03,996 INFO L475 AbstractCegarLoop]: Abstraction has 55945 states and 80693 transitions. [2019-09-10 08:12:03,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:12:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 55945 states and 80693 transitions. [2019-09-10 08:12:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:12:04,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:04,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:04,013 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2118858450, now seen corresponding path program 1 times [2019-09-10 08:12:04,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:04,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:04,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:04,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:04,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:04,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:04,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:12:04,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:04,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:12:04,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:12:04,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:12:04,258 INFO L87 Difference]: Start difference. First operand 55945 states and 80693 transitions. Second operand 10 states. [2019-09-10 08:12:04,754 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-09-10 08:12:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:07,269 INFO L93 Difference]: Finished difference Result 434970 states and 624886 transitions. [2019-09-10 08:12:07,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:12:07,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-10 08:12:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:07,755 INFO L225 Difference]: With dead ends: 434970 [2019-09-10 08:12:07,755 INFO L226 Difference]: Without dead ends: 434970 [2019-09-10 08:12:07,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:12:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434970 states. [2019-09-10 08:12:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434970 to 56112. [2019-09-10 08:12:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56112 states. [2019-09-10 08:12:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56112 states to 56112 states and 80903 transitions. [2019-09-10 08:12:10,643 INFO L78 Accepts]: Start accepts. Automaton has 56112 states and 80903 transitions. Word has length 152 [2019-09-10 08:12:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:10,643 INFO L475 AbstractCegarLoop]: Abstraction has 56112 states and 80903 transitions. [2019-09-10 08:12:10,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:12:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 56112 states and 80903 transitions. [2019-09-10 08:12:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:12:10,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:10,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:10,660 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:10,660 INFO L82 PathProgramCache]: Analyzing trace with hash -170540571, now seen corresponding path program 1 times [2019-09-10 08:12:10,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:10,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:10,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:10,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:10,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:10,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:10,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:10,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:10,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:10,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:10,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:10,726 INFO L87 Difference]: Start difference. First operand 56112 states and 80903 transitions. Second operand 3 states. [2019-09-10 08:12:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:11,072 INFO L93 Difference]: Finished difference Result 111568 states and 159968 transitions. [2019-09-10 08:12:11,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:11,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-10 08:12:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:11,175 INFO L225 Difference]: With dead ends: 111568 [2019-09-10 08:12:11,175 INFO L226 Difference]: Without dead ends: 111568 [2019-09-10 08:12:11,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111568 states. [2019-09-10 08:12:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111568 to 111566. [2019-09-10 08:12:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111566 states. [2019-09-10 08:12:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111566 states to 111566 states and 159967 transitions. [2019-09-10 08:12:13,815 INFO L78 Accepts]: Start accepts. Automaton has 111566 states and 159967 transitions. Word has length 152 [2019-09-10 08:12:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:13,816 INFO L475 AbstractCegarLoop]: Abstraction has 111566 states and 159967 transitions. [2019-09-10 08:12:13,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 111566 states and 159967 transitions. [2019-09-10 08:12:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:12:13,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:13,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:13,849 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:13,849 INFO L82 PathProgramCache]: Analyzing trace with hash -784563424, now seen corresponding path program 1 times [2019-09-10 08:12:13,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:13,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:13,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:13,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:13,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:13,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:13,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:13,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:13,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:13,922 INFO L87 Difference]: Start difference. First operand 111566 states and 159967 transitions. Second operand 3 states. [2019-09-10 08:12:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:14,093 INFO L93 Difference]: Finished difference Result 56628 states and 80544 transitions. [2019-09-10 08:12:14,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:14,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-10 08:12:14,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:14,155 INFO L225 Difference]: With dead ends: 56628 [2019-09-10 08:12:14,155 INFO L226 Difference]: Without dead ends: 56628 [2019-09-10 08:12:14,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56628 states. [2019-09-10 08:12:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56628 to 56626. [2019-09-10 08:12:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56626 states. [2019-09-10 08:12:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56626 states to 56626 states and 80543 transitions. [2019-09-10 08:12:14,639 INFO L78 Accepts]: Start accepts. Automaton has 56626 states and 80543 transitions. Word has length 152 [2019-09-10 08:12:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:14,639 INFO L475 AbstractCegarLoop]: Abstraction has 56626 states and 80543 transitions. [2019-09-10 08:12:14,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 56626 states and 80543 transitions. [2019-09-10 08:12:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:12:14,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:14,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:14,658 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:14,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:14,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1773541836, now seen corresponding path program 1 times [2019-09-10 08:12:14,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:14,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:14,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:14,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:14,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:14,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:14,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:14,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:12:14,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:14,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:12:14,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:12:14,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:12:14,866 INFO L87 Difference]: Start difference. First operand 56626 states and 80543 transitions. Second operand 10 states. [2019-09-10 08:12:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:17,770 INFO L93 Difference]: Finished difference Result 332130 states and 470480 transitions. [2019-09-10 08:12:17,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:12:17,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-10 08:12:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:18,107 INFO L225 Difference]: With dead ends: 332130 [2019-09-10 08:12:18,107 INFO L226 Difference]: Without dead ends: 332130 [2019-09-10 08:12:18,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=802, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:12:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332130 states. [2019-09-10 08:12:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332130 to 57050. [2019-09-10 08:12:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57050 states. [2019-09-10 08:12:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57050 states to 57050 states and 81016 transitions. [2019-09-10 08:12:19,908 INFO L78 Accepts]: Start accepts. Automaton has 57050 states and 81016 transitions. Word has length 152 [2019-09-10 08:12:19,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:19,908 INFO L475 AbstractCegarLoop]: Abstraction has 57050 states and 81016 transitions. [2019-09-10 08:12:19,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:12:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 57050 states and 81016 transitions. [2019-09-10 08:12:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:12:19,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:19,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:19,925 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1522779547, now seen corresponding path program 1 times [2019-09-10 08:12:19,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:19,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:19,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:19,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:19,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:21,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:21,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:21,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:21,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:21,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:21,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:21,321 INFO L87 Difference]: Start difference. First operand 57050 states and 81016 transitions. Second operand 3 states. [2019-09-10 08:12:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:21,538 INFO L93 Difference]: Finished difference Result 55934 states and 79214 transitions. [2019-09-10 08:12:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:21,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-10 08:12:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:21,585 INFO L225 Difference]: With dead ends: 55934 [2019-09-10 08:12:21,585 INFO L226 Difference]: Without dead ends: 55934 [2019-09-10 08:12:21,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55934 states. [2019-09-10 08:12:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55934 to 55934. [2019-09-10 08:12:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55934 states. [2019-09-10 08:12:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55934 states to 55934 states and 79214 transitions. [2019-09-10 08:12:22,066 INFO L78 Accepts]: Start accepts. Automaton has 55934 states and 79214 transitions. Word has length 153 [2019-09-10 08:12:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:22,067 INFO L475 AbstractCegarLoop]: Abstraction has 55934 states and 79214 transitions. [2019-09-10 08:12:22,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 55934 states and 79214 transitions. [2019-09-10 08:12:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:12:22,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:22,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:22,088 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash 452628205, now seen corresponding path program 1 times [2019-09-10 08:12:22,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:22,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:22,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:22,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:22,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:22,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:22,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:12:22,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:22,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:12:22,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:12:22,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:12:22,312 INFO L87 Difference]: Start difference. First operand 55934 states and 79214 transitions. Second operand 10 states. [2019-09-10 08:12:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:25,915 INFO L93 Difference]: Finished difference Result 467958 states and 658241 transitions. [2019-09-10 08:12:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:12:25,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-09-10 08:12:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:26,437 INFO L225 Difference]: With dead ends: 467958 [2019-09-10 08:12:26,438 INFO L226 Difference]: Without dead ends: 467958 [2019-09-10 08:12:26,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:12:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467958 states. [2019-09-10 08:12:28,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467958 to 55562. [2019-09-10 08:12:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55562 states. [2019-09-10 08:12:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55562 states to 55562 states and 78638 transitions. [2019-09-10 08:12:28,983 INFO L78 Accepts]: Start accepts. Automaton has 55562 states and 78638 transitions. Word has length 153 [2019-09-10 08:12:28,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:28,983 INFO L475 AbstractCegarLoop]: Abstraction has 55562 states and 78638 transitions. [2019-09-10 08:12:28,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:12:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 55562 states and 78638 transitions. [2019-09-10 08:12:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:12:28,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:28,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:28,998 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:28,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1603415415, now seen corresponding path program 1 times [2019-09-10 08:12:28,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:28,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:28,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:28,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:28,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:29,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:29,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:29,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:29,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:29,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:29,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:29,078 INFO L87 Difference]: Start difference. First operand 55562 states and 78638 transitions. Second operand 3 states. [2019-09-10 08:12:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:29,165 INFO L93 Difference]: Finished difference Result 28398 states and 39805 transitions. [2019-09-10 08:12:29,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:29,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-10 08:12:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:29,196 INFO L225 Difference]: With dead ends: 28398 [2019-09-10 08:12:29,196 INFO L226 Difference]: Without dead ends: 28398 [2019-09-10 08:12:29,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28398 states. [2019-09-10 08:12:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28398 to 28396. [2019-09-10 08:12:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28396 states. [2019-09-10 08:12:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28396 states to 28396 states and 39804 transitions. [2019-09-10 08:12:29,422 INFO L78 Accepts]: Start accepts. Automaton has 28396 states and 39804 transitions. Word has length 153 [2019-09-10 08:12:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:29,422 INFO L475 AbstractCegarLoop]: Abstraction has 28396 states and 39804 transitions. [2019-09-10 08:12:29,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 28396 states and 39804 transitions. [2019-09-10 08:12:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:12:29,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:29,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:29,430 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:29,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1644184107, now seen corresponding path program 1 times [2019-09-10 08:12:29,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:29,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:29,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:29,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:29,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:29,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:29,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:12:29,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:29,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:12:29,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:12:29,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:12:29,652 INFO L87 Difference]: Start difference. First operand 28396 states and 39804 transitions. Second operand 10 states. [2019-09-10 08:12:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:32,099 INFO L93 Difference]: Finished difference Result 165974 states and 232337 transitions. [2019-09-10 08:12:32,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:12:32,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-10 08:12:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:32,270 INFO L225 Difference]: With dead ends: 165974 [2019-09-10 08:12:32,271 INFO L226 Difference]: Without dead ends: 165974 [2019-09-10 08:12:32,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:12:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165974 states. [2019-09-10 08:12:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165974 to 29420. [2019-09-10 08:12:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29420 states. [2019-09-10 08:12:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29420 states to 29420 states and 41042 transitions. [2019-09-10 08:12:33,247 INFO L78 Accepts]: Start accepts. Automaton has 29420 states and 41042 transitions. Word has length 154 [2019-09-10 08:12:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:33,247 INFO L475 AbstractCegarLoop]: Abstraction has 29420 states and 41042 transitions. [2019-09-10 08:12:33,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:12:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 29420 states and 41042 transitions. [2019-09-10 08:12:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:12:33,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:33,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:33,255 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:33,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:33,256 INFO L82 PathProgramCache]: Analyzing trace with hash 713901048, now seen corresponding path program 1 times [2019-09-10 08:12:33,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:33,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:33,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:33,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:33,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:33,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:33,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:33,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:33,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:33,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:33,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:33,315 INFO L87 Difference]: Start difference. First operand 29420 states and 41042 transitions. Second operand 3 states. [2019-09-10 08:12:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:33,482 INFO L93 Difference]: Finished difference Result 28104 states and 39176 transitions. [2019-09-10 08:12:33,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:33,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-10 08:12:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:33,514 INFO L225 Difference]: With dead ends: 28104 [2019-09-10 08:12:33,514 INFO L226 Difference]: Without dead ends: 28104 [2019-09-10 08:12:33,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28104 states. [2019-09-10 08:12:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28104 to 28104. [2019-09-10 08:12:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28104 states. [2019-09-10 08:12:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28104 states to 28104 states and 39176 transitions. [2019-09-10 08:12:33,780 INFO L78 Accepts]: Start accepts. Automaton has 28104 states and 39176 transitions. Word has length 155 [2019-09-10 08:12:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:33,780 INFO L475 AbstractCegarLoop]: Abstraction has 28104 states and 39176 transitions. [2019-09-10 08:12:33,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 28104 states and 39176 transitions. [2019-09-10 08:12:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:12:33,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:33,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:33,788 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1986766144, now seen corresponding path program 1 times [2019-09-10 08:12:33,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:33,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:33,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:33,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:33,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:34,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:34,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:12:34,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:34,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:12:34,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:12:34,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:12:34,054 INFO L87 Difference]: Start difference. First operand 28104 states and 39176 transitions. Second operand 10 states. [2019-09-10 08:12:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:37,172 INFO L93 Difference]: Finished difference Result 230700 states and 318309 transitions. [2019-09-10 08:12:37,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:12:37,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-10 08:12:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:37,394 INFO L225 Difference]: With dead ends: 230700 [2019-09-10 08:12:37,394 INFO L226 Difference]: Without dead ends: 230700 [2019-09-10 08:12:37,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:12:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230700 states. [2019-09-10 08:12:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230700 to 28156. [2019-09-10 08:12:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28156 states. [2019-09-10 08:12:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28156 states to 28156 states and 39202 transitions. [2019-09-10 08:12:38,389 INFO L78 Accepts]: Start accepts. Automaton has 28156 states and 39202 transitions. Word has length 155 [2019-09-10 08:12:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:38,390 INFO L475 AbstractCegarLoop]: Abstraction has 28156 states and 39202 transitions. [2019-09-10 08:12:38,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:12:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 28156 states and 39202 transitions. [2019-09-10 08:12:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:12:38,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:38,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:38,397 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1550421164, now seen corresponding path program 1 times [2019-09-10 08:12:38,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:38,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:38,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:38,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:38,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:38,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:38,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:38,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:38,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:38,480 INFO L87 Difference]: Start difference. First operand 28156 states and 39202 transitions. Second operand 3 states. [2019-09-10 08:12:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:38,528 INFO L93 Difference]: Finished difference Result 14902 states and 20451 transitions. [2019-09-10 08:12:38,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:38,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-10 08:12:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:38,543 INFO L225 Difference]: With dead ends: 14902 [2019-09-10 08:12:38,543 INFO L226 Difference]: Without dead ends: 14902 [2019-09-10 08:12:38,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:38,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14902 states. [2019-09-10 08:12:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14902 to 14900. [2019-09-10 08:12:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14900 states. [2019-09-10 08:12:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14900 states to 14900 states and 20450 transitions. [2019-09-10 08:12:38,663 INFO L78 Accepts]: Start accepts. Automaton has 14900 states and 20450 transitions. Word has length 155 [2019-09-10 08:12:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:38,663 INFO L475 AbstractCegarLoop]: Abstraction has 14900 states and 20450 transitions. [2019-09-10 08:12:38,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 14900 states and 20450 transitions. [2019-09-10 08:12:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:12:38,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:38,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:38,668 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1616574444, now seen corresponding path program 1 times [2019-09-10 08:12:38,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:38,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:38,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:38,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:38,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:38,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:38,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:12:38,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:38,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:12:38,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:12:38,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:12:38,791 INFO L87 Difference]: Start difference. First operand 14900 states and 20450 transitions. Second operand 4 states. [2019-09-10 08:12:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:38,863 INFO L93 Difference]: Finished difference Result 15084 states and 20542 transitions. [2019-09-10 08:12:38,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:12:38,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-10 08:12:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:38,908 INFO L225 Difference]: With dead ends: 15084 [2019-09-10 08:12:38,909 INFO L226 Difference]: Without dead ends: 14880 [2019-09-10 08:12:38,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:12:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14880 states. [2019-09-10 08:12:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14880 to 14860. [2019-09-10 08:12:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14860 states. [2019-09-10 08:12:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14860 states to 14860 states and 20250 transitions. [2019-09-10 08:12:39,094 INFO L78 Accepts]: Start accepts. Automaton has 14860 states and 20250 transitions. Word has length 156 [2019-09-10 08:12:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:39,095 INFO L475 AbstractCegarLoop]: Abstraction has 14860 states and 20250 transitions. [2019-09-10 08:12:39,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:12:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 14860 states and 20250 transitions. [2019-09-10 08:12:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:12:39,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:39,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:39,102 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1262761436, now seen corresponding path program 1 times [2019-09-10 08:12:39,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:39,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:39,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:39,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:39,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:39,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:39,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:39,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:39,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:39,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:39,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:39,165 INFO L87 Difference]: Start difference. First operand 14860 states and 20250 transitions. Second operand 3 states. [2019-09-10 08:12:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:39,240 INFO L93 Difference]: Finished difference Result 21358 states and 27615 transitions. [2019-09-10 08:12:39,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:39,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-10 08:12:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:39,276 INFO L225 Difference]: With dead ends: 21358 [2019-09-10 08:12:39,276 INFO L226 Difference]: Without dead ends: 21350 [2019-09-10 08:12:39,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21350 states. [2019-09-10 08:12:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21350 to 20484. [2019-09-10 08:12:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20484 states. [2019-09-10 08:12:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20484 states to 20484 states and 26454 transitions. [2019-09-10 08:12:39,514 INFO L78 Accepts]: Start accepts. Automaton has 20484 states and 26454 transitions. Word has length 158 [2019-09-10 08:12:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:39,514 INFO L475 AbstractCegarLoop]: Abstraction has 20484 states and 26454 transitions. [2019-09-10 08:12:39,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 20484 states and 26454 transitions. [2019-09-10 08:12:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:12:39,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:39,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:39,521 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:39,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:39,522 INFO L82 PathProgramCache]: Analyzing trace with hash -600875830, now seen corresponding path program 1 times [2019-09-10 08:12:39,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:39,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:39,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:39,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:39,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:39,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:39,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:39,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:39,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:39,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:39,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:39,608 INFO L87 Difference]: Start difference. First operand 20484 states and 26454 transitions. Second operand 3 states. [2019-09-10 08:12:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:39,700 INFO L93 Difference]: Finished difference Result 22830 states and 29599 transitions. [2019-09-10 08:12:39,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:39,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-10 08:12:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:39,734 INFO L225 Difference]: With dead ends: 22830 [2019-09-10 08:12:39,735 INFO L226 Difference]: Without dead ends: 22830 [2019-09-10 08:12:39,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:39,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22830 states. [2019-09-10 08:12:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22830 to 20732. [2019-09-10 08:12:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20732 states. [2019-09-10 08:12:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20732 states to 20732 states and 26758 transitions. [2019-09-10 08:12:40,076 INFO L78 Accepts]: Start accepts. Automaton has 20732 states and 26758 transitions. Word has length 159 [2019-09-10 08:12:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:40,076 INFO L475 AbstractCegarLoop]: Abstraction has 20732 states and 26758 transitions. [2019-09-10 08:12:40,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 20732 states and 26758 transitions. [2019-09-10 08:12:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 08:12:40,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:40,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:40,082 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1348657046, now seen corresponding path program 1 times [2019-09-10 08:12:40,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:40,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:40,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:40,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:40,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:40,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:40,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:40,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:40,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:40,169 INFO L87 Difference]: Start difference. First operand 20732 states and 26758 transitions. Second operand 3 states. [2019-09-10 08:12:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:40,291 INFO L93 Difference]: Finished difference Result 20694 states and 26571 transitions. [2019-09-10 08:12:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:40,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-10 08:12:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:40,316 INFO L225 Difference]: With dead ends: 20694 [2019-09-10 08:12:40,317 INFO L226 Difference]: Without dead ends: 20674 [2019-09-10 08:12:40,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20674 states. [2019-09-10 08:12:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20674 to 14844. [2019-09-10 08:12:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14844 states. [2019-09-10 08:12:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14844 states to 14844 states and 19004 transitions. [2019-09-10 08:12:40,505 INFO L78 Accepts]: Start accepts. Automaton has 14844 states and 19004 transitions. Word has length 160 [2019-09-10 08:12:40,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:40,505 INFO L475 AbstractCegarLoop]: Abstraction has 14844 states and 19004 transitions. [2019-09-10 08:12:40,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 14844 states and 19004 transitions. [2019-09-10 08:12:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 08:12:40,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:40,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:40,513 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:40,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:40,513 INFO L82 PathProgramCache]: Analyzing trace with hash 24098109, now seen corresponding path program 1 times [2019-09-10 08:12:40,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:40,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:40,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:40,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:40,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:40,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:40,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:12:40,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:40,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:12:40,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:12:40,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:12:40,633 INFO L87 Difference]: Start difference. First operand 14844 states and 19004 transitions. Second operand 6 states. [2019-09-10 08:12:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:40,747 INFO L93 Difference]: Finished difference Result 23558 states and 30400 transitions. [2019-09-10 08:12:40,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:12:40,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-09-10 08:12:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:40,771 INFO L225 Difference]: With dead ends: 23558 [2019-09-10 08:12:40,772 INFO L226 Difference]: Without dead ends: 23558 [2019-09-10 08:12:40,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:12:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23558 states. [2019-09-10 08:12:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23558 to 15148. [2019-09-10 08:12:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15148 states. [2019-09-10 08:12:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15148 states to 15148 states and 19268 transitions. [2019-09-10 08:12:40,983 INFO L78 Accepts]: Start accepts. Automaton has 15148 states and 19268 transitions. Word has length 160 [2019-09-10 08:12:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:40,984 INFO L475 AbstractCegarLoop]: Abstraction has 15148 states and 19268 transitions. [2019-09-10 08:12:40,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:12:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 15148 states and 19268 transitions. [2019-09-10 08:12:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 08:12:40,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:40,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:40,988 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:40,988 INFO L82 PathProgramCache]: Analyzing trace with hash -585902407, now seen corresponding path program 1 times [2019-09-10 08:12:40,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:40,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:40,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:40,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:40,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:41,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:41,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:41,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:41,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:41,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:41,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:41,063 INFO L87 Difference]: Start difference. First operand 15148 states and 19268 transitions. Second operand 3 states. [2019-09-10 08:12:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:41,121 INFO L93 Difference]: Finished difference Result 15662 states and 19669 transitions. [2019-09-10 08:12:41,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:41,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-10 08:12:41,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:41,132 INFO L225 Difference]: With dead ends: 15662 [2019-09-10 08:12:41,132 INFO L226 Difference]: Without dead ends: 15662 [2019-09-10 08:12:41,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15662 states. [2019-09-10 08:12:41,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15662 to 15556. [2019-09-10 08:12:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15556 states. [2019-09-10 08:12:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15556 states to 15556 states and 19564 transitions. [2019-09-10 08:12:41,245 INFO L78 Accepts]: Start accepts. Automaton has 15556 states and 19564 transitions. Word has length 160 [2019-09-10 08:12:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:41,245 INFO L475 AbstractCegarLoop]: Abstraction has 15556 states and 19564 transitions. [2019-09-10 08:12:41,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 15556 states and 19564 transitions. [2019-09-10 08:12:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:12:41,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:41,249 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:41,249 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:41,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:41,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2116294546, now seen corresponding path program 1 times [2019-09-10 08:12:41,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:41,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:41,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:41,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:41,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:41,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:41,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:41,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:41,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:41,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:41,321 INFO L87 Difference]: Start difference. First operand 15556 states and 19564 transitions. Second operand 3 states. [2019-09-10 08:12:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:41,400 INFO L93 Difference]: Finished difference Result 22614 states and 28357 transitions. [2019-09-10 08:12:41,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:41,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 08:12:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:41,416 INFO L225 Difference]: With dead ends: 22614 [2019-09-10 08:12:41,417 INFO L226 Difference]: Without dead ends: 22614 [2019-09-10 08:12:41,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22614 states. [2019-09-10 08:12:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22614 to 22612. [2019-09-10 08:12:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22612 states. [2019-09-10 08:12:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22612 states to 22612 states and 28356 transitions. [2019-09-10 08:12:41,568 INFO L78 Accepts]: Start accepts. Automaton has 22612 states and 28356 transitions. Word has length 161 [2019-09-10 08:12:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:41,568 INFO L475 AbstractCegarLoop]: Abstraction has 22612 states and 28356 transitions. [2019-09-10 08:12:41,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 22612 states and 28356 transitions. [2019-09-10 08:12:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:12:41,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:41,576 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:41,576 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:41,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:41,577 INFO L82 PathProgramCache]: Analyzing trace with hash -722602318, now seen corresponding path program 1 times [2019-09-10 08:12:41,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:41,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:41,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:41,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:41,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:41,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:12:41,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:12:41,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:12:41,851 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [143], [156], [169], [182], [195], [208], [211], [218], [220], [224], [227], [232], [235], [240], [242], [245], [248], [251], [253], [255], [258], [261], [264], [266], [268], [271], [274], [277], [279], [281], [284], [287], [290], [292], [294], [297], [300], [303], [305], [307], [310], [313], [319], [323], [325], [328], [333], [341], [343], [346], [354], [356], [359], [362], [367], [369], [372], [380], [382], [385], [393], [395], [398], [406], [408], [411], [414], [420], [423], [424], [426], [428], [431], [442], [451], [453], [456], [459], [461], [476], [478], [481], [484], [486], [501], [503], [506], [509], [511], [519], [522], [528], [531], [534], [536], [551], [553], [556], [559], [561], [576], [578], [580], [583], [586], [588], [596], [599], [737], [740], [746], [771], [774], [789], [792], [795], [797], [814], [817], [820], [822], [839], [842], [845], [847], [864], [867], [870], [872], [889], [892], [895], [897], [916], [919], [922], [924], [1014], [1015], [1019], [1020], [1021] [2019-09-10 08:12:41,900 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:12:41,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:12:42,036 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:12:43,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:12:43,230 INFO L272 AbstractInterpreter]: Visited 185 different actions 1017 times. Merged at 62 different actions 722 times. Widened at 24 different actions 118 times. Performed 3482 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3482 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 92 fixpoints after 19 different actions. Largest state had 181 variables. [2019-09-10 08:12:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:43,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:12:43,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:12:43,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:12:43,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:43,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:12:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:43,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:12:43,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:12:43,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:43,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:43,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:43,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:44,139 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:12:44,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:44,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:44,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:44,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:44,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:46,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:46,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:12:46,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 31 [2019-09-10 08:12:46,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:12:46,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:12:46,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:12:46,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:12:46,564 INFO L87 Difference]: Start difference. First operand 22612 states and 28356 transitions. Second operand 20 states. [2019-09-10 08:12:48,980 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 08:12:49,243 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 08:12:49,788 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 08:12:51,073 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 08:12:51,968 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 08:12:52,167 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:12:52,802 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 08:12:53,062 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:12:53,397 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:12:56,150 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 08:12:56,308 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 08:12:56,719 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:12:57,043 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 08:12:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:57,831 INFO L93 Difference]: Finished difference Result 186280 states and 240394 transitions. [2019-09-10 08:12:57,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-10 08:12:57,831 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 193 [2019-09-10 08:12:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:58,355 INFO L225 Difference]: With dead ends: 186280 [2019-09-10 08:12:58,355 INFO L226 Difference]: Without dead ends: 186280 [2019-09-10 08:12:58,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 328 SyntacticMatches, 38 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5569 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2731, Invalid=11549, Unknown=0, NotChecked=0, Total=14280 [2019-09-10 08:12:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186280 states. [2019-09-10 08:13:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186280 to 40744. [2019-09-10 08:13:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40744 states. [2019-09-10 08:13:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40744 states to 40744 states and 50188 transitions. [2019-09-10 08:13:01,319 INFO L78 Accepts]: Start accepts. Automaton has 40744 states and 50188 transitions. Word has length 193 [2019-09-10 08:13:01,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:01,320 INFO L475 AbstractCegarLoop]: Abstraction has 40744 states and 50188 transitions. [2019-09-10 08:13:01,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:13:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 40744 states and 50188 transitions. [2019-09-10 08:13:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:13:01,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:01,375 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:01,375 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1884011116, now seen corresponding path program 1 times [2019-09-10 08:13:01,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:01,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:01,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:01,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:01,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:13:01,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:13:01,833 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [143], [156], [169], [182], [195], [208], [211], [218], [220], [224], [227], [232], [235], [240], [242], [245], [248], [251], [253], [255], [258], [261], [264], [266], [268], [271], [274], [277], [279], [281], [284], [287], [290], [292], [294], [297], [300], [303], [305], [307], [310], [313], [319], [323], [325], [328], [333], [341], [343], [346], [349], [354], [356], [359], [367], [369], [372], [380], [382], [385], [393], [395], [398], [406], [408], [411], [414], [420], [423], [424], [426], [428], [431], [442], [451], [453], [456], [459], [461], [476], [478], [481], [484], [486], [501], [503], [506], [509], [511], [526], [528], [531], [534], [536], [544], [547], [553], [556], [559], [561], [576], [578], [580], [583], [586], [588], [596], [599], [737], [740], [746], [771], [774], [789], [792], [795], [797], [814], [817], [820], [822], [839], [842], [845], [847], [864], [867], [870], [872], [889], [892], [895], [897], [916], [919], [922], [924], [1014], [1015], [1019], [1020], [1021] [2019-09-10 08:13:01,849 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:13:01,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:13:01,890 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:13:02,491 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:13:02,492 INFO L272 AbstractInterpreter]: Visited 185 different actions 919 times. Merged at 62 different actions 638 times. Widened at 24 different actions 91 times. Performed 3183 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3183 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 85 fixpoints after 23 different actions. Largest state had 181 variables. [2019-09-10 08:13:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:02,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:13:02,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:02,492 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 08:13:02,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:02,508 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 08:13:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:02,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:13:02,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:13:02,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:02,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:02,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:02,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:03,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:13:03,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:03,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:03,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:03,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:03,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:03,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:03,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:03,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:13:03,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:13:03,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 08:13:03,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:13:03,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:13:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:13:03,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:13:03,844 INFO L87 Difference]: Start difference. First operand 40744 states and 50188 transitions. Second operand 22 states. [2019-09-10 08:13:07,679 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:13:07,888 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:13:08,048 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:13:08,239 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:13:09,254 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:13:09,441 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:13:09,845 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:13:10,022 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:13:10,242 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:13:10,471 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:13:10,689 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:13:10,860 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:13:11,055 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:13:11,494 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:13:12,154 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:13:12,343 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:13:12,530 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:13:12,733 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:13:12,900 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:13:13,793 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:13:14,018 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:13:14,223 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:13:14,418 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:13:14,608 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:13:14,976 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:13:15,242 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 08:13:16,556 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:13:16,750 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 08:13:17,713 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:13:17,922 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:13:18,327 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:13:18,487 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:13:18,712 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:13:18,905 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 08:13:19,498 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:13:19,693 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:13:19,879 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:13:20,034 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:13:21,098 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:13:21,291 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:13:21,472 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:13:21,640 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:13:21,839 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:13:22,047 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:13:22,255 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:13:23,211 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:13:23,421 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:13:23,597 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:13:23,871 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 08:13:24,096 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:13:24,310 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:13:24,488 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:13:24,684 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:13:24,896 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:13:25,105 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:13:25,261 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:13:25,428 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:13:25,651 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:13:25,867 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:13:26,063 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:13:26,452 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:13:26,667 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:13:26,850 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:13:27,032 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:13:27,237 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:13:27,418 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:13:27,597 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:13:28,106 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:13:28,297 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:13:28,488 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:13:28,670 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:13:28,841 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:13:29,011 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:13:30,431 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:13:30,934 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:13:31,121 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:13:31,365 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:13:31,575 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:13:31,786 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:13:31,980 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:13:32,330 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:13:32,495 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:13:32,665 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:13:32,924 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:13:33,136 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:13:33,329 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:13:33,483 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:13:33,709 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:13:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:33,923 INFO L93 Difference]: Finished difference Result 265116 states and 317839 transitions. [2019-09-10 08:13:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-10 08:13:33,923 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 193 [2019-09-10 08:13:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:34,246 INFO L225 Difference]: With dead ends: 265116 [2019-09-10 08:13:34,246 INFO L226 Difference]: Without dead ends: 265116 [2019-09-10 08:13:34,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9350 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=5040, Invalid=26112, Unknown=0, NotChecked=0, Total=31152 [2019-09-10 08:13:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265116 states. [2019-09-10 08:13:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265116 to 101986. [2019-09-10 08:13:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101986 states. [2019-09-10 08:13:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101986 states to 101986 states and 125148 transitions. [2019-09-10 08:13:36,082 INFO L78 Accepts]: Start accepts. Automaton has 101986 states and 125148 transitions. Word has length 193 [2019-09-10 08:13:36,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:36,082 INFO L475 AbstractCegarLoop]: Abstraction has 101986 states and 125148 transitions. [2019-09-10 08:13:36,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:13:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 101986 states and 125148 transitions. [2019-09-10 08:13:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:13:36,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:36,117 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:36,118 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:36,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:36,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1162284313, now seen corresponding path program 1 times [2019-09-10 08:13:36,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:36,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:36,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:36,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:36,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:36,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:36,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:13:36,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:13:36,391 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [143], [156], [169], [182], [195], [208], [211], [218], [220], [224], [227], [232], [235], [238], [240], [242], [245], [248], [253], [255], [258], [261], [264], [266], [268], [271], [274], [277], [279], [281], [284], [287], [290], [292], [294], [297], [300], [303], [305], [307], [310], [313], [319], [323], [325], [328], [333], [341], [343], [346], [354], [356], [359], [367], [369], [372], [380], [382], [385], [393], [395], [398], [401], [406], [408], [411], [414], [420], [423], [424], [426], [428], [431], [442], [444], [447], [453], [456], [459], [461], [476], [478], [481], [484], [486], [501], [503], [506], [509], [511], [526], [528], [531], [534], [536], [551], [553], [556], [559], [561], [576], [578], [580], [583], [586], [588], [596], [599], [712], [715], [746], [771], [774], [789], [792], [795], [797], [814], [817], [820], [822], [839], [842], [845], [847], [864], [867], [870], [872], [889], [892], [895], [897], [916], [919], [922], [924], [1014], [1015], [1019], [1020], [1021] [2019-09-10 08:13:36,396 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:13:36,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:13:36,424 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:13:37,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:13:37,145 INFO L272 AbstractInterpreter]: Visited 185 different actions 1115 times. Merged at 62 different actions 807 times. Widened at 28 different actions 167 times. Performed 3693 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3693 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 102 fixpoints after 22 different actions. Largest state had 181 variables. [2019-09-10 08:13:37,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:37,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:13:37,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:37,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:13:37,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:37,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:13:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:37,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:13:37,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:13:37,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:37,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:37,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:37,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:37,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:13:37,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:38,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:38,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:38,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:38,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:39,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:40,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:13:40,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2019-09-10 08:13:40,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:13:40,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:13:40,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:13:40,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:13:40,216 INFO L87 Difference]: Start difference. First operand 101986 states and 125148 transitions. Second operand 21 states. [2019-09-10 08:13:45,095 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-10 08:13:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:45,926 INFO L93 Difference]: Finished difference Result 353814 states and 440173 transitions. [2019-09-10 08:13:45,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 08:13:45,926 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 193 [2019-09-10 08:13:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:46,260 INFO L225 Difference]: With dead ends: 353814 [2019-09-10 08:13:46,260 INFO L226 Difference]: Without dead ends: 353814 [2019-09-10 08:13:46,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 326 SyntacticMatches, 39 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2231 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=917, Invalid=3639, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 08:13:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353814 states. [2019-09-10 08:13:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353814 to 172682. [2019-09-10 08:13:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172682 states. [2019-09-10 08:13:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172682 states to 172682 states and 211684 transitions. [2019-09-10 08:13:53,240 INFO L78 Accepts]: Start accepts. Automaton has 172682 states and 211684 transitions. Word has length 193 [2019-09-10 08:13:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:53,240 INFO L475 AbstractCegarLoop]: Abstraction has 172682 states and 211684 transitions. [2019-09-10 08:13:53,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:13:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 172682 states and 211684 transitions. [2019-09-10 08:13:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:13:53,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:53,284 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:53,284 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:53,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1460096230, now seen corresponding path program 1 times [2019-09-10 08:13:53,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:53,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:53,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:53,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:53,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:13:53,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:13:53,569 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [143], [156], [169], [182], [195], [208], [211], [218], [220], [224], [227], [232], [235], [238], [240], [242], [245], [248], [251], [253], [255], [258], [261], [264], [266], [268], [271], [274], [277], [279], [281], [284], [287], [292], [294], [297], [300], [303], [305], [307], [310], [313], [319], [323], [325], [328], [333], [336], [341], [343], [346], [354], [356], [359], [367], [369], [372], [380], [382], [385], [393], [395], [398], [406], [408], [411], [414], [420], [423], [424], [426], [428], [431], [442], [451], [453], [456], [459], [461], [476], [478], [481], [484], [486], [501], [503], [506], [509], [511], [526], [528], [531], [534], [536], [551], [553], [556], [559], [561], [569], [572], [578], [580], [583], [586], [588], [596], [599], [637], [640], [746], [771], [774], [789], [792], [795], [797], [814], [817], [820], [822], [839], [842], [845], [847], [864], [867], [870], [872], [889], [892], [895], [897], [916], [919], [922], [924], [1014], [1015], [1019], [1020], [1021] [2019-09-10 08:13:53,571 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:13:53,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:13:53,597 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:13:54,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:13:54,536 INFO L272 AbstractInterpreter]: Visited 185 different actions 1155 times. Merged at 62 different actions 844 times. Widened at 27 different actions 173 times. Performed 3971 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3971 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 108 fixpoints after 20 different actions. Largest state had 181 variables. [2019-09-10 08:13:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:54,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:13:54,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:54,537 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 08:13:54,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:54,565 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 08:13:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:54,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:13:54,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:13:54,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:54,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:54,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:54,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:55,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:13:55,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:55,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:55,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:55,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:55,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:57,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:57,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:13:57,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2019-09-10 08:13:57,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:13:57,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:13:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:13:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:13:57,744 INFO L87 Difference]: Start difference. First operand 172682 states and 211684 transitions. Second operand 21 states. [2019-09-10 08:14:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:11,609 INFO L93 Difference]: Finished difference Result 1187914 states and 1392092 transitions. [2019-09-10 08:14:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-10 08:14:11,609 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 193 [2019-09-10 08:14:11,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:12,843 INFO L225 Difference]: With dead ends: 1187914 [2019-09-10 08:14:12,843 INFO L226 Difference]: Without dead ends: 1187914 [2019-09-10 08:14:12,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 323 SyntacticMatches, 42 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6356 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=3075, Invalid=12927, Unknown=0, NotChecked=0, Total=16002 [2019-09-10 08:14:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187914 states. [2019-09-10 08:14:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187914 to 171360. [2019-09-10 08:14:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171360 states. [2019-09-10 08:14:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171360 states to 171360 states and 210124 transitions. [2019-09-10 08:14:25,445 INFO L78 Accepts]: Start accepts. Automaton has 171360 states and 210124 transitions. Word has length 193 [2019-09-10 08:14:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:25,446 INFO L475 AbstractCegarLoop]: Abstraction has 171360 states and 210124 transitions. [2019-09-10 08:14:25,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:14:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 171360 states and 210124 transitions. [2019-09-10 08:14:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:14:25,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:25,477 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:25,477 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:25,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash 592093124, now seen corresponding path program 1 times [2019-09-10 08:14:25,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:25,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:25,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:25,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:25,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:26,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:14:26,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:14:26,358 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:14:26,361 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [143], [156], [169], [182], [195], [208], [211], [218], [220], [224], [227], [232], [235], [238], [240], [242], [245], [248], [251], [253], [255], [258], [261], [264], [266], [268], [271], [274], [277], [279], [281], [284], [287], [292], [294], [297], [300], [303], [305], [307], [310], [313], [319], [323], [325], [328], [333], [341], [343], [346], [354], [356], [359], [367], [369], [372], [380], [382], [385], [393], [395], [398], [401], [406], [408], [411], [414], [420], [423], [424], [426], [428], [431], [442], [444], [447], [453], [456], [459], [461], [476], [478], [481], [484], [486], [501], [503], [506], [509], [511], [526], [528], [531], [534], [536], [551], [553], [556], [559], [561], [576], [578], [580], [583], [586], [588], [596], [599], [637], [640], [746], [771], [774], [789], [792], [795], [797], [814], [817], [820], [822], [839], [842], [845], [847], [864], [867], [870], [872], [889], [892], [895], [897], [916], [919], [922], [924], [1014], [1015], [1019], [1020], [1021] [2019-09-10 08:14:26,366 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:14:26,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:14:26,391 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:14:27,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:14:27,039 INFO L272 AbstractInterpreter]: Visited 185 different actions 1061 times. Merged at 62 different actions 759 times. Widened at 27 different actions 141 times. Performed 3648 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3648 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 96 fixpoints after 21 different actions. Largest state had 181 variables. [2019-09-10 08:14:27,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:27,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:14:27,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:14:27,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:14:27,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:27,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:14:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:27,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:14:27,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:14:27,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:27,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:27,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:27,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:27,741 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:14:28,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:28,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:28,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:28,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:28,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:28,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:28,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:28,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:14:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:14:28,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:14:28,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 08:14:28,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:14:28,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:14:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:14:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:14:28,393 INFO L87 Difference]: Start difference. First operand 171360 states and 210124 transitions. Second operand 22 states. [2019-09-10 08:14:28,573 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:14:31,454 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:14:32,297 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:14:33,051 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:14:33,219 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:14:33,829 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:14:33,981 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:14:34,217 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:14:34,382 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:14:34,564 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:14:35,093 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:14:35,254 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:14:35,410 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:14:35,583 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:14:36,397 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:14:36,727 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:14:36,940 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:14:37,334 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:14:37,642 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:14:37,851 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:14:38,024 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:14:38,202 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:14:38,569 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:14:41,540 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:14:42,154 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:14:42,356 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:14:42,584 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:14:42,813 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:14:43,011 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:14:43,295 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:14:43,717 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 08:14:45,392 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:14:45,559 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:14:46,369 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-09-10 08:14:46,570 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:14:46,785 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:14:46,949 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:14:47,177 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:14:47,368 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:14:47,555 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:14:47,700 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 08:14:47,881 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:14:48,523 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:14:48,688 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:14:49,267 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:14:49,444 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:14:49,698 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 08:14:49,909 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:14:50,096 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:14:50,258 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:14:50,486 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:14:50,677 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:14:50,846 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:14:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:53,041 INFO L93 Difference]: Finished difference Result 730428 states and 891591 transitions. [2019-09-10 08:14:53,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-10 08:14:53,042 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 193 [2019-09-10 08:14:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:53,885 INFO L225 Difference]: With dead ends: 730428 [2019-09-10 08:14:53,885 INFO L226 Difference]: Without dead ends: 730428 [2019-09-10 08:14:53,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3826 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=2814, Invalid=12686, Unknown=0, NotChecked=0, Total=15500 [2019-09-10 08:14:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730428 states. [2019-09-10 08:15:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730428 to 290478. [2019-09-10 08:15:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290478 states. [2019-09-10 08:15:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290478 states to 290478 states and 354994 transitions. [2019-09-10 08:15:08,211 INFO L78 Accepts]: Start accepts. Automaton has 290478 states and 354994 transitions. Word has length 193 [2019-09-10 08:15:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:08,211 INFO L475 AbstractCegarLoop]: Abstraction has 290478 states and 354994 transitions. [2019-09-10 08:15:08,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:15:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 290478 states and 354994 transitions. [2019-09-10 08:15:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:15:08,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:08,268 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:08,269 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:08,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:08,269 INFO L82 PathProgramCache]: Analyzing trace with hash 966655371, now seen corresponding path program 1 times [2019-09-10 08:15:08,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:08,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:08,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:08,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:08,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:08,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:08,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:15:08,773 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2019-09-10 08:15:08,773 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [143], [156], [169], [182], [195], [208], [211], [218], [220], [224], [227], [232], [235], [238], [240], [242], [245], [248], [253], [255], [258], [261], [264], [266], [268], [271], [274], [277], [279], [281], [284], [287], [290], [292], [294], [297], [300], [303], [305], [307], [310], [313], [319], [323], [325], [328], [333], [341], [343], [346], [354], [356], [359], [362], [367], [369], [372], [380], [382], [385], [393], [395], [398], [401], [404], [406], [408], [411], [414], [420], [423], [424], [426], [428], [431], [442], [453], [456], [459], [461], [476], [478], [481], [484], [486], [501], [503], [506], [509], [511], [519], [522], [528], [531], [534], [536], [551], [553], [556], [559], [561], [576], [578], [580], [583], [586], [588], [596], [599], [712], [715], [746], [771], [774], [789], [792], [795], [797], [814], [817], [820], [822], [839], [842], [845], [847], [864], [867], [870], [872], [889], [892], [895], [897], [916], [919], [922], [924], [1014], [1015], [1019], [1020], [1021] [2019-09-10 08:15:08,776 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:15:08,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:15:08,804 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:15:09,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:15:09,407 INFO L272 AbstractInterpreter]: Visited 186 different actions 955 times. Merged at 63 different actions 667 times. Widened at 22 different actions 116 times. Performed 3227 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3227 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 76 fixpoints after 22 different actions. Largest state had 181 variables. [2019-09-10 08:15:09,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:09,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:15:09,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:09,408 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 08:15:09,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:09,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:15:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:09,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:15:09,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:15:09,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:09,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:09,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:09,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:09,962 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:15:10,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:10,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:10,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:10,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:10,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:10,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:10,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:10,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:10,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:15:10,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 08:15:10,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:15:10,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:15:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:15:10,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:15:10,835 INFO L87 Difference]: Start difference. First operand 290478 states and 354994 transitions. Second operand 22 states. [2019-09-10 08:15:10,987 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:15:14,003 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:15:14,577 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:15:14,728 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:15:14,907 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:15:15,059 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:15:16,186 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:15:16,352 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:15:16,504 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:15:16,860 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:15:17,026 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:15:17,868 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:15:18,036 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:15:18,202 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:15:18,383 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:15:18,548 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:15:18,983 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:15:19,295 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:15:19,455 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:15:19,820 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:15:20,818 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:15:21,461 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:15:21,746 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:15:21,942 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:15:22,141 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:15:22,492 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:15:22,702 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:15:25,405 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:15:25,970 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:15:26,540 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:15:26,740 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:15:27,211 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:15:27,928 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:15:28,145 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:15:28,334 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:15:28,516 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:15:29,355 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:15:29,619 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:15:29,833 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:15:30,025 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:15:30,206 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:15:30,990 WARN L188 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:15:31,191 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:15:31,377 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:15:32,652 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:15:32,882 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:15:33,165 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:15:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:35,834 INFO L93 Difference]: Finished difference Result 1542721 states and 1891656 transitions. [2019-09-10 08:15:35,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-10 08:15:35,835 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 194 [2019-09-10 08:15:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:46,553 INFO L225 Difference]: With dead ends: 1542721 [2019-09-10 08:15:46,553 INFO L226 Difference]: Without dead ends: 1542721 [2019-09-10 08:15:46,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 367 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=2665, Invalid=12835, Unknown=0, NotChecked=0, Total=15500 [2019-09-10 08:15:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542721 states. [2019-09-10 08:16:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542721 to 707603. [2019-09-10 08:16:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707603 states. [2019-09-10 08:16:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707603 states to 707603 states and 857759 transitions. [2019-09-10 08:16:05,675 INFO L78 Accepts]: Start accepts. Automaton has 707603 states and 857759 transitions. Word has length 194 [2019-09-10 08:16:05,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:05,675 INFO L475 AbstractCegarLoop]: Abstraction has 707603 states and 857759 transitions. [2019-09-10 08:16:05,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:16:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 707603 states and 857759 transitions. [2019-09-10 08:16:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:16:05,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:05,775 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:05,775 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:05,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:05,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1554823989, now seen corresponding path program 1 times [2019-09-10 08:16:05,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:05,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:05,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:05,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:05,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:06,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:16:06,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:16:06,125 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2019-09-10 08:16:06,125 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [143], [156], [169], [182], [195], [208], [211], [218], [220], [224], [227], [232], [235], [238], [240], [242], [245], [248], [251], [253], [255], [258], [261], [264], [266], [268], [271], [274], [277], [279], [281], [284], [287], [290], [292], [294], [297], [300], [305], [307], [310], [313], [319], [323], [325], [328], [333], [341], [343], [346], [354], [356], [359], [362], [367], [369], [372], [380], [382], [385], [393], [395], [398], [401], [404], [406], [408], [411], [414], [420], [423], [424], [426], [428], [431], [442], [453], [456], [459], [461], [476], [478], [481], [484], [486], [501], [503], [506], [509], [511], [519], [522], [528], [531], [534], [536], [551], [553], [556], [559], [561], [576], [578], [580], [583], [586], [588], [596], [599], [612], [615], [746], [771], [774], [789], [792], [795], [797], [814], [817], [820], [822], [839], [842], [845], [847], [864], [867], [870], [872], [889], [892], [895], [897], [916], [919], [922], [924], [1014], [1015], [1019], [1020], [1021] [2019-09-10 08:16:06,127 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:16:06,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:16:06,160 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:16:06,878 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:16:06,879 INFO L272 AbstractInterpreter]: Visited 186 different actions 1049 times. Merged at 63 different actions 750 times. Widened at 24 different actions 142 times. Performed 3555 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3555 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 85 fixpoints after 21 different actions. Largest state had 181 variables. [2019-09-10 08:16:06,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:06,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:16:06,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:16:06,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:16:06,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:06,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:16:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:07,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:16:07,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:16:07,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:07,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:07,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:07,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:07,407 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:16:07,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:07,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:07,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:07,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:07,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:16,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:16,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:16:16,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2019-09-10 08:16:16,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:16:16,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:16:16,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:16:16,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:16:16,777 INFO L87 Difference]: Start difference. First operand 707603 states and 857759 transitions. Second operand 21 states. [2019-09-10 08:16:29,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:29,604 INFO L93 Difference]: Finished difference Result 2243531 states and 2765232 transitions. [2019-09-10 08:16:29,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 08:16:29,604 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2019-09-10 08:16:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:34,397 INFO L225 Difference]: With dead ends: 2243531 [2019-09-10 08:16:34,397 INFO L226 Difference]: Without dead ends: 2243531 [2019-09-10 08:16:34,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 300 SyntacticMatches, 67 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4411 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1736, Invalid=6820, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 08:16:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243531 states. [2019-09-10 08:17:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243531 to 707027. [2019-09-10 08:17:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707027 states. [2019-09-10 08:17:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707027 states to 707027 states and 857135 transitions. [2019-09-10 08:17:15,796 INFO L78 Accepts]: Start accepts. Automaton has 707027 states and 857135 transitions. Word has length 194 [2019-09-10 08:17:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:15,797 INFO L475 AbstractCegarLoop]: Abstraction has 707027 states and 857135 transitions. [2019-09-10 08:17:15,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:17:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 707027 states and 857135 transitions. [2019-09-10 08:17:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:17:15,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:15,867 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:15,867 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:15,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:15,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1506794789, now seen corresponding path program 1 times [2019-09-10 08:17:15,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:15,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:15,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:15,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:15,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:16,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:16,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:17:16,219 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2019-09-10 08:17:16,220 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [143], [156], [169], [182], [195], [208], [211], [218], [220], [224], [227], [232], [235], [238], [240], [242], [245], [248], [253], [255], [258], [261], [264], [266], [268], [271], [274], [277], [279], [281], [284], [287], [290], [292], [294], [297], [300], [303], [305], [307], [310], [313], [319], [323], [325], [328], [333], [336], [339], [341], [343], [346], [354], [356], [359], [362], [365], [367], [369], [372], [380], [382], [385], [393], [395], [398], [401], [406], [408], [411], [414], [420], [423], [424], [426], [428], [431], [442], [444], [447], [453], [456], [459], [461], [476], [478], [481], [484], [486], [501], [503], [506], [509], [511], [528], [531], [534], [536], [551], [553], [556], [559], [561], [578], [580], [583], [586], [588], [596], [599], [712], [715], [746], [771], [774], [789], [792], [795], [797], [814], [817], [820], [822], [839], [842], [845], [847], [864], [867], [870], [872], [889], [892], [895], [897], [916], [919], [922], [924], [1014], [1015], [1019], [1020], [1021] [2019-09-10 08:17:16,222 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:17:16,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:17:16,245 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:17:16,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:17:16,784 INFO L272 AbstractInterpreter]: Visited 187 different actions 1041 times. Merged at 64 different actions 747 times. Widened at 24 different actions 133 times. Performed 3425 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3425 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 87 fixpoints after 19 different actions. Largest state had 181 variables. [2019-09-10 08:17:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:16,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:17:16,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:16,784 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) [2019-09-10 08:17:16,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:16,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:17:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:16,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 08:17:16,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:17:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:17:17,032 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:17:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:17:17,180 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:17:17,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [12] total 17 [2019-09-10 08:17:17,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:17,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:17:17,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:17:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:17:17,181 INFO L87 Difference]: Start difference. First operand 707027 states and 857135 transitions. Second operand 4 states. [2019-09-10 08:17:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:20,190 INFO L93 Difference]: Finished difference Result 716121 states and 866690 transitions. [2019-09-10 08:17:20,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:17:20,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-09-10 08:17:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:20,974 INFO L225 Difference]: With dead ends: 716121 [2019-09-10 08:17:20,974 INFO L226 Difference]: Without dead ends: 716121 [2019-09-10 08:17:20,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 385 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:17:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716121 states. [2019-09-10 08:17:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716121 to 705993. [2019-09-10 08:17:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705993 states. [2019-09-10 08:17:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705993 states to 705993 states and 855870 transitions. [2019-09-10 08:17:47,552 INFO L78 Accepts]: Start accepts. Automaton has 705993 states and 855870 transitions. Word has length 195 [2019-09-10 08:17:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:47,553 INFO L475 AbstractCegarLoop]: Abstraction has 705993 states and 855870 transitions. [2019-09-10 08:17:47,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:17:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 705993 states and 855870 transitions. [2019-09-10 08:17:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:17:47,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:47,588 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:47,588 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:47,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:47,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2142677520, now seen corresponding path program 1 times [2019-09-10 08:17:47,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:47,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:47,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:47,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:47,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:47,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:47,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:17:47,726 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2019-09-10 08:17:47,726 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [143], [156], [169], [182], [195], [208], [211], [218], [220], [224], [227], [232], [235], [238], [240], [242], [245], [248], [253], [255], [258], [261], [264], [266], [268], [271], [274], [277], [279], [281], [284], [287], [290], [292], [294], [297], [300], [303], [305], [307], [310], [317], [319], [323], [325], [328], [333], [336], [341], [343], [346], [354], [356], [359], [362], [365], [367], [369], [372], [380], [382], [385], [393], [395], [398], [401], [404], [406], [408], [411], [418], [420], [423], [424], [426], [435], [438], [442], [453], [456], [459], [461], [476], [478], [481], [484], [486], [501], [503], [506], [509], [511], [528], [531], [534], [536], [551], [553], [556], [559], [561], [569], [572], [578], [580], [583], [586], [588], [603], [606], [712], [715], [746], [771], [774], [789], [792], [795], [797], [814], [817], [820], [822], [839], [842], [845], [847], [864], [867], [870], [872], [889], [892], [895], [897], [916], [919], [922], [924], [1014], [1015], [1019], [1020], [1021] [2019-09-10 08:17:47,728 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:17:47,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:17:47,750 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:17:47,813 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:17:47,813 INFO L272 AbstractInterpreter]: Visited 120 different actions 120 times. Never merged. Never widened. Performed 607 root evaluator evaluations with a maximum evaluation depth of 6. Performed 607 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 181 variables. [2019-09-10 08:17:47,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:47,814 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:17:48,217 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 75.58% of their original sizes. [2019-09-10 08:17:48,217 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:17:56,820 INFO L420 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2019-09-10 08:17:56,820 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:17:56,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:17:56,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [6] total 67 [2019-09-10 08:17:56,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:56,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 08:17:56,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 08:17:56,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=3593, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 08:17:56,824 INFO L87 Difference]: Start difference. First operand 705993 states and 855870 transitions. Second operand 63 states. [2019-09-10 08:19:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:11,595 INFO L93 Difference]: Finished difference Result 555008 states and 676555 transitions. [2019-09-10 08:19:11,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-10 08:19:11,595 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 195 [2019-09-10 08:19:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:12,138 INFO L225 Difference]: With dead ends: 555008 [2019-09-10 08:19:12,139 INFO L226 Difference]: Without dead ends: 554998 [2019-09-10 08:19:12,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=856, Invalid=11800, Unknown=0, NotChecked=0, Total=12656 [2019-09-10 08:19:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554998 states. [2019-09-10 08:19:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554998 to 554956. [2019-09-10 08:19:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554956 states. [2019-09-10 08:19:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554956 states to 554956 states and 676491 transitions. [2019-09-10 08:19:20,421 INFO L78 Accepts]: Start accepts. Automaton has 554956 states and 676491 transitions. Word has length 195 [2019-09-10 08:19:20,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:20,421 INFO L475 AbstractCegarLoop]: Abstraction has 554956 states and 676491 transitions. [2019-09-10 08:19:20,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 08:19:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 554956 states and 676491 transitions. [2019-09-10 08:19:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:19:20,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:20,449 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:20,449 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash -333800868, now seen corresponding path program 1 times [2019-09-10 08:19:20,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:20,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:20,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:20,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:20,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:19:20,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:20,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:20,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:20,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:20,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:20,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:20,569 INFO L87 Difference]: Start difference. First operand 554956 states and 676491 transitions. Second operand 5 states. [2019-09-10 08:19:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:29,660 INFO L93 Difference]: Finished difference Result 1046346 states and 1278359 transitions. [2019-09-10 08:19:29,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:29,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-10 08:19:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:31,834 INFO L225 Difference]: With dead ends: 1046346 [2019-09-10 08:19:31,834 INFO L226 Difference]: Without dead ends: 1046316 [2019-09-10 08:19:31,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:19:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046316 states. [2019-09-10 08:19:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046316 to 1046310. [2019-09-10 08:19:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046310 states. [2019-09-10 08:19:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046310 states to 1046310 states and 1278325 transitions. [2019-09-10 08:19:55,453 INFO L78 Accepts]: Start accepts. Automaton has 1046310 states and 1278325 transitions. Word has length 195 [2019-09-10 08:19:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:55,453 INFO L475 AbstractCegarLoop]: Abstraction has 1046310 states and 1278325 transitions. [2019-09-10 08:19:55,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1046310 states and 1278325 transitions. [2019-09-10 08:19:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:19:55,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:55,483 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:55,483 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:55,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1693932853, now seen corresponding path program 1 times [2019-09-10 08:19:55,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:55,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:55,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:55,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:05,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:05,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:20:05,959 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2019-09-10 08:20:05,960 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [143], [156], [169], [182], [195], [208], [211], [218], [220], [224], [227], [232], [235], [238], [240], [242], [245], [248], [251], [253], [255], [258], [261], [264], [266], [268], [271], [274], [277], [279], [281], [284], [287], [290], [292], [294], [297], [300], [303], [305], [307], [310], [317], [319], [323], [325], [328], [333], [336], [339], [341], [343], [346], [354], [356], [359], [362], [367], [369], [372], [380], [382], [385], [393], [395], [398], [401], [406], [408], [411], [418], [420], [423], [424], [426], [435], [438], [442], [444], [447], [453], [456], [459], [461], [476], [478], [481], [484], [486], [501], [503], [506], [509], [511], [519], [522], [528], [531], [534], [536], [551], [553], [556], [559], [561], [578], [580], [583], [586], [588], [603], [606], [746], [771], [774], [789], [792], [795], [797], [814], [817], [820], [822], [839], [842], [845], [847], [864], [867], [870], [872], [889], [892], [895], [897], [916], [919], [922], [924], [1014], [1015], [1019], [1020], [1021] [2019-09-10 08:20:05,962 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:20:05,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:20:05,974 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:20:06,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:20:06,355 INFO L272 AbstractInterpreter]: Visited 187 different actions 969 times. Merged at 65 different actions 685 times. Widened at 22 different actions 115 times. Performed 3291 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3291 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 81 fixpoints after 23 different actions. Largest state had 181 variables. [2019-09-10 08:20:06,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:06,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:20:06,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:06,355 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 08:20:06,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:06,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:20:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:06,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:20:06,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:20:06,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:06,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:07,050 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:20:07,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:07,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:11,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:12,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:20:12,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 08:20:12,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:20:12,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:20:12,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:20:12,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:20:12,266 INFO L87 Difference]: Start difference. First operand 1046310 states and 1278325 transitions. Second operand 20 states. [2019-09-10 08:20:12,475 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 08:20:13,116 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:20:13,342 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:20:13,919 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:20:14,115 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:20:14,273 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:20:14,512 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:20:15,247 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:20:15,586 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:20:15,939 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:20:16,198 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:20:16,401 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:20:16,683 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:20:17,943 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:20:18,275 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:20:18,533 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:20:18,765 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:20:19,031 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:20:19,373 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:20:19,614 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:20:19,823 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:20:20,256 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 08:20:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:26,480 INFO L93 Difference]: Finished difference Result 2097426 states and 2620795 transitions. [2019-09-10 08:20:26,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:20:26,481 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 195 [2019-09-10 08:20:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:41,032 INFO L225 Difference]: With dead ends: 2097426 [2019-09-10 08:20:41,032 INFO L226 Difference]: Without dead ends: 2097426 [2019-09-10 08:20:41,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 306 SyntacticMatches, 71 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=664, Invalid=1886, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:20:41,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097426 states. [2019-09-10 08:21:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097426 to 1125362. [2019-09-10 08:21:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125362 states. [2019-09-10 08:21:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125362 states to 1125362 states and 1372229 transitions. [2019-09-10 08:21:13,340 INFO L78 Accepts]: Start accepts. Automaton has 1125362 states and 1372229 transitions. Word has length 195 [2019-09-10 08:21:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:13,340 INFO L475 AbstractCegarLoop]: Abstraction has 1125362 states and 1372229 transitions. [2019-09-10 08:21:13,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:21:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1125362 states and 1372229 transitions. [2019-09-10 08:21:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:21:13,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:13,376 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:13,377 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:13,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:13,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1180036965, now seen corresponding path program 1 times [2019-09-10 08:21:13,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:13,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:13,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:13,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:13,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:13,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:21:13,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:21:13,522 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2019-09-10 08:21:13,522 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [143], [156], [169], [182], [195], [208], [211], [218], [220], [224], [227], [232], [235], [240], [242], [245], [248], [251], [253], [255], [258], [261], [264], [266], [268], [271], [274], [277], [279], [281], [284], [287], [290], [292], [294], [297], [300], [303], [305], [307], [310], [317], [319], [323], [325], [328], [333], [336], [339], [341], [343], [346], [349], [352], [354], [356], [359], [362], [367], [369], [372], [380], [382], [385], [393], [395], [398], [401], [404], [406], [408], [411], [418], [420], [423], [424], [426], [435], [438], [442], [453], [456], [459], [461], [476], [478], [481], [484], [486], [501], [503], [506], [509], [511], [519], [522], [528], [531], [534], [536], [553], [556], [559], [561], [578], [580], [583], [586], [588], [603], [606], [737], [740], [746], [771], [774], [789], [792], [795], [797], [814], [817], [820], [822], [839], [842], [845], [847], [864], [867], [870], [872], [889], [892], [895], [897], [916], [919], [922], [924], [1014], [1015], [1019], [1020], [1021] [2019-09-10 08:21:13,524 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:21:13,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:21:13,541 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:21:13,592 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:21:13,592 INFO L272 AbstractInterpreter]: Visited 120 different actions 120 times. Never merged. Never widened. Performed 607 root evaluator evaluations with a maximum evaluation depth of 6. Performed 607 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 181 variables. [2019-09-10 08:21:13,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:13,593 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:21:13,855 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 75.28% of their original sizes. [2019-09-10 08:21:13,855 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:21:30,791 INFO L420 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2019-09-10 08:21:30,791 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:21:30,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:21:30,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [6] total 67 [2019-09-10 08:21:30,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:30,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 08:21:30,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 08:21:30,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3591, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 08:21:30,793 INFO L87 Difference]: Start difference. First operand 1125362 states and 1372229 transitions. Second operand 63 states.